Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-27T05:32:25.575Z Has data issue: false hasContentIssue false

3 - A Modeling Toolbox for Cancer Growth

Published online by Cambridge University Press:  04 May 2017

Caterina A. M. La Porta
Affiliation:
Università degli Studi di Milano
Stefano Zapperi
Affiliation:
Università degli Studi di Milano
Get access

Summary

In this chapter we review a set of basic mathematical models and tools that have been widely applied to study cancer growth.We start in Section 3.1 with branching processes, simple probabilistic mean-field models for the evolution of a population. Branching processes represent the most widely used approach to model population dynamics of cancer cells. In Section 3.2 we consider probabilistic models for the evolution of mutations in cancer development. These models are sometimes related to branching processes we need to take into account for mutations in expanding clonal populations. In Section 3.3 we discuss models’ gene regulatory networks and signaling networks relevant for cancer, and in particular models for the p53 network. Mean-field models are not adequate to take into account the spatial localization of a tumor or of cancer cell population. To this end, one should introduce individual cell models in which we can follow the dynamics of a set of interacting active cells (Section 3.4). At a more coarse-grained level, the growth dynamics of a tumor can be represented by lattice cellular automata or by continuum phase-field models as discussed in Section 3.5.

Branching Processes

Branching processes (Harris, 1989; Kimmel and Axelrod, 2002) are a class of simple models that have been used extensively to model growth dynamics of stem cells (Vogel et al., 1968; Matioli et al., 1970; Potten and Morris, 1988; Clayton et al., 2007; Antal and Krapivsky, 2010; Itzkovitz et al., 2012) and cancer cells (Kimmel and Axelrod, 1991; Michor et al., 2005; Ashkenazi et al., 2008; Michor, 2008; Tomasetti and Levy, 2010; La Porta et al., 2012). Branching processes can be defined in discrete or continuous time and with evolution rules that may or may not depend on time. A detailed review of the mathematical theory of the branching process is given by Harris (1989) and applications to biology are discussed in Kimmel and Axelrod (2002).

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×