Model Rejection and Parameter Reduction via Time Series
Year: 2018
Type: article
Abstract: We show how a graph algorithm for finding matching labeled paths in pairs of labeled directed graphs can be used to perform model invalidation for a class of dynamical systems including regulatory network models of relevance to systems biology. In particular, given a partial order of events describing local minima and local maxima of observed quantities from experimental time series data, we produce a labeled directed graph we call the pattern graph for which every path from root to leaf corresponds to a plausible sequence of events. We then consider the regulatory network model, which can itself be rendered into a labeled directed graph we call the search graph via techniques previously developed in computational dynamics. Labels on the pattern graph correspond to experimentally observed events, while labels on the search graph correspond to mathematical facts about the model. We give a theoretical guarantee that failing to find a match invalidates the model. As an application we consider gene regulatory models for the yeast S. cerevisiae.
DOI: 10.1137/17m1134548
Language: English
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: green
Awards: G1816823653, INSPIRE: Nonlinear Data Reduction applied to Dense Granular Media, G4022875974, G4420254675, Collaborative Research: Computational and Data-Enabled Science and Engineering: Characterizing Dynamics of Particle-based Systems, G4636648896, G4803408543, G5270150132, G5636261911, CDI-TYPE II--COLLABORATIVE RESEARCH: Using Algebraic Topology to Connect Models with Measurements in Complex Nonequilibrium Systems, G6182062231, Impact of hepatocyte lineage life history dynamics on liver homeostasis in the ag, Emergent properties of synthetic microbial consortia, Needle in a haystack: effective search for dynamics across the space of networks, Mathematical Models for Pause-induced Delays in Bioprocesses, G7600576773, G862860306, G8852363705
OpenAlex ID: W2626668642
