Presentation is loading. Please wait.

Presentation is loading. Please wait.

A Quick Look at Cellular Automata Models for Solid Tumor Growth Philip Crooke Department of Mathematics Biomathematics Study Group Vanderbilt Integrative.

Similar presentations


Presentation on theme: "A Quick Look at Cellular Automata Models for Solid Tumor Growth Philip Crooke Department of Mathematics Biomathematics Study Group Vanderbilt Integrative."— Presentation transcript:

1 A Quick Look at Cellular Automata Models for Solid Tumor Growth Philip Crooke Department of Mathematics Biomathematics Study Group Vanderbilt Integrative Cancer Biology Center

2 Characteristics of a Basic Cellular Automata Lattice: A discrete set of points (1D, 2D or 3D) (sites). States: Each lattice point takes one of a finite number of states. Time: It is discrete and ever site updates simultaneously. Neighborhood: A definition what it means for sites to be close to one another. Update Rules: Laws that define how states change according to the states of sites in its neighborhood. The update rules can be deterministic or probabilistic. Homogeneity: The behavior of all sites are according to the same set of update rules.

3 Variations on a Basic CA Continuous States: Instead of discrete states, they can be continuous. Asynchronous Updating: Update of states is not done simultaneously. Non-homogeneity: Different update rules for different sites.

4 von Neumann Neighborhood

5 Moore Neighborhood

6 Basic Duchting Model W. Duchting, A model of disturbed self-reproducing cell systems, in Biomathematics and Cell Kinetics, A.J. Valleron and R.D.M. MacDonald (editors), Elsevier/North Holland, 1978.  Two-dimensional, finite lattice (10x10, INTEL 8080)  von Neumann neighborhood  Asynchronous  Each lattice site corresponds to a living cell or dead cell (empty site)  Update rules: oIf a living cell is isolated, then it dies immediately. oA cell is alive only if there are at least one living cell in its neighborhood. oCell division only takes place in there is an empty site in the neighborhood. If there are more than one empty sites in the neighborhood, the new site is selected randomly in the neighborhood. oThere are special rules for boundary sites of the lattice.

7 Some Enhancements The growing process for each single cell comes from an initial signal. Assign a mean life span for each site. He calls it the life span matrix and determines how long a cell lives before cell division. The smaller the entry in the matrix, the faster the cell grows. A cell can be destroyed at any arbitrary time by an external disturbance (by irradiation or by a cytostaticum). The model allows two classes of cells which grow together, but with different life span matrices.

8 Competing Cell Groups Circles: fast growing. Triangles: slow growing. Werner Duchting, 1978.

9 Competing Cell Groups with Surgical Removal at T=101 Circles: fast growing. Triangles: slow growing. Werner Duchting, 1978.

10 Duchting Model (1980) Two-dimensional lattice (100x100, CYBER 76) Each site contains a living or dead (empty) cell. There are three classes of cells (normal, tumor and dead). The life span of a cell (normal or tumor) is determined by a random number. Uses von Neumann neighborhoods. A normal cell can divide only there is an empty site in the neighborhood of the dividing cell. If there are more than one empty sites in the neighborhood, then the daughter cell is assigned randomly to one of the empty sites. Each normal cell can be deleted at any time by an external signal. For tumor cells, a division can take place even if there are no neighborhood vacancies. In this case, a direction (vertical or horizontal) which contains the minimal number of cells that are adjacent and a shift is performed. Tumor cells have special rules for the boundary sites. The probability of the loss of tumor cell is different than a normal cell. The lattice can be subdivided into sub-lattices with different boundary rules.

11 Duchting Model (1981) Lattice is three-dimensional (40x40x40). Tumor is spherical. Each site can either occupied by a (tumor) cell or is empty (medium) and when occupied by a cell, the cell can be in different phases. The model uses an extended cell cycle. The cell can spend time in the phases (G1, S, G2, M, GO and N) with phases times (T G1, T S, T G2, T M, T GO, T N ) and standard deviations (  G1,  S,  G2,  M,  GO,  N ). These times are generated from a Gaussian distribution. The GO state is fictitious state (resting) for cells and is a check to see if there is sufficient nutrients for a cell to divide. If the nutrient level is too low, then it goes into state N. The N state is a state of dying and T N is the time of death. Incorporates R crit (recall talk about diffusion models) for nutrient level. If a site is within the sphere of radius R crit, then there the nutrient concentration is not sufficient for a cell to divide and cell passes to the N state. Cells may die randomly after some initial period. In theory, the number of replications of a cell is unlimited. However, replication stops when a site a prescribed distance from the medium. For a particular cell at the end of state M, the neighborhood of the cell is checked for any empty site. If there are more than one side in the neighborhood, then the site that is closest to the medium is selected. If no empty site exists in the neighborhood, then the direction that is closest to the medium is selected and cells are shifted. If there are more than one direction that is is closest to the medium, then the direction is selected randomly.

12 Duchting Model (continued) All cells living a certain distance or more from the medium and in the GO phase, go the N phase. Each cell can be removed by an external event (radiotherapy or chemotherapy) With radiotherapy, only proliferating cells can be lethally damages with some probability. With chemotherapy, only cells in phases G1, S, G2, and M are destroyed with some other probability.

13 Brain Tumor Growth Model A.R. Kansal et al., Simulated brain tumor growth dynamics using a three-dimensional cellular automaton, J. Thoer. Biol. 203(2000), 367-382. Lattice is not regular. It uses a 3D Voronoi-Delaunay lattice i.e., a collection of space-filling polyhedrons. Each site of lattice is the center of each polyhedron. Each polyhedron represents a cell. The number of cells per unit volume is higher near the center of the lattice. There are 1.5 million lattice sites. The neighborhood of a site is the set of lattice sites that share a common surface with the polyhedron of the particular site.

14 2D Voronoi-Delaunay Lattice

15 Brain Tumor Growth Model (continued) There are two types of cells: cancerous and normal (non-cancerous). Normal cells are represented by empty sites of the lattice. Cancerous cells have three discrete states: proliferating, quiescent and necrotic. The initial configuration of tumor cells (~1000 cells) are placed at the center of the lattice. The update rules are probabilistic. The state of each cell (proliferating, quiescent, or necrotic) transition a probability function. The update rules are not all local e.g., the proliferation rule depends on the location of the site and only sites that are sufficiently close to the boundary surface of the tumor can divide. There are four important time-dependent parameters: R t, D p, D n and P d (average tumor radius, proliferating rim thickness, quiescent thickness, and probability of division).

16 Tumor Cross-section

17 Brain Tumor Growth Model (continued) At each time step: oEach cell is checked for time: normal, necrotic, quiescent, or proliferating. oNormal cells and necrotic cells are inert. oCancerous, quiescent cells the are more than the distance D n become necrotic. This incorporates the idea of nutrient starvation. oProliferating cells divide if a certain random number that depends on the location of the cell in the tumor is exceeded. This incorporates a mechanical confinement pressure condition. oDividing cells searches a sphere of radius D p for an empty (non- tumor) site. If found, it divides and fills both sites. If unsuccessful, then the site changes to quiescent.

18 Simulation Over Time: Proliferating, Quiescent and Necrotic Regions (cross-section)

19 Simulations: Different Cross-sections

20 Potts Model (2002) (Yi Jiang and Jelena Pjesivac-Grbovic: Cellular Model for Avascular Tumor Growth, Student Research Symposium 2002, LARC)

21 Biological Processes Nutrient absorption and diffusion Waste products Cell-cell adhesion Chemotaxis Cell proliferation Mutations Geometry and structure of cells

22 Jiang & Pjesivac-Grbovic Model Extended Potts Model in Three-dimensions Monte Carlo Reaction-diffusion equations (PDEs) for oxygen, nutrients, and waste products Incorporates some of the biological processes

23 Potts Model: Minimize energy of the system of cells 3D lattice is partitioned into domains of cells and medium. Cells can occupy more than one lattice point. Each cell has properties assigned: type (proliferating, quiescent, or necrotic), adhesion strength to neighboring cells, and the volume of the cell. For growing cells, the properties also include growth rate, metabolic rate (nutrient uptake and waste production). The total energy of the system depends on cell-cell surface interaction due to adhesion, cell elastic bulk energy due to growth, and chemical energy due to cell interaction with local chemical gradients (oxygen, nutrients e.g., glucose, and wastes e.g., lactate). The lattice evolves by a Monte Carlo process. At each Monte Carlo step, a random change is made at a lattice site. The change in energy as a result of the perturbation is computed. If the proposed change decreases the total energy of the system, then the change is accepted and the next Monte Carlo step is made. If the change results in an increase of the energy, then the change is accepted with a probability that is dependent a Boltzmann parameter. The chemical dynamics are solved using an irregular 3D grid with each point of the this irregular grid being the center of mass of the cell.

24 (continued) Two different time scales are used. For cell dynamics, there are many Monte Carlo steps for each real time step (~cell cycle) and for the chemical dynamics the number of numerical steps are determined by chemical diffusion and metabolic rates. There are approximately 70 Monte Carlo steps per day. Cell growth and division are incorporated in the volume constraint in the energy. Each cell has its own cell cycle. This cycle is sensitive to its nutrient and waste environment. Different nutrients affect the cell cycle differently. The diffusion rates for different nutrients can be different. When the nutrient levels fall below some threshold value or the waste level is above some threshold level for a particular cell, then the cell stops proliferating and becomes quiescent. Depending on nutrients and waste levels, a quiescent cell becomes necrotic. Cells divide only when a cell reaches the last stage of the cell cycle and its volume reaches a targeted valued. A cell splits along its longest axis into two daughter cells and these two cells may inherit the state of the mother cell or undergo mutation with some given probability.

25 Energy S - cell identification number (1,2,3,…)  (S) - cell type (proliferating, quiescent, or necrotic) J  (S)  (S’) - coupling energy between cell types  (S) and  (S’) v - elasticity v s - cell Volume V s - target Volume C f - concentration of chemical (nutrient or waste) µ f - chemical potential

26 Chemical Diffusion in Tumor

27 Nutrient Diffusion (from Jiang & Pjesivac-Grbovic)

28 Simulation Example (after 440 Monte Carlo steps) (from Jiang & Pjesivac-Grbovic)

29 Waste Distribution (from Jiang & Pjesivac-Grbovic)

30 Number of Cells over Time (from Jiang & Pjesivac-Grbovic)

31 Growth of Tumor - 12 Hours (from Jiang & Pjesivac-Grbovic)

32 Day 3 (from Jiang & Pjesivac-Grbovic)

33 8.5 Days (from Jiang & Pjesivac-Grbovic)

34 Growth in Number of Cells versus O 2 and Nutrient (from Jiang & Pjesivac-Grbovic)

35 Volume of Cells versus O 2 and Nutrient (from Jiang & Pjesivac-Grbovic)


Download ppt "A Quick Look at Cellular Automata Models for Solid Tumor Growth Philip Crooke Department of Mathematics Biomathematics Study Group Vanderbilt Integrative."

Similar presentations


Ads by Google