{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:47:44Z","timestamp":1770752864897,"version":"3.50.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2010,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:sec><jats:title>Background<\/jats:title><jats:p>Supertree methods synthesize collections of small phylogenetic trees with incomplete taxon overlap into comprehensive trees, or supertrees, that include all taxa found in the input trees. Supertree methods based on the well established Robinson-Foulds (RF) distance have the potential to build supertrees that retain much information from the input trees. Specifically, the RF supertree problem seeks a binary supertree that minimizes the sum of the RF distances from the supertree to the input trees. Thus, an RF supertree is a supertree that is consistent with the largest number of clusters (or clades) from the input trees.<\/jats:p><\/jats:sec><jats:sec><jats:title>Results<\/jats:title><jats:p>We introduce efficient, local search based, hill-climbing heuristics for the intrinsically hard RF supertree problem on rooted trees. These heuristics use novel non-trivial algorithms for the SPR and TBR local search problems which improve on the time complexity of the best known (na\u00efve) solutions by a factor of \u0398(<jats:italic>n<\/jats:italic>) and \u0398(<jats:italic>n<\/jats:italic><jats:sup>2<\/jats:sup>) respectively (where<jats:italic>n<\/jats:italic>is the number of taxa, or leaves, in the supertree). We use an implementation of our new algorithms to examine the performance of the RF supertree method and compare it to matrix representation with parsimony (MRP) and the triplet supertree method using four supertree data sets. Not only did our RF heuristic provide fast estimates of RF supertrees in all data sets, but the RF supertrees also retained more of the information from the input trees (based on the RF distance) than the other supertree methods.<\/jats:p><\/jats:sec><jats:sec><jats:title>Conclusions<\/jats:title><jats:p>Our heuristics for the RF supertree problem, based on our new local search algorithms, make it possible for the first time to estimate large supertrees by directly optimizing the RF distance from rooted input trees to the supertrees. This provides a new and fast method to build accurate supertrees. RF supertrees may also be useful for estimating majority-rule(-) supertrees, which are a generalization of majority-rule consensus trees.<\/jats:p><\/jats:sec>","DOI":"10.1186\/1748-7188-5-18","type":"journal-article","created":{"date-parts":[[2010,2,24]],"date-time":"2010-02-24T19:16:48Z","timestamp":1267039008000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":86,"title":["Robinson-Foulds Supertrees"],"prefix":"10.1186","volume":"5","author":[{"given":"Mukul S","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J Gordon","family":"Burleigh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Eulenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Fern\u00e1ndez-Baca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,24]]},"reference":[{"issue":"7","key":"91_CR1","doi-asserted-by":"publisher","first-page":"1904","DOI":"10.1073\/pnas.0308127100","volume":"101","author":"TJ Davies","year":"2004","unstructured":"Davies TJ, Barraclough TG, Chase MW, Soltis PS, Soltis DE, Savolainen V: Darwin's abominable mystery: Insights from a supertree of the angiosperms. Proceedings of the National Academy of Sciences of the United States of America. 2004, 101 (7): 1904-1909. 10.1073\/pnas.0308127100","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"7135","key":"91_CR2","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1038\/nature05634","volume":"446","author":"ORP Bininda-Emonds","year":"2007","unstructured":"Bininda-Emonds ORP, Cardillo M, Jones KE, Macphee RDE, Beck RMD, Grenyer R, Price SA, Vos RA, Gittleman JL, Purvis A: The delayed rise of present-day mammals. Nature. 2007, 446 (7135): 507-512. 10.1038\/nature05634","journal-title":"Nature"},{"issue":"7","key":"91_CR3","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1101\/gr.187002","volume":"12","author":"V Daubin","year":"2002","unstructured":"Daubin V, Gouy M, Perriere G: A Phylogenomic Approach to Bacterial Phylogeny: Evidence of a Core of Genes Sharing a Common History. Genome Res. 2002, 12 (7): 1080-1090. 10.1101\/gr.187002","journal-title":"Genome Res"},{"key":"91_CR4","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1080\/10635150500541722","volume":"55","author":"JG Burleigh","year":"2006","unstructured":"Burleigh JG, Driskell AC, Sanderson MJ: Supertree bootstrapping methods for assessing phylogenetic variation among genes in genome-scale data sets. Systematic Biology. 2006, 55: 426-440. 10.1080\/10635150500541722","journal-title":"Systematic Biology"},{"issue":"8","key":"91_CR5","doi-asserted-by":"publisher","first-page":"1752","DOI":"10.1093\/molbev\/msm095","volume":"24","author":"D Pisani","year":"2007","unstructured":"Pisani D, Cotton JA, McInerney JO: Supertrees disentangle the chimerical origin of eukaryotic genomes. Mol Biol Evol. 2007, 24 (8): 1752-1760. 10.1093\/molbev\/msm095","journal-title":"Mol Biol Evol"},{"key":"91_CR6","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1146\/annurev.ecolsys.33.010802.150448","volume":"33","author":"CO Webb","year":"2002","unstructured":"Webb CO, Ackerly DD, McPeek M, Donoghue MJ: Phylogenies and community ecology. Ann Rev Ecol Syst. 2002, 33: 475-505. 10.1146\/annurev.ecolsys.33.010802.150448","journal-title":"Ann Rev Ecol Syst"},{"issue":"Supplement 1","key":"91_CR7","doi-asserted-by":"publisher","first-page":"11556","DOI":"10.1073\/pnas.0801917105","volume":"105","author":"TJ Davies","year":"2008","unstructured":"Davies TJ, Fritz SA, Grenyer R, Orme CDL, Bielby J, Bininda-Emonds ORP, Cardillo M, Jones KE, Gittleman JL, Mace GM, Purvis A: Phylogenetic trees and the future of mammalian biodiversity. Proceedings of the National Academy of Sciences. 2008, 105 (Supplement 1): 11556-11563. 10.1073\/pnas.0801917105","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"91_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1093\/sysbio\/44.2.251","volume":"44","author":"A Purvis","year":"1995","unstructured":"Purvis A: A modification to Baum and Ragan's method for combining phylogenetic trees. Systematic Biology. 1995, 44: 251-255.","journal-title":"Systematic Biology"},{"key":"91_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1080\/106351502753475925","volume":"51","author":"D Pisani","year":"2002","unstructured":"Pisani D, Wilkinson M: Matrix Representation with Parsimony, Taxonomic Congruence, and Total Evidence. Systematic Biology. 2002, 51: 151-155. 10.1080\/106351502753475925","journal-title":"Systematic Biology"},{"key":"91_CR10","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 JL, Steel MA: The (super) tree of life: procedures, problems, and prospects. Annual Review of Ecology and Systematics. 2002, 33: 265-289. 10.1146\/annurev.ecolsys.33.010802.150511","journal-title":"Annual Review of Ecology and Systematics"},{"key":"91_CR11","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1080\/10635150590949832","volume":"54","author":"M Wilkinson","year":"2005","unstructured":"Wilkinson M, Cotton JA, Creevey C, Eulenstein O, Harris SR, Lapointe FJ, Levasseur C, McInerney JO, Pisani D, Thorley JL: The shape of supertrees to come: Tree shape related properties of fourteen supertree methods. Syst Biol. 2005, 54: 419-432. 10.1080\/10635150590949832","journal-title":"Syst Biol"},{"issue":"3","key":"91_CR12","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1111\/j.1096-0031.2005.00064.x","volume":"21","author":"PA Goloboff","year":"2005","unstructured":"Goloboff PA: Minority rule supertrees? MRP, Compatibility, and Minimum Flip may display the least frequent groups. Cladistics. 2005, 21 (3): 282-294. 10.1111\/j.1096-0031.2005.00064.x","journal-title":"Cladistics"},{"issue":"2","key":"91_CR13","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1080\/10635150701245370","volume":"56","author":"M Wilkinson","year":"2007","unstructured":"Wilkinson M, Cotton JA, Lapointe FJ, Pisani D: Properties of Supertree Methods in the Consensus Setting. Syst Biol. 2007, 56 (2): 330-337. 10.1080\/10635150701245370","journal-title":"Syst Biol"},{"issue":"2","key":"91_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.jtbi.2008.03.024","volume":"253","author":"WH Day","year":"2008","unstructured":"Day WH, McMorris F, Wilkinson M: Explosions and hot spots in supertree methods. Journal of Theoretical Biology. 2008, 253 (2): 345-348. 10.1016\/j.jtbi.2008.03.024","journal-title":"Journal of Theoretical Biology"},{"key":"91_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2307\/1222480","volume":"41","author":"BR Baum","year":"1992","unstructured":"Baum BR: Combining Trees as a Way of Combining Data Sets for Phylogenetic Inference, and the Desirability of Combining Gene Trees. Taxon. 1992, 41: 3-10. 10.2307\/1222480","journal-title":"Taxon"},{"key":"91_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/1055-7903(92)90035-F","volume":"1","author":"MA Ragan","year":"1992","unstructured":"Ragan MA: Phylogenetic inference based on matrix representation of trees. Molecular Phylogenetics and Evolution. 1992, 1: 53-58. 10.1016\/1055-7903(92)90035-F","journal-title":"Molecular Phylogenetics and Evolution"},{"issue":"4","key":"91_CR17","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1111\/j.1096-0031.1999.tb00278.x","volume":"15","author":"PA Goloboff","year":"1999","unstructured":"Goloboff PA: Analyzing Large Data Sets in Reasonable Times: Solutions for Composite Optima. Cladistics. 1999, 15 (4): 415-428. 10.1111\/j.1096-0031.1999.tb00278.x","journal-title":"Cladistics"},{"key":"91_CR18","volume-title":"PAUP*: Phylogenetic analysis using parsimony (*and other methods), Version 4.0b10","author":"DL Swofford","year":"2002","unstructured":"Swofford DL: PAUP*: Phylogenetic analysis using parsimony (*and other methods), Version 4.0b10. 2002"},{"key":"91_CR19","first-page":"98","volume-title":"CSB","author":"U Roshan","year":"2004","unstructured":"Roshan U, Moret BME, Warnow T, Williams TL: Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees. CSB. 2004, 98-109."},{"key":"91_CR20","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1080\/106351501750435112","volume":"50","author":"O Bininda-Emonds","year":"2001","unstructured":"Bininda-Emonds O, Sanderson M: Assessment of the accuracy of matrix representation with parsimony analysis supertree construction. Systematic Biology. 2001, 50: 565-579. 10.1080\/106351501750435112","journal-title":"Systematic Biology"},{"key":"91_CR21","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1080\/10635150490423719","volume":"53","author":"O Eulenstein","year":"2003","unstructured":"Eulenstein O, Chen D, Burleigh JG, Fern\u00e1ndez-Baca D, Sanderson MJ: Performance of Flip Supertree Construction with a Heuristic Algorithm. Systematic Biology. 2003, 53: 299-308. 10.1080\/10635150490423719","journal-title":"Systematic Biology"},{"key":"91_CR22","volume-title":"Evolutionary Bioinformatics","author":"D Chen","year":"2006","unstructured":"Chen D, Eulenstein O, Fern\u00e1ndez-Baca D, Burleigh JG: Improved Heuristics for Minimum-Flip Supertree Construction. Evolutionary Bioinformatics. 2006, 2:"},{"issue":"3","key":"91_CR23","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1093\/bioinformatics\/bti020","volume":"21","author":"CJ Creevey","year":"2005","unstructured":"Creevey CJ, McInerney JO: Clann: investigating phylogenetic information through supertree analyses. Bioinformatics. 2005, 21 (3): 390-392. 10.1093\/bioinformatics\/bti020","journal-title":"Bioinformatics"},{"key":"91_CR24","first-page":"61","volume-title":"Reconstructing the Tree of Life: Taxonomy and Systematics of Species Rich Taxa","author":"M Wilkinson","year":"2007","unstructured":"Wilkinson M, Cotton JA: Supertree Methods for Building the Tree of Life: Divide-and-Conquer Approaches to Large Phylogenetic Problems. Reconstructing the Tree of Life: Taxonomy and Systematics of Species Rich Taxa. Edited by: Hodkinson TR, Parnell JAN. 2007, 61-76. CRC Press"},{"issue":"1-2","key":"91_CR25","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"DF Robinson","year":"1981","unstructured":"Robinson DF, Foulds LR: Comparison of phylogenetic trees. Mathematical Biosciences. 1981, 53 (1-2): 131-147. 10.1016\/0025-5564(81)90043-2","journal-title":"Mathematical Biosciences"},{"key":"91_CR26","volume-title":"Proceedings of the International Federation of Classification Societies","author":"FR McMorris","year":"1993","unstructured":"McMorris FR, Steel MA: The complexity of the median procedure for binary trees. Proceedings of the International Federation of Classification Societies. 1993"},{"key":"91_CR27","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01894194","volume":"3","author":"JP Barth\u00e9lemy","year":"1986","unstructured":"Barth\u00e9lemy JP, McMorris FR: The median procedure for n-trees. Journal of Classification. 1986, 3: 329-334. 10.1007\/BF01894194","journal-title":"Journal of Classification"},{"key":"91_CR28","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. Systematic Biology. 2007, 56: 445-452. 10.1080\/10635150701416682","journal-title":"Systematic Biology"},{"issue":"3","key":"91_CR29","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1093\/sysbio\/syp032","volume":"58","author":"J Dong","year":"2009","unstructured":"Dong J, Fern\u00e1ndez-Baca D: Properties of Majority-Rule Supertrees. Syst Biol. 2009, 58 (3): 360-367. 10.1093\/sysbio\/syp032","journal-title":"Syst Biol"},{"key":"91_CR30","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01908061","volume":"2","author":"WHE Day","year":"1985","unstructured":"Day WHE: Optimal algorithms for comparing trees with labeled leaves. Journal of Classification. 1985, 2: 7-28. 10.1007\/BF01908061","journal-title":"Journal of Classification"},{"issue":"6","key":"91_CR31","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1089\/cmb.2007.R012","volume":"14","author":"ND Pattengale","year":"2007","unstructured":"Pattengale ND, Gottlieb EJ, Moret BME: Efficiently Computing the Robinson-Foulds Metric. Journal of Computational Biology. 2007, 14 (6): 724-735. [PMID: 17691890] 10.1089\/cmb.2007.R012","journal-title":"Journal of Computational Biology"},{"key":"91_CR32","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C Semple","year":"2003","unstructured":"Semple C, Steel M: Phylogenetics. 2003, Oxford University Press"},{"key":"91_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"BL Allen","year":"2001","unstructured":"Allen BL, Steel M: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics. 2001, 5: 1-13. 10.1007\/s00026-001-8006-8","journal-title":"Annals of Combinatorics"},{"key":"91_CR34","first-page":"407","volume-title":"Molecular Systematics","author":"DL Swofford","year":"1996","unstructured":"Swofford DL, Olsen GJ, Waddel PJ, Hillis DM: Phylogenetic inference. Molecular Systematics. Edited by: Hillis DM, Moritz C, Mable BK. 1996, 407-509. Sunderland, Mass: Sinauer Assoc"},{"key":"91_CR35","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","volume":"8","author":"M Bordewich","year":"2004","unstructured":"Bordewich M, Semple C: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics. 2004, 8: 409-423. 10.1007\/s00026-004-0229-z","journal-title":"Annals of Combinatorics"},{"key":"91_CR36","first-page":"238","volume-title":"RECOMB, Volume 4453 of Lecture Notes in Computer Science","author":"MS Bansal","year":"2007","unstructured":"Bansal MS, Burleigh JG, Eulenstein O, Wehe A: Heuristics for the Gene-Duplication Problem: A \u0398(n) Speed-Up for the Local Search. RECOMB, Volume 4453 of Lecture Notes in Computer Science. Edited by: Speed TP, Huang H. 2007, 238-252. full_text. Springer"},{"issue":"4","key":"91_CR37","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1109\/TCBB.2008.69","volume":"5","author":"MS Bansal","year":"2008","unstructured":"Bansal MS, Eulenstein O: An \u03a9(n2\/log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem. IEEE\/ACM Transactions on Computational Biology and Bioinformatics. 2008, 5 (4): 514-524. 10.1109\/TCBB.2008.69","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"Suppl 1","key":"91_CR38","doi-asserted-by":"publisher","first-page":"S8","DOI":"10.1186\/1471-2105-10-S1-S8","volume":"10","author":"H Lin","year":"2009","unstructured":"Lin H, Burleigh JG, Eulenstein O: Triplet supertree heuristics for the tree of life. BMC Bioinformatics. 2009, 10 (Suppl 1): S8- 10.1186\/1471-2105-10-S1-S8","journal-title":"BMC Bioinformatics"},{"key":"91_CR39","first-page":"88","volume-title":"LATIN, Volume 1776 of Lecture Notes in Computer Science","author":"MA Bender","year":"2000","unstructured":"Bender MA, Farach-Colton M: The LCA Problem Revisited. LATIN, Volume 1776 of Lecture Notes in Computer Science. Edited by: Gonnet GH, Panario D, Viola A. 2000, 88-94. full_text. Springer"},{"key":"91_CR40","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1642\/0004-8038(2002)119[0088:SSCPEO]2.0.CO;2","volume":"119","author":"M Kennedy","year":"2002","unstructured":"Kennedy M, Page R: Seabird supertrees: combining partial estimates of procellariiform phylogeny. The Auk. 2002, 119: 88-108. 10.1642\/0004-8038(2002)119[0088:SSCPEO]2.0.CO;2","journal-title":"The Auk"},{"key":"91_CR41","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1017\/S0952836904005539","volume":"264","author":"M Cardillo","year":"2004","unstructured":"Cardillo M, Bininda-Emonds ORP, Boakes E, Purvis A: A species-level phylogenetic supertree of marsupials. Journal of Zoology. 2004, 264: 11-31. 10.1017\/S0952836904005539","journal-title":"Journal of Zoology"},{"key":"91_CR42","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1186\/1471-2148-6-93","volume":"6","author":"R Beck","year":"2006","unstructured":"Beck R, Bininda-Emonds O, Cardillo M, Liu FG, Purvis A: A higher-level MRP supertree of placental mammals. BMC Evolutionary Biology. 2006, 6: 93- 10.1186\/1471-2148-6-93","journal-title":"BMC Evolutionary Biology"},{"key":"91_CR43","first-page":"277","volume-title":"Advances in Legume Systematics","author":"M Wojciechowski","year":"2000","unstructured":"Wojciechowski M, Sanderson M, Steele K, Liston A: Molecular phylogeny of the \"Temperate Herbaceous Tribes\" of Papilionoid legumes: a supertree approach. Advances in Legume Systematics. Edited by: Herendeen P, Bruneau A. 2000, 9: 277-298. Kew: Royal Botanic Gardens"},{"key":"91_CR44","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1111\/j.1096-0031.1999.tb00277.x","volume":"15","author":"KC Nixon","year":"1999","unstructured":"Nixon KC: The parsimony ratchet: a new method for rapid parsimony analysis. Cladistics. 1999, 15: 407-414. 10.1111\/j.1096-0031.1999.tb00277.x","journal-title":"Cladistics"},{"key":"91_CR45","volume-title":"PAUPRat: PAUP* implementation of the parsimony ratchet","author":"DS Sikes","year":"2001","unstructured":"Sikes DS, Lewis PO: PAUPRat: PAUP* implementation of the parsimony ratchet. 2001"},{"issue":"5","key":"91_CR46","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1080\/10635150590950362","volume":"54","author":"M Wilkinson","year":"2005","unstructured":"Wilkinson M, Pisani D, Cotton JA, Corfe I: Measuring Support and Finding Unsupported Relationships in Supertrees. Syst Biol. 2005, 54 (5): 823-831. 10.1080\/10635150590950362","journal-title":"Syst Biol"},{"key":"91_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-2330-9","volume-title":"Phylogenetic supertrees","author":"(Ed) Bininda-Emonds OR","year":"2004","unstructured":"Bininda-Emonds OR (Ed): Phylogenetic supertrees. 2004, Springer Verlag"},{"issue":"4","key":"91_CR48","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TCBB.2006.58","volume":"3","author":"S Snir","year":"2006","unstructured":"Snir S, Rao S: Using Max Cut to Enhance Rooted Trees Consistency. IEEE\/ACM Trans. Comput. Biology Bioinform. 2006, 3 (4): 323-333. 10.1109\/TCBB.2006.58","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform"},{"issue":"1557","key":"91_CR49","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1098\/rspb.2004.2864","volume":"271","author":"CJ Creevey","year":"2004","unstructured":"Creevey CJ, Fitzpatrick DA, Gayle K Philip RJK, O'Connell MJ, Pentony MM, Travers SA, Wilkinson M, McInerney JO: Does a tree-like phylogeny only exist at the tips in the prokaryotes?. Proc Biol Sci. 2004, 271 (1557): 2551-2558. 10.1098\/rspb.2004.2864","journal-title":"Proc Biol Sci"},{"key":"91_CR50","first-page":"185","volume-title":"Bioconsensus, Volume 61 of DIMACS: Series in Discrete Mathematics and Theoretic Computer Science, Providence, Rhode Island, USA: American Mathematical Society","author":"JL Thorley","year":"2003","unstructured":"Thorley JL, Wilkinson M: A View of Supertree Methods. Bioconsensus, Volume 61 of DIMACS: Series in Discrete Mathematics and Theoretic Computer Science, Providence, Rhode Island, USA: American Mathematical Society. 2003, 185-193."},{"issue":"2","key":"91_CR51","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/TCBB.2009.7","volume":"6","author":"MS Bansal","year":"2009","unstructured":"Bansal MS, Eulenstein O, Wehe A: The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches. IEEE\/ACM Transactions on Computational Biology and Bioinformatics. 2009, 6 (2): 221-231. 10.1109\/TCBB.2009.7","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"91_CR52","volume-title":"PhD thesis","author":"D Bryant","year":"1997","unstructured":"Bryant D: Building trees, hunting for trees, and comparing trees: Theory and methods in phylogenetic analysis. PhD thesis. 1997, Dept. of Mathematics, University of Canterbury"},{"key":"91_CR53","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: 243-250. 10.1080\/10635150802033014","journal-title":"Syst. Biol"},{"issue":"3","key":"91_CR54","first-page":"459","volume":"11","author":"MK Kuhner","year":"1994","unstructured":"Kuhner MK, Felsenstein J: A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates [published erratum appears in Mol Biol Evol 1995 May;12(3):525]. Mol Biol Evol. 1994, 11 (3): 459-468.","journal-title":"Mol Biol Evol"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-5-18.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T12:44:24Z","timestamp":1711284264000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-5-18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,24]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["91"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-5-18","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,24]]},"assertion":[{"value":"27 June 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2010","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2010","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"18"}}