Skip to main content

Finding Functional Modules

  • Chapter
  • First Online:
Systems Biology for Signaling Networks

Part of the book series: Systems Biology ((SYSTBIOL))

Abstract

Biological systems can be modeled as complex network systems with many interactions between the components. These interactions give rise to the function and behavior of that system. For example, the protein–protein interaction (PPI) network is the physical basis of multiple cellular functions. One goal of emerging systems biology is to analyze very large complex biological networks such as protein–protein interaction networks, metabolic networks, and regulatory networks to identify functional modules and assign functions to certain components of the system. Network modules do not occur by chance, so identification of modules is likely to capture the biologically meaningful interactions in large-scale PPI data. Unfortunately, existing computer-based clustering methods developed to find those modules are either not so accurate or are too slow. We devised a new methodology called SCAN (Structural Clustering Algorithm for Networks) that can efficiently find clusters or functional modules in complex biological networks as well as hubs and outliers. More specifically, we demonstrated that we can find functional modules in complex networks and classify nodes into various roles based on their structures. In this chapter, we show the effectiveness of our methodology using the budding yeast (Saccharomyces cerevisiae) PPI network. To validate our clustering results, we compared our clusters with the known functions of each protein. Our predicted functional modules achieved very high purity comparing with state-of-the-art approaches. Additionally the theoretical and empirical analysis demonstrated a linear running time of the algorithm, which is the fastest approach for networks. We compare our algorithm with well-known modularity-based clustering algorithm CNM. We successfully detect functional groups that are annotated with putative Gene Ontology (GO) terms. Top-10 clusters with minimum p-value theoretically prove that newly proposed algorithm partitions network more accurately then CNM. Furthermore, manual interpretations of functional groups found by SCAN show superior performance over CNM.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Arnau V, Mars S, Marin I (2005) Iterative cluster analysis of protein interaction data. Bioinformatics 21:3;364–378

    Article  CAS  PubMed  Google Scholar 

  • Barabási AL, Oltvai ZN (2004) Network Biology: Understanding The Cell’s Functional Organization. Nat Rev Genet 5:101–113

    Article  PubMed  Google Scholar 

  • Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70:066111–066117.

    Article  Google Scholar 

  • Ding C, He X, H. Zha et al (2001) A min-max cut algorithm for graph partitioning and data clustering, In: Proceedings of IEEE International Conference on Data Mining, San Jose

    Google Scholar 

  • Erdös P, RĂ©nyi A (1959) On Random Graphs I. Publicationes Mathematicae 6:290–297

    Google Scholar 

  • Ester M, Kriegel H-P, Sander J et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of ACM International Conference on Knowledge Discovery and Data Mining, Portland, 2006

    Google Scholar 

  • Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. In: Proceedings of Special Interest Group on Data Communication, Massachusetts

    Google Scholar 

  • Giot L, Bader JS, C. Brouwer C et al (2003) A protein interaction map of drosophila melanogaster. Science 302:1727–1736

    Article  CAS  PubMed  Google Scholar 

  • Guimera R, Amaral LAN (2005) Functional cartography of complex metabolic networks. Nature 433:895–900

    Article  CAS  PubMed Central  PubMed  Google Scholar 

  • Ito T, Chiba T, Ozawa R et al (2001) A comprehensive two-hybrid analysis to explore the yeast protein interactome. Proc Natl Acad Sci 98:4569–4574

    Article  CAS  PubMed  Google Scholar 

  • Jeong H, Tombor B, Albert R et al (2000) The large-scale organization of metabolic networks. Nature 407:651–654

    Article  CAS  PubMed  Google Scholar 

  • King AD, Przulj N, Jurisica I (2004) Protein complex prediction via cost based clustering. Bioinformatics 20:17 3013–3020

    Article  CAS  PubMed  Google Scholar 

  • Li S, Armstrong CM, Bertin N, Ge H, Milstein S et al (2004) A map of the interactome network of the metazoan C. elegans. Science 303:540–543

    Article  CAS  PubMed Central  PubMed  Google Scholar 

  • Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113–026128

    Article  CAS  Google Scholar 

  • Przulj N, Wigle D, Jurisica I (2004) Functional topology in a network of protein interactions. Bioinformatics 20:3;340–348

    Article  CAS  PubMed  Google Scholar 

  • Saccharomyces Genome Database (2009) Leland Stanford Junior University, Accessed on July 15, 2008. http://www.yeastgenome.org/

  • Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22:888–905

    Article  Google Scholar 

  • Strogatz SH (2001) Exploring complex networks. Nature 410 268–276

    Article  CAS  PubMed  Google Scholar 

  • Ucar D, Asur S, Catalyurek U et al (2006) Improving functional modularity in protein-protein interactions graphs using hub-induced subgraphs. In: Proceedings of Practice of Knowledge Discovery in Databases, Berlin

    Google Scholar 

  • Uetz P, Giot L, Cagney G, Mansfield TA et al (2000) A comprehensive analysis of protein-protein interactions in Saccharomyces cerevisiae. Nature 403:623–627

    Article  CAS  PubMed  Google Scholar 

  • Wagner A, Fell DA (2001) The small world inside large metabolic networks. In: Proceedings of Royal Society, London

    Google Scholar 

  • Watts DJ, Strogatz SH (1998) Collective dynamics of small-world networks. Nature 393:440–442

    Article  CAS  PubMed  Google Scholar 

  • Wu LF, Hughes TR, Davierwala AP et al (2002) Large-scale prediction of saccharomyces cerevisiae gene function using overlapping transcriptional clusters. Nat Genet 31:255–265

    Article  CAS  PubMed  Google Scholar 

  • Xu X, Yuruk N, Feng Z et al (2007) SCAN: a structural clustering algorithm for networks. In: Proceedings of ACM International Conference on Knowledge Discovery and Data Mining, San Jose

    Google Scholar 

  • Yook SY, Oltvai ZN, Barabási AL (2004) Functional and topological characterization of protein interaction networks. Proteomics 4:928–942

    Article  CAS  PubMed  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mutlu Mete .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Mete, M., Tang, F., Xu, X., Yuruk, N. (2010). Finding Functional Modules. In: Choi, S. (eds) Systems Biology for Signaling Networks. Systems Biology. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-5797-9_10

Download citation

Publish with us

Policies and ethics