{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:29:18Z","timestamp":1649143758441},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":1635,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1016\/j.jda.2008.11.003","type":"journal-article","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T15:12:10Z","timestamp":1228835530000},"page":"90-101","source":"Crossref","is-referenced-by-count":2,"title":["Finding occurrences of protein complexes in protein\u2013protein interaction graphs"],"prefix":"10.1016","volume":"7","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.jda.2008.11.003_bib001","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/net.3230110108","article-title":"Covering and packing in graphs IV: Linear arboricity","volume":"11","author":"Akiyama","year":"1981","journal-title":"Networks"},{"key":"10.1016\/j.jda.2008.11.003_bib002","series-title":"Proc. 13th Annual Symposium on Combinatorial Pattern Matching (CPM)","first-page":"99","article-title":"Towards optimally solving the longest common subsequence problem for sequences with nested arc annotations in linear time","volume":"vol. 2373","author":"Alber","year":"2002"},{"issue":"3","key":"10.1016\/j.jda.2008.11.003_bib003","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02783300","article-title":"The linear arboricity of graphs","volume":"62","author":"Alon","year":"1988","journal-title":"Israel Journal of Mathematics"},{"key":"10.1016\/j.jda.2008.11.003_bib004","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/j.jda.2008.11.003_bib005","series-title":"Proc. 26th International Colloquium on Automata, Languages and Programming (ICALP)","first-page":"200","article-title":"On some tighter inapproximability results","volume":"vol. 1644","author":"Berman","year":"1999"},{"key":"10.1016\/j.jda.2008.11.003_bib006","first-page":"49","article-title":"Parameterized complexity analysis in computational biology","volume":"11","author":"Bodlaender","year":"1995","journal-title":"Computer Applications in the Biosciences"},{"key":"10.1016\/j.jda.2008.11.003_bib007","series-title":"Proc. 16th Fundamentals of Computation Theory, 16th International Symposium (FCT)","first-page":"137","article-title":"Pattern matching in protein\u2013protein interaction graphs","author":"Brevier","year":"2007"},{"key":"10.1016\/j.jda.2008.11.003_bib008","series-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/j.jda.2008.11.003_bib009","series-title":"Infinite and Finite Sets, Colloq., dedicated to P. Erd\u00f6s on his 60th birthday","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs and some related questions","volume":"vol. 2","author":"Erd\u00f6s","year":"1975"},{"issue":"2","key":"10.1016\/j.jda.2008.11.003_bib010","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.jda.2007.06.002","article-title":"Bounded list injective homomorphism for comparative analysis of protein\u2013protein interaction graphs","volume":"6","author":"Fagnot","year":"2008","journal-title":"Journal of Discrete Algorithms"},{"key":"10.1016\/j.jda.2008.11.003_bib011","series-title":"Proc. 30th International Symposium on Mathematical Foundations of Computer Science (MFCS)","first-page":"328","article-title":"Finding exact and maximum occurrences of protein complexes in protein\u2013protein interaction graphs","volume":"vol. 3618","author":"Fertin","year":"2005"},{"key":"10.1016\/j.jda.2008.11.003_bib012","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"6868","key":"10.1016\/j.jda.2008.11.003_bib013","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1038\/415141a","article-title":"Functional organization of the yeast proteome by systematic analysis of protein complexes","volume":"414","author":"Gavin","year":"2002","journal-title":"Nature"},{"issue":"1","key":"10.1016\/j.jda.2008.11.003_bib014","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/1125994.1125997","article-title":"Pattern matching for arc-annotated sequences","volume":"2","author":"Gramm","year":"2006","journal-title":"ACM Transactions on Algorithms"},{"issue":"6868","key":"10.1016\/j.jda.2008.11.003_bib015","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1038\/415180a","article-title":"Systematic identification of protein complexes in Saccharomyces cerevisae by mass spectrometry","volume":"415","author":"Ho","year":"2002","journal-title":"Nature"},{"key":"10.1016\/j.jda.2008.11.003_bib016","series-title":"Proc. 12th Annual International Conference on Computational Molecular Biology (RECOMB)","article-title":"Fast and accurate alignment of multiple protein networks","author":"Kalaev","year":"2008"},{"issue":"20","key":"10.1016\/j.jda.2008.11.003_bib017","doi-asserted-by":"crossref","first-page":"11394","DOI":"10.1073\/pnas.1534710100","article-title":"Conserved pathways within bacteria and yeast as revealed by global protein network alignment","volume":"100","author":"Kelley","year":"2003","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"10.1016\/j.jda.2008.11.003_bib018","series-title":"Proc. 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB)","first-page":"48","article-title":"Pairwise local alignment of protein interaction networks guided by models of evolution","volume":"vol. 3500","author":"Koyut\u00fcrk","year":"2005"},{"key":"10.1016\/j.jda.2008.11.003_bib019","series-title":"Proc. 21st Annual Symposium on Foundation of Computer Science (FOCS)","first-page":"17","article-title":"An O(|V||E|) algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/j.jda.2008.11.003_bib020","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"Journal of Computer and System Sciences"},{"issue":"8","key":"10.1016\/j.jda.2008.11.003_bib021","doi-asserted-by":"crossref","first-page":"4285","DOI":"10.1073\/pnas.96.8.4285","article-title":"Assigning protein functions by comparative genome analysis: Protein phylogenetic profiles","volume":"96","author":"Pellegrini","year":"1999","journal-title":"PNAS"},{"issue":"1","key":"10.1016\/j.jda.2008.11.003_bib022","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/prot.10505","article-title":"Detection of functional modules from protein interaction networks","volume":"54","author":"Pereira-Leal","year":"2004","journal-title":"Proteins"},{"key":"10.1016\/j.jda.2008.11.003_bib023","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1089\/cmb.2006.13.133","article-title":"Efficient algorithms for detecting signaling pathways in protein interaction networks","volume":"13","author":"Scott","year":"2006","journal-title":"Journal of Computational Biology"},{"key":"10.1016\/j.jda.2008.11.003_bib024","series-title":"Proc. 8th Annual International Conference on Computational Molecular Biology (RECOMB)","first-page":"282","article-title":"Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data","author":"Sharan","year":"2004"},{"issue":"6","key":"10.1016\/j.jda.2008.11.003_bib025","doi-asserted-by":"crossref","first-page":"1974","DOI":"10.1073\/pnas.0409522102","article-title":"Conserved patterns of protein interaction in multiple species","volume":"102","author":"Sharan","year":"2005","journal-title":"Proceedings of the National Academy of Sciences USA"},{"issue":"1","key":"10.1016\/j.jda.2008.11.003_bib026","first-page":"111","article-title":"What do we learn from high-throughput protein interaction data?","volume":"1","author":"Titz","year":"2004","journal-title":"Expert Review of Anticancer Therapy"},{"issue":"6770","key":"10.1016\/j.jda.2008.11.003_bib027","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1038\/35001009","article-title":"A comprehensive analysis of protein\u2013protein interactions in Saccharomyces cerevisae","volume":"403","author":"Uetz","year":"2000","journal-title":"Nature"},{"issue":"1","key":"10.1016\/j.jda.2008.11.003_bib028","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1089\/cmb.2006.0076","article-title":"Path matching and graph matching in biological networks","volume":"14","author":"Yang","year":"2007","journal-title":"Journal of Computational Biology"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1570866708000981?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1570866708000981?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,23]],"date-time":"2018-12-23T19:54:23Z","timestamp":1545594863000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866708000981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["S1570866708000981"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jda.2008.11.003","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}