Approximate simulation of cortical microtubule models using dynamical graph grammars.

ABSTRACT: Dynamical graph grammars (DGGs) are capable of modeling and simulating the dynamics of the cortical microtubule array (CMA) in plant cells by using an exact simulation algorithm derived from a master equation; however, the exact method is slow for large systems. We present preliminary work on an approximate simulation algorithm that is compatible with the DGG formalism. The approximate simulation algorithm uses a spatial decomposition of the domain at the level of the system's time-evolution operator, to gain efficiency at the cost of some reactions firing out of order, which may introduce errors. The decomposition is more coarsely partitioned by effective dimension (d= 0 to 2 or 0 to 3), to promote exact parallelism between different subdomains within a dimension, where most comput

SUBMITTER: Medwedeff E 

PROVIDER: S-EPMC11216692 | biostudies-literature | 2023 Jul

REPOSITORIES: biostudies-literature