A review on algorithms for network motif discovery in biological networks

Tien Tzu Hsueh Pao/Acta Electronica Sinica

Volumn 37, Issue 10, 2009, Pages 2258-2265

  Qin, Gui Min ^a   Gao, Lin ^a   Hu, Jia Lu ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

Algorithms; Biological networks; Network motifs

Indexed keywords

BIOLOGICAL NETWORKS; COMPUTATIONAL ISSUES; DATA ANALYSIS; KEY PROBLEMS; MOTIF DISCOVERY; NETWORK MOTIF; NETWORK MOTIFS; RANDOM NETWORK; RECENT PROGRESS; RESEARCH METHODS; RESEARCH TRENDS; SUBGRAPHS;

ALGORITHMS;

EID: 70849103679     PISSN: 03722112     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (49)

1. Yeger-Lotem E, Sattath S, Kashtan N, Itzkovitz S, Milo R, Pinter R Y, Alon U, Margalit H. Network motifs in integrated cellular networks of transcription regulation and protein-protein interaction[J]. Proc Natl Acad Sci, 2004, 101(16):5934-5939.
2. Newman M E J. The structure and function of complex networks[J]. SIAM Rev. 2003, 45(2):167-256.
3. R Milo, S S Shen-Orr, S Itzkovitz, et al. Network motifs: Simple building blocks of complex networks[J]. Science, 2002, 298(5594):824-827.
4. S S Shen-Orr, R Milo, S Mangan, U Alon. Network motifs in the transcriptional regulation network of Escherichian Coli[J]. Nature Genetics, 2002, 31(1):64-68.
5. Lee T I, et al. Transcriptional regulatory networks in saccharomyces cerevisiae[J]. Science, 2002, 298, 799-804.
6. Milo R, Itzkovitz S, Kashtan N, et al. Superfamilies of evolved and designed networks[J]. Science, 2004, 303, 1538-1542.
7. Lahav G, Rosenfeld N, Sigal A, et al. Dynamics of the p53-Mdm2 feedback loop in individual cells[J]. Nature Genetics, 2004, 36, 147-150.
8. Barabasi AL, Oltvai ZN. Network biology: Understanding the cell's functional organization[J]. Nature Reviews Genetics, 2004, 5(2):101-114.
9. Uri Alon. Network motifs: theory and experimental approaches[J]. Nature, 2007, 8, 450-461.
10. Berg J. Lässig M. Local graph alignment and motif search in biological networks[J]. Proc Natl Acad Sci, 2004, 101(41):14689-14694.
11. Albert-László Barabási, Zoltán N. Oltvai. Network biology: Understanding the cell's fuctional organization[J]. Nature, 2004, 5:101-113.
12. Milo R, Kashtan N, Itzkovitz S, Neuman M E J, Alon, U. On the uniform generation of random graphs with prescribed degree sequences[OL]. cond-mat/0312028, 2003.
13. Przulj N, Corneil DG, Jurisica I. Modeling interactome: scale-free or geometric?[J]. Bioinformatics, 2004, 20(18):3508-3515.
14. Przulj N, Corneil DG, Jurisica I. Efficient estimation of graphlet frequency distribution in protein-protein interaction networks[J]. Bioinformatics, 2006, 22(8):974-980.
15. N Kashtan, S Itzkovitz, R Milo, U Alon. Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs[J]. Bioinformatics, 2004, 20(11):1746-1758.
16. Wernicke S. A faster algorithm for detecting network motifs[A]. In Proceedings of the 5th Workshop on Algorithms in Bioinformatics (WABI'05). Lecture Notes in Bioinformatics[C]. Mallorca, Spain: Springer Verlag, 2005, 3692:165-177.
17. Sebastian Wernicke. Efficient detection of network motifs[J]. IEEE Trans on Computational Biology and Bioinformatics, 2006, 3(4):347-359.
18. Grochow JA, Kellis M. Network motif discovery using subgraph enumeration and symmetry-breaking[A]. In RECOMB 2007, Lecture Notes in Computer Science[C]. Oakland, CA: Springer. 92-106.
19. Xiaofeng Zhou, Lin Gao, AnGuo Dong. An algorithm for finding frequent patterns in a large sparse graph[A]. In IAENG International Conference on Bioinformatics (ICB2007) [C]. Hong Kong, China, 2007. 290-294.
20. An guo Dong, Lin Gao, Xiaofeng Zhou, HongYu Su. An algebra approach for finding frequent subgraphs with Hamilton cycle[A]. The 4th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD07)[C]. Haikou, China: IEEE, 2007. 288-292.
21. Sebastian Wernicke, Florian Rasche. FANMOD: a tool for fast network motif detection[J]. Bioinformatics, 2006, 22, 1152-1153.
22. Jiang Rui, Tu Zhidong, Chen Ting, et al. Network motif identification in stochastic networks[J]. Proc Natl Acad Sci, 2006, 103(25):9404-9409.
23. Jin Chen, Wynne Hsu, Mong Li Lee, See-Kiong Ng. NeMoFinder: Dissecting genome-wide protein-protein interactions with meso-scale network motifs[A]. In KDD'06[C]. Philadelphia, Pennsylvania, USA:ACM, 2006. 106-115.
24. Huan J, Wang W, Prins J, et al. Spin:mining maximal frequent subgraphs from graph database[A]. In KDD 2004[C]. Seattle, Washington, USA: ACM, 2004. 581-586.
25. Schreiber F, Schwobbermeyer H. Frequency concepts and pattern detection for the analysis of motifs in networks[J]. Transactions on Computational Systems Biology, 2005, 3:89-104.
26. Chia-Ying Cheng, Chung-Yuan Huang, Chuen-Tsai Sun. Mining bridge and brick motifs from complex biological networks for functionally and statistically significant discovery[J]. IEEE Transactions on Systems, Man, and Cybernetics, 2008, 38(1):17-24.
27. Noga Alon, Phuong Dao, Iman Hajirasouliha, et al. Biomolecular network motif counting and discovery by color coding[J]. Bioinformatics, 2008, 24:i241-i249.
28. Giovanni Ciriello, Concettina Guerra. A review on models and algorithms for motif discovery in protein-protein interaction networks[J]. Briefings in Functional Genomics and Proteomics, 2008, 2:147-156.
29. Chen J, Hsu W, Lee ML, et al. Labeling network motifs in protein interactomes for protein function prediction[A]. In IEEE 23rd International Conference on Data Engineering (ICDE07)[C]. Istanbul, Turkey: IEEE Computer Society, 2007. 546-555.
30. Babu M M, Luscombe N M, Aravind L, et al. Structure and evolution of transcriptional regulatory networks[J]. Curr Opin Struct Biol, 2004, 14:283-291.
31. Mason, O Verwoerd, M. Graph theory and networks in biology[J]. System Biology IET, 2007, 1(2):89-119.
32. Bader GD, Hogue CW. An automated method for finding molecular complexes in large protein interaction networks[J]. BMC Bioinformatics, 2003, 4:2.
33. King AD, Przulj N, Jurisica I. Protein complex prediction via cost-based clustering[J]. Bioinformatics, 2004, 20(17):3013-3020.
34. Van Dongen S. Graph Clustering by Flow Simulation[D]. Utrecht, Netherlands: University of Utrecht, 2000.
35. Blatt M, Wiseman S, Domany E. Superparamagnetic clustering of data[J]. Phys Rev Lett, 1996, 76(18):3251-3254.
36. Arnau V, Mars S, Marin I. Iterative cluster analysis of protein interaction data[J]. Bioinformatics, 2005, 21(3):364-378.
37. Palla G, Dere'nyi I, Farkas IJ, et al. Uncovering the overlapping community structure of complex networks in nature and society[J]. Nature, 2005, 435 (7043):814-818.
38. Baskerville K, Paczuski M. Subgraph ensembles and motif discovery using a new heuristic for graph isomorphism[J]. Phys Rev 2006, E 74:051903.
39. Parida L. Discoverying topological motifs using a compact notation[J]. J Comput Biol, 2007, 4(3):300-323.
40. Royi Itzhack, Yelena Mogilevski, Yoram Louzoun. An optimal algorithm for counting network motifs[J]. Physica A, 2007, 381:482-490.
41. C Matias, S Schbath, E Birmele, et al. Network motifs: mean and variance for the count[J]. REVSTAT-Statistical Journal, 2006, 4(1):31-51.
42. F Picard, J. -J. Daudin, M. Koskas, et al. Assessing the exceptionality of network motifs[J]. Journal of Computational Biology, 2008, 15(1):1-20.
43. Inokuchi, T Washio, H Motoda. An apriori-based algorithm for mining frequent substructures from graph data[A]. Proc. Fourth European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD'00) [C]. Lyon, France: Springer-Verlag, 2000. 13-23.
44. A Inokuchi, T Washio, H Motoda. Complete mining of frequent patterns from graphs: Mining graph data[J]. Machine Learning, 2003, 50(3):321-354.
45. M Kuramochi, G Karypis. An efficient algorithm for discovering frequent subgraphs[J]. IEEE Trans Knowledge and Data Eng, 2004, 16(9):1038-1051.
46. X Yan, J Han. g. Span: graph-based substructure pattern mining[A]. In Proc of 2002 IEEE Int'l Conf Data Mining (ICDM) [C]. Maebashi City, Japan: IEEE, 2002. 721-724.
47. J Huan, W Wang, J Prins. Efficient mining of frequent subgraph in the presence of isomorphism[A]. In Proc of 2003 IEEE International Conference on Data Mining (ICDM'03) [C]. Melbourne, Florida USA: IEEE, 2003. 549-552.
48. E Gudes, S E Shimony, N Vanetik. Discovering frequent graph patterns using disjoint paths[J]. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(11):1441-1456.
49. Gao Lin, Qin Gui-Min, Zhou Xiao-Feng. An overview of algorithms for mining frequent patterns in graph data[J]. Acta Electronica Sinica, 2008, 36(8):1603-1609. (in Chinese)