Help Privacy Policy Disclaimer
  Advanced SearchBrowse





Algorithmic Reduction of Biological Networks With Multiple Time Scales


Sturm,  Thomas
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

(Preprint), 952KB

Supplementary Material (public)
There is no public supplementary material available

Kruff, N., Lüders, C., Radulescu, O., Sturm, T., & Walcher, S. (2020). Algorithmic Reduction of Biological Networks With Multiple Time Scales. Retrieved from https://arxiv.org/abs/2010.10129.

Cite as: http://hdl.handle.net/21.11116/0000-0007-7A12-C
We present a symbolic algorithmic approach that allows to compute invariant manifolds and corresponding reduced systems for differential equations modeling biological networks which comprise chemical reaction networks for cellular biochemistry, and compartmental models for pharmacology, epidemiology and ecology. Multiple time scales of a given network are obtained by scaling, based on tropical geometry. Our reduction is mathematically justified within a singular perturbation setting using a recent result by Cardin and Teixeira. The existence of invariant manifolds is subject to hyperbolicity conditions, which we test algorithmically using Hurwitz criteria. We finally obtain a sequence of nested invariant manifolds and respective reduced systems on those manifolds. Our theoretical results are generally accompanied by rigorous algorithmic descriptions suitable for direct implementation based on existing off-the-shelf software systems, specifically symbolic computation libraries and Satisfiability Modulo Theories solvers. We present computational examples taken from the well-known BioModels database using our own prototypical implementations.