Abstract
Small over-represented motifs in biological networks are believed to represent essential functional units of biological processes. A natural question is to gauge whether a motif occurs abundantly or rarely in a biological network. Given that high-throughput biotechnology is only able to interrogate a portion of the entire biological network with non-negligible errors, we develop a powerful method to correct link errors in estimating undirected or directed motif counts in the entire network from noisy subnetwork data.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Arabidopsis Interactome Mapping Consortium: Evidence for network evolution in an Arabidopsis interactome map. Science 333, 601–607 (2011)
Neph, S., et al.: Circuitry and dynamics of human transcription factor regulatory networks. Cell 150, 1274–1286 (2012)
Rottger, R., Ruckert, U., Taubert, J., Baumbach, J.: How little do we actually know? - On the size of gene regulatory networks. IEEE/ACM Trans. Comput. Biol. Bioinform. 9, 1293–1300 (2012)
Simonis, N., et al.: Empirically controlled mapping of the C. elegans protein-protein interactome network. Nature Methods 6, 47–54 (2009)
Stumpf, M.P.H., et al.: Estimating the size of the human interactome. Proc. Natl. Acad. Sci. U.S.A. 105, 6959–6964 (2008)
Venkatesan, K., et al.: An empirical framework for binary interactome mapping. Nature Methods 6, 83–90 (2009)
Yu, H., et al.: High-quality binary protein interaction map of the yeast interactome network. Science 322, 104–110 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tran, N.H., Choi, K.P., Zhang, L. (2013). Counting Motifs in the Entire Biological Network from Noisy and Incomplete Data. In: Deng, M., Jiang, R., Sun, F., Zhang, X. (eds) Research in Computational Molecular Biology. RECOMB 2013. Lecture Notes in Computer Science(), vol 7821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37195-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-37195-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37194-3
Online ISBN: 978-3-642-37195-0
eBook Packages: Computer ScienceComputer Science (R0)