{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T15:14:20Z","timestamp":1714317260424},"reference-count":23,"publisher":"Oxford University Press (OUP)","issue":"20","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":1504,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10,15]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Motivation: The availability of large-scale curated protein interaction datasets has given rise to the opportunity to investigate higher level organization and modularity within the protein\u2013protein interaction (PPI) network using graph theoretic analysis. Despite the recent progress, systems level analysis of high-throughput PPIs remains a daunting task because of the amount of data they present. In this article, we propose a novel PPI network decomposition algorithm called FACETS in order to make sense of the deluge of interaction data using Gene Ontology (GO) annotations. FACETS finds not just a single functional decomposition of the PPI network, but a multi-faceted atlas of functional decompositions that portray alternative perspectives of the functional landscape of the underlying PPI network. Each facet in the atlas represents a distinct interpretation of how the network can be functionally decomposed and organized. Our algorithm maximizes interpretative value of the atlas by optimizing inter-facet orthogonality and intra-facet cluster modularity.<\/jats:p><jats:p>Results: We tested our algorithm on the global networks from IntAct, and compared it with gold standard datasets from MIPS and KEGG. We demonstrated the performance of FACETS. We also performed a case study that illustrates the utility of our approach.<\/jats:p><jats:p>Contact: \u00a0seah0097@ntu.edu.sg or assourav@ntu.edu.sg<\/jats:p><jats:p>Supplementary information: \u00a0Supplementary data are available at the Bioinformatics online.<\/jats:p><jats:p>Availability: Our software is available freely for non-commercial purposes from: http:\/\/www.cais.ntu.edu.sg\/\u223cassourav\/Facets\/<\/jats:p>","DOI":"10.1093\/bioinformatics\/bts469","type":"journal-article","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T01:12:25Z","timestamp":1345511545000},"page":"2624-2631","source":"Crossref","is-referenced-by-count":2,"title":["FACETS: multi-faceted functional decomposition of protein interaction networks"],"prefix":"10.1093","volume":"28","author":[{"given":"Boon-Siew","family":"Seah","sequence":"first","affiliation":[{"name":"1 School of Computer Engineering, Nanyang Technological University, Singapore, 2Biological Engineering Department, Massachusetts Institute of Technology, Cambridge, MA 02139, USA and 3Singapore-MIT Alliance, Nanyang Technological University, Singapore"},{"name":"1 School of Computer Engineering, Nanyang Technological University, Singapore, 2Biological Engineering Department, Massachusetts Institute of Technology, Cambridge, MA 02139, USA and 3Singapore-MIT Alliance, Nanyang Technological University, Singapore"}]},{"given":"Sourav S.","family":"Bhowmick","sequence":"additional","affiliation":[{"name":"1 School of Computer Engineering, Nanyang Technological University, Singapore, 2Biological Engineering Department, Massachusetts Institute of Technology, Cambridge, MA 02139, USA and 3Singapore-MIT Alliance, Nanyang Technological University, Singapore"},{"name":"1 School of Computer Engineering, Nanyang Technological University, Singapore, 2Biological Engineering Department, Massachusetts Institute of Technology, Cambridge, MA 02139, USA and 3Singapore-MIT Alliance, Nanyang Technological University, Singapore"}]},{"suffix":"Jr","given":"C.","family":"Forbes Dewey","sequence":"additional","affiliation":[{"name":"1 School of Computer Engineering, Nanyang Technological University, Singapore, 2Biological Engineering Department, Massachusetts Institute of Technology, Cambridge, MA 02139, USA and 3Singapore-MIT Alliance, Nanyang Technological University, Singapore"},{"name":"1 School of Computer Engineering, Nanyang Technological University, Singapore, 2Biological Engineering Department, Massachusetts Institute of Technology, Cambridge, MA 02139, USA and 3Singapore-MIT Alliance, Nanyang Technological University, Singapore"}]}],"member":"286","published-online":{"date-parts":[[2012,8,20]]},"reference":[{"key":"2023012513151563000_bts469-B1","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1140\/epjb\/e2008-00425-1","article-title":"Modularity-maximizing graph communities via mathematical programming","volume":"66","author":"Agarwal","year":"2008","journal-title":"Eur. Phys. J. B."},{"key":"2023012513151563000_bts469-B2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1186\/1471-2105-4-2","article-title":"An automated method for finding molecular complexes in large protein interaction networks","volume":"4","author":"Bader","year":"2003","journal-title":"BMC Bioinformatics"},{"key":"2023012513151563000_bts469-B4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1038\/nature09204","article-title":"Network organization of the human autophagy system","volume":"466","author":"Behrends","year":"2010","journal-title":"Nature"},{"key":"2023012513151563000_bts469-B5","first-page":"6","article-title":"A stability based method for discovering structure in clustered data","author":"Ben-Hur","year":"2002","journal-title":"Pac. Symp. Biocomput"},{"key":"2023012513151563000_bts469-B6","doi-asserted-by":"crossref","first-page":"3710","DOI":"10.1093\/bioinformatics\/bth456","article-title":"GO:TermFinder\u2013open source software for accessing Gene Ontology information and finding significantly enriched Gene Ontology terms associated with a list of genes","volume":"20","author":"Boyle","year":"2004","journal-title":"Bioinformatics"},{"key":"2023012513151563000_bts469-B7","article-title":"Convergence properties of the k-means algorithms","author":"Bottou","year":"1994","journal-title":"Advances in Neural Information Processing Systems 7 (NIPS\u201994)"},{"key":"2023012513151563000_bts469-B8","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1186\/1471-2105-7-488","article-title":"Evaluation of clustering algorithms for protein\u2013protein interaction networks","volume":"7","author":"Broh\u00e9e","year":"2006","journal-title":"BMC Bioinformatics"},{"key":"2023012513151563000_bts469-B9","article-title":"Meta clustering","author":"Caruana","year":"2006","journal-title":"Proceedings of the Sixth IEEE International Conference on Data Mining"},{"key":"2023012513151563000_bts469-B11","doi-asserted-by":"crossref","DOI":"10.1109\/ICDM.2007.94","article-title":"Non-redundant multi-view clustering via orthogonalization","author":"Cui","year":"2007","journal-title":"Proceedings of the Seventh IEEE International Conference on Data Mining"},{"key":"2023012513151563000_bts469-B13","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1186\/gb-2006-7-11-120","article-title":"How complete are current yeast and human protein-interaction networks?","volume":"7","author":"Hart","year":"2006","journal-title":"Genome Biol"},{"issue":"3","key":"2023012513151563000_bts469-B15","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1109\/72.377977","article-title":"Approximating maximum clique with a Hopfield network","volume":"6","author":"Jagota","year":"1995","journal-title":"IEEE Trans. Neural Netw."},{"issue":"Database issue","key":"2023012513151563000_bts469-B16","doi-asserted-by":"crossref","first-page":"D561","DOI":"10.1093\/nar\/gkl958","article-title":"IntAct-open source resource for molecular interaction data","volume":"35","author":"Kerrien","year":"2007","journal-title":"Nucleic Acids Res."},{"issue":"7084","key":"2023012513151563000_bts469-B18","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1038\/nature04670","article-title":"Global landscape of protein complexes in the yeast Saccharomyces cerevisiae","volume":"440","author":"Krogan","year":"2006","journal-title":"Nature"},{"key":"2023012513151563000_bts469-B19","article-title":"Detection of locally over-represented GO terms in protein\u2013protein interaction networks","author":"Lavall\u00e9e-Adam","year":"2009","journal-title":"Proceedings of the Thirteenth Annual International Conference on Research in Computational Molecular Biology"},{"issue":"4","key":"2023012513151563000_bts469-B20","doi-asserted-by":"crossref","first-page":"046101","DOI":"10.1103\/PhysRevE.71.046101","article-title":"Identifying communities within energy landscapes","volume":"71","author":"Massen","year":"2005","journal-title":"Phys. Rev. E"},{"issue":"1","key":"2023012513151563000_bts469-B21","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1093\/nar\/30.1.31","article-title":"MIPS: a database for genomes and protein sequences","volume":"30","author":"Mewes","year":"2002","journal-title":"Nucleic Acids Res."},{"key":"2023012513151563000_bts469-B22","first-page":"166","article-title":"Exploring biological network dynamics with ensembles of graph partitions","author":"Navlakha","year":"2010","journal-title":"Pac. Symp. Biocomput"},{"key":"2023012513151563000_bts469-B23","first-page":"831","article-title":"Multiple non-redundant spectral clustering views","author":"Niu","year":"2010","journal-title":"27th International Conference on Machine Learning (ICML 2010)"},{"key":"2023012513151563000_bts469-B24","article-title":"An overview of the Scala programming language","author":"Odersky","year":"2004","journal-title":"EPFL Technical Report IC\/2004\/64"},{"key":"2023012513151563000_bts469-B25","doi-asserted-by":"crossref","DOI":"10.1145\/1557019.1557099","article-title":"A principled and flexible framework for finding alternative clusterings","author":"Qi","year":"2009","journal-title":"Proceeding of the Fifteenth ACM SIGKDD International Conference on Knowledge Discovery in Data Mining"},{"key":"2023012513151563000_bts469-B26","doi-asserted-by":"crossref","first-page":"S61","DOI":"10.1186\/1471-2105-11-S1-S61","article-title":"Network module identification in Cytoscape","volume":"11","author":"Rivera","year":"2010","journal-title":"BMC Bioinformatics"},{"key":"2023012513151563000_bts469-B27","doi-asserted-by":"crossref","first-page":"S10","DOI":"10.1186\/1471-2105-13-S3-S10","article-title":"FUSE: towards multi-level functional summarization of protein interaction networks","volume":"13","author":"Seah","year":"2012","journal-title":"BMC Bioinformatics"},{"key":"2023012513151563000_bts469-B28","article-title":"Clustering with instance-level constraints","author":"Wagstaff","year":"2000","journal-title":"Proceedings of the Seventeenth International Conference on Machine Learning"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/28\/20\/2624\/48877522\/bioinformatics_28_20_2624.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/28\/20\/2624\/48877522\/bioinformatics_28_20_2624.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T14:50:41Z","timestamp":1714315841000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/28\/20\/2624\/200634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,20]]},"references-count":23,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2012,10,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bts469","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2012,10,15]]},"published":{"date-parts":[[2012,8,20]]}}}