A node-based version of the cellular Potts model

The cellular Potts model (CPM) is a lattice-based Monte Carlo method that uses an energetic formalism to describe the phenomenological mechanisms underlying the biophysical problem of interest. We here propose a CPM-derived framework that relies on a node-based representation of cell-scale elements. This feature has relevant consequences on the overall simulation environment. First, our model can be implemented on any given domain, provided a proper discretization (which can be regular or irregular, fixed or time evolving). Then, it allowed an explicit representation of cell membranes, whose displacements realistically result in cell movement. Finally, our node-based approach can be easily interfaced with continuous mechanics or fluid dynamics models. The proposed computational environment is here applied to some simple biological phenomena, such as cell sorting and chemotactic migration, also in order to achieve an analysis of the performance of the underlying algorithm. This work is finally equipped with a critical comparison between the advantages and disadvantages of our model with respect to the traditional CPM and to some similar vertex-based approaches

A Review of Mathematical Models for the Formation of\ud Vascular Networks

Mainly two mechanisms are involved in the formation of blood vasculature: vasculogenesis and angiogenesis. The former consists of the formation of a capillary-like network from either a dispersed or a monolayered population of endothelial cells, reproducible also in vitro by specific experimental assays. The latter consists of the sprouting of new vessels from an existing capillary or post-capillary venule. Similar phenomena are also involved in the formation of the lymphatic system through a process generally called lymphangiogenesis.\ud \ud A number of mathematical approaches have analysed these phenomena. This paper reviews the different modelling procedures, with a special emphasis on their ability to reproduce the biological system and to predict measured quantities which describe the overall processes. A comparison between the different methods is also made, highlighting their specific features

Cells in Silico – introducing a high-performance framework for large-scale tissue modeling

Background Discoveries in cellular dynamics and tissue development constantly reshape our understanding of fundamental biological processes such as embryogenesis, wound-healing, and tumorigenesis. High-quality microscopy data and ever-improving understanding of single-cell effects rapidly accelerate new discoveries. Still, many computational models either describe few cells highly detailed or larger cell ensembles and tissues more coarsely. Here, we connect these two scales in a joint theoretical model. Results We developed a highly parallel version of the cellular Potts model that can be flexibly applied and provides an agent-based model driving cellular events. The model can be modular extended to a multi-model simulation on both scales. Based on the NAStJA framework, a scaling implementation running efficiently on high-performance computing systems was realized. We demonstrate independence of bias in our approach as well as excellent scaling behavior. Conclusions Our model scales approximately linear beyond 10,000 cores and thus enables the simulation of large-scale three-dimensional tissues only confined by available computational resources. The strict modular design allows arbitrary models to be configured flexibly and enables applications in a wide range of research questions. Cells in Silico (CiS) can be easily molded to different model assumptions and help push computational scientists to expand their simulations to a new area in tissue simulations. As an example we highlight a 1000$^{3}$ voxel-sized cancerous tissue simulation at sub-cellular resolution

A Lock Free Approach To Parallelize The Cellular Potts Model: Application To Ductal Carcinoma In Situ

In the field of computational biology, in order to simulate multiscale biological systems, the Cellular Potts Model (CPM) has been used, which determines the actions that simulated cells can perform by determining a hamiltonian of energy that takes into account the influence that neighboring cells exert, under a wide range of parameters. There are some proposals in the literature that parallelize the CPM; in all cases, either lockbased techniques or other techniques that require large amounts of information to be disseminated among parallel tasks are used to preserve data coherence. In both cases, computational performance is limited. This work proposes an alternative approach for the parallelization of the model that uses transactional memory to maintain the coherence of the information. A Java implementation has been applied to the simulation of the ductal adenocarcinoma of breast in situ (DCIS). Times and speedups of the simulated execution of the model on the cluster of our university are analyzed. The results show a good speedup

Validity of the Cauchy-Born rule applied to discrete cellular-scale models of biological tissues.

The development of new models of biological tissues that consider cells in a discrete manner is becoming increasingly popular as an alternative to continuum methods based on partial differential equations, although formal relationships between the discrete and continuum frameworks remain to be established. For crystal mechanics, the discrete-to-continuum bridge is often made by assuming that local atom displacements can be mapped homogeneously from the mesoscale deformation gradient, an assumption known as the Cauchy-Born rule (CBR). Although the CBR does not hold exactly for noncrystalline materials, it may still be used as a first-order approximation for analytic calculations of effective stresses or strain energies. In this work, our goal is to investigate numerically the applicability of the CBR to two-dimensional cellular-scale models by assessing the mechanical behavior of model biological tissues, including crystalline (honeycomb) and noncrystalline reference states. The numerical procedure involves applying an affine deformation to the boundary cells and computing the quasistatic position of internal cells. The position of internal cells is then compared with the prediction of the CBR and an average deviation is calculated in the strain domain. For center-based cell models, we show that the CBR holds exactly when the deformation gradient is relatively small and the reference stress-free configuration is defined by a honeycomb lattice. We show further that the CBR may be used approximately when the reference state is perturbed from the honeycomb configuration. By contrast, for vertex-based cell models, a similar analysis reveals that the CBR does not provide a good representation of the tissue mechanics, even when the reference configuration is defined by a honeycomb lattice. The paper concludes with a discussion of the implications of these results for concurrent discrete and continuous modeling, adaptation of atom-to-continuum techniques to biological tissues, and model classification

GADIA: A Greedy Asynchronous Distributed Interference Avoidance Algorithm

In this paper, the problem of distributed dynamic frequency allocation is considered for a canonical communication network, which spans several networks such as cognitive radio networks and digital subscriber lines (DSLs). A greedy asynchronous distributed interference avoidance (GADIA) algorithm for horizontal spectrum sharing has been proposed that achieves performance close to that of a centralized optimal algorithm. The convergence of the GADIA algorithm to a near-optimal frequency allocation strategy is proved and several asymptotic performance bounds have been established for various spatial configurations of the network nodes. Furthermore, the near-equilibrium dynamics of the GADIA algorithm has been studied using the Glauber dynamics, by identifying the problem with the antiferromagnetic inhomogeneous long-range Potts model. Using the near-equilibrium dynamics and methods from stochastic analysis, the robustness of the algorithm with respect to time variations in the activity of network nodes is studied. These analytic results along with simulation studies reveal that the performance is close to that of an optimum centralized frequency allocation algorithm. Further simulation studies confirm that our proposed algorithm outperforms the iterative water-filling algorithm in the low signal-to-interference-plus-noise ratio (SINR) regime, in terms of achieved sum rate, complexity, convergence rate, and robustness to time-varying node activities.Engineering and Applied Science