Graph topological transformations in space-filling cell aggregates
Tanmoy Sarkar, Matej Krajnc

TL;DR
This paper introduces the Graph Vertex Model (GVM), a novel graph-based reformulation of the 3D vertex model for cell rearrangements, enabling transparent, reproducible simulations of tissue dynamics.
Contribution
The paper presents GVM, a graph data structure for modeling 3D cell rearrangements, generalizing 2D T1 transitions, and provides a Python package for tissue analysis.
Findings
GVM effectively models cell rearrangements in 3D tissues.
Order-disorder transition characterized in 3D cell aggregates.
Close to transition, aggregates show efficient ordering.
Abstract
Cell rearrangements are fundamental mechanisms driving large-scale deformations of living tissues. In three-dimensional (3D) space-filling cell aggregates, cells rearrange through local topological transitions of the network of cell-cell interfaces, which is most conveniently described by the vertex model. Since these transitions are not yet mathematically properly formulated, the 3D vertex model is generally difficult to implement. The few existing implementations rely on highly customized and complex software-engineering solutions, which cannot be transparently delineated and are thus mostly non-reproducible. To solve this outstanding problem, we propose a reformulation of the vertex model. Our approach, called Graph Vertex Model (GVM), is based on storing the topology of the cell network into a knowledge graph with a particular data structure that allows performing cell-rearrangement…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCell Image Analysis Techniques · Bioinformatics and Genomic Networks · Gene Regulatory Network Analysis
