Abstract
We consider the problem of network completion, which is to make the minimum amount of modifications to a given network so that the resulting network is most consistent with the observed data. We employ here a certain type of differential equations as gene regulation rules in a genetic network, gene expression time series data as observed data, and deletions and additions of edges as basic modification operations. In addition, we assume that the numbers of deleted and added edges are specified. For this problem, we present a novel method using dynamic programming and least-squares fitting and show that it outputs a network with the minimum sum squared error in polynomial time if the maximum indegree of the network is bounded by a constant. We also perform computational experiments using both artificially generated and real gene expression time series data.
Highlights
Analysis of biological networks is one of the central research topics in computational systems biology
We proposed an approach called network completion [14] by following Occam’s razor, which is a well-known principle in scientific discovery
We proved that network completion is computationally intractable (NP-hard) even for tree-structured networks
Summary
Center, Institute for Chemical Research, Kyoto University Gokasho, Uji, Kyoto 611-0011, Japan of System Cohort, Multi-scale Research Center for Medical Science, Medical Institute of Bioregulation, Kyushu University, 3-1-1 Maidashi, Higashi-ku, Fukuoka, Fukuoka 812-8582, Japan
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have