{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T15:52:19Z","timestamp":1721663539774},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"S9","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1186\/s12859-018-2269-0","type":"journal-article","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T07:04:54Z","timestamp":1534143894000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["On the impact of uncertain gene tree rooting on duplication-transfer-loss reconciliation"],"prefix":"10.1186","volume":"19","author":[{"given":"Soumya","family":"Kundu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mukul S.","family":"Bansal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,13]]},"reference":[{"issue":"5","key":"2269_CR1","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1134\/S0026893309050197","volume":"43","author":"KY Gorbunov","year":"2009","unstructured":"Gorbunov KY, Liubetskii VA. Reconstructing genes evolution along a species tree. Mol Biol. 2009; 43(5):946\u201358.","journal-title":"Mol Biol"},{"key":"2269_CR2","volume-title":"RECOMB-CG. vol. 6398 of Lecture Notes in Computer Science","author":"JP Doyon","year":"2010","unstructured":"Doyon JP, Scornavacca C, Gorbunov KY, Sz\u00f6llosi GJ, Ranwez V, Berry V. An Efficient Algorithm for Gene\/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers In: Tannier E, editor. RECOMB-CG. vol. 6398 of Lecture Notes in Computer Science. Berlin: Springer: 2010. p. 93\u2013108."},{"issue":"2","key":"2269_CR3","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. Simultaneous Identification of Duplications and Lateral Gene Transfers. IEEE\/ACM Trans Comput Biol Bioinform. 2011; 8(2):517\u201335.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"2269_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1038\/nature09649","volume":"469","author":"LA David","year":"2011","unstructured":"David LA, Alm EJ. Rapid evolutionary innovation during an Archaean genetic expansion. Nature. 2011; 469:93\u20136.","journal-title":"Nature"},{"issue":"12","key":"2269_CR5","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. Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinformatics. 2012; 28(12):283\u201391.","journal-title":"Bioinformatics"},{"issue":"18","key":"2269_CR6","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. 2012; 28(18):409\u201315.","journal-title":"Bioinformatics"},{"issue":"43","key":"2269_CR7","doi-asserted-by":"publisher","first-page":"17513","DOI":"10.1073\/pnas.1202997109","volume":"109","author":"GJ Szollosi","year":"2012","unstructured":"Szollosi GJ, Boussau B, Abby SS, Tannier E, Daubin V. Phylogenetic modeling of lateral gene transfer reconstructs the pattern and relative timing of speciations. Proc Natl Acad Sci. 2012; 109(43):17513\u20138.","journal-title":"Proc Natl Acad Sci"},{"issue":"10","key":"2269_CR8","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1089\/cmb.2013.0073","volume":"20","author":"MS Bansal","year":"2013","unstructured":"Bansal MS, Alm EJ, Kellis M. Reconciliation Revisited: Handling Multiple Optima when Reconciling with Duplication, Transfer, and Loss. J Comput Biol. 2013; 20(10):738\u201354.","journal-title":"J Comput Biol"},{"issue":"02","key":"2269_CR9","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. 2013; 11(02):1250025.","journal-title":"J Bioinform Comput Biol"},{"issue":"12","key":"2269_CR10","doi-asserted-by":"publisher","first-page":"i87","DOI":"10.1093\/bioinformatics\/btu289","volume":"30","author":"R Libeskind-Hadas","year":"2014","unstructured":"Libeskind-Hadas R, Wu YC, Bansal MS, Kellis M. Pareto-optimal phylogenetic tree reconciliation. Bioinformatics. 2014; 30(12):i87\u2013i95.","journal-title":"Bioinformatics"},{"issue":"3","key":"2269_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1093\/sysbio\/syu007","volume":"63","author":"J Sjostrand","year":"2014","unstructured":"Sjostrand J, Tofigh A, Daubin V, Arvestad L, Sennblad B, Lagergren J. A Bayesian Method for Analyzing Lateral Gene Transfer. Syst Biol. 2014; 63(3):409\u201320.","journal-title":"Syst Biol"},{"key":"2269_CR12","volume-title":"Proceedings of the 7th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, BCB 2016, Seattle, WA, USA, October 2-5 2016","author":"M Kordi","year":"2016","unstructured":"Kordi M, Bansal MS. Exact Algorithms for Duplication-Transfer-Loss Reconciliation with Non-Binary Gene Trees. In: Proceedings of the 7th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, BCB 2016, Seattle, WA, USA, October 2-5 2016. New York: ACM: 2016. p. 297\u2013306. Available from: \n                    http:\/\/doi.acm.org\/10.1145\/2975167.2975198\n                    \n                  ."},{"issue":"13","key":"2269_CR13","doi-asserted-by":"publisher","first-page":"2056","DOI":"10.1093\/bioinformatics\/btw105","volume":"32","author":"E Jacox","year":"2016","unstructured":"Jacox E, Chauve C, Szollosi GJ, Ponty Y, Scornavacca C. ecceTERA: comprehensive gene tree-species tree reconciliation using parsimony. Bioinformatics. 2016; 32(13):2056.","journal-title":"Bioinformatics"},{"issue":"1","key":"2269_CR14","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. 2011; 18(1):59\u201365.","journal-title":"J Comput Biol"},{"key":"2269_CR15","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. 2009; 16:105\u201317.","journal-title":"J Comput Biol"},{"issue":"1","key":"2269_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1111\/j.1366-9516.2006.00210.x","volume":"12","author":"F Rutschmann","year":"2006","unstructured":"Rutschmann F. Molecular dating of phylogenetic trees: A brief review of current methods that estimate divergence times. Divers Distrib. 2006; 12(1):35\u201348.","journal-title":"Divers Distrib"},{"key":"2269_CR17","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-319-38827-4_10","volume-title":"Algorithms for Computational Biology","author":"Laura Urbini","year":"2016","unstructured":"Urbini L, Sinaimeri B, Matias C, Sagot M. Robustness of the Parsimonious Reconciliation Method in Cophylogeny In: Bot\u00f3n-Fern\u00e1ndez M, et al, editors.. Springer: 2016. p. 119\u2013130. Available from: \n                    https:\/\/doi.org\/10.1007\/978-3-319-38827-4_10\n                    \n                  ."},{"issue":"2","key":"2269_CR18","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/TCBB.2013.22","volume":"10","author":"P G\u00f3recki","year":"2013","unstructured":"G\u00f3recki P, Eulenstein O, Tiuryn J. Unrooted Tree Reconciliation: A Unified Approach. IEEE\/ACM Trans Comput Biol Bioinform. 2013; 10(2):522\u2013536. Available from: \n                    https:\/\/doi.org\/10.1109\/TCBB.2013.22\n                    \n                  .","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"2269_CR19","volume-title":"Numerical Taxonomy","author":"FR McMorris","year":"1983","unstructured":"McMorris FR, Meronk DB, Neumann DA. A View of Some Consensus Methods for Trees In: Felsenstein J, editor. Numerical Taxonomy. Berlin: Springer: 1983. p. 122\u20136. Available from: \n                    https:\/\/doi.org\/10.1007\/978-3-642-69024-2_18\n                    \n                  ."},{"issue":"21","key":"2269_CR20","doi-asserted-by":"publisher","first-page":"2688","DOI":"10.1093\/bioinformatics\/btl446","volume":"22","author":"A Stamatakis","year":"2006","unstructured":"Stamatakis A. RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models. Bioinformatics. 2006; 22(21):2688\u201390.","journal-title":"Bioinformatics"},{"issue":"8","key":"2269_CR21","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1093\/bioinformatics\/btu806","volume":"31","author":"MS Bansal","year":"2015","unstructured":"Bansal MS, Wu YC, Alm EJ, Kellis M. Improved gene tree error correction in the presence of horizontal gene transfer. Bioinformatics. 2015; 31(8):1211\u20138.","journal-title":"Bioinformatics"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-018-2269-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-018-2269-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-018-2269-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T23:04:15Z","timestamp":1565651055000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-018-2269-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":21,"journal-issue":{"issue":"S9","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["2269"],"URL":"https:\/\/doi.org\/10.1186\/s12859-018-2269-0","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8]]},"assertion":[{"value":"13 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"290"}}