Analyzing protein lists with large networks: Edge-count probabilities in random graphs with given expected degrees

Journal of Computational Biology

Volumn 12, Issue 2, 2005, Pages 113-128

  Pradines, Joël R ^a   Farutin, Victor ^a   Rowley, Steve ^a   Dančík, Vlado ^a  

^a MILLENNIUM PHARMACEUTICALS INC   (United States)

Author keywords

Degree sequence; Degree sequence problem; Protein network; Random graph; Sparse network

Indexed keywords

ARTICLE; MODEL; PRIORITY JOURNAL; PROBABILITY; PROTEIN ANALYSIS; PROTEIN EXPRESSION; PROTEIN FUNCTION; PROTEIN INTERACTION; RANDOMIZATION;

ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; DATA INTERPRETATION, STATISTICAL; HUMANS; POISSON DISTRIBUTION; PROTEINS;

EID: 15944384250     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2005.12.113     Document Type: Article

References (34)

1. Albert, R., and Barabási, A.-L. 2002. Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47-97.
2. Bader, G.D., Betel, D., and Hogue, C. 2003. BIND: The Biomolecular Interaction Network Database. Nucl. Acids Res. 31, 248-250.
3. Bader, G.D., and Hogue, C.W.V. 2002. Analyzing yeast protein-protein interaction data obtained from different sources. Nat. Biotechnol. 20, 991-997.
4. Bailey, J.E. 1999. Lessons from metabolic engineering for functional genomics and drug discovery. Nat. Biotechnol. 17, 616-618.
5. Bassler, J., Grandi, P., Gadal, O., Lessmann, T., Petfalski, E., Tollervey, D., Lechner, J., and Hurt, E. 2001. Identification of a 60S preribosomal particle that is closely linked to nuclear export. Mol. Cell 8, 517-529.
6. Bender, E.A., and Canfield, E.R. 1978. The asymptotic number of labelled graphs with given degree sequences. J. Combin. Theory (A) 24, 296-307.
7. Braun, E.L., and Fuge, E.K., Padilla, P.A., and Werner-Washburne, M. 1996. A stationary-phase gene in Saccharomyces cerevisiae is a member of a novel, highly conserved gene family. J. Bacteriol. 178, 6865-6872.
8. Chung, F., and Lu, L. 2002. The average distance in random graphs with given expected degrees. Proc. Natl. Acad. Sci. USA 99, 15879-15882.
9. Feller, W. 1970. An Introduction to Probability Theory and Its Applications, vol. I, chap. XI, 280-282, John Wiley, New York.
10. Girvan, M., and Newman, M.E.J. 2002. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821-7826.
11. Hakimi, S. 1962. On realizability of a set of integers as degrees of the vertices of a linear graph. J. Soc. Ind. Appl. Math. 10, 496-506.
12. Havel, V. 1955. A remark on the existence of finite graphs. Čaposis Pěst. Mat. 80, 477-480.
13. Itzkovitz, S., Milo, R., Kashtan, N., Ziv, G., and Alon, U. 2003. Subgraphs in random networks. Phys. Rev. E 68, 026127.
14. Krause, R., Von Mering, C., and Bork, P. 2003. A comprehensive set of protein complexes in yeast: Mining large scale protein-protein interaction screens. Bioinformatics 19, 1901-1908.
15. Letovsky, S., and Kasif, S. 2003. Predicting protein function from protein/protein interaction data: A probabilistic approach. Bioinformatics 19(Suppl. 1), 197-204.
16. Maslov, S., and Sneppen, K. 2002. Specificity and stability in topology of protein networks. Science 296, 910-913.
17. Maslov, S., Sneppen, K., and Zaliznyak, A. 2003. Detection of topological patterns in complex networks: Correlation profile of the internet. arXiv:cond-mat/0205379.
18. Milo, R., Kashtan, N., Itzkovitz, S., Newman, M., and Alon, U. 2003. Uniform generation of random graphs with arbitrary degree sequences. arXiv:cond-mat/0312028.
19. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., and Alon, U. 2002. Network motifs: Simple building blocks of complex networks. Science 298, 824-827.
20. Molloy, M., and Reed, B. 1995. A critical point for random graphs with a given degree sequence. Rand. Struct. Alg. 6, 161-179.
21. Newman, M. 2003a. Mixing patterns in networks. Phys. Rev. E 67, 026126.
22. Newman, M. 2003b. The structure and function of complex networks. SIAM Review 45, 167-256.
23. Newman, M.E.J. 2004. Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133.
24. Newman, M., Strogatz, S., and Watts, D. 2001. Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118.
25. Pruitt, K.D., and Maglott, D.R. 2003. RefSeq and LocusLink: NCBI gene-centered resources. Nucl. Acids Res. 29, 137-140.
26. Ravasz, E., Somera, A., Mongru, D., Oltvai, Z., and Barabási, A. 2002. Hierarchical organization of modularity in metabolic networks. Science 297, 1551-1555.
27. Rives, A.W., and Galitski, T. 2003. Modular organization of cellular networks. Proc. Natl. Acad. Sci. USA 100, 1128-1133.
28. Samanta, M.P., and Liang, S. 2003. Predicting protein functions from redundancies in large-scale protein interaction networks. Proc. Natl. Acad. Sci. USA 100, 12579-12583.
29. Sanders, S.L., Jennings, J., Canutescu, A., Link, A.J., and Weil, P.A. 2002. Proteomics of the eukaryotic transcription machinery: Identification of proteins associated with components of yeast TFIID by multidimensional mass spectrometry. Mol. Cell. Biol. 22, 4723-4738.
30. Shen-orr, S., Milo, R., Mangan, S., and Alon, U. 2002. Network motifs in the transcriptional regulation network of Escherichia coli. Nature Genet. 31, 64-68.
31. Sierksma, G., and Hoogeveen, H. 1991. Seven criteria for integer sequences being graphic. J. Graph Theory 15, 223-231.
32. Spirin, V., and Mirny, L.A. 2003. Protein complexes and functional modules in molecular networks. Proc. Natl. Acad. Sci. USA 100, 12123-12128.
33. Watts, D.J., and Strogatz, S.H. 1998. Collective dynamics of small world networks. Nature 393, 440-442.
34. Yook, S.Y., Oltvai, Z.N., and Barabási, A.-L. 2004. Functional and topological characterization of protein interaction networks. Proteomics 4, 928-942.