### Abstract

Eukaryotic cell crawling is a highly complex biophysical and biochemical process, where deformation and motion of a cell are driven by internal, biochemical regulation of a poroelastic cytoskeleton. One challenge to built quantitative models that describe crawling cells is solving the reaction-diffusion-advection dynamics for the biochemical and cytoskeletal components of the cell inside its moving and deforming geometry. Here we develop an algorithm that uses the level set method to move the cell boundary and uses information stored in the distance map to construct a finite volume representation of the cell. Our method preserves Cartesian connectivity of nodes in the finite volume representation while resolving the distorted cell geometry. Derivatives approximated using a Taylor series expansion at finite volume interfaces lead to second order accuracy even on highly distorted quadrilateral elements. A modified, Laplacian-based interpolation scheme is developed that conserves mass while interpolating values onto nodes that join the cell interior as the boundary moves. An implicit time stepping algorithm is used to maintain stability. We use the algorithm to simulate two simple models for cellular crawling. The first model uses depolymerization of the cytoskeleton to drive cell motility and suggests that the shape of a steady crawling cell is strongly dependent on the adhesion between the cell and the substrate. In the second model, we use a model for chemical signalling during chemotaxis to determine the shape of a crawling cell in a constant gradient and to show cellular response upon gradient reversal.

Original language | English (US) |
---|---|

Pages (from-to) | 7287-7308 |

Number of pages | 22 |

Journal | Journal of Computational Physics |

Volume | 229 |

Issue number | 19 |

DOIs | |

State | Published - Sep 2010 |

Externally published | Yes |

### Fingerprint

### Keywords

- Cell motility
- Diffusion
- Finite volume
- Level set
- Moving boundaries
- Numeric method

### ASJC Scopus subject areas

- Computer Science Applications
- Physics and Astronomy (miscellaneous)

### Cite this

**The moving boundary node method : A level set-based, finite volume algorithm with applications to cell motility.** / Wolgemuth, Charles William; Zajac, Mark.

Research output: Contribution to journal › Article

*Journal of Computational Physics*, vol. 229, no. 19, pp. 7287-7308. https://doi.org/10.1016/j.jcp.2010.06.014

}

TY - JOUR

T1 - The moving boundary node method

T2 - A level set-based, finite volume algorithm with applications to cell motility

AU - Wolgemuth, Charles William

AU - Zajac, Mark

PY - 2010/9

Y1 - 2010/9

N2 - Eukaryotic cell crawling is a highly complex biophysical and biochemical process, where deformation and motion of a cell are driven by internal, biochemical regulation of a poroelastic cytoskeleton. One challenge to built quantitative models that describe crawling cells is solving the reaction-diffusion-advection dynamics for the biochemical and cytoskeletal components of the cell inside its moving and deforming geometry. Here we develop an algorithm that uses the level set method to move the cell boundary and uses information stored in the distance map to construct a finite volume representation of the cell. Our method preserves Cartesian connectivity of nodes in the finite volume representation while resolving the distorted cell geometry. Derivatives approximated using a Taylor series expansion at finite volume interfaces lead to second order accuracy even on highly distorted quadrilateral elements. A modified, Laplacian-based interpolation scheme is developed that conserves mass while interpolating values onto nodes that join the cell interior as the boundary moves. An implicit time stepping algorithm is used to maintain stability. We use the algorithm to simulate two simple models for cellular crawling. The first model uses depolymerization of the cytoskeleton to drive cell motility and suggests that the shape of a steady crawling cell is strongly dependent on the adhesion between the cell and the substrate. In the second model, we use a model for chemical signalling during chemotaxis to determine the shape of a crawling cell in a constant gradient and to show cellular response upon gradient reversal.

AB - Eukaryotic cell crawling is a highly complex biophysical and biochemical process, where deformation and motion of a cell are driven by internal, biochemical regulation of a poroelastic cytoskeleton. One challenge to built quantitative models that describe crawling cells is solving the reaction-diffusion-advection dynamics for the biochemical and cytoskeletal components of the cell inside its moving and deforming geometry. Here we develop an algorithm that uses the level set method to move the cell boundary and uses information stored in the distance map to construct a finite volume representation of the cell. Our method preserves Cartesian connectivity of nodes in the finite volume representation while resolving the distorted cell geometry. Derivatives approximated using a Taylor series expansion at finite volume interfaces lead to second order accuracy even on highly distorted quadrilateral elements. A modified, Laplacian-based interpolation scheme is developed that conserves mass while interpolating values onto nodes that join the cell interior as the boundary moves. An implicit time stepping algorithm is used to maintain stability. We use the algorithm to simulate two simple models for cellular crawling. The first model uses depolymerization of the cytoskeleton to drive cell motility and suggests that the shape of a steady crawling cell is strongly dependent on the adhesion between the cell and the substrate. In the second model, we use a model for chemical signalling during chemotaxis to determine the shape of a crawling cell in a constant gradient and to show cellular response upon gradient reversal.

KW - Cell motility

KW - Diffusion

KW - Finite volume

KW - Level set

KW - Moving boundaries

KW - Numeric method

UR - http://www.scopus.com/inward/record.url?scp=77955267573&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955267573&partnerID=8YFLogxK

U2 - 10.1016/j.jcp.2010.06.014

DO - 10.1016/j.jcp.2010.06.014

M3 - Article

AN - SCOPUS:77955267573

VL - 229

SP - 7287

EP - 7308

JO - Journal of Computational Physics

JF - Journal of Computational Physics

SN - 0021-9991

IS - 19

ER -