Using tree diversity to compare phylogenetic heuristics

BMC Bioinformatics

Volumn 10, Issue SUPPL. 4, 2009, Pages

  Sul, Seung Jin ^a   Matthews, Suzanne ^a   Williams, Tiffani L ^a  

^a Texas AandM University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY-BASED METHODS; EVOLUTIONARY HISTORY; EVOLUTIONARY TREE; MAXIMUM PARSIMONY; PERFORMANCE MEASURE; ROBINSON-FOULDS DISTANCE; SEARCH ALGORITHMS; TREE DIVERSITY;

BIOLOGY; TOPOLOGY;

FORESTRY;

CONFERENCE PAPER; CONTROLLED STUDY; ENTROPY; EVOLUTIONARY ALGORITHM; INFORMATION PROCESSING; INTERMETHOD COMPARISON; PARSIMONY ANALYSIS; PHYLOGENETIC TREE CONSTRUCTION METHOD; SCORING SYSTEM; ALGORITHM; ARTICLE; BIOLOGY; EVOLUTION; METHODOLOGY; PHYLOGENY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; EVOLUTION; PHYLOGENY;

EID: 65449148286     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-10-S4-S3     Document Type: Conference Paper

References (17)

1. Bader D Moret BM Vawter L Industrial Applications of High-Performance Computing for Phylogeny Reconstruction Proceedings of SPIE Commercial Applications for High-Performance Computing, Denver CO Siegel H 2001, 4528:159-168
2. Metzker ML Mindell DP Liu XM Ptak RG Gibbs RA Hillis DM Molecular evidence of HIV-1 transmission in a criminal case PNAS 2002, 99(2):14292-14297. 137877 12388776
3. Nixon KC The parsimony ratchet, a new method for rapid parsimony analysis Cladistics 1999, 15:407-414
4. Roshan U Moret BME Williams TL Warnow T A Fast Algorithmic Techniques for Reconstructing Large Phylogenetic Trees Proc IEEE Computer Society Bioinformatics Conference (CSB 2004) IEEE Press 2004:98-109
5. Bininda-Emonds O Parsimony Ratchet implementation for PAUP*4.0b10 using Perl 2003 http://www.uni-oldenburg.de/molekularesystematik/ download/goto.php?w=/Programs/perlRat.zip
6. Swofford DL PAUP*: Phylogenetic Analysis Using Parsimony (and Other Methods) Sinauer Associates, Underland, Massachusetts, Version 4.0 2002 12504223
7. Goloboff P Analyzing large data sets in reasonable times: Solutions for composite optima Cladistics 1999, 15:415-428
8. Robinson D Foulds L Comparison of weighted labelled trees Proc Sixth Austral Conf Lecture Notes in Mathematics, Springer-Verlag 1979, 748:119-126
9. Huson D Nettles S Warnow T Disk-covering, a fast-converging method for phylogenetic tree reconstruction Journal of Computational Biology 1999, 6:369-386. 10582573
10. Huson D Vawter L Warnow T Solving Large Scale Phylogenetic Problems using DCM2 Proc 7th Int'l Conf on Intelligent Systems for Molecular Biology (ISMB'99) AAAI Press 1999:118-129
11. Nakhleh L Roshan U St John K Sun J Warnow T Designing Fast Converging Phylogenetic Methods Proc 9th Int'l Conf on Intelligent Systems for Molecular Biology (ISMB'01) Bioinformatics, Oxford Univeristy Press 2001, 17:S190-S198
12. Deans AR Gillespie JJ Yoder MJ An evaluation of ensign wasp classification (Hymenoptera: Evanildae) based on molecular data and insights from ribosomal RNA secondary structure Syst Ento 2006, 31:517-528
13. Gillespie JJ McKenna CH Yoder MJ Gutell RR Johnston JS Kathirithamby J Cognato AI Assessing the odd secondary structural properties of nuclear small subunit ribosomal RNA sequences (18S) of the twisted-wing parasites (Insecta: Strepsiptera) Insect Mol Biol 2005, 14:625-643. 16313563
14. Rice K Donoghue M Olmstead R Analyzing large datasets: RbcL 500 revisited Systematic Biology 1997, 46(3):554-563. 11975333
15. Soltis DE Soltis PS Chase MW Mort ME Albach DC Zanis M Savolainen V Hahn WH Hoot SB Fay MF Axtell M Swensen SM Prince LM Kress WJ Nixon KC Farris JS Angiosperm phylogeny inferred from 18s rDNA, rbcL, and atpB sequences Botanical Journal of the Linnean Society 2000, 133:381-461
16. Sul SJ Williams TL A Randomized Algorithm for Comparing Sets of Phylogenetic Trees Proc Fifth Asia Pacific Bioinformatics Conference (APBC'07) 2007:121-130
17. Sul SJ Brammer G Williams TL Efficiently Computing Arbitrarily-Sized Robinson-Foulds Distance Matrices Workshop on Algorithms in Bioinformatics (WABI'08) Lecture Notes in Computer Science, Springer-Verlag 2008, 5251:123-134