{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:29Z","timestamp":1763468189560},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319052687"},{"type":"electronic","value":"9783319052694"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05269-4_33","type":"book-chapter","created":{"date-parts":[[2014,2,27]],"date-time":"2014-02-27T22:19:53Z","timestamp":1393539593000},"page":"418-432","source":"Crossref","is-referenced-by-count":13,"title":["Reconciliation with Non-binary Gene Trees Revisited"],"prefix":"10.1007","author":[{"given":"Yu","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louxin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","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":"M.S. 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.\u00a07821, pp. 1\u201313. Springer, Heidelberg (2013)"},{"key":"33_CR2","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.\u00a04112, pp. 235\u2013244. Springer, Heidelberg (2006)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-02008-7_4","volume-title":"Research in Computational Molecular Biology","author":"C. Chauve","year":"2009","unstructured":"Chauve, C., El-Mabrouk, N.: New perspectives on gene family evolution: Losses in reconciliation and a link with supertrees. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol.\u00a05541, pp. 46\u201358. Springer, Heidelberg (2009)"},{"key":"33_CR4","doi-asserted-by":"publisher","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.\u00a07, 429\u2013447 (2000)","journal-title":"J. Comput. Biol."},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1109\/TCBB.2012.79","volume":"9","author":"Z.Z. Chen","year":"2012","unstructured":"Chen, Z.Z., Deng, F., Wang, L.: Simultaneous identification of duplications, losses, and lateral gene transfers. IEEE-ACM Trans. Comput. Biol. Bioinformatics\u00a09, 1515\u20131528 (2012)","journal-title":"IEEE-ACM Trans. Comput. Biol. Bioinformatics"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1093\/bib\/bbr045","volume":"12","author":"J.P. Doyon","year":"2011","unstructured":"Doyon, J.P., et al.: Models, algorithms and programs for phylogeny reconciliation. Briefings Bioinform.\u00a012, 392\u2013400 (2011)","journal-title":"Briefings Bioinform."},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1093\/bioinformatics\/bti325","volume":"21","author":"J.-F. Dufayard","year":"2005","unstructured":"Dufayard, J.-F., et al.: Tree pattern matching in phylogenetic trees: automatic search for orthologs or paralogs in homologous gene sequence databases. Bioinformatics\u00a021, 2596\u20132603 (2005)","journal-title":"Bioinformatics"},{"key":"33_CR8","doi-asserted-by":"publisher","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 hybrid micro-macroevolutionary approach to gene tree reconstruction. J. Comput. Biol.\u00a013, 320\u2013335 (2006)","journal-title":"J. Comput. Biol."},{"key":"33_CR9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/9780470619902.ch10","volume-title":"Evolution After Duplication","author":"O. Eulenstein","year":"2010","unstructured":"Eulenstein, O., Huzurbazar, S., Liberles, D., Eulenstein, O., et al.: Reconciling phylogenetic trees. In: Dittmar, K., Liberles, D. (eds.) Evolution After Duplication, pp. 185\u2013206. Wiley-Blackwell, USA (2010)"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2307\/2412448","volume":"19","author":"W.M. Fitch","year":"1970","unstructured":"Fitch, W.M.: Distinguishing homologous from analogous proteins. Syst. Zool.\u00a019, 99\u2013113 (1970)","journal-title":"Syst. Zool."},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"132","DOI":"10.2307\/2412519","volume":"28","author":"M. Goodman","year":"1979","unstructured":"Goodman, M., et al.: Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst. Zool.\u00a028, 132\u2013163 (1979)","journal-title":"Syst. Zool."},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Goodstadt, L., Ponting, C.: Phylogenetic reconstruction of orthology, paralogy, and conserved synteny for dog and human. PLoS Comput. Biol.\u00a02, e133 (2006)","DOI":"10.1371\/journal.pcbi.0020133"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.tcs.2006.05.019","volume":"359","author":"P. G\u00f3recki","year":"2006","unstructured":"G\u00f3recki, P., Tiuryn, J.: DLS-trees: a model of evolutionary scenarios. Theoret. Comput. Sci.\u00a0359, 378\u2013399 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1093\/bioinformatics\/17.8.754","volume":"17","author":"J.P. Huelsenbeck","year":"2001","unstructured":"Huelsenbeck, J.P., Ronquist, F.: MRBAYES: Bayesian inference of phylogenetic trees. Bioinformatics\u00a017, 754\u2013755 (2001)","journal-title":"Bioinformatics"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1038\/nature01644","volume":"423","author":"M. Kellis","year":"2003","unstructured":"Kellis, M., et al.: Sequencing and comparison of yeast species to identify genes and regulatory elements. Nature\u00a0423, 241\u2013254 (2003)","journal-title":"Nature"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1093\/bib\/bbr030","volume":"12","author":"D.M. Kristensen","year":"2011","unstructured":"Kristensen, D.M., Wolf, Y.I., Mushegian, A.R., Koonin, E.V.: Computational methods for gene orthology inference. Briefings Bioinform.\u00a012, 379\u2013391 (2011)","journal-title":"Briefings Bioinform."},{"key":"33_CR17","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.\u00a07534, pp. 106\u2013122. Springer, Heidelberg (2012)"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Pollard, et al.: Widespread discordance of gene trees with species tree in Drosophila: evidence for incomplete lineage sorting. PLoS Genet. 2(10), e173 (2006)","DOI":"10.1371\/journal.pgen.0020173"},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput.\u00a017, 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"issue":"18","key":"33_CR20","doi-asserted-by":"crossref","first-page":"i409","DOI":"10.1093\/bioinformatics\/bts386","volume":"28","author":"M. Stolzer","year":"2012","unstructured":"Stolzer, M., et al.: Inferring duplications, losses, transfers and incomplete lineage sorting with non-binary species trees. Bioinformatics\u00a028(18), i409\u2013i415 (2012)","journal-title":"Bioinformatics"},{"key":"33_CR21","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1093\/bioinformatics\/18.1.92","volume":"18","author":"C. Storm","year":"2002","unstructured":"Storm, C., Sonnhammer, E.: Automated ortholog inference from phylogenetic trees and calculation of orthology reliability. Bioinformatics\u00a018, 92\u201399 (2002)","journal-title":"Bioinformatics"},{"key":"33_CR22","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1126\/science.278.5338.631","volume":"278","author":"R.L. Tatusov","year":"1997","unstructured":"Tatusov, R.L., et al.: A genomic perspective on protein families. Science\u00a0278, 631\u2013637 (1997)","journal-title":"Science"},{"key":"33_CR23","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1038\/nature06107","volume":"449","author":"I. Wapinski","year":"2007","unstructured":"Wapinski, I., et al.: Natural history and evolutionary principles of gene duplication in fungi. Nature\u00a0449, 54\u201361 (2007)","journal-title":"Nature"},{"key":"33_CR24","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4471-5298-9_6","volume-title":"Models and Algorithms for Genome Evolution","author":"T. Warnow","year":"2013","unstructured":"Warnow, T.: Large-scale multiple sequence alignment and phylogeny estimation. In: Models and Algorithms for Genome Evolution, pp. 85\u2013146. Springer, UK (2013)"},{"key":"33_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1089\/cmb.1997.4.177","volume":"4","author":"L.X. Zhang","year":"1997","unstructured":"Zhang, L.X.: On a Mirkin-Muchnik-Smith conjecture for comparing molecular phylogenies. J. Comput. Biol.\u00a04, 177\u2013187 (1997)","journal-title":"J. Comput. Biol."},{"key":"33_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-319-03780-6_17","volume-title":"Combinatorial Optimization and Applications","author":"Y. Zheng","year":"2013","unstructured":"Zheng, Y., Wu, T., Zhang, L.: A linear-time algorithm for reconciliation of non-binary gene tree and binary species tree. In: Widmayer, P., Xu, Y., Zhu, B. (eds.) COCOA 2013. LNCS, vol.\u00a08287, pp. 190\u2013201. Springer, Heidelberg (2013)"},{"key":"33_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-38036-5_26","volume-title":"Bioinformatics Research and Applications","author":"Y. Zheng","year":"2013","unstructured":"Zheng, Y., Zhang, L.: Effect of incomplete lineage sorting on tree-reconciliation-based inference of gene duplication. In: Cai, Z., Eulenstein, O., Janies, D., Schwartz, D. (eds.) ISBRA 2013. LNCS, vol.\u00a07875, pp. 261\u2013272. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05269-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T17:35:01Z","timestamp":1716572101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-05269-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319052687","9783319052694"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05269-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}