Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs

Bioinformatics

Volumn 20, Issue 11, 2004, Pages 1746-1758

  Kashtan, N ^a   Itzkovitz, S ^a   Milo, R ^a   Alon, Uri ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ESCHERICHIA COLI PROTEIN;

ALGORITHM; ANALYTIC METHOD; ARTICLE; ARTIFICIAL NEURAL NETWORK; BACTERIAL GENE; CONTROLLED STUDY; DISPLAY SYSTEM; ESCHERICHIA COLI; GENETIC TRANSCRIPTION; INFORMATION PROCESSING; MATHEMATICAL COMPUTING; NONHUMAN; PRIORITY JOURNAL; PROTEIN MOTIF; RANDOMIZATION; SAMPLING;

EID: 4444268694     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bth163     Document Type: Article

References (47)

1. Achacoso,T.B. and Yamamoto,W.S. (1992) AY's Neuroanatomy of C. elegans for Computation. CRC Press, Boca Roton, FL.
2. Ackley,D.H., Hinton,G.E. and Sejnowski,T.J. (1985) A Learning Algorithm for Boltzmann Machines. Cognitive Science 9: 147-169.
3. Akkoyunlu,E. (1973) The enumeration of maximal cliques of large graphs. SIAM J. Comput., 2, 1-6.
4. Alon,N., Duke,R., Lefmann,H., Rödl,V. and Yuster,R. (1994) The algorithmic aspects of the regularity lemma. J. Algor., 16, 80-109.
5. Alon,N., Yuster,R. and Zwick,U. (1997) Finding and counting given length cycles. Algorithmica, 17, 209-223.
6. Barabasi,A.-L. and Albert,R. (1999) Emergence of scaling in random networks. Science, 286, 509-512.
7. Bezem,G.J. and Van Leeuwen,J. (1987) Enumeration in graphs. M.Sc. thesis Universiteit Utrecht, Utrecht.
8. Bosiljka,T. and Rodgers,G.J. (2002) Packet transport on scale free networks. Adv. Complex Syst., 5, 445-456.
9. Bunge,J. and Fitzpatrick,M. (1993) Estimating the number of species: a review. J. Am. Stat. Assoc., 88, 364-373.
10. Chaudhuri,S., Motwani,R. and Narassaya,V. (1998) Using random sampling for histogram construction: how much is enough? Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, Washington, USA, 2-4 June, ACM Press, pp. 436-447.
11. Costanzo,M.C., Crawford,M.E., Hirschman,J.E., Kranz,J.E., Olsen,P., Robertson,L.S., Skrzypek,M.S., Braun,B.R., Hopkins,K.L., Kondu,P. et al. (2001) YPD, PombePD and WormPD: model organism volumes of the BioKnowledge library, an integrated resource for protein information. Nucleic Acids Res., 29, 75-79.
12. Duke,R., Lefmann,H. and Rödl,V. (1995) A fast approximation algorithm for computing the frequencies of subgraphs in a given graph. SIAM J. Comput., 24, 598-620.
13. Dyer,M., Frieze,A.M. and Jerrum,M. (1994) Approximately counting Hamilton cycles in dense graphs. Proceedings of the 5th ACM/SIAM Symposium on Discrete Algorithms. ACM/SIAM Press, pp. 336-343.
14. Flajolet,P. and Martin,G. (1985) Probabilistic counting algorithms. J. Comput. Syst. Sci., 31, 182-209.
15. Frieze,A. and Kannan,R. (1999) Quick approximation to matrices and applications. Combinatorica, 19, 175-220.
16. Gibbons,P.B. (2001) Distinct sampling for highly-accurate answers to distinct values queries and event reports. Proceedings of the 27th International Conference on Very Large Databases. Rome, Italy. pp. 541-550.
17. Hertz,J., Krogh,A. and Palmer,R.G. (1991) Introduction to the Theory of Neural Computation. Addison-Wesley Publishing Company. Redwood, CA.
18. Inokuchi,A., Washio,T. and Motoda,H. (2000) An apriori-based algorithm for mining frequent substructures from graph data. Proceedings of PKDD2000: The Fourth European Conference on Principles and Practice of Knowledge Discovery in Databases. Lyon, Springer, France.
19. Itzkovitz,S., Milo,R., Kashtan,N., Ziv,G. and Alon,U. (2003) Subgraphs in random networks. Phys. Rev. E., 68, 026127.
20. Jerrum,M. (2003) Counting, sampling and integrating: algorithms and complexity. Lectures in Mathematics. ETH Zurich, Springer, 132 pp.
21. Jerrum,M. and Sinclair,A. (1996) The Markov chain Monte Carlo method: an approach to approximate counting and integration. In Hochbaum, P.S. (ed.), Approximation Algorithms for NP-hard Problems. PWS Publishing, Boston, pp. 482-520.
22. Johnson,D.B. (1975) Finding all the elementary circuits of a directed graph. SIAM J. Comput., 4, 77-84.
23. Kalir,S., McClure,J., Pabbaraju,K., Southward,C., Ronen,M., Leibler,S., Surette,M.G. and Alon,U. (2001) Ordering genes in a flagella pathway by analysis of expression kinetics from living bacteria. Science, 292, 2080-2083.
24. Kashtan,N., Itzkovitz,S., Milo,R. and Alon,U. (2004) Topological Generalizations of network motifs arxiv: q-bio/0312019. Phys. Rev. E. in press.
25. Kim,B.J., Hong,H. and Choy,M.Y. (2003) Quantum and classical diffusion in small-world networks. PRB, in press.
26. Kuramochi,M. and Karypis,G. (2001) Frequent subgraph discovery. Proceedings of the 1st IEEE International Conference on Data Mining (ICDM).
27. Lahav,G., Rosenfeld,N., Sigal,A., Geva-Zatorsky,N., Levine,A.J., Elowitz,M.B. and Alon,U. (2004) Dynamics of the p53-Mdm2 feedback loop in individual cells. Nat. Genet., 36, 147-50.
28. Laub,M.T., McAdams,H.H., Feldblyum,T., Fraser,C.M. and Shapiro,L. (2000) Global analysis of the genetic network controlling a bacterial cell cycle. Science, 290, 2144-2148.
29. Lovasz,L. (1993) Random Walks on Graphs: A Survey. Combinatorics Paul Erdos is Eighty. Bolyai Society for Mathematical Studies, Vol. 2, pp. 1-46.
30. McAdams,H.H. and Shapiro,L. (2003) A bacterial cell-cycle regulatory network operating in time and space. Science 301, 1874-1877.
31. Mangan,S. and Alon,U. (2003) Structure and function of the feedforward loop network motif. Proc. Natl Acad. Sci., USA, 100, 11980-11985.
32. Mangan,S., Zaslaver,A. and Alon,U. (2003) The coherent feedforward loop serves as a sign-sensitive delay element in transcription networks. J. Mol. Biol., 334, 197-204.
33. Milo,R., Kashtan,N., Itzkovitz,S., Neuman,M.E.J. and Alon,U. (2003) Uniform generation of random networks with arbitrary degree sequence.
34. 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.
35. Milo,R., Itzkovitz,S., Kashtan,N., Levitt,R., Shen-Orr,S., Ayzenshtat,I., Sheffer,M. and Alon,U. (2004) Superfamilies of evolved and designed networks. Science 303(5663): 1538-42.
36. Minsky,M.L. and Papert,S.A. (1969) Perceptrons. Cambridge, MIT Press.
37. Nesetril,J. and Poljak,S. (1985) On the complexity of the subgraph problem. Commen. Math. Univ. Carol., 26, 415-419.
38. Olken,F. and Rotem,D., (1995) Random sampling from databases - a survey. Stat. Comput., 5, 25-42.
39. Ouzounis,C. and Karp,P. (2000) Global properties of the metabolic map of Escherichia coli. Genome Res., 10, 568-576.
40. Ronen,M., Rosenberg,R., Shraiman,B.I. and Alon,U. (2002) Assigning numbers to the arrows: parameterizing a gene regulation network by using accurate expression kinetics. Proc. Natl Acad. Sci., USA, 99, 10555-10560.
41. Rosenblatt,F. (1962) Principles of Neurodynamics. New York, Spartan.
42. Shen-Orr,S., Milo,R., Mangan,S. and Alon,U. (2002) Network motifs in the transciptional regualtion network of Escherichia coli. Nat. Genet., 31, 64-68.
43. Szemeredi,E. (1978) Regular partitions of graphs. In Bermond,J.-C., Fournier,J.-C., Las Vergnas,M. and Sotteau,D. (eds), Proceedings of the Colleque International CNRS, No. 260. pp. 399-401.
44. Wagner,A. and Fell,D. (2001) The small world inside large metabolic networks. Proc. R. Soc. Load. B Biol. Sci., 268, 1803-1810.
45. White,J., Southgate,E., Thomson,J. and Brenner,S. (1986) The structure of the nervous system of the nematode Caenorhabditis elegans. Phil. Trans. R. Soc. Load. Ser B, 314, 1-340.
46. Williams,R.J. and Martinez,N.D. (2000) Simple rules yield complex food webs. Nature, 404, 180-183.
47. Zaslaver,A., Mayo,A.E., Rosenberg,R., Bashkin,P., Sberro,H., Tsalyuk,M., Surette,M.G. and Alon,U. (2004) Just-in-time transcription programs in metabolic pathways. Nat. Genet., 36, 486-491.