English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Algorithmic Reduction of Biological Networks With Multiple Time Scales

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.

Item is

Files

show Files
hide Files
:
arXiv:2010.10129.pdf (Preprint), 952KB
Name:
arXiv:2010.10129.pdf
Description:
File downloaded from arXiv at 2020-11-27 15:01
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show

Creators

show
hide
 Creators:
Kruff, Niclas1, Author
Lüders, Christoph1, Author
Radulescu, Ovidiu1, Author
Sturm, Thomas2, Author                 
Walcher, Sebastian1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545              

Content

show
hide
Free keywords: Quantitative Biology, Molecular Networks, q-bio.MN,Computer Science, Logic in Computer Science, cs.LO,Computer Science, Symbolic Computation, cs.SC,Mathematics, Dynamical Systems, math.DS,
 Abstract: 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.

Details

show
hide
Language(s): eng - English
 Dates: 2020-10-202020
 Publication Status: Published online
 Pages: 35 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: arXiv: 2010.10129
URI: https://arxiv.org/abs/2010.10129
BibTex Citekey: Kruff_arXiv2010.10129
 Degree: -

Event

show

Legal Case

show

Project information

show

Source

show