{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:47:52Z","timestamp":1725853672725},"publisher-location":"New York, NY","reference-count":29,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","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":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_599","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:09:45Z","timestamp":1553098185000},"page":"183-189","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Beyond Evolutionary Trees"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Dondi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Pirola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"12","key":"781_CR251","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1093\/bioinformatics\/bts225","volume":"28","author":"MS Bansal","year":"2012","unstructured":"Bansal MS, Alm EJ, Kellis M (2012) Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinformatics 28(12):283\u2013291. doi:10.1093\/bioinformatics\/ bts225","journal-title":"Bioinformatics"},{"issue":"1\u20132","key":"781_CR252","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2005.05.016","volume":"347","author":"P Bonizzoni","year":"2005","unstructured":"Bonizzoni P, Della Vedova G, Dondi R (2005) Reconciling a gene tree to a species tree under the duplication cost model. Theor Comput Sci 347(1\u20132):36\u201353. doi:10.1016\/j.tcs.2005.05.016","journal-title":"Theor Comput Sci"},{"key":"781_CR253","doi-asserted-by":"crossref","unstructured":"Burleigh JG, Bansal MS, Wehe A, Eulenstein O (2008) Locating multiple gene duplications through reconciled trees. In: Proceedings of the 12th annual international conference on research in computational molecular biology, RECOMB 2008, Singapore. LNCS, vol\u00a04955. Springer, pp\u00a0273\u2013284. doi:10.1007\/978-3-540-78839-3_24","DOI":"10.1007\/978-3-540-78839-3_24"},{"key":"781_CR254","doi-asserted-by":"crossref","unstructured":"Chang WC, Eulenstein O (2006) Reconciling gene trees with apparent polytomies. In: Proceedings of the 12th annual international conference on computing and combinatorics, COCOON 2006, Taipei. LNCS, vol\u00a04112. Springer, pp\u00a0235\u2013244. doi:10.1007\/11809678_26","DOI":"10.1007\/11809678_26"},{"key":"781_CR255","doi-asserted-by":"crossref","unstructured":"Chauve C, El-Mabrouk N (2009) New perspectives on gene family evolution: losses in reconciliation and a link with supertrees. In: Proceedings of the 13th annual international conference on research in computational molecular biology, RECOMB 2009, Tucson. LNCS, vol\u00a05541. Springer, pp\u00a046\u201358. doi:10.1007\/978-3-642-02008-7_4","DOI":"10.1007\/978-3-642-02008-7_4"},{"issue":"1","key":"781_CR256","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2004.12.012","volume":"335","author":"C Choy","year":"2005","unstructured":"Choy C, Jansson J, Sadakane K, Sung WK (2005) Computing the maximum agreement of phylogenetic networks. Theor Comput Sci 335(1):93\u2013107. doi:10.1016\/j.tcs.2004.12.012","journal-title":"Theor Comput Sci"},{"issue":"2","key":"781_CR257","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s11047-009-9156-6","volume":"9","author":"G Della Vedova","year":"2010","unstructured":"Della Vedova G, Dondi R, Jiang T, Pavesi G, Pirola Y, Wang L (2010) Beyond evolutionary trees. Nat Comput 9(2):421\u2013435. doi:10.1007\/s11047-009-9156-6","journal-title":"Nat Comput"},{"key":"781_CR258","doi-asserted-by":"crossref","unstructured":"Gambette P, Berry V, Paul C (2012) Quartets and unrooted phylogenetic networks. J Bioinform Comput Biol 10(4). doi:10.1142\/S0219720012500047","DOI":"10.1142\/S0219720012500047"},{"issue":"2","key":"781_CR259","doi-asserted-by":"publisher","first-page":"132","DOI":"10.2307\/2412519","volume":"28","author":"M Goodman","year":"1979","unstructured":"Goodman M, Czelusniak J, Moore GW, Romero-Herrera AE, Matsuda G (1979) Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst Zool 28(2):132\u2013163. doi:10.1093\/sysbio\/28.2.132","journal-title":"Syst Zool"},{"key":"781_CR260","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1145\/974614.974656","volume-title":"Proceedings of the 8th annual international conference on computational molecular biology, RECOMB 2004","author":"P G\u00f2recki","year":"2004","unstructured":"G\u00f2recki P (2004) Reconciliation problems for duplication, loss and horizontal gene transfer. In: Proceedings of the 8th annual international conference on computational molecular biology, RECOMB 2004, San Diego. ACM, pp\u00a0316\u2013325. doi:10.1145\/974614.974656"},{"issue":"1\u20133","key":"781_CR261","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.tcs.2006.05.019","volume":"359","author":"P G\u00f2recki","year":"2006","unstructured":"G\u00f2recki P, Tiuryn J (2006) DLS-trees: a model of evolutionary scenarios. Theor Comput Sci 359(1\u20133):378\u2013399. doi:10.1016\/j.tcs.2006.05.019","journal-title":"Theor Comput Sci"},{"issue":"2","key":"781_CR262","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1006\/mpev.1996.0071","volume":"6","author":"R Guig\u00f2","year":"1996","unstructured":"Guig\u00f2 R, Muchnik I, Smith T (1996) Reconstruction of ancient molecular phylogeny. Mol Phylogenet Evol 6(2):189\u2013213. doi:10.1006\/mpev.1996.0071","journal-title":"Mol Phylogenet Evol"},{"issue":"1","key":"781_CR263","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1142\/S0219720004000521","volume":"2","author":"D Gusfield","year":"2004","unstructured":"Gusfield D, Eddhu S, Langley CH (2004) Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J Bioinform Comput Biol 2(1):173\u2013214. doi:10.1142\/S0219720004000521","journal-title":"J Bioinform Comput Biol"},{"key":"781_CR264","doi-asserted-by":"crossref","unstructured":"Habib M, To TH (2012) Constructing a minimum phylogenetic network from a dense triplet set. J Bioinform Comput Biol 10(5). doi:10.1142\/S0219720012500138","DOI":"10.1142\/S0219720012500138"},{"key":"781_CR265","doi-asserted-by":"crossref","unstructured":"Huson DH, Kl\u00f6pper TH (2007) Beyond galled trees \u2013 decomposition and computation of galled networks. In: Proceedings of the 11th annual international conference on research in computational molecular biology, RECOMB 2007, Oakland. LNCS, vol\u00a04453. Springer, pp\u00a0211\u2013225. doi:10.1007\/978-3-540-71681-5_15","DOI":"10.1007\/978-3-540-71681-5_15"},{"key":"781_CR266","doi-asserted-by":"crossref","unstructured":"Huson DH, Rupp R (2008) Summarizing multiple gene trees using cluster networks. In: Proceedings of the 8th international workshop on algorithms in bioinformatics, WABI 2008, Karlsruhe. LNCS, vol\u00a05251. Springer, pp\u00a0296\u2013305. doi:10.1007\/978-3-540-87361-7_25","DOI":"10.1007\/978-3-540-87361-7_25"},{"key":"781_CR267","doi-asserted-by":"crossref","unstructured":"Jansson J, Sung WK (2004) The maximum agreement of two nested phylogenetic networks. In: Proceedings of the 15th international symposium on algorithms and computation, ISAAC 2004, Hong Kong. LNCS, vol\u00a03341. Springer, pp\u00a0581\u2013593. doi:10.1007\/978-3-540-30551-4_51","DOI":"10.1007\/978-3-540-30551-4_51"},{"issue":"5","key":"781_CR268","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1137\/S0097539704446529","volume":"35","author":"J Jansson","year":"2006","unstructured":"Jansson J, Nguyen NB, Sung WK (2006) Algorithms for combining rooted triplets into a galled phylogenetic network. SIAM J Comput 35(5):1098\u20131121. doi:10.1137\/S0097539704446529","journal-title":"SIAM J Comput"},{"issue":"4","key":"781_CR269","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1007\/s00453-012-9708-5","volume":"68","author":"S Kelk","year":"2014","unstructured":"Kelk S, Scornavacca C (2014) Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable. Algorithmica 68(4):886\u2013915. doi:10.1007\/s00453-012-9708-5","journal-title":"Algorithmica"},{"issue":"1","key":"781_CR270","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1089\/cmb.2008.0084","volume":"16","author":"R Libeskind-Hadas","year":"2009","unstructured":"Libeskind-Hadas R, Charleston MA (2009) On the computational complexity of the reticulate cophylogeny reconstruction problem. J Comput Biol 16(1):105\u2013117. doi:10.1089\/ cmb.2008.0084","journal-title":"J Comput Biol"},{"issue":"3","key":"781_CR271","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1137\/S0097539798343362","volume":"30","author":"B Ma","year":"2000","unstructured":"Ma B, Li M, Zhang L (2000) From gene trees to species trees. SIAM J Comput 30(3):729\u2013752. doi:10.1137\/S0097539798343362","journal-title":"SIAM J Comput"},{"issue":"1","key":"781_CR272","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1089\/cmb.2009.0240","volume":"18","author":"Y Ovadia","year":"2011","unstructured":"Ovadia Y, Fielder D, Conow C, Libeskind-Hadas R (2011) The cophylogeny reconstruction problem is NP-complete. J Comput Biol 18(1):59\u201365. doi:10.1089\/cmb.2009.0240","journal-title":"J Comput Biol"},{"issue":"1","key":"781_CR273","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1093\/sysbio\/43.1.58","volume":"43","author":"R Page","year":"1994","unstructured":"Page R (1994) Maps between trees and cladistic analysis of historical associations among genes. Syst Biol 43(1):58\u201377. doi:10.1093\/sysbio\/43.1.58","journal-title":"Syst Biol"},{"key":"781_CR274","doi-asserted-by":"crossref","unstructured":"To TH, Habib M (2009) Level-k phylogenetic networks are constructable from a dense triplet set in polynomial time. In: Proceedings of the 20th annual symposium on combinatorial pattern matching, CPM 2009, Lille. LNCS, vol\u00a05577. Springer, pp\u00a0275\u2013288. doi:10.1007\/978-3-642-02441-2_25","DOI":"10.1007\/978-3-642-02441-2_25"},{"issue":"2","key":"781_CR275","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/TCBB.2010.14","volume":"8","author":"A Tofigh","year":"2011","unstructured":"Tofigh A, Hallett MT, Lagergren J (2011) Simultaneous identification of duplications and lateral gene transfers. IEEE\/ACM Trans Comput Biol Bioinform 8(2):517\u2013535. doi:10.1109\/TCBB.2010.14","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"2","key":"781_CR276","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00453-009-9333-0","volume":"60","author":"L Iersel van","year":"2011","unstructured":"van Iersel L, Kelk S (2011) Constructing the simplest possible phylogenetic network from triplets. Algorithmica 60(2):207\u2013235. doi:10.1007\/s00453-009-9333-0","journal-title":"Algorithmica"},{"issue":"4","key":"781_CR277","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1109\/TCBB.2009.22","volume":"6","author":"L Iersel van","year":"2009","unstructured":"van Iersel L, Keijsper J, Kelk S, Stougie L, Hagen F, Boekhout T (2009) Constructing level-2 phylogenetic networks from triplets. IEEE\/ACM Trans Comput Biol Bioinform 6(4):667\u2013681. doi:10.1145\/1671403.1671415","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"4","key":"781_CR278","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1142\/S0219720009004308","volume":"7","author":"L Iersel van","year":"2009","unstructured":"van Iersel L, Kelk S, Mnich M (2009) Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks. J Bioinform Comput Biol 7(4):597\u2013623. doi:10.1142\/S0219720009004308","journal-title":"J Bioinform Comput Biol"},{"issue":"12","key":"781_CR279","doi-asserted-by":"publisher","first-page":"i124","DOI":"10.1093\/bioinformatics\/btq202","volume":"26","author":"L Iersel van","year":"2010","unstructured":"van Iersel L, Kelk S, Rupp R, Huson D (2010) Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters. Bioinformatics 26(12):i124\u2013i131. doi:10.1093\/bioinformatics\/btq202","journal-title":"Bioinformatics"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:49:15Z","timestamp":1553100555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_599","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}