{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:39:22Z","timestamp":1743154762029,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319581620"},{"type":"electronic","value":"9783319581637"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58163-7_9","type":"book-chapter","created":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T06:59:25Z","timestamp":1493017165000},"page":"127-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Clustering the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model"],"prefix":"10.1007","author":[{"given":"Alex","family":"Ozdemir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Sheely","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Bork","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricson","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reyna","family":"Hulett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jincheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Libeskind-Hadas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,25]]},"reference":[{"issue":"12","key":"9_CR1","doi-asserted-by":"publisher","first-page":"i283","DOI":"10.1093\/bioinformatics\/bts225","volume":"28","author":"MS Bansal","year":"2012","unstructured":"Bansal, M.S., Alm, E.J., Kellis, M.: Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinformatics 28(12), i283\u2013i291 (2012)","journal-title":"Bioinformatics"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-37195-0_1","volume-title":"Research in Computational Molecular Biology","author":"MS Bansal","year":"2013","unstructured":"Bansal, M.S., Alm, E.J., Kellis, M.: Reconciliation revisited: handling multiple optima when reconciling with duplication, transfer, and loss. In: Deng, M., Jiang, R., Sun, F., Zhang, X. (eds.) RECOMB 2013. LNCS, vol. 7821, pp. 1\u201313. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-37195-0_1"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jbi.2005.08.006","volume":"39","author":"MA Charleston","year":"2006","unstructured":"Charleston, M.A., Perkins, S.L.: Traversing the tangle: algorithms and applications for cophylogenetic studies. J. Biomed. Inform. 39(1), 62\u201371 (2006)","journal-title":"J. Biomed. Inform."},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/1748-7188-5-16","volume":"5","author":"C Conow","year":"2010","unstructured":"Conow, C., Fielder, D., Ovadia, Y., Libeskind-Hadas, R.: Jane: a new tool for cophylogeny reconstruction problem. Algorithms Mol. Biol. 5(1), 16 (2010)","journal-title":"Algorithms Mol. Biol."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1038\/nature09649","volume":"469","author":"LA David","year":"2011","unstructured":"David, L.A., Alm, E.J.: Rapid evolutionary innovation during an Archaean genetic expansion. Nature 469, 93\u201396 (2011)","journal-title":"Nature"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-642-16181-0_9","volume":"6398","author":"JP Doyon","year":"2011","unstructured":"Doyon, J.P., Scornavacca, C., Gorbunov, K.Y., Sz\u00f6ll\u0151si, G.J., Ranwez, V., Berry, V.: An efficient algorithm for gene\/species trees parsimonious reconciliation with losses, duplications and transfers. Comp. Genomics 6398, 93\u2013108 (2011)","journal-title":"Comp. Genomics"},{"key":"9_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T Gonz\u00e1lez","year":"1985","unstructured":"Gonz\u00e1lez, T.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Ma, W., Smirnov, D., Forman, J., Schweickart, A., Slocum, C., Srinivasan, S., Libeskind-Hadas, R.: DTL-RnB: Algorithms and tools for summarizing the space of DTL reconciliations. IEEE\/ACM Trans. Comput. Biol. Bioinform. (2016). doi:10.1109\/TCBB.2016.2537319","DOI":"10.1109\/TCBB.2016.2537319"},{"issue":"10","key":"9_CR10","doi-asserted-by":"publisher","first-page":"e73667","DOI":"10.1371\/journal.pone.0073667","volume":"8","author":"TH Nguyen","year":"2013","unstructured":"Nguyen, T.H., Ranwez, V., Berry, V., Scornavacca, C.: Support measures to estimate the reliability of evolutionary events predicted by reconciliation methods. PLoS ONE 8(10), e73667 (2013)","journal-title":"PLoS ONE"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","volume":"36","author":"HS Park","year":"2009","unstructured":"Park, H.S., Jun, C.H.: A simple and fast algorithm for k-medoids clustering. Expert Syst. Appl. 36(2), 3336\u20133341 (2009)","journal-title":"Expert Syst. Appl."},{"issue":"02","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1250025","DOI":"10.1142\/S0219720012500254","volume":"11","author":"C Scornavacca","year":"2013","unstructured":"Scornavacca, C., Paprotny, W., Berry, V., Ranwez, V.: Representing a set of reconciliations in a compact way. J. Bioinform. Comput. Biol. 11(02), 1250025 (2013). pMID: 23600816","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1089\/cmb.2007.A010","volume":"14","author":"C Than","year":"2007","unstructured":"Than, C., Ruths, D., Innan, H., Nakhleh, L.: Confounding factors in HGT detection: statistical error, coalescent effects, and multiple solutions. J. Comput. Biol. 14(4), 517\u2013535 (2007)","journal-title":"J. Comput. Biol."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1186\/s12859-015-0803-x","volume":"16","author":"TH To","year":"2015","unstructured":"To, T.H., Jacox, E., Ranwez, V., Scornavacca, C.: A fast method for calculating reliable event supports in tree reconciliations via pareto optimality. BMC Bioinform. 16, 384 (2015)","journal-title":"BMC Bioinform."},{"key":"9_CR15","unstructured":"Tofigh, A.: Using trees to capture reticulate evolution: lateral gene transfers and cancer progression. Ph.D. thesis, KTH Royal Institute of Technology (2009)"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/TCBB.2010.14","volume":"8","author":"A Tofigh","year":"2011","unstructured":"Tofigh, A., Hallett, M.T., Lagergren, J.: Simultaneous identification of duplications and lateral gene transfers. IEEE\/ACM Trans. Comput. Biol. Bioinform. 8(2), 517\u2013535 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58163-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T14:17:19Z","timestamp":1710166639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58163-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319581620","9783319581637"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58163-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"25 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AlCoB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms for Computational Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aveiro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"alcob2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/grammars.grlmc.com\/AlCoB2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}