Jin Chen
ABSTRACT
Recent works in network analysis have revealed the existence of network motifs in biological networks such as the protein-protein interaction (PPI) networks. However, existing motif mining algorithms are not sufficiently scalable to find meso-scale network motifs. Also, there has been little or no work to systematically exploit the extracted network motifs for dissecting the vast interactomes.We describe an efficient network motif discovery algorithm, NeMoFinder, that can mine meso-scale network motifs that are repeated and unique in large PPI networks. Using NeMoFinder, we successfully discovered, for the first time, up to size-12 network motifs in a large whole-genome S. cerevisiae (Yeast) PPI network. We also show that such network motifs can be systematically exploited for indexing the reliability of PPI data that were generated via highly erroneous high-throughput experimental methods.
- I. Albert and R. Albert, Conserved network motifs allow protein-protein interaction prediction, Bioinformatics, Volume 20, Number 18, Pages 3346--3352, 2004]] Google Scholar
Digital Library
- J. Chen, W. Hsu, M. L. Lee, and S. K. Ng, Discovering and exploiting meso-scale network motifs in protein interactomes, National University of Singapore, TRC6/06, 2006]]Google Scholar
- M. B. Eisen, P. T. Spellman, P. O. Brown, and D. Botstein, Cluster analysis and display of genome-wide expression patterns, Proc. Natl Acad. Sci. USA, 1998, volume 95, pages 14863--14868]]Google ScholarCross Ref
- S. Fortin, The graph isomorphism problem, Technical Report TR96-20, Department of Computing Science, University of Alberta, 1996]]Google Scholar
- A. Grigoriev, A relationship between gene expression and protein interactions on the proteome scale, Nucleic Acids Res, Volume 29, Number 17, Pages 3513--3519, 2001]]Google Scholar
- J. Huan, W. Wang, and J. Prins, Efficient mining of frequent subgraph in the presence of isomorphism, ICDM, 2003, pages 549--552]] Google ScholarDigital Library
- J. Huan, W. Wang, J. Prins, and J. Yang, SPIN: Mining maximal frequent subgraphs from graph databases, SIGKDD, 2004]] Google ScholarDigital Library
- A. Inokuchi, T. Washio, and H. Motoda, An Apriori-based algorithm for mining frequent substructures from graph, PKDD, 2000, pages 13--23]] Google ScholarDigital Library
- N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon, Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs, Bioinformatics, 2004, volume 20, number 11, pages 1746--1758]] Google ScholarDigital Library
- M. Kuramochi and G. Karypis, An efficient algorithm for discovering frequent subgraphs, TKDE, 2001]]Google Scholar
- M. Kuramochi and G. Karypis, Finding Frequent Patterns in a Large Sparse Graph, In SIAM International Conference on Data Mining, 2004]]Google Scholar
- S. Maslov and K. Sneppen, Specificity and stability in topology of protein networks, Science, Volume 296, Number 5569, Pages 910--913, 2002]]Google Scholar
- C. V. Mering, R. Krause, B. Snel, et al, Comparative assessment of largescale data sets of protein-protein interactions, Nature, volume 417, pages 399--403, 2002]]Google Scholar
- H. W. Mewes, D. Frishman, U. Guldener, et al, MIPS: a database for genomes and protein sequences, Nucleic Acids Res, Volume 30, Number 1, Pages 31--34, 2002]]Google ScholarCross Ref
- R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, Network Motifs: Simple Building Blocks of Complex Networks, Science, volume 298, pages 824--827, 2002]]Google Scholar
- R. Saito, H. Suzuki, and Y. Hayashizaki, Interaction generality, a measurement to assess the reliability of a protein-protein interaction, Nucleic Acids Res, 2002, volume 30, pages 1163--1168]]Google ScholarCross Ref
- R. Saito, H. Suzuki, and Y. Hayashizaki, Construction of reliable protein-protein interaction networks with a new interaction generality measure, Bioinformatics, 2002, volume 19, pages 756--763]]Google Scholar
- F. Schreiber and H. Schwobbermeyer, Frequency Concepts and Pattern Detection for the Analysis of Motifs in Networks, Transactions on Computational Systems Biology, volume 3, pages 89--104, LNBI 3737, 2005]] Google ScholarDigital Library
- V. Spirin and L. A. Mirny, Protein complexes and functional modules in molecular networks, PNAS, 2003, volume 100, number 21, pages 12123--12128]]Google ScholarCross Ref
- Uetz, P., Giot, L., Cagney, G., et al, A comprehensive analysis of protein-protein interactions in Saccharomyces cerevisiae, Nature, Volume 403, Number 6770, Pages 623--627, 2000]]Google Scholar
- X. Yan and J. Han, gSpan: Graph-based substructure pattern mining, ICDM, 2002]] Google ScholarDigital Library
Index Terms
- NeMoFinder: dissecting genome-wide protein-protein interactions with meso-scale network motifs
Recommendations
A topology potential-based method for identifying essential proteins from PPI networks
Essential proteins are indispensable for cellular life. It is of great significance to identify essential proteins that can help us understand the minimal requirements for cellular life and is also very important for drug design. However, identification ...
A local average connectivity-based method for identifying essential proteins from the network level
Graphical abstractDisplay Omitted Highlights A protein's essentiality is determined by evaluating the relationship between it and its neighbors. The number of essential proteins predicted by LAC clearly exceeds that explored by Degree Centrality (DC). ...
Analyzing Online Transaction Networks with Network Motifs
KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data MiningNetwork motif is a kind of frequently occurring subgraph that reflects local topology in graphs. Although network motif has been studied in graph analytics, e.g., social network and biological network, it is yet unclear whether network motif is useful ...
Comments