3.1. Cellular Potts Modelling of the FRC Network
In this section we construct a geometrical model of a reticular network using the Cellular Potts Model (CPM). This approach lets us explicitly control the target volume of reticular network, vary properties of each FRC, and directly incorporate the network in further models of cellular immune response. In addition, it is a starting point of modelling reticular network as soft tissue, which would let us explore mechanical properties and behavior of the network in cases of inflammation, T cells depletion or LN fibrosis.
In CPM (reviewed in [
26,
27,
28,
29]), the cells are defined on a cubic lattice as connected collections of lattice cites (voxels)
with the same cell id
. Each cell can belong to a certain type
. The extracellular medium is defined as a generalized cell with
.
The dynamics of the system are defined with a modified Metropolis algorithm, which models the motion of cells by rearranging the states of the voxels in a stochastic energy minimization manner. It samples random local voxel-copy attempts and accepts them in accordance with provided Boltzman probability acception function .
The energy of the system is usually defined as the sum of two terms:
Adhesion term represents the sum of binding energies
of molecules located at adjacent pairs of voxels
, which correspond to membranes of different cells
. The second term describes the ability of the cell to constrain its volume
near the resting volume
due to the internal pressure. The parameter
is a spring modulus, i.e., the rigidity of the cell to changes of volume. It determines the relative weight of the second energetic term. There are many other possible terms and modifications of the form of energy,
E, which allow the modelling of compressibility of cells membranes, chemotaxis, haptotaxis, cell elongation and other properties [
26,
27,
29,
30].
The basic form of the probability acceptance function in CPM is given as,
where
T is a global parameter representing the amplitude of cells fluctuations, proportional to the probability to accept energetically unfavourable voxel-copy attempts,
is the change of energy of the system (
1) as a result of sampled voxel-copy attempt. If
, the simulation is fully determinate and can freeze at local energy minima. As a possible extension of (
2), each cell type or each cell can have its own
.
The other form of acceptance function, which provides a biologically relevant meaning of parameter
—the intrinsic motility of the cell (discussed in detail in [
29]), was specified as follows,
where
is the resultant motility of membrane between
. Given the tanh-mapping of membrane motility, Function (
3) restricts the voxel-copy attempts involving so-called frozen cells (with
), even if calculated
is significantly negative. This allows us to specify the motility of cells, i.e., their ability to react on external stimuli.
We extend this approach by setting intrinsic motility for each voxel of the cell. By doing this, we can easily model the reticular network, making the ends of protrusions frozen (forming FRC junctional complexes [
31]). As a result, there is no need for extra assumptions and extra CPM plugins such as cell elongation or connectivity constraints (which are computationally expensive in 3D [
30]), utilized in other models of cellular networks (such as in the study of vasculogenesis [
30]).
We initialize cells as thin (
m) cylinders along the graph of reticular network topology (constructed in [
5]), forming the conduit system (
Figure 1a). Protrusions of different cells are connected at the middles of the corresponding edges. For each FRC we define the center of its body
at the coordinates of corresponding graph nodes. We define the motility of voxels occupied with cells (
) according to the distribution localized around
:
By doing this, the voxels, which are far from the center of FRC body , have close to zero motility . As a result, the ends of FRCs protrusions are linked with each other in accordance with given topology and are not altered during the simulation, resulting in no connectivity issues. The voxels which are closer to centers have more intrinsic motility, thus it is more probable for them to extend to the medium due to internal pressure until the FRCs would reach their target volume .
Figure 1b illustrates the reticular network, reached it’s target volume (4% of the whole volume of lattice [
5]). It contains 3374 FRCs in a
m
m
m computational domain with
m length of the voxel resolution. Parameters used in the simulation are listed in
Table 1. We set adhesion energies to zero because they are not relevant for the result as there are no other cells in our model. The choice of FRC-FRC adhesion energy doesn’t affect the simulation because FRC junctional complexes are modeled by freezing the ends of protrusions. A high value for lamda is chosen (
) because of rigidity of the reticular networks. The deviation of volume from the target volume for the whole network is less than 1% after 20 Monte-Carlo steps (MCSs) burn-in period.
The implementation of the model is based on the open-source CompuCell3D application (available at
http://compucell3d.org/). We modified the source code of its core C++ library to accomplish voxel-based motility and developed Python scripts to configure the simulation. The computation of the FRC network shown in
Figure 1 requires about 10 min real time on Intel Xeon 4-core 3 GHz CPU with 4 Threads based parallelization.
3.4. Integrative Geometric Model of Vascular Networks
To assemble the two networks [FRC + vascular networks] into one 3D geometric model, we used the FRC network constructed with the algorithm from [
7] for a sphere with a diameter of about 200
m as shown in
Figure 4.
The graph of the network topology and its node-level characteristics are shown in
Figure 5.
The method developed in [
7] was further utilized to place two or more network graphs in same domain.
To this end, we placed both graph structures in one structure, unified the length of all edges (we converted them into sets of edges with length about 4
m) and executed the minimisation of length inconsistencies using a modified version of the algorithm from [
7]. Some remaining intersections were removed at the stage of voxel-based approximation of the graphs. The integrated blood microvascular network and the FRC networks are shown in
Figure 6.
The key characteristics of the constructed 3D blood microvascular and FRC network geometric model are listed in
Table 2.
All the algorithms were implemented using C++ language and Microsoft Visual Studio 2015 IDE. Construction of the vascular graph takes about 10 min and 20 Mb of RAM (CPU - Intel Core i7-4700HQ 2.40 GHz), integration of the blood vascular vessels and FRC network takes 20 min, and additional operations (voxel approximation, smoothing of the 3D surface) requires about 2 h CPU time.