{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T04:56:13Z","timestamp":1684212973249},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"S14","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1186\/s12859-016-1267-3","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T10:05:54Z","timestamp":1478858754000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the consistency of orthology relationships"],"prefix":"10.1186","volume":"17","author":[{"given":"Mark","family":"Jones","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]},{"given":"C\u00e9line","family":"Scornavacca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,11]]},"reference":[{"issue":"2","key":"1267_CR1","first-page":"99","volume":"19","author":"WM Fitch","year":"1970","unstructured":"Fitch WM. Distinguishing homologous from analogous proteins. Syst Biol. 1970; 19(2):99\u2013113.","journal-title":"Syst Biol"},{"key":"1267_CR2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-1-61779-582-4_9","volume":"1","author":"AM Altenhoff","year":"2012","unstructured":"Altenhoff AM, Dessimoz C. Inferring orthology and paralogy. Evol Genomics Stat Comput Methods. 2012; 1:259\u201379.","journal-title":"Evol Genomics Stat Comput Methods"},{"issue":"Database issue","key":"1267_CR3","doi-asserted-by":"crossref","first-page":"D922","DOI":"10.1093\/nar\/gkt1055","volume":"42","author":"F Schreiber","year":"2014","unstructured":"Schreiber F, Patricio M, Muffato M, Pignatelli M, Bateman A. Treefam v9: a new website, more species and orthology-on-the-fly. Nucleic Acids Res. 2014; 42(Database issue):D922\u20135. doi: 10.1093\/nar\/gkt1055 . Epub 2013 Nov 4.","journal-title":"Nucleic Acids Res"},{"issue":"5","key":"1267_CR4","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1093\/bib\/bbr045","volume":"12","author":"JP Doyon","year":"2011","unstructured":"Doyon JP, Ranwez V, Daubin V, Berry V. Models, algorithms and programs for phylogeny reconciliation. Brief Bioinform. 2011; 12(5):392\u2013400.","journal-title":"Brief Bioinform"},{"issue":"9","key":"1267_CR5","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1101\/gr.1224503","volume":"13","author":"L Li","year":"2003","unstructured":"Li L, Stoeckert CJ, Roos DS. Orthomcl: identification of ortholog groups for eukaryotic genomes. Genome Res. 2003; 13(9):2178\u201389.","journal-title":"Genome Res"},{"issue":"2","key":"1267_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1111\/j.1096-0031.2005.00059.x","volume":"21","author":"J Bergsten","year":"2005","unstructured":"Bergsten J. A review of long-branch attraction. Cladistics. 2005; 21(2):163\u201393.","journal-title":"Cladistics"},{"issue":"Suppl 19","key":"1267_CR7","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1186\/1471-2105-13-S19-S6","volume":"13","author":"M Hernandez-Rosales","year":"2012","unstructured":"Hernandez-Rosales M, Hellmuth M, Wieseke N, Huber KT, Moulton V, Stadler PF. From event-labeled gene trees to species trees. BMC Bioinforma. 2012; 13(Suppl 19):6.","journal-title":"BMC Bioinforma"},{"issue":"1-2","key":"1267_CR8","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 KT, Moulton V, Stadler PF, Wieseke N. Orthology relations, symbolic ultrametrics, and cographs. J Math Biol. 2013; 66(1-2):399\u2013420.","journal-title":"J Math Biol"},{"issue":"Suppl 6","key":"1267_CR9","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"},{"issue":"7","key":"1267_CR10","doi-asserted-by":"crossref","first-page":"2058","DOI":"10.1073\/pnas.1412770112","volume":"112","author":"M Hellmuth","year":"2015","unstructured":"Hellmuth M, Wieseke N, Lechner M, Lenhof HP, Middendorf M, Stadler PF. Phylogenomics with paralogs. Proc Natl Acad Sci U S A. 2015; 112(7):2058\u201363.","journal-title":"Proc Natl Acad Sci U S A"},{"issue":"3","key":"1267_CR11","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1137\/S0097539798343362","volume":"30","author":"B Ma","year":"2000","unstructured":"Ma B, Li M, Zhang L. From gene trees to species trees. SIAM J Comput. 2000; 30(3):729\u201352.","journal-title":"SIAM J Comput"},{"key":"1267_CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1146\/annurev.genet.39.073003.114725","volume":"39","author":"EV Koonin","year":"2005","unstructured":"Koonin EV. Orthologs, paralogs, and evolutionary genomics 1. Annu Rev Genet. 2005; 39:309\u201338.","journal-title":"Annu Rev Genet"},{"issue":"1","key":"1267_CR13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D Corneil","year":"1981","unstructured":"Corneil D, Lerchs H, Stewart-Burlingham LK. Complement reducible graphs. Discret Appl Math. 1981; 3(1):163\u201374.","journal-title":"Discret Appl Math"},{"issue":"1","key":"1267_CR14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1006\/aima.1998.1743","volume":"138","author":"S Bo\u030bcker","year":"1998","unstructured":"Bo\u030bcker S, Dress AWM. Recovering symbolically dated, rooted trees from symbolic ultrametrics. Adv Math. 1998; 138(1):105\u201325. doi: 10.1006\/aima.1998.1743 .","journal-title":"Adv Math"},{"issue":"4","key":"1267_CR15","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1137\/060664690","volume":"22","author":"A Bretscher","year":"2008","unstructured":"Bretscher A, Corneil D, Habib M, Paul C. A simple linear time lexbfs cograph recognition algorithm. SIAM J Discret Math. 2008; 22(4):1277\u201396.","journal-title":"SIAM J Discret Math"},{"issue":"4","key":"1267_CR16","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D Corneil","year":"1985","unstructured":"Corneil D, Perl Y, Stewart LK. A linear time recognition algorithm for cographs. SIAM J Comput. 1985; 14(4):926\u201334.","journal-title":"SIAM J Comput"},{"key":"1267_CR17","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1006\/jagm.1995.1047","volume":"19","author":"M Golumbic","year":"1995","unstructured":"Golumbic M, Kaplan H, Shamir R. Graph sandwich problems. J Algorithm. 1995; 19:449\u201373.","journal-title":"J Algorithm"},{"issue":"3","key":"1267_CR18","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(3):405\u201321.","journal-title":"SIAM J Comput"},{"key":"1267_CR19","doi-asserted-by":"crossref","unstructured":"Lafond M, Swenson KM, El-Mabrouk N. An optimal reconciliation algorithm for gene trees with polytomies. In: International Workshop on Algorithms in Bioinformatics. Springer Berlin Heidelberg: 2012. p. 106\u201322.","DOI":"10.1007\/978-3-642-33122-0_9"},{"issue":"2","key":"1267_CR20","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1101\/gr.141978.112","volume":"23","author":"B Boussau","year":"2013","unstructured":"Boussau B, Sz\u00f6llo\u030bsi GJ, Duret L, Gouy M, Tannier E, Daubin V. Genome-scale coestimation of species and gene trees. Genome Res. 2013; 23(2):323\u201330.","journal-title":"Genome Res"},{"key":"1267_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey RG, Fellows MR. Parameterized Complexity. New York, NY, USA: Springer; 1999, p. 530."},{"key":"1267_CR22","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY, USA: W. H. Freeman & Co.; 1979."},{"issue":"6","key":"1267_CR23","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman D. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 2007; 3(6):103\u201328. doi: 10.4086\/toc.2007.v003a006 .","journal-title":"Theory Comput"},{"key":"1267_CR24","unstructured":"Lafond M, Jones M. GitHub - UdeM-LBIT\/OrthoPara-ConstraintChecker: A program to check if a given set of orthology\/paralogy relations, with possible unknowns, is satisfiable or consistent with a species tree. https:\/\/github.com\/UdeM-LBIT\/OrthoPara-ConstraintChecker . Accessed 22 July 2016."},{"issue":"Database issue","key":"1267_CR25","doi-asserted-by":"crossref","first-page":"D48","DOI":"10.1093\/nar\/gks1236","volume":"41","author":"P Flicek","year":"2012","unstructured":"Flicek P, Ahmed I, Amode MR, Barrell D, Beal K, Brent S, Carvalho-Silva D, Clapham P, Coates G, Fairley S, et al. Ensembl 2013. Nucleic Acids Res. 2012; 41(Database issue):D48\u2013D55. Published online 2012 Nov 30. doi: 10.1093\/nar\/gks1236 .","journal-title":"Nucleic Acids Res"},{"issue":"1","key":"1267_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1471-2105-12-124","volume":"12","author":"M Lechner","year":"2011","unstructured":"Lechner M, Findei\u00df S, Steiner L, Marz M, Stadler PF, Prohaska SJ. Proteinortho: Detection of (co-) orthologs in large-scale analysis. BMC Bioinforma. 2011; 12(1):1.","journal-title":"BMC Bioinforma"},{"key":"1267_CR27","unstructured":"Ensembl. Ensembl Species Tree. http:\/\/www.ensembl.org\/info\/about\/speciestree.html . Accessed 22 July 2016."},{"issue":"1","key":"1267_CR28","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1186\/1471-2105-9-413","volume":"9","author":"C Scornavacca","year":"2008","unstructured":"Scornavacca C, Berry V, Lefort V, Douzery EJ, Ranwez V. Physic_ist: cleaning source trees to infer more informative supertrees. BMC Bioinforma. 2008; 9(1):413.","journal-title":"BMC Bioinforma"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-016-1267-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T13:42:24Z","timestamp":1568554944000},"score":1,"resource":{"primary":{"URL":"http:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-016-1267-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":28,"journal-issue":{"issue":"S14","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1267"],"URL":"https:\/\/doi.org\/10.1186\/s12859-016-1267-3","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11]]},"article-number":"416"}}