{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:25:47Z","timestamp":1725575147471},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343813"},{"type":"electronic","value":"9783540343820"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758525_98","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T15:03:32Z","timestamp":1147359812000},"page":"726-733","source":"Crossref","is-referenced-by-count":5,"title":["A Multilevel Approach to Identify Functional Modules in a Yeast Protein-Protein Interaction Network"],"prefix":"10.1007","author":[{"given":"S.","family":"Oliveira","sequence":"first","affiliation":[]},{"given":"S. C.","family":"Seok","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"12","key":"98_CR1","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1016\/S0167-8191(00)00043-0","volume":"26","author":"R. Diekmann","year":"2000","unstructured":"Diekmann, R., Monien, B., Preis, R.: Quality matching and local improvement for multilevel graph-partitioning. Parallel Comput.\u00a026(12), 1609\u20131634 (2000)","journal-title":"Parallel Comput."},{"volume-title":"Handbook of Graphs and Networks","year":"2003","key":"98_CR2","unstructured":"Bornholdt, S., Schuster, H.G. (eds.): Handbook of Graphs and Networks. Wiley VCH, Chichester (2003)"},{"key":"98_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/prot.20147","volume":"57","author":"R. Meraz","year":"2004","unstructured":"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\u00a057, 99\u2013108 (2004)","journal-title":"Proteins: Structure, Function, and Bioinformatics"},{"issue":"1","key":"98_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/prot.20147","volume":"57","author":"R.F. Meraz","year":"2004","unstructured":"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\u00a057(1), 99\u2013108 (2004)","journal-title":"Proteins: Structure, Function, and Bioinformatics"},{"issue":"5","key":"98_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1074\/mcp.M100037-MCP200","volume":"1","author":"I. Xenarios","year":"2002","unstructured":"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\u00a01(5), 349\u2013356 (2002)","journal-title":"Mol. Cell Proteomics"},{"key":"98_CR6","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/11560500_24"},{"key":"98_CR7","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear time heuristic for improving network partitions. In: 19th IEEE Design Automation Conference, pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"98_CR8","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: SODA, pp. 434\u2013443 (1990)"},{"key":"98_CR9","doi-asserted-by":"crossref","unstructured":"Hogue, C.W., Bader, G.D.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics\u00a04(1) (2003)","DOI":"10.1186\/1471-2105-4-2"},{"key":"98_CR10","unstructured":"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)"},{"key":"98_CR11","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1081870.1081948"},{"key":"98_CR12","unstructured":"Karypis, G., Kumar, V.: MeTis: Unstrctured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0 (1995)"},{"key":"98_CR13","unstructured":"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)"},{"key":"98_CR14","doi-asserted-by":"crossref","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal (1970)","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"98_CR15","first-page":"99","volume":"57","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: Properties of highly clustered networks. Physics Review\u00a057, 99\u2013108 (2003)","journal-title":"Physics Review"},{"key":"98_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/11428831_26","volume-title":"Computational Science \u2013 ICCS 2005","author":"S. Oliveira","year":"2005","unstructured":"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.\u00a03514, pp. 204\u2013211. Springer, Heidelberg (2005)"},{"issue":"1","key":"98_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01305952","volume":"14","author":"V. Vazirani","year":"1994","unstructured":"Vazirani, V.: A theory of alternating paths and blossoms for proving correctness of the (sqrt{E}) general graph maximum matching algorithm. Combinatorica\u00a014(1), 71\u2013109 (1994)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758525_98","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,4]],"date-time":"2024-02-04T09:56:11Z","timestamp":1707040571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758525_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343813","9783540343820"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11758525_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}