Abstract
Identifying functional modules is believed to reveal most cellular processes. There have been many computational approaches to investigate the underlying biological structures [9, 4, 10, 6]. A spectral clustering method plays a critical role identifying functional modules in a yeast protein-protein network in [6, 4]. We present an unweighted-graph version of a multilevel spectral algorithm which more accurately identifies protein complexes with less computational time.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Diekmann, R., Monien, B., Preis, R.: Quality matching and local improvement for multilevel graph-partitioning. Parallel Comput. 26(12), 1609–1634 (2000)
Bornholdt, S., Schuster, H.G. (eds.): Handbook of Graphs and Networks. Wiley VCH, Chichester (2003)
Meraz, R., Holbrook, S., Ding, C., He, X.: A unified representation for multi-protein complex data for modeling protein interaction networks. Proteins: Structure, Function, and Bioinformatics 57, 99–108 (2004)
Meraz, R.F., Holbrook, S.R., Ding, C., He, X.: A unified representation of multiprotein complex data for modeling interaction networks. Proteins: Structure, Function, and Bioinformatics 57(1), 99–108 (2004)
Xenarios, I., Eisenberg, D., Deane, C.M., Salwinski, L.: Protein interactions: two methods for assessment of the reliability of high throughput observations. Mol. Cell Proteomics 1(5), 349–356 (2002)
Pothen, A., Ramadan, E., Osgood, C.: The architecture of a proteomic network in the yeast. In: International Workshop on Distributed Data Mining in Life Science (LifeDDM 2005) (2005)
Fiduccia, C.M., Mattheyses, R.M.: A linear time heuristic for improving network partitions. In: 19th IEEE Design Automation Conference, pp. 175–181 (1982)
Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: SODA, pp. 434–443 (1990)
Hogue, C.W., Bader, G.D.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4(1) (2003)
Ding, C., Zhang, Y., Kumar, V., Holbrook, S., Xiong, H., He, X.: Identification of functional modules in protein complexes via hyperclique pattern discovery. In: Pacific Symposium on Biocomputing (PSB 2005) (2005)
Kulis, B., Dhillon, I., Guan, Y.: A fast kernel-based multilevel algorithm for graph clustering. In: The eleventh ACM SIGKDD international conference on Knowledge discovery in data mining (2005)
Karypis, G., Kumar, V.: MeTis: Unstrctured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0 (1995)
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report 95-035, Department of Computer Science, University of Minnesota, Minneapolis, MN (1998)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal (1970)
Newman, M.E.J.: Properties of highly clustered networks. Physics Review 57, 99–108 (2003)
Oliveira, S., Seok, S.C.: A multi-level approach for document clustering. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol. 3514, pp. 204–211. Springer, Heidelberg (2005)
Vazirani, V.: A theory of alternating paths and blossoms for proving correctness of the (sqrt{E}) general graph maximum matching algorithm. Combinatorica 14(1), 71–109 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oliveira, S., Seok, S.C. (2006). A Multilevel Approach to Identify Functional Modules in a Yeast Protein-Protein Interaction Network. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758525_98
Download citation
DOI: https://doi.org/10.1007/11758525_98
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34381-3
Online ISBN: 978-3-540-34382-0
eBook Packages: Computer ScienceComputer Science (R0)