CytoKavosh: A Cytoscape Plug-In for Finding Network Motifs in Large Biological Networks

PLoS ONE

Volumn 7, Issue 8, 2012, Pages

  Masoudi Nejad, Ali ^a   Ansariola, Mitra ^a   Razaghi Moghadam Kashani, Zahra ^a   Salehzadeh Yazdi, Ali ^a   Khakabimamaghani, Sahand ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPLEX FORMATION; COMPUTER GRAPHICS; COMPUTER MEMORY; COMPUTER NETWORK; CONTROLLED STUDY; DATA ANALYSIS SOFTWARE; HUMAN COMPUTER INTERACTION; INTERMETHOD COMPARISON; MOLECULAR BIOLOGY; MOLECULAR COMPUTER; NETWORK MOTIF; PROCESS OPTIMIZATION; STRUCTURAL BIOINFORMATICS; STRUCTURE ANALYSIS;

ALGORITHMS; AMINO ACID MOTIFS; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; MODELS, BIOLOGICAL; PROGRAMMING LANGUAGES; PROTEIN INTERACTION MAPPING; PROTEIN STRUCTURE, TERTIARY; SOFTWARE; SYSTEMS BIOLOGY;

EID: 84865595417     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0043287     Document Type: Article

References (17)

1. Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, et al. (2002) Network motifs: simple building blocks of complex networks. Science 298: 824-827.
2. Bachmaier C, Brandes U, Schreiber F (2012) Biological Networks in R, Handbook of Graph Drawing and Visualization: Chapman & Hall/CRC Press.
3. Bode C, Kovacs IA, Szalay MS, Palotai R, Korcsmaros T, et al. (2007) Network analysis of protein dynamics. FEBS Lett 581: 2776-2782.
4. Dobrin R, Beg QK, Barabasi AL, Oltvai ZN, (2004) Aggregation of topological motifs in the Escherichia coli transcriptional regulatory network. BMC Bioinformatics 5: 10.
5. Kashtan N, Itzkovitz S, Milo R, Alon U, (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20: 1746-1758.
6. Schreiber F, Schwobbermeyer H, (2005) MAVisto: a tool for the exploration of network motifs. Bioinformatics 21: 3572-3574.
7. Chen J, Hsu W, Lee ML, Ng SK, (2006) NeMoFinder: dissecting genome-wide protein-protein interactions with meso-scale network motifs. 12th ACM SIGKDD international conference on Knowledge discovery and data mining pp. 106-115.
8. Joshua A, Grochow MK, (2007) Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking. Terence P Speed HH Oakland, CA, USA pp. 92-106.
9. Alon N, Dao P, Hajirasouliha I, Hormozdiari F, Sahinalp SC, (2008) Biomolecular network motif counting and discovery by color coding. Bioinformatics 24: i241-249.
10. Fernando Silva PR (2010) G-Tries: an efficient data structure for discovering network motifs. 25th ACM Symposium on Applied Computing- Bioinformatics and Computational Systems Biology Track. Sierre, Switzerland: ACM.
11. Wernicke S, Rasche F, (2006) FANMOD: a tool for fast network motif detection. Bioinformatics 22: 1152-1153.
12. Kashani ZR, Ahrabian H, Elahi E, Nowzari-Dalini A, Ansari ES, et al. (2009) Kavosh: a new algorithm for finding network motifs. BMC Bioinformatics 10: 318.
13. Omidi S, Schreiber F, Masoudi-Nejad A, (2009) MODA: an efficient algorithm for network motif discovery in biological networks. Genes Genet Syst 84: 385-395.
14. Kreher DL, Douglas RS (1998) Combinatorial Algorithms: Generation, Enumeration, and Search: CRC Press. 344 p.
15. Kreher D, Stinson D (1998) Combinatorial algorithms: Generation, Enumeration and Search:Florida: CRC Press LTC.
16. McKay BD, (1981) Practical Graph Isomorphism. CongressusNumerantium pp. 45-87.
17. Junker BH, Schreiber (2008) Analysis of Biological Networks: Wiley-Interscience. 368 p.