{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:56:42Z","timestamp":1770753402473,"version":"3.50.0"},"reference-count":33,"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":[[2015,12]]},"DOI":"10.1186\/1471-2105-16-s14-s4","type":"journal-article","created":{"date-parts":[[2015,10,3]],"date-time":"2015-10-03T04:04:46Z","timestamp":1443845086000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Reconstructing a SuperGeneTree minimizing reconciliation"],"prefix":"10.1186","volume":"16","author":[{"given":"Manuel","family":"Lafond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A\u00efda","family":"Ouangraoua","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":[[2015,10,2]]},"reference":[{"issue":"3","key":"7176_CR1","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"AV Aho","year":"1981","unstructured":"Aho AV, Yehoshua S, 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-421. 10.1137\/0210030.","journal-title":"SIAM J Comput"},{"key":"7176_CR2","doi-asserted-by":"crossref","unstructured":"Bansal M, Burleigh J, Eulenstein O, Fern\u00e1ndez-Baca D: Robinson-foulds supertrees. Alg Mol Biol. 2010, 5 (18):","DOI":"10.1186\/1748-7188-5-18"},{"key":"7176_CR3","doi-asserted-by":"publisher","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. Nucleic Acids Research. 2008, 36: D263-D266.","journal-title":"Nucleic Acids Research"},{"key":"7176_CR4","doi-asserted-by":"crossref","unstructured":"Bininda-Emonds O, editor: Phylogenetic Supertrees combining information to reveal The Tree Of Life. Computational Biology. 2004, Kluwer Academic, Dordrecht, the Netherlands","DOI":"10.1007\/978-1-4020-2330-9"},{"key":"7176_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1146\/annurev.ecolsys.33.010802.150511","volume":"33","author":"ORP Bininda-Emonds","year":"2002","unstructured":"Bininda-Emonds ORP, Gittleman J, Steel MA: The super tree of life: Procedures, problems and prospects. Annu Rev Ecol Syst. 2002, 33: 265-289. 10.1146\/annurev.ecolsys.33.010802.150511.","journal-title":"Annu Rev Ecol Syst"},{"key":"7176_CR6","volume-title":"DIMACS series in Discrete Math and Theo Comput Sci","author":"D Bryant","year":"2003","unstructured":"Bryant D: A classification of consensus methods for phylogenetics. DIMACS series in Discrete Math and Theo Comput Sci. 2003"},{"key":"7176_CR7","first-page":"46","volume":"5541","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 of LNCS, Springer. 2009, 5541: 46-58.","journal-title":"RECOMB of LNCS, Springer"},{"key":"7176_CR8","doi-asserted-by":"publisher","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. Journal of Computational Biology. 2000, 7: 429-447. 10.1089\/106652700750050871.","journal-title":"Journal of Computational Biology"},{"key":"7176_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01202270","volume":"12","author":"M Constantinescu","year":"1995","unstructured":"Constantinescu M, Sankoff D: An efficient algorithm for supertrees. J Classif. 1995, 12: 101-112. 10.1007\/BF01202270.","journal-title":"J Classif"},{"issue":"3","key":"7176_CR10","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1080\/10635150701416682","volume":"56","author":"JA Cotton","year":"2007","unstructured":"Cotton JA, Wilkinson M: Majority-rule supertrees. Syst Biol. 2007, 56 (3): 445-452. 10.1080\/10635150701416682.","journal-title":"Syst Biol"},{"key":"7176_CR11","doi-asserted-by":"publisher","first-page":"W84","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: W84-W89. 10.1093\/nar\/gkp373.","journal-title":"Nucleic Acids Res"},{"issue":"6","key":"7176_CR12","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"Michel X Goemans","year":"1995","unstructured":"Goemans Michel, Williamson David: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (JACM). 1995, 42 (6): 1115-1145. 10.1145\/227683.227684.","journal-title":"Journal of the ACM (JACM)"},{"key":"7176_CR13","first-page":"347","volume-title":"Proceedings of the eighth annual international conference on Resaerch in computational molecular biology ACM","author":"Mike Hallett","year":"2004","unstructured":"Hallett Mike, Lagergren Jens, Tofigh Ali: Simultaneous identification of duplications and lateral transfers. Proceedings of the eighth annual international conference on Resaerch in computational molecular biology ACM. 2004, 347-356."},{"key":"7176_CR14","doi-asserted-by":"publisher","first-page":"D556","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'on 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: D556-D560. 10.1093\/nar\/gkq1109.","journal-title":"Nucleic Acids Res"},{"issue":"1","key":"7176_CR15","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/100811489","volume":"41","author":"J Jansson","year":"2012","unstructured":"Jansson J, Lemence RS, Lingas A: The complexity of inferring a minimally resolved phylogenetic supertree. SIAM J on computing. 2012, 41 (1): 272-291. 10.1137\/100811489.","journal-title":"SIAM J on computing"},{"key":"7176_CR16","first-page":"106","volume":"7534","author":"M Lafond","year":"2012","unstructured":"Lafond M, Swenson KM, El-Mabrouk N: An optimal reconciliation algorithm for gene trees with polytomies. LNCS, of WABI. 2012, 7534: 106-122.","journal-title":"LNCS, of WABI"},{"key":"7176_CR17","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1186\/1471-2105-12-124","volume":"12","author":"M Lechner","year":"2011","unstructured":"Lechner M, Findeib Sven, Steiner L, Marz1 M, Stadler PF, Prohaska SJ: Proteinortho: detection of (co-)orthologs in large-scale analysis. BMC Bioinformatics. 2011, 12: 124-10.1186\/1471-2105-12-124.","journal-title":"BMC Bioinformatics"},{"key":"7176_CR18","doi-asserted-by":"publisher","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 Research. 2003, 13: 2178-2189. 10.1101\/gr.1224503.","journal-title":"Genome Research"},{"key":"7176_CR19","doi-asserted-by":"publisher","first-page":"D377","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: D377-D386.","journal-title":"Nucleic Acids Res"},{"key":"7176_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0166-218X(95)00074-2","volume":"69","author":"MP Ng","year":"1996","unstructured":"Ng MP, Wormald NC: Reconstruction of rooted trees from subtrees. Discrete Appl Math. 1996, 69: 19-31. 10.1016\/0166-218X(95)00074-2.","journal-title":"Discrete Appl Math"},{"key":"7176_CR21","doi-asserted-by":"crossref","unstructured":"Nguyen N, Mirarab S, Warnow T: MRL and SuperFine+MRL: new supertree methods. J Algo for Mol Biol. 2012, 7 (3):","DOI":"10.1186\/1748-7188-7-3"},{"issue":"Suppl 6","key":"7176_CR22","doi-asserted-by":"publisher","first-page":"S3","DOI":"10.1186\/1471-2105-10-S6-S3","volume":"10","author":"Simon Penel","year":"2009","unstructured":"Penel Simon, Arigon Anne-Muriel, Dufayard Jean-Fran\u00e7ois, Sertier Anne-Sophie, Daubin Vincent, Duret Laurent, Gouy Manolo, Perri\u00e8re Guy: Databases of homologous gene families for comparative genomics. BMC Bioinformatics. 2009, 10 (Suppl 6): S3-10.1186\/1471-2105-10-S6-S3.","journal-title":"BMC Bioinformatics"},{"key":"7176_CR23","doi-asserted-by":"publisher","first-page":"e32","DOI":"10.1093\/nar\/gkq953","volume":"39","author":"LP Pryszcz","year":"2011","unstructured":"Pryszcz LP, Huerta-Cepas J, Gabald\u00f3n T: MetaPhOrs: orthology nd paralogy predictions from multiple phylogenetic evidence using a consistency-based confidence score. Nucleic Acids Research. 2011, 39: e32-10.1093\/nar\/gkq953.","journal-title":"Nucleic Acids Research"},{"issue":"5","key":"7176_CR24","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1080\/10635150701639754","volume":"56","author":"V Ranwez","year":"2007","unstructured":"Ranwez V, Berry V, Criscuolo A, Fabre P, Guillemot S, Scornavacca C, Douzery E: PhySIC: a veto supertree method with desirable properties. Syst Biol. 2007, 56 (5): 798-817. 10.1080\/10635150701639754.","journal-title":"Syst Biol"},{"issue":"12","key":"7176_CR25","doi-asserted-by":"publisher","first-page":"i115","DOI":"10.1093\/bioinformatics\/btq196","volume":"26","author":"V Ranwez","year":"2010","unstructured":"Ranwez V, Criscuolo A, Douzery EJ: SuperTriplets: a triplet-based supertree approach to phylogenomics. Bioinformatics. 2010, 26 (12): i115-i123. 10.1093\/bioinformatics\/btq196.","journal-title":"Bioinformatics"},{"key":"7176_CR26","volume-title":"Bioinformatics","author":"Celine Scornavacca","year":"2014","unstructured":"Scornavacca Celine, Jacox Edwin, Sz\u00f6ll\u0151si Gergely: Joint amalgamation of most parsimonious reconciled gene trees. Bioinformatics. 2014, btu728"},{"key":"7176_CR27","doi-asserted-by":"crossref","unstructured":"Semple C: Reconstructing minimal rooted trees. Discrete Appl Math. 2003, 127 (3):","DOI":"10.1016\/S0166-218X(02)00250-0"},{"issue":"2","key":"7176_CR28","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1080\/10635150802033014","volume":"57","author":"M Steel","year":"2008","unstructured":"Steel M, Rodrigo A: Maximum likelihood supertrees. Syst Biol. 2008, 57 (2): 243-250. 10.1080\/10635150802033014.","journal-title":"Syst Biol"},{"issue":"2","key":"7176_CR29","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1093\/sysbio\/syr092","volume":"61","author":"MS Swenson","year":"2012","unstructured":"Swenson MS, Suri R, Linder CR, Warnow T: SuperFine: fast and accurate supertree estimation. Sys Biol. 2012, 61 (2): 214-227. 10.1093\/sysbio\/syr092.","journal-title":"Sys Biol"},{"key":"7176_CR30","doi-asserted-by":"publisher","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 Research. 2009, 19: 327-335.","journal-title":"Genome Research"},{"key":"7176_CR31","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-319-03780-6_17","volume":"8287","author":"Y Zheng","year":"2013","unstructured":"Zheng Y, Wu T, Zhang L: A linear-time algorithm for reconciliation of non-binary gene tree and binary species tree. Combinatorial Optimization and Applications of LNCS. 2013, 8287: 190-201. 10.1007\/978-3-319-03780-6_17.","journal-title":"Combinatorial Optimization and Applications of LNCS"},{"key":"7176_CR32","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-319-05269-4_33","volume-title":"Research in Computational Molecular Biology, Springer","author":"Yu Zheng","year":"2014","unstructured":"Zheng Yu, Zhang Louxin: Reconciliation with non-binary gene trees revisited. Research in Computational Molecular Biology, Springer. 2014, 418-432."},{"key":"7176_CR33","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1145\/1132516.1132612","volume-title":"Proceedings of the thirty-eighth annual ACM symposium on Theory of computing ACM","author":"David Zuckerman","year":"2006","unstructured":"Zuckerman David: Linear degree extractors and the inapproximability of max clique and chromatic number. Proceedings of the thirty-eighth annual ACM symposium on Theory of computing ACM. 2006, 681-690."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-16-S14-S4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,22]],"date-time":"2022-05-22T16:40:22Z","timestamp":1653237622000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-16-S14-S4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,2]]},"references-count":33,"journal-issue":{"issue":"S14","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["7176"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-16-s14-s4","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,2]]},"assertion":[{"value":"2 October 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"S4"}}