{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:29:40Z","timestamp":1742988580580,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319190471"},{"type":"electronic","value":"9783319190488"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19048-8_16","type":"book-chapter","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T14:57:48Z","timestamp":1430319468000},"page":"187-198","source":"Crossref","is-referenced-by-count":4,"title":["On the Complexity of Duplication-Transfer-Loss Reconciliation with Non-binary Gene Trees"],"prefix":"10.1007","author":[{"given":"Misagh","family":"Kordi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mukul S.","family":"Bansal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1146\/annurev.genet.39.073003.114725","volume":"39","author":"E.V. Koonin","year":"2005","unstructured":"Koonin, E.V.: Orthologs, paralogs, and evolutionary genomics. Annual Review of Genetics\u00a039(1), 309\u2013338 (2005)","journal-title":"Annual Review of Genetics"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1101\/gr.073585.107","volume":"19","author":"A.J. 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 Research\u00a019(2), 327\u2013335 (2009)","journal-title":"Genome Research"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Chen, K., Durand, D., Farach-Colton, M.: Notung: dating gene duplications using gene family trees. In: RECOMB, pp. 96\u2013106 (2000)","DOI":"10.1145\/332306.332351"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1038\/nature09649","volume":"469","author":"L.A. David","year":"2011","unstructured":"David, L.A., Alm, E.J.: Rapid evolutionary innovation during an archaean genetic expansion. Nature\u00a0469, 93\u201396 (2011)","journal-title":"Nature"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1089\/cmb.2006.13.320","volume":"13","author":"D. Durand","year":"2006","unstructured":"Durand, D., Halld\u00f3rsson, B.V., Vernot, B.: A hybrid micro-macroevolutionary approach to gene tree reconstruction. J. Comput. Biol.\u00a013(2), 320\u2013335 (2006)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1093\/sysbio\/syq072","volume":"60","author":"J.G. Burleigh","year":"2011","unstructured":"Burleigh, J.G., Bansal, M.S., Eulenstein, O., Hartmann, S., Wehe, A., Vision, T.J.: Genome-scale phylogenetics: Inferring the plant tree of life from 18,896 gene trees. Syst. Biol.\u00a060(2), 117\u2013125 (2011)","journal-title":"Syst. Biol."},{"key":"16_CR7","unstructured":"Scornavacca, C., Jacox, E., Sz\u00f6llosi, G.J.: Joint amalgamation of most parsimonious reconciled gene trees. Bioinformatics (in press)"},{"issue":"5","key":"16_CR8","first-page":"946","volume":"43","author":"K.Y. Gorbunov","year":"2009","unstructured":"Gorbunov, K.Y., Liubetskii, V.A.: Reconstructing genes evolution along a species tree. Molekuliarnaia Biologiia\u00a043(5), 946\u2013958 (2009)","journal-title":"Molekuliarnaia Biologiia"},{"key":"16_CR9","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.\u00a06398, pp. 93\u2013108. Springer, Heidelberg (2010)"},{"issue":"2","key":"16_CR10","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. Biology Bioinform.\u00a08(2), 517\u2013535 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"issue":"12","key":"16_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1093\/bioinformatics\/bts225","volume":"28","author":"M.S. 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\u00a028(12), 283\u2013291 (2012)","journal-title":"Bioinformatics"},{"issue":"18","key":"16_CR12","doi-asserted-by":"publisher","first-page":"409","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 nonbinary species trees. Bioinformatics\u00a028(18), 409\u2013415 (2012)","journal-title":"Bioinformatics"},{"issue":"10","key":"16_CR13","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1089\/cmb.2013.0073","volume":"20","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. J. Comput. Biol.\u00a020(10), 738\u2013754 (2013)","journal-title":"J. Comput. Biol."},{"issue":"02","key":"16_CR14","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.\u00a011(02), 1250025 (2013)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Libeskind-Hadas, R., Wu, Y.C., Bansal, M.S., Kellis, M.: Pareto-optimal phylogenetic tree reconciliation. Bioinformatics 30(12), i87\u2013i95 (2014)","DOI":"10.1093\/bioinformatics\/btu289"},{"issue":"1","key":"16_CR16","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.: The cophylogeny reconstruction problem is NP-complete. J. Comput. Biol.\u00a018(1), 59\u201365 (2011)","journal-title":"J. Comput. Biol."},{"key":"16_CR17","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, M.: On the computational complexity of the reticulate cophylogeny reconstruction problem. J. Comput. Biol.\u00a016, 105\u2013117 (2009)","journal-title":"J. Comput. Biol."},{"key":"16_CR18","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":"16_CR19","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":"16_CR20","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.\u00a08394, pp. 418\u2013432. Springer, Heidelberg (2014)"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Proceedings of a Symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19048-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T10:28:27Z","timestamp":1675852107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19048-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190471","9783319190488"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19048-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}