Christoph Lüders

ORCID: 0000-0002-1458-4663
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Gene Regulatory Network Analysis
  • Formal Methods in Verification
  • Protein Structure and Dynamics
  • Numerical Methods and Algorithms
  • Microbial Metabolic Engineering and Bioproduction
  • Bioinformatics and Genomic Networks
  • Cryptography and Residue Arithmetic
  • Spectroscopy and Quantum Chemical Studies
  • Slime Mold and Myxomycetes Research
  • Innovation, Technology, and Society
  • Polynomial and algebraic computation
  • Mathematical Biology Tumor Growth
  • Regional Development and Policy
  • Algorithms and Data Compression
  • Distributed and Parallel Computing Systems
  • Corporate Governance and Management
  • Digital Innovation in Industries
  • Tensor decomposition and applications
  • Simulation Techniques and Applications
  • Coding theory and cryptography

University of Bonn
2015-2024

University of Kassel
2022

.Model reduction of fast-slow chemical reaction networks based on the quasi-steady state approximation fails when fast subsystem has first integrals. We call these integrals approximate conservation laws. In order to define subsystems and identify laws, we use ideas from tropical geometry. prove that any law evolves more slowly than all species involved in it therefore represents a supplementary slow variable an extended system. By elimination some variables system, obtain without which can...

10.1137/22m1543963 article EN SIAM Journal on Applied Dynamical Systems 2024-01-19

Abstract Summary Recently, symbolic computation and computer algebra systems have been successfully applied in biology, especially chemical reaction network theory. One advantage of is its potential for qualitative answers to biological questions. Qualitative methods analyze dynamical input as formal objects, contrast investigating only part the state space, case with numerical simulation. However, corresponding tools libraries a different set requirements their data than counterparts. A...

10.1093/bioadv/vbac027 article EN cc-by Bioinformatics Advances 2022-01-01

The Schönhage-Strassen algorithm (SSA) is the de-facto standard for multiplication of large integers. For N-bit numbers it has a time bound O(N log N N). De, Kurur, Saha and Saptharishi (DKSS) presented an asymptotically faster with better N• 2O(log* this paper, simplified DKSS was implemented. Assuming sensible upper limit on input size, some required constants could be precomputed. This allowed to simplify save complexity run-time. Still, run-time about 30 times larger than SSA, while...

10.1145/2755996.2756643 article EN 2015-06-24

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 cellular biochemistry, compartmental models pharmacology, epidemiology ecology. Multiple time scales of given network are obtained by scaling, based on tropical geometry. Our reduction is mathematically justified within singular perturbation setting. The existence subject...

10.1007/s11786-021-00515-2 article EN cc-by Mathematics in Computer Science 2021-07-08

A novel way to use SMT (Satisfiability Modulo Theories) solvers compute the tropical prevariety (resp. equilibrium) of a polynomial system is presented. The new method benchmarked against naive approach that uses purely polyhedral methods. It turns out faster than for models would otherwise take more one minute compute, in many cases by factor 60 or more, and worst case only slower two. Furthermore, an anytime algorithm, thus offering parts solution when infeasible.

10.48550/arxiv.2004.07058 preprint EN other-oa arXiv (Cornell University) 2020-01-01

.For polynomial ODE models, we introduce and discuss the concepts of exact approximate conservation laws, which are first integrals full truncated sets ODEs. For fast-slow systems, ODEs describe fast dynamics. We define compatibility classes as subsets state space, obtained by equating laws to constants. A set is complete when corresponding contain a finite number steady states. Complete can be used for model order reduction studying multistationarity model. provide algorithmic methods...

10.1137/22m1544014 article EN SIAM Journal on Applied Dynamical Systems 2024-03-12

Abstract The concept of attractor dynamic biochemical networks has been used to explain cell types and alterations in health disease. We have recently proposed an extension the notion take into account metastable regimes, defined as long lived dynamical states network. These regimes correspond slow dynamics on low dimensional invariant manifolds networks. Methods based tropical geometry allow compute represent them polyhedra space logarithms species concentrations. are looking for sensitive...

10.1101/466714 preprint EN cc-by-nc-nd bioRxiv (Cold Spring Harbor Laboratory) 2018-11-09

The Schönhage-Strassen algorithm (SSA) is the de-facto standard for multiplication of large integers. For $N$-bit numbers it has a time bound $O(N \cdot \log N N)$. De, Kurur, Saha and Saptharishi (DKSS) presented an asymptotically faster with better $N 2^{O(\log^* N)}$. In this diploma thesis, results implementation DKSS are presented: run-time about 30 times larger than SSA, while memory requirements 3.75 higher SSA. A possible crossover point estimated to be out reach even if we utilized...

10.48550/arxiv.1503.04955 preprint EN other-oa arXiv (Cornell University) 2015-01-01

Recently, symbolic computation and computer algebra systems have been successfully applied in biology, especially chemical reaction network theory. One advantage of is its potential for qualitative answers to biological questions. Qualitative methods analyze dynamical input as formal objects, contrast investigating only part the state space, case with numerical simulation. However, tools libraries a different set requirements their data than counterparts. A common format used mathematical...

10.48550/arxiv.2201.08980 preprint EN other-oa arXiv (Cornell University) 2022-01-01

Model reduction of fast-slow chemical reaction networks based on the quasi-steady state approximation fails when fast subsystem has first integrals. We call these integrals approximate conservation laws. In order to define subsystems and identify laws, we use ideas from tropical geometry. prove that any law evolves slower than all species involved in it therefore represents a supplementary slow variable an extended system. By elimination some variables system, obtain without which can be...

10.48550/arxiv.2212.13474 preprint EN cc-by arXiv (Cornell University) 2022-01-01

For polynomial ODE models, we introduce and discuss the concepts of exact approximate conservation laws, which are first integrals full truncated sets ODEs. fast-slow systems, ODEs describe fast dynamics. We define compatibility classes as subsets state space, obtained by equating laws to constants. A set is complete when corresponding contain a finite number steady states. Complete can be used for model order reduction studying multistationarity model. provide algorithmic methods computing...

10.48550/arxiv.2212.14881 preprint EN cc-by arXiv (Cornell University) 2022-01-01
Coming Soon ...