Bio-ModelChecker: Using Bounded Constraint Satisfaction to Seamlessly Integrate Observed Behavior With Prior Knowledge of Biological Networks

• Main Authors: Hooman Sedghamiz, Matthew Morris, Travis J. A Craddock, Darrell Whitley, Gordon Broderick
• Format: Article
• Language: English
• Published: Frontiers Media S.A. 2019-03-01
• Series: Frontiers in Bioengineering and Biotechnology
• Subjects: multi-valued discrete logic; constraint satisfaction; regulatory networks; multi-objective; data compliance; transition efficiency
• Online Access: https://www.frontiersin.org/article/10.3389/fbioe.2019.00048/full

The in silico study and reverse engineering of regulatory networks has gained in recognition as an insightful tool for the qualitative study of biological mechanisms that underlie a broad range of complex illness. In the creation of reliable network models, the integration of prior mechanistic knowledge with experimentally observed behavior is hampered by the disparate nature and widespread sparsity of such measurements. The former challenges conventional regression-based parameter fitting while the latter leads to large sets of highly variable network models that are equally compliant with the data. In this paper, we propose a bounded Constraint Satisfaction (CS) based model checking framework for parameter set identification that readily accommodates partial records and the exponential complexity of this problem. We introduce specific criteria to describe the biological plausibility of competing multi-valued regulatory networks that satisfy all the constraints and formulate model identification as a multi-objective optimization problem. Optimization is directed at maximizing structural parsimony of the regulatory network by mitigating excessive control action selectivity while also favoring increased state transition efficiency and robustness of the network's dynamic response. The framework's scalability, computational time and validity is demonstrated on several well-established and well-studied biological networks.