{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:05:59Z","timestamp":1763809559367,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["ID0EMHAC93"],"award-info":[{"award-number":["ID0EMHAC93"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003151","name":"Fonds de Recherche du Qu\u00e9bec - Nature et Technologies (CA)","doi-asserted-by":"publisher","award":["ID0EUIAC94"],"award-info":[{"award-number":["ID0EUIAC94"]}],"id":[{"id":"10.13039\/501100003151","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1186\/s13015-016-0067-7","type":"journal-article","created":{"date-parts":[[2016,4,15]],"date-time":"2016-04-15T20:36:07Z","timestamp":1460752567000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["The link between orthology relations and gene trees: a correction perspective"],"prefix":"10.1186","volume":"11","author":[{"given":"Manuel","family":"Lafond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Dondi","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":[[2016,4,16]]},"reference":[{"key":"67_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86659-3","volume-title":"Evolution by gene duplication","author":"S Ohno","year":"1970","unstructured":"Ohno S. Evolution by gene duplication. Berlin: Springer; 1970."},{"key":"67_CR2","doi-asserted-by":"crossref","first-page":"132","DOI":"10.2307\/2412519","volume":"28","author":"M Goodman","year":"1979","unstructured":"Goodman M, Czelusniak J, Moore GW, Romero-Herrera AE, Matsuda G. Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst Zool. 1979;28:132\u201363.","journal-title":"Syst Zool"},{"key":"67_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1093\/nar\/28.1.33","volume":"28","author":"RL Tatusov","year":"2000","unstructured":"Tatusov RL, Galperin MY, Natale DA, Koonin EV. The COG database: a tool for genome-scale analysis of protein functions and evolution. Nucl Acids Res. 2000;28:33\u20136.","journal-title":"Nucl Acids Res"},{"key":"67_CR4","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1101\/gr.1224503","volume":"13","author":"L Li","year":"2003","unstructured":"Li L, Stoeckert CJJ, Roos DS. OrthoMCL: identification of ortholog groups for eukaryotic genomes. Genome Res. 2003;13:2178\u201389.","journal-title":"Genome Res"},{"key":"67_CR5","doi-asserted-by":"crossref","first-page":"D263","DOI":"10.1093\/nar\/gkm1020","volume":"36","author":"AC Berglund","year":"2008","unstructured":"Berglund AC, Sjolund E, Ostlund G, Sonnhammer EL. InParanoid 6: eukaryotic ortholog clusters with inparalogs. Nucl Acids Res. 2008;36:D263\u20136.","journal-title":"Nucl Acids Res"},{"key":"67_CR6","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1186\/1471-2105-12-124","volume":"12","author":"M Lechner","year":"2011","unstructured":"Lechner M, Findeib SS, Steiner L, Marz M, Stadler PF, Prohaska SJ. Proteinortho: detection of (co-)orthologs in large-scale analysis. BMC Bioinform. 2011;12:124.","journal-title":"BMC Bioinform"},{"issue":"supp 15","key":"67_CR7","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 KM, Tannier E, El-Mabrouk N. Gene tree correction guided by orthology. BMC Bioinform. 2013;14(supp 15):S5.","journal-title":"BMC Bioinform"},{"key":"67_CR8","volume-title":"Error detection and correction of gene trees. Models and algorithms for genome evolution","author":"M Lafond","year":"2013","unstructured":"Lafond M, Swenson K, El-Mabrouk N. Error detection and correction of gene trees. Models and algorithms for genome evolution. London: Springer; 2013."},{"issue":"1","key":"67_CR9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1038\/75556","volume":"25","author":"Consortium TGO","year":"2000","unstructured":"Consortium TGO. Gene ontology: tool for the unification of biology. Nat Genet. 2000;25(1):25\u20139.","journal-title":"Nat Genet"},{"issue":"1\u20132","key":"67_CR10","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s00285-012-0525-x","volume":"66","author":"M Hellmuth","year":"2013","unstructured":"Hellmuth M, Hernandez-Rosales M, Huber K, Moulton V, Stadler P, Wieseke N. Orthology relations, symbolic ultrametrics, and cographs. J Math Biol. 2013;66(1\u20132):399\u2013420.","journal-title":"J Math Biol"},{"issue":"7","key":"67_CR11","doi-asserted-by":"crossref","first-page":"2058","DOI":"10.1073\/pnas.1412770112","volume":"112","author":"M Hellmuth","year":"2014","unstructured":"Hellmuth M, Wieseke N, Lechner M, Lenhof HP, Middendorf M, Stadler PF. Phylogenomics with paralogs. PNAS. 2014;112(7):2058\u201363.","journal-title":"PNAS"},{"key":"67_CR12","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"AV Aho","year":"1981","unstructured":"Aho AV, Sagiv Y, Szymanski TG, Ullman JD. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J Comput. 1981;10:405\u201321.","journal-title":"SIAM J Comput"},{"issue":"Suppl. 19","key":"67_CR13","first-page":"56","volume":"13","author":"M Hernandez-Rosales","year":"2012","unstructured":"Hernandez-Rosales M, Hellmuth M, Wieseke N, Huber KT, Moulton V, Stadler P. From event-labeled gene trees to species trees. BMC Bioinform. 2012;13(Suppl. 19):56.","journal-title":"BMC Bioinform"},{"issue":"Suppl 6","key":"67_CR14","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/1471-2164-15-S6-S12","volume":"15","author":"M Lafond","year":"2014","unstructured":"Lafond M, El-Mabrouk N. Orthology and paralogy constraints: satisfiability and consistency. BMC Genomics. 2014;15(Suppl 6):12.","journal-title":"BMC Genomics"},{"key":"67_CR15","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1101\/gr.073585.107","volume":"19","author":"AJ Vilella","year":"2009","unstructured":"Vilella AJ, Severin J, Ureta-Vidal A, Heng L, Durbin R, Birney E. EnsemblCompara gene trees: Complete, duplication-aware phylogenetic trees in vertebrates. Genome Res. 2009;19:327\u201335.","journal-title":"Genome Res"},{"issue":"Suppl 6","key":"67_CR16","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 AM, Dufayard JF, Sertier AS, Daubin V, Duret L, Gouy M, Perri\u00e8re G. Databases of homologous gene families for comparative genomics. BMC Bioinform. 2009;10(Suppl 6):S3. doi: 10.1186\/1471-2105-10-S6-S3 .","journal-title":"BMC Bioinform"},{"key":"67_CR17","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1093\/nar\/gkp373","volume":"37","author":"RS Datta","year":"2009","unstructured":"Datta RS, Meacham C, Samad B, Neyer C, Sj\u00f6lander K. Berkeley PHOG: PhyloFacts orthology group prediction web server. Nucleic Acids Res. 2009;37:84\u20139.","journal-title":"Nucleic Acids Res"},{"key":"67_CR18","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1093\/nar\/gkq953","volume":"39","author":"LP Pryszcz","year":"2011","unstructured":"Pryszcz LP, Huerta-Cepas J, Gabald\u00f3n T. MetaPhOrs: orthology and paralogy predictions from multiple phylogenetic evidence using a consistency-based confidence score. Nucleic Acids Res. 2011;39:32.","journal-title":"Nucleic Acids Res"},{"key":"67_CR19","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1093\/nar\/gkq1109","volume":"39","author":"J Huerta-Cepas","year":"2011","unstructured":"Huerta-Cepas J, Capella-Gutierrez S, Pryszcz LP, Denisov I, Kormes D, Marcet-Houben M, Gabald\u2019on T. Phylomedb v3.0: an expanding repository of genome-wide collections of trees, alignments and phylogeny-based orthology and paralogy predictions. Nucleic Acids Res. 2011;39:556\u201360.","journal-title":"Nucleic Acids Res"},{"key":"67_CR20","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1093\/nar\/gks1118","volume":"41","author":"H Mi","year":"2012","unstructured":"Mi H, Muruganujan A, Thomas PD. Panther in 2013: modeling the evolution of gene function, and other gene attributes, in the context of phylogenetic trees. Nucleic Acids Res. 2012;41:377\u201386.","journal-title":"Nucleic Acids Res"},{"issue":"Supp. 10","key":"67_CR21","first-page":"11","volume":"13","author":"R Chaudhary","year":"2011","unstructured":"Chaudhary R, Burleigh JG, Eulenstein O. Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence. BMC Bioinform. 2011;13(Supp. 10):11.","journal-title":"BMC Bioinform"},{"key":"67_CR22","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: dating gene duplications using gene family trees. J Comput Biol. 2000;7:429\u201347.","journal-title":"J Comput Biol"},{"key":"67_CR23","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.jda.2013.06.001","volume":"25","author":"R Dondi","year":"2014","unstructured":"Dondi R, El-Mabrouk N, Swenson KM. Gene tree correction for reconciliation and species tree inference: complexity and algorithms. J Discret Algorithms. 2014;25:51\u201365. doi: 10.1016\/j.jda.2013.06.001 .","journal-title":"J Discret Algorithms"},{"key":"67_CR24","doi-asserted-by":"crossref","unstructured":"Doroftei A, El-Mabrouk N. Removing noise from gene trees. In: Przytycka TM, Sagot M-F, editors. WABI 2011. Lecture notes in bioinformatics. vol. 6833. Berlin, Heidelberg: Springer; 2011. p. 76\u201391.","DOI":"10.1007\/978-3-642-23038-7_8"},{"issue":"Supp 10","key":"67_CR25","first-page":"14","volume":"13","author":"P Gorecki","year":"2011","unstructured":"Gorecki P, Eulenstein O. Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem. BMC Bioinform. 2011;13(Supp 10):14.","journal-title":"BMC Bioinform"},{"key":"67_CR26","doi-asserted-by":"crossref","unstructured":"Gorecki P, Eulenstein O. A linear-time algorithm for error-corrected reconciliation of unrooted gene trees. In: Chen J, Wang J, Zelikovsky A, editors. ISBRA 2011. Lecture notes in bioinformatics. vol. 6674. Berlin, Heidelberg: Springer; 2011. p. 148\u2013159.","DOI":"10.1007\/978-3-642-21260-4_17"},{"issue":"17","key":"67_CR27","doi-asserted-by":"crossref","first-page":"519","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. 2014;30(17):519\u201326. doi: 10.1093\/bioinformatics\/btu463 .","journal-title":"Bioinformatics"},{"key":"67_CR28","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1186\/1748-7188-7-31","volume":"7","author":"KM Swenson","year":"2012","unstructured":"Swenson KM, Doroftei A, El-Mabrouk N. Gene tree correction for reconciliation and species tree inference. Algorithms Mol Biol. 2012;7:31.","journal-title":"Algorithms Mol Biol"},{"issue":"8","key":"67_CR29","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/1748-7188-8-12","volume":"8","author":"TH Nguyen","year":"2013","unstructured":"Nguyen TH, Ranwez V, Pointet S, Chifolleau AM, Doyon JP, Berry V. Reconciliation and local gene tree rearrangement can be of mutual profit. Algorithms Mol Biol. 2013;8(8):12.","journal-title":"Algorithms Mol Biol"},{"key":"67_CR30","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D Robinson","year":"1981","unstructured":"Robinson D, Foulds L. Comparison of phylogenetic trees. Math Biosci. 1981;53:131\u201347.","journal-title":"Math Biosci"},{"key":"67_CR31","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.tcs.2011.11.040","volume":"461","author":"Y Liu","year":"2012","unstructured":"Liu Y, Wang J, Guo J, Chen J. Complexity and parameterized algorithms for cograph editing. Theor Comput Sci. 2012;461:45\u201354. doi: 10.1016\/j.tcs.2011.11.040 .","journal-title":"Theor Comput Sci"},{"issue":"1","key":"67_CR32","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A Natanzon","year":"2001","unstructured":"Natanzon A, Shamir R, Sharan R. Complexity classification of some edge modification problems. Discret Appl Math. 2001;113(1):109\u201328.","journal-title":"Discret Appl Math"},{"issue":"5","key":"67_CR33","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0168-9525(00)02005-9","volume":"16","author":"WM Fitch","year":"2000","unstructured":"Fitch WM. Homology a personal view on some of the problems. Trends Genet. 2000;16(5):227\u201331.","journal-title":"Trends Genet"},{"issue":"3","key":"67_CR34","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/31.1748","volume":"35","author":"ES El-Mallah","year":"1988","unstructured":"El-Mallah ES, Colbourn CJ. The complexity of some edge deletion problems. IEEE Trans Circuits Syst. 1988;35(3):354\u201362.","journal-title":"IEEE Trans Circuits Syst"},{"key":"67_CR35","volume-title":"Computers and intractability: a guide to the theory of np-completeness","author":"RG Michael","year":"1979","unstructured":"Michael RG, David SJ. Computers and intractability: a guide to the theory of np-completeness. San Francisco: WH Freeman & Co.; 1979."},{"key":"67_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2003","unstructured":"Vazirani VV. Approximation algorithms. New York: Springer; 2003."},{"issue":"1","key":"67_CR37","first-page":"103","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman D. Linear degree extractors and the inapproximability of max clique and chromatic number. Proc Thirty Eight Annu ACM Symp Theor Comput. 2007;3(1):103\u201328. doi: 10.4086\/toc.2007.v003a006 .","journal-title":"Proc Thirty Eight Annu ACM Symp Theor Comput"},{"issue":"4","key":"67_CR38","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1137\/060664690","volume":"22","author":"A Bretscher","year":"2008","unstructured":"Bretscher A, Corneil DG, Habib M, Paul C. A simple linear time lexbfs cograph recognition algorithm. SIAM J Discret Math. 2008;22(4):1277\u201396. doi: 10.1137\/060664690 .","journal-title":"SIAM J Discret Math"},{"issue":"1","key":"67_CR39","doi-asserted-by":"crossref","first-page":"53786","DOI":"10.1371\/journal.pone.0053786","volume":"8","author":"AM Altenhoff","year":"2013","unstructured":"Altenhoff AM, Gil M, Gonnet GH, Dessimoz C. Inferring hierarchical orthologous groups from orthologous gene pairs. PLoS One. 2013;8(1):53786.","journal-title":"PLoS One"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-016-0067-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T07:06:10Z","timestamp":1498287970000},"score":1,"resource":{"primary":{"URL":"http:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-016-0067-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,16]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["67"],"URL":"https:\/\/doi.org\/10.1186\/s13015-016-0067-7","relation":{},"ISSN":["1748-7188"],"issn-type":[{"type":"electronic","value":"1748-7188"}],"subject":[],"published":{"date-parts":[[2016,4,16]]},"article-number":"4"}}