A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence
- 1 September 2007
- journal article
- research article
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 14 (7) , 927-949
- https://doi.org/10.1089/cmb.2007.0015
Abstract
In this paper, we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed causal relationships as network paths and using techniques from combinatorial optimization to find the sparsest graph consistent with all experimental observations. Our contributions are twofold: (a) We formalize our approach, study its computational complexity and prove new results for exact and approximate solutions of the computationally hard transitive reduction substep of the approach (Sections 2 and 5). (b) We validate the biological usability of our approach by successfully applying it to a previously published signal transduction network by Li et al. (2006) and show that our algorithm for the transitive reduction substep performs well on graphs with a structure similar to those observed in transcriptional regulatory and signal transduction networks.Keywords
This publication has 20 references indexed in Scilit:
- Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone SubsystemsPublished by Springer Nature ,2006
- Inferring network interactions within a cellBriefings in Bioinformatics, 2005
- Evidence for dynamically organized modularity in the yeast protein–protein interaction networkNature, 2004
- A Protein Interaction Map of Drosophila melanogasterScience, 2003
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- The large-scale organization of metabolic networksNature, 2000
- Identifying gene regulatory networks from experimental dataPublished by Association for Computing Machinery (ACM) ,1999
- Approximation Algorithms for Several Graph Augmentation ProblemsSIAM Journal on Computing, 1981
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972