{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:26:00Z","timestamp":1764174360910},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"S3","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Syst Biol"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1186\/s12918-017-0405-5","type":"journal-article","created":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T05:53:47Z","timestamp":1489470827000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Finding low-conductance sets with dense interactions (FLCD) for better protein complex prediction"],"prefix":"10.1186","volume":"11","author":[{"given":"Yijie","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xiaoning","family":"Qian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,14]]},"reference":[{"key":"405_CR1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"GD Bader","year":"2003","unstructured":"Bader GD, Hogue CW. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics. 2003; 4:2.","journal-title":"BMC Bioinformatics"},{"key":"405_CR2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1093\/nar\/gkh086","volume":"32","author":"L Salwinski","year":"2004","unstructured":"Salwinski L, Miller CS, Smith AJ, Pettit FK, Bowie JU, Eisenberg D. The Database of Interacting Proteins: 2004 update. Nucleic Acids Res. 2004; 32:449\u201351.","journal-title":"Nucleic Acids Res"},{"key":"405_CR3","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1093\/nar\/gkj109","volume":"34","author":"C Stark","year":"2006","unstructured":"Stark C, Breitkreutz BJ, Reguly T, Boucher L, Breitkreutz A, Tyers M. BioGRID: A general repository for interaction datasets. Nucleic Acids Res. 2006; 34:535\u20139.","journal-title":"Nucleic Acids Res"},{"issue":"D1","key":"405_CR4","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1093\/nar\/gkr1088","volume":"40","author":"S Kerrien","year":"2012","unstructured":"Kerrien S, Aranda B, Breuza L, et al. The IntAct molecular interaction database in 2012. Nucleic Acids Res. 2012; 40(D1):841\u20136.","journal-title":"Nucleic Acids Res"},{"key":"405_CR5","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1093\/nar\/gkr930","volume":"40","author":"L Licata","year":"2012","unstructured":"Licata L, Briganti L, Peluso D, et al. MINT, the molecular interaction database: 2012 update. Nucleic Acids Res. 2012; 40:857\u201361.","journal-title":"Nucleic Acids Res"},{"key":"405_CR6","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1038\/nmeth.1938","volume":"9","author":"T Nepusz","year":"2012","unstructured":"Nepusz T, Yu H, Paccanaro A. Detecting overlapping protein complexes in protein-protein interaction networks. Nat Methods. 2012; 9:471\u20132.","journal-title":"Nat Methods"},{"key":"405_CR7","unstructured":"van Dongen S. A cluster algorithm for graphs. 2000. Technical Report INS-R0010, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam."},{"key":"405_CR8","doi-asserted-by":"crossref","unstructured":"Satuluri V, Parthasarathy S. Scalable Graph Clustering Using Stochastic Flows: Applications to Community Discovery. In: 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201909). Paris: 2009. p. 737\u201346.","DOI":"10.1145\/1557019.1557101"},{"issue":"18","key":"405_CR9","first-page":"1473","volume":"28","author":"YK Shih","year":"2012","unstructured":"Shih YK, Parthasarathy S. Identifying functional modules in interaction networks through overlapping Markov clustering. Bioinformatics. 2012; 28(18):1473\u20139.","journal-title":"Bioinformatics"},{"key":"405_CR10","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I, Vicsek T. Uncovering the overlapping community structure of complex networks in nature and society. Nature. 2005; 435:814\u20138.","journal-title":"Nature"},{"key":"405_CR11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1186\/1471-2105-10-283","volume":"10","author":"K Macropol","year":"2009","unstructured":"Macropol K, Can T, Singh AK. RRW: Repeated random walks on genome-scale protein networks for local cluster discovery. BMC Bioinformatics. 2009; 10:283.","journal-title":"BMC Bioinformatics"},{"key":"405_CR12","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"YY Ahn","year":"2010","unstructured":"Ahn YY, Bagrow JP, Lehmann S. Link communities reveal multiscale complexity in networks. Nature. 2010; 466:761\u20134.","journal-title":"Nature"},{"key":"405_CR13","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1038\/nature04532","volume":"440","author":"AC Gavin","year":"2006","unstructured":"Gavin AC, Aloy P, Grandi P, et al. Proteome survey reveals modularity of the yeast cell machinery. Nature. 2006; 440:631\u20136.","journal-title":"Nature"},{"issue":"1","key":"405_CR14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1093\/bioinformatics\/btt569","volume":"30","author":"Y Wang","year":"2014","unstructured":"Wang Y, Qian X. Functional module identification in protein interaction networks by interaction patterns. Bioinformatics. 2014; 30(1):81\u201393.","journal-title":"Bioinformatics"},{"key":"405_CR15","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ. Modularity and community structure in networks. Proc Nat Acad Sci USA. 2006; 103:8577\u201382.","journal-title":"Proc Nat Acad Sci USA"},{"issue":"1","key":"405_CR16","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato S, Barth\u00e9lemy M. Resolution limit in community detection. Proc Nat Acad Sci USA. 2007; 104(1):36\u201341.","journal-title":"Proc Nat Acad Sci USA"},{"key":"405_CR17","doi-asserted-by":"crossref","unstructured":"Andersen R, Chung F, Lang K. Local Graph Partitioning Using PageRank Vectors. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906). Berkeley: 2006. p. 475\u201386.","DOI":"10.1109\/FOCS.2006.44"},{"issue":"1","key":"405_CR18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"DG Corneil","year":"1984","unstructured":"Corneil DG, Perl Y. Clustering and domination in perfect graphs. Discrete Appl Math. 1984; 9(1):27\u201339.","journal-title":"Discrete Appl Math"},{"issue":"1","key":"405_CR19","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1038\/75556","volume":"25","author":"M Ashburner","year":"2000","unstructured":"Ashburner M, Ball CA, Blake JA, et al. Gene ontology: Tool for the unification of biology. The Gene Ontology Consortium. Nat Genet. 2000; 25(1):25\u20139.","journal-title":"Nat Genet"},{"key":"405_CR20","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1093\/nar\/gkm909","volume":"36","author":"EL Hong","year":"2008","unstructured":"Hong EL, et al. Gene ontology annotations at SGD: New data sources and annotation methods. Nucleic Acids Res. 2008; 36:577\u201381.","journal-title":"Nucleic Acids Res"},{"issue":"Database issue","key":"405_CR21","doi-asserted-by":"crossref","first-page":"D41","DOI":"10.1093\/nar\/gkh092","volume":"32","author":"HW Mewes","year":"2004","unstructured":"Mewes HW, et al. MIPS: Analysis and annotation of proteins from whole genomes. Nucliec Acids Res. 2004; 32(Database issue):D41\u201344.","journal-title":"Nucliec Acids Res"},{"issue":"suppl 1","key":"405_CR22","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1186\/1752-0509-8-S1-S9","volume":"8","author":"Y Wang","year":"2014","unstructured":"Wang Y, Qian X. Joint clustering of protein interaction networks through Markov random walk. BMC Syst Biol. 2014; 8(suppl 1):9.","journal-title":"BMC Syst Biol"},{"issue":"Suppl 3","key":"405_CR23","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1186\/1471-2105-13-S3-S11","volume":"13","author":"Y Shih","year":"2012","unstructured":"Shih Y, Parthasarathy S. Scalable global alignment for multiple biological networks. BMC Bioinformatics. 2012; 13(Suppl 3):11.","journal-title":"BMC Bioinformatics"},{"issue":"2","key":"405_CR24","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s10878-010-9351-5","volume":"23","author":"N Fan","year":"2010","unstructured":"Fan N, Pardalos P. Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs. J Combinatorial Optimization. 2010; 23(2):224\u201351.","journal-title":"J Combinatorial Optimization"},{"key":"405_CR25","unstructured":"Gurobi Optimization Inc.Gurobi Optimizer Reference Manual. 2016. http:\/\/www.gurobi.com ."}],"container-title":["BMC Systems Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12918-017-0405-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T08:34:47Z","timestamp":1498379687000},"score":1,"resource":{"primary":{"URL":"http:\/\/bmcsystbiol.biomedcentral.com\/articles\/10.1186\/s12918-017-0405-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":25,"journal-issue":{"issue":"S3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["405"],"URL":"https:\/\/doi.org\/10.1186\/s12918-017-0405-5","relation":{},"ISSN":["1752-0509"],"issn-type":[{"value":"1752-0509","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3]]},"article-number":"22"}}