{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:28:44Z","timestamp":1743082124926,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319679785"},{"type":"electronic","value":"9783319679792"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67979-2_16","type":"book-chapter","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T04:31:23Z","timestamp":1505363483000},"page":"298-320","source":"Crossref","is-referenced-by-count":9,"title":["Fast Heuristics for Resolving Weakly Supported Branches Using Duplication, Transfers, and Losses"],"prefix":"10.1007","author":[{"given":"Han","family":"Lai","sequence":"first","affiliation":[]},{"given":"Maureen","family":"Stolzer","sequence":"additional","affiliation":[]},{"given":"Dannie","family":"Durand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,15]]},"reference":[{"issue":"5","key":"16_CR1","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1093\/sysbio\/syr041","volume":"60","author":"M Anisimova","year":"2011","unstructured":"Anisimova, M., Gil, M., Dufayard, J.F., Dessimoz, C., Gascuel, O.: Survey of branch support methods demonstrates accuracy, power, and robustness of fast likelihood-based approximation schemes. Syst. Biol. 60(5), 685\u2013699 (2011)","journal-title":"Syst. Biol."},{"key":"16_CR2","doi-asserted-by":"crossref","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, i283\u2013i291 (2012)","journal-title":"Bioinformatics"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1093\/bioinformatics\/btu806","volume":"31","author":"MS Bansal","year":"2015","unstructured":"Bansal, M.S., Wu, Y.C., Alm, E.J., Kellis, M.: Improved gene tree error correction in the presence of horizontal gene transfer. Bioinformatics 31, 1211\u20131218 (2015)","journal-title":"Bioinformatics"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Barker, D.: Gene trees for orthologous groups from: the evolution of nitrogen fixation in cyanobacteria (2012). Edinburgh DataShare. doi: 10.5061\/dryad.pv6df","DOI":"10.5061\/dryad.pv6df"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1101\/gr.141978.112","volume":"23","author":"B Boussau","year":"2013","unstructured":"Boussau, B., Sz\u00f6ll\u0151si, G.J., Duret, L., Gouy, M., Tannier, E., Daubin, V.: Genome-scale coestimation of species and gene trees. Genome Res. 23, 323\u2013330 (2013)","journal-title":"Genome Res."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11809678_26","volume-title":"Computing and Combinatorics","author":"W-C Chang","year":"2006","unstructured":"Chang, W.-C., Eulenstein, O.: Reconciling gene trees with apparent polytomies. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 235\u2013244. Springer, Heidelberg (2006). doi: 10.1007\/11809678_26"},{"issue":"Suppl 10","key":"16_CR7","doi-asserted-by":"crossref","first-page":"S11","DOI":"10.1186\/1471-2105-13-S10-S11","volume":"13","author":"R Chaudhary","year":"2012","unstructured":"Chaudhary, R., Burleigh, J.G., Eulenstein, O.: Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence. BMC Bioinformatics 13(Suppl 10), S11 (2012)","journal-title":"BMC Bioinformatics"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-1-4471-5298-9_4","volume-title":"Models and Algorithms for Genome Evolution","author":"C Chauve","year":"2013","unstructured":"Chauve, C., El-Mabrouk, N., Gu\u00e9guen, L., Semeria, M., Tannier, E.: Duplication rearrangement and reconciliation: a follow-up 13 years later. In: Chauve, C., El-Mabrouk, N., Tannier, E. (eds.) Models and Algorithms for Genome Evolution, pp. 47\u201362. Springer, London (2013). doi: 10.1007\/978-1-4471-5298-9_4"},{"issue":"3\/4","key":"16_CR9","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1089\/106652700750050871","volume":"7","author":"K Chen","year":"2000","unstructured":"Chen, K., Durand, D., Farach-Colton, M.: Notung: a program for dating gene duplications and optimizing gene family trees. J. Comput. Biol. 7(3\/4), 429\u2013447 (2000)","journal-title":"J. Comput. Biol."},{"issue":"5","key":"16_CR10","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1093\/bioinformatics\/btw686","volume":"33","author":"CA Darby","year":"2017","unstructured":"Darby, C.A., Stolzer, M., Ropp, P.J., Barker, D., Durand, D.: Xenolog classification. Bioinformatics 33(5), 640\u2013649 (2017)","journal-title":"Bioinformatics"},{"key":"16_CR11","doi-asserted-by":"crossref","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"},{"issue":"1","key":"16_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1186\/s13015-014-0031-3","volume":"10","author":"B Donati","year":"2015","unstructured":"Donati, B., Baudet, C., Sinaimeri, B., Crescenzi, P., Sagot, M.F.: EUCALYPT: efficient tree reconciliation enumerator. Algorithms Mol. Biol. 10(1), 3 (2015)","journal-title":"Algorithms Mol. Biol."},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-16181-0_9","volume-title":"Comparative Genomics","author":"J-P Doyon","year":"2010","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. In: Tannier, E. (ed.) RECOMB-CG 2010. LNCS, vol. 6398, pp. 93\u2013108. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-16181-0_9"},{"issue":"2","key":"16_CR14","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1089\/cmb.2006.13.320","volume":"13","author":"D Durand","year":"2006","unstructured":"Durand, D., Halldorsson, B., Vernot, B.: A hybridmicro-macroevolutionary approach to gene tree reconstruction. J. Comput. Biol. 13(2), 320\u2013335 (2006). A preliminary version appeared in RECOMB 2005, 250\u2013264","journal-title":"J. Comput. Biol."},{"key":"16_CR15","unstructured":"El-Mabrouk, N., Ouangraoua, A.: A general framework for gene tree correction based on duplication-loss reconciliation. In: Proceedings of the Workshop on Algorithmics in Bioinformatics (WABI). (2017, in press)"},{"issue":"Suppl 10","key":"16_CR16","doi-asserted-by":"crossref","first-page":"S14","DOI":"10.1186\/1471-2105-13-S10-S14","volume":"13","author":"P G\u00f3recki","year":"2012","unstructured":"G\u00f3recki, P., Eulenstein, O.: Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem. BMC Bioinform. 13(Suppl 10), S14 (2012)","journal-title":"BMC Bioinform."},{"key":"16_CR17","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/sysbio\/syq010","volume":"59","author":"S Guindon","year":"2010","unstructured":"Guindon, S., Dufayard, J.F., Lefort, V., Anisimova, M., Hordijk, W., Gascuel, O.: New algorithms and methods to estimate maximum-likelihood phylogenies: assessing the performance of PhyML 3.0. Syst. Biol. 59, 307\u2013321 (2010)","journal-title":"Syst. Biol."},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Hallett, M., Lagergren, J., Tofigh, A.: Simultaneous identification of duplications and lateral transfers. In: Proceedings of the 8th International Conference on Research in Computational Biology, RECOMB 2004, pp. 347\u2013356. ACM Press, New York (2004)","DOI":"10.1145\/974614.974660"},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1186\/1471-2148-10-42","volume":"10","author":"T Hill","year":"2010","unstructured":"Hill, T., Nordstr\u00f6m, K.J.V., Thollesson, M., S\u00e4fstr\u00f6m, T.M., Vernersson, A.K.E., Fredriksson, R., Schi\u00f6th, H.B.: Sprit: Identifying horizontal gene transfer in rooted phylogenetic trees. BMC Evol. Biol. 10, 42 (2010)","journal-title":"BMC Evol. Biol."},{"key":"16_CR20","volume-title":"Phylogenetic Networks: Concepts, Algorithms and Applications","author":"D Huson","year":"2011","unstructured":"Huson, D., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press, Cambridge (2011)"},{"key":"16_CR21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1093\/gbe\/evq077","volume":"3","author":"DH Huson","year":"2011","unstructured":"Huson, D.H., Scornavacca, C.: A survey of combinatorial methods for phylogenetic networks. Genome Biol. Evol. 3, 23\u201335 (2011)","journal-title":"Genome Biol. Evol."},{"key":"16_CR22","doi-asserted-by":"crossref","first-page":"2056","DOI":"10.1093\/bioinformatics\/btw105","volume":"32","author":"E Jacox","year":"2016","unstructured":"Jacox, E., Chauve, C., Sz\u00f6ll\u0151si, G.J., Ponty, Y., Scornavacca, C.: ecceTERA: comprehensive gene tree-species tree reconciliation using parsimony. Bioinformatics 32, 2056\u20132058 (2016)","journal-title":"Bioinformatics"},{"key":"16_CR23","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1093\/bioinformatics\/btw778","volume":"33","author":"E Jacox","year":"2017","unstructured":"Jacox, E., Weller, M., Tannier, E., Scornavacca, C.: Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses. Bioinformatics 33, 980\u2013987 (2017)","journal-title":"Bioinformatics"},{"key":"16_CR24","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1186\/1471-2148-6-29","volume":"6","author":"TM Keane","year":"2006","unstructured":"Keane, T.M., Creevey, C.J., Pentony, M.M., Naughton, T.J., Mclnerney, J.O.: Assessment of methods for amino acid matrix selection and their use on empirical data shows that ad hoc assumptions for choice of matrix are not justified. BMC Evol. Biol. 6, 29 (2006)","journal-title":"BMC Evol. Biol."},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Kordi, M., Bansal, M.S.: Exact algorithms for duplication-transfer-loss reconciliation with non-binary gene trees. In: ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, pp. 297\u2013306 (2016)","DOI":"10.1145\/2975167.2975198"},{"issue":"3","key":"16_CR26","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1109\/TCBB.2015.2511761","volume":"14","author":"M Kordi","year":"2017","unstructured":"Kordi, M., Bansal, S.: On the complexity of duplication-transfer-loss reconciliation with non-binary gene trees. IEEE\/ACM Trans. Comput. Biol. Bioinform. 14(3), 587\u2013599 (2017)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"16_CR27","doi-asserted-by":"crossref","first-page":"i519","DOI":"10.1093\/bioinformatics\/btu463","volume":"30","author":"M Lafond","year":"2014","unstructured":"Lafond, M., Chauve, C., Dondi, R., El-Mabrouk, N.: Polytomy refinement for the correction of dubious duplications in gene trees. Bioinformatics 30, i519\u2013i526 (2014)","journal-title":"Bioinformatics"},{"key":"16_CR28","unstructured":"Lafond, M., Noutahi, E., El-Mabrouk, N.: Efficient non-binary gene tree resolution with weighted reconciliation cost. In: Grossi, R., Lewenstein, M. (eds.) 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), Leibniz International Proceedings in Informatics (LIPIcs), vol. 54, pp. 14:1\u201314:12. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016)"},{"issue":"Suppl 15","key":"16_CR29","doi-asserted-by":"crossref","first-page":"S5","DOI":"10.1186\/1471-2105-14-S15-S5","volume":"14","author":"M Lafond","year":"2013","unstructured":"Lafond, M., Semeria, M., Swenson, K.M., Tannier, E., El -Mabrouk, N.: Gene tree correction guided by orthology. BMC Bioinform. 14(Suppl 15), S5 (2013)","journal-title":"BMC Bioinform."},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-33122-0_9","volume-title":"Algorithms in Bioinformatics","author":"M Lafond","year":"2012","unstructured":"Lafond, M., Swenson, K.M., El-Mabrouk, N.: An optimal reconciliation algorithm for gene trees with polytomies. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol. 7534, pp. 106\u2013122. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33122-0_9"},{"issue":"5","key":"16_CR31","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1093\/bioinformatics\/bts008","volume":"28","author":"N Latysheva","year":"2012","unstructured":"Latysheva, N., Junker, V.L., Palmer, W.J., Codd, G.A., Barker, D.: The evolution of nitrogen fixation in cyanobacteria. Bioinformatics 28(5), 603\u2013606 (2012)","journal-title":"Bioinformatics"},{"key":"16_CR32","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, in press)"},{"key":"16_CR33","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-0-387-09760-2_7","volume-title":"The Problem Solving Handbook for Computational","author":"L Nakhleh","year":"2010","unstructured":"Nakhleh, L.: Evolutionary phylogenetic networks: models and issues. In: Heath, L., Ramakrishnan, N. (eds.) The Problem Solving Handbook for Computational, pp. 125\u2013158. Springer, Heidelberg (2010). doi: 10.1007\/978-0-387-09760-2_7"},{"key":"16_CR34","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/j.tree.2013.09.004","volume":"28","author":"L Nakhleh","year":"2013","unstructured":"Nakhleh, L.: Computational approaches to species phylogeny inference and gene tree reconciliation. Trends Ecol. Evol. 28, 719\u2013728 (2013)","journal-title":"Trends Ecol. Evol."},{"key":"16_CR35","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1201\/9781420010626.ch17","volume-title":"Meta-Analysis and Combining Information in Genetics and Genomics","author":"L Nakhleh","year":"2009","unstructured":"Nakhleh, L., Ruths, D.: Gene trees, species trees, and species networks. In: Guerra, R., Goldstein, D. (eds.) Meta-Analysis and Combining Information in Genetics and Genomics, pp. 275\u2013293. CRC Press, Boca Raton (2009)"},{"issue":"1","key":"16_CR36","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/1748-7188-8-12","volume":"8","author":"TH Nguyen","year":"2013","unstructured":"Nguyen, T.H., Ranwez, V., Pointet, S., Chifolleau, A.M.A., Doyon, J.P., Berry, V.: Reconciliation and local gene tree rearrangement can be of mutual profit. Algorithms Mol. Biol. 8(1), 12 (2013)","journal-title":"Algorithms Mol. Biol."},{"key":"16_CR37","doi-asserted-by":"crossref","first-page":"e0159559","DOI":"10.1371\/journal.pone.0159559","volume":"11","author":"E Noutahi","year":"2016","unstructured":"Noutahi, E., Semeria, M., Lafond, M., Seguin, J., Boussau, B., Gu\u00e9guen, L., El -Mabrouk, N., Tannier, E.: Efficient gene tree correction guided by genome evolution. PLoS ONE 11, e0159559 (2016)","journal-title":"PLoS ONE"},{"key":"16_CR38","doi-asserted-by":"crossref","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.: The cophylogeny reconstruction problem is NP-complete. J. Comput. Biol. 18, 59\u201365 (2011)","journal-title":"J. Comput. Biol."},{"issue":"Suppl 6","key":"16_CR39","doi-asserted-by":"crossref","first-page":"S3","DOI":"10.1186\/1471-2105-10-S6-S3","volume":"10","author":"S Penel","year":"2009","unstructured":"Penel, S., Arigon, A.M., Dufayard, J.F., Sertier, A.S., Daubin, V., Duret, L., Gouy, M., Perri\u00e8re, G.: Databases of homologous gene families for comparative genomics. BMC Bioinform. 10(Suppl 6), S3 (2009)","journal-title":"BMC Bioinform."},{"key":"16_CR40","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1093\/molbev\/msq189","volume":"28","author":"MD Rasmussen","year":"2011","unstructured":"Rasmussen, M.D., Kellis, M.: A Bayesian approach for fast and accurate gene tree reconstruction. Mol. Biol. Evol. 28, 273\u2013290 (2011)","journal-title":"Mol. Biol. Evol."},{"key":"16_CR41","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1093\/bioinformatics\/btu728","volume":"31","author":"C Scornavacca","year":"2015","unstructured":"Scornavacca, C., Jacox, E., Sz\u00f6ll\u0151si, G.J.: Joint amalgamation of most parsimonious reconciled gene trees. Bioinformatics 31, 841\u2013848 (2015)","journal-title":"Bioinformatics"},{"key":"16_CR42","doi-asserted-by":"crossref","first-page":"2994","DOI":"10.1093\/bioinformatics\/bts548","volume":"28","author":"J Sj\u00f6strand","year":"2012","unstructured":"Sj\u00f6strand, J., Sennblad, B., Arvestad, L., Lagergren, J.: DLRS: gene tree evolution in light of a species tree. Bioinformatics 28, 2994\u20132995 (2012)","journal-title":"Bioinformatics"},{"issue":"3","key":"16_CR43","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1093\/sysbio\/syu007","volume":"63","author":"J Sj\u00f6strand","year":"2014","unstructured":"Sj\u00f6strand, J., Tofigh, A., Daubin, V., Arvestad, L., Sennblad, B., Lagergren, J.: A Bayesian method for analyzing lateral gene transfer. Syst. Biol. 63(3), 409 (2014)","journal-title":"Syst. Biol."},{"key":"16_CR44","doi-asserted-by":"crossref","first-page":"i409","DOI":"10.1093\/bioinformatics\/bts386","volume":"28","author":"M Stolzer","year":"2012","unstructured":"Stolzer, M., Lai, H., Xu, M., Sathaye, D., Vernot, B., Durand, D.: Inferring duplications, losses, transfers, and incomplete lineage sorting with non-binary species trees. Bioinformatics 28, i409\u2013i415 (2012)","journal-title":"Bioinformatics"},{"key":"16_CR45","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1186\/1748-7188-7-31","volume":"7","author":"KM Swenson","year":"2012","unstructured":"Swenson, K.M., Doroftei, A., El-Mabrouk, N.: Gene tree correction for reconciliation and species tree inference. Algorithms Mol. Biol. 7, 31 (2012)","journal-title":"Algorithms Mol. Biol."},{"key":"16_CR46","doi-asserted-by":"crossref","first-page":"17513","DOI":"10.1073\/pnas.1202997109","volume":"109","author":"GJ Sz\u00f6ll\u0151si","year":"2012","unstructured":"Sz\u00f6ll\u0151si, G.J., Boussau, B., Abby, S.S., Tannier, E., Daubin, V.: Phylogenetic modeling of lateral gene transfer reconstructs the pattern and relative timing of speciations. Proc. Natl. Acad. Sci. U.S.A. 109, 17513\u201317518 (2012)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"16_CR47","doi-asserted-by":"publisher","unstructured":"Sz\u00f6ll\u0151si, G.J., Rosikiewicz, W., Boussau, B., Tannier, E., Daubin, V.: Data from: efficient exploration of the space of reconciled gene trees (2013). Dryad Digital Repository. doi: 10.5061\/dryad.pv6df","DOI":"10.5061\/dryad.pv6df"},{"key":"16_CR48","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1093\/sysbio\/syt054","volume":"62","author":"GJ Sz\u00f6ll\u0151si","year":"2013","unstructured":"Sz\u00f6ll\u0151si, G.J., Rosikiewicz, W., Boussau, B., Tannier, E., Daubin, V.: Efficient exploration of the space of reconciled gene trees. Syst. Biol. 62, 901\u2013912 (2013)","journal-title":"Syst. Biol."},{"key":"16_CR49","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1186\/1471-2105-11-312","volume":"11","author":"PD Thomas","year":"2010","unstructured":"Thomas, P.D.: GIGA: a simple, efficient algorithm for gene tree inference in the genomic age. BMC Bioinform. 11, 312 (2010)","journal-title":"BMC Bioinform."},{"key":"16_CR50","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1109\/TCBB.2010.14","volume":"8","author":"A Tofigh","year":"2011","unstructured":"Tofigh, A., Hallett, M., Lagergren, J.: Simultaneous identification of duplications and lateral gene transfers. IEEE\/ACM Trans. Comput. Biol. Bioinf. 8, 517\u2013535 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"16_CR51","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1101\/gr.073585.107","volume":"19","author":"AJ Vilella","year":"2009","unstructured":"Vilella, A.J., Severin, J., Ureta-Vidal, A., Heng, L., Durbin, R., Birney, E.: Ensemblcompara genetrees: complete, duplication-aware phylogenetic trees in vertebrates. Genome Res. 19, 327\u2013335 (2009)","journal-title":"Genome Res."},{"key":"16_CR52","doi-asserted-by":"crossref","first-page":"i549","DOI":"10.1093\/bioinformatics\/btm193","volume":"23","author":"I Wapinski","year":"2007","unstructured":"Wapinski, I., Pfeffer, A., Friedman, N., Regev, A.: Automatic genome-wide reconstruction of phylogenetic gene trees. Bioinformatics 23, i549\u2013i558 (2007)","journal-title":"Bioinformatics"},{"key":"16_CR53","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1089\/cmb.2014.0021","volume":"21","author":"Y Zheng","year":"2014","unstructured":"Zheng, Y., Zhang, L.: Are the duplication cost and robinson-foulds distance equivalent? J. Comput. Biol. 21, 578\u2013590 (2014)","journal-title":"J. Comput. Biol."},{"key":"16_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-319-05269-4_33","volume-title":"Research in Computational Molecular Biology","author":"Y Zheng","year":"2014","unstructured":"Zheng, Y., Zhang, L.: Reconciliation with non-binary gene trees revisited. In: Sharan, R. (ed.) RECOMB 2014. LNCS, vol. 8394, pp. 418\u2013432. Springer, Cham (2014). doi: 10.1007\/978-3-319-05269-4_33"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67979-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T20:48:37Z","timestamp":1692996517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67979-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319679785","9783319679792"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67979-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}