{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:22Z","timestamp":1759637962961,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"S15","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1186\/1471-2105-14-s15-s5","type":"journal-article","created":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T05:02:51Z","timestamp":1381813371000},"source":"Crossref","is-referenced-by-count":20,"title":["Gene tree correction guided by orthology"],"prefix":"10.1186","volume":"14","author":[{"given":"Manuel","family":"Lafond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magali","family":"Semeria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krister M","family":"Swenson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Tannier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"El-Mabrouk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,15]]},"reference":[{"key":"6101_CR1","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BF01734359","volume":"17","author":"J Felsenstein","year":"1981","unstructured":"Felsenstein J: Evolurionary trees from DNA sequences: a maximum likelihood approach. Journal of Molecular Evolution. 1981, 17: 368-376. 10.1007\/BF01734359.","journal-title":"Journal of Molecular Evolution"},{"issue":"14","key":"6101_CR2","doi-asserted-by":"publisher","first-page":"5714","DOI":"10.1073\/pnas.0806251106","volume":"106","author":"O Akerborg","year":"2009","unstructured":"Akerborg O, Sennblad B, Arvestad L, Lagergren J: Simultaneous Bayesian gene tree reconstruction and reconciliation analysis. Proceedings of the National Academy of Sciences of the United States of America. 2009, 106 (14): 5714-5719. 10.1073\/pnas.0806251106.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"6101_CR3","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/s00239-005-0096-1","volume":"63","author":"A Berglund-Sonnhammer","year":"2006","unstructured":"Berglund-Sonnhammer A, Steffansson P, Betts M, Liberles D: Optimal gene trees from sequences and species trees using a soft interpretation of parsimony. Journal of Molecular Evolution. 2006, 63: 240-250. 10.1007\/s00239-005-0096-1.","journal-title":"Journal of Molecular Evolution"},{"key":"6101_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1101\/gr.141978.112","volume":"23","author":"B Boussau","year":"2013","unstructured":"Boussau B, Sz\u00f6llosi GJ, Duret L, Gouy M, Tannier E, Daubin V: Genome-scale coestimation of species and gene trees. Genome Research. 2013, 23: 323-330. 10.1101\/gr.141978.112.","journal-title":"Genome Research"},{"key":"6101_CR5","first-page":"148","volume-title":"ISBRA, Volume 6674 of LNBI","author":"P Gorecki","year":"2011","unstructured":"Gorecki P, Eulenstein O: A linear-time algorithm for error-corrected reconciliation of unrooted gene trees. ISBRA, Volume 6674 of LNBI. 2011, Springer-Verlag, 148-159."},{"key":"6101_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1093\/molbev\/msq189","volume":"28","author":"MD Rasmussen","year":"2011","unstructured":"Rasmussen MD, Kellis M: A Bayesian approach for fast and accurate gene tree reconstruction. Molecular Biology and Evolution. 2011, 28: 273-290. 10.1093\/molbev\/msq189.","journal-title":"Molecular Biology and Evolution"},{"key":"6101_CR7","doi-asserted-by":"crossref","unstructured":"Sz\u00f6llosi GJ, Rosikiewicz W, Bousseau B, Tannier E, Daubin V: Efficient Exploration of the Space of Reconciled Gene Trees 2013. [Submitted].","DOI":"10.1093\/sysbio\/syt054"},{"key":"6101_CR8","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1186\/1471-2105-11-312","volume":"11","author":"P Thomas","year":"2010","unstructured":"Thomas P: GIGA: a simple, efficient algorithm for gene tree inference in the genomic age. BMC Bioinformatics. 2010, 11: 312-10.1186\/1471-2105-11-312.","journal-title":"BMC Bioinformatics"},{"key":"6101_CR9","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1186\/1471-2164-10-630","volume":"10","author":"J Jun","year":"2009","unstructured":"Jun J, Mandoiu II, Nelson CE: Identification of mammalian orthologs using local synteny. BMC Genomics. 2009, 10: 630-10.1186\/1471-2164-10-630. [ http:\/\/dx.doi.org\/10.1186\/1471-2164-10-630 ]","journal-title":"BMC Genomics"},{"key":"6101_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5298-9","volume-title":"Models and algorithms for genome evolution","author":"C Chauve","year":"2013","unstructured":"Chauve C, El-Mabrouk N, Gueguen L, Semeria M, Tannier E: Models and algorithms for genome evolution. 2013, Springer, chap. Duplication, rearrangement and reconciliation: a follow-up 13 years later"},{"key":"6101_CR11","volume-title":"Models and algorithms for genome evolution","author":"M Lafond","year":"2013","unstructured":"Lafond M, Swenson K, El-Mabrouk N: Models and algorithms for genome evolution. 2013, Springer, chap. Error detection and correction of gene trees"},{"issue":"13","key":"6101_CR12","doi-asserted-by":"publisher","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. 2007, 23 (13): i549-i558. 10.1093\/bioinformatics\/btm193. [ http:\/\/bioinformatics.oxfordjournals.org\/content\/23\/13\/i549.abstract ]","journal-title":"Bioinformatics"},{"issue":"18","key":"6101_CR13","doi-asserted-by":"publisher","first-page":"i382","DOI":"10.1093\/bioinformatics\/bts374","volume":"28","author":"S B\u00e9rard","year":"2012","unstructured":"B\u00e9rard S, Gallien C, Boussau B, Sz\u00f6llosi GJ, Daubin V, Tannier E: Evolution of gene neighborhoods within reconciled phylogenies. Bioinformatics. 2012, 28 (18): i382-i388. 10.1093\/bioinformatics\/bts374.","journal-title":"Bioinformatics"},{"issue":"Supp 10","key":"6101_CR14","first-page":"S11","volume":"13","author":"R Chaudhary","year":"2011","unstructured":"Chaudhary R, Burleigh J, Eulenstein O: Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence. BMC-Bioinformatics. 2011, 13 (Supp 10): S11-","journal-title":"BMC-Bioinformatics"},{"issue":"Suppl 10","key":"6101_CR15","doi-asserted-by":"publisher","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 Bioinformatics. 2012, 13 (Suppl 10): S14-10.1186\/1471-2105-13-S10-S14.","journal-title":"BMC Bioinformatics"},{"issue":"8","key":"6101_CR16","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1093\/bioinformatics\/btq079","volume":"26","author":"M Muffato","year":"2010","unstructured":"Muffato M, Louis A, Poisnel CE, Crollius HR: Genomicus: a database and a browser to study gene synteny in modern and ancestral genomes. Bioinformatics. 2010, 26 (8): 1119-1121. 10.1093\/bioinformatics\/btq079.","journal-title":"Bioinformatics"},{"key":"6101_CR17","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/1748-7188-8-12","volume":"8","author":"T Nguyen","year":"2013","unstructured":"Nguyen T, Ranwez V, Pointet S, Chifolleau AMA, Doyon JP, Berry V: Reconciliation and local gene tree rearrangement can be of mutual profit. Algorithms Mol Biol. 2013, 8: 12-10.1186\/1748-7188-8-12. [ http:\/\/dx.doi.org\/10.1186\/17487188-8-12 ]","journal-title":"Algorithms Mol Biol"},{"issue":"Database","key":"6101_CR18","doi-asserted-by":"publisher","first-page":"D84","DOI":"10.1093\/nar\/gkr991","volume":"40","author":"P Flicek","year":"2012","unstructured":"Flicek P: Ensembl 2012. Nucleic Acids Research. 2012, 40 (Database): D84-D90.","journal-title":"Nucleic Acids Research"},{"issue":"2","key":"6101_CR19","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1101\/gr.073585.107","volume":"19","author":"A Vilella","year":"2009","unstructured":"Vilella A, Severin J, Ureta-Vidal A, Heng L, Birney E: EnsemblCompara GeneTrees: Complete, duplication-aware phylogenetic trees in vertebrates. Genome Research. 2009, 19 (2): 327-335.","journal-title":"Genome Research"},{"key":"6101_CR20","first-page":"46","volume-title":"RECOMB 2009, Volume 5541 of LNCS","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. RECOMB 2009, Volume 5541 of LNCS. 2009, Springer, 46-58."},{"key":"6101_CR21","first-page":"76","volume-title":"WABI 2011, Algorithms in Bioinformatics, Volume 6833 of LNCS\/LNBI","author":"A Doroftei","year":"2011","unstructured":"Doroftei A, El-Mabrouk N: Removing Noise from Gene Trees. WABI 2011, Algorithms in Bioinformatics, Volume 6833 of LNCS\/LNBI. 2011, 76-91."},{"key":"6101_CR22","first-page":"106","volume-title":"Algorithms in Bioinformatics, proceedings of WABI'12, Volume 7534 of LNCS\/LNBI","author":"M Lafond","year":"2012","unstructured":"Lafond M, Swenson K, El-Mabrouk N: An Optimal Reconciliation Algorithm for Gene Trees with Polytomies. Algorithms in Bioinformatics, proceedings of WABI'12, Volume 7534 of LNCS\/LNBI. 2012, 106-122."},{"key":"6101_CR23","first-page":"696704","volume":"52","author":"S Guidon","year":"2003","unstructured":"Guidon S, Gascuel O: A simple, fast and accurate algorithm to estimate large phylogenies by maximum likelihood. Systematic Biology. 2003, 52: 696704-","journal-title":"Systematic Biology"},{"issue":"12","key":"6101_CR24","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1093\/bioinformatics\/17.12.1246","volume":"17","author":"H Shimodaira","year":"2001","unstructured":"Shimodaira H, Hasegawa M: Consel: for assessing the confidence of phylogenetic tree selection. Bioinformatics. 2001, 17 (12): 1246-1247. 10.1093\/bioinformatics\/17.12.1246.","journal-title":"Bioinformatics"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-14-S15-S5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-14-S15-S5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-14-S15-S5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T17:04:31Z","timestamp":1564506271000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-14-S15-S5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":24,"journal-issue":{"issue":"S15","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["6101"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-14-s15-s5","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2013,10]]},"article-number":"S5"}}