A randomized algorithm for comparing sets of phylogenetic trees

Series on Advances in Bioinformatics and Computational Biology

Volumn 5, Issue , 2007, Pages 121-130

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

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; EVOLUTIONARY ALGORITHMS;

DISTANCE MATRICES; EVOLUTIONARY RELATIONSHIPS; EVOLUTIONARY TREE; PHYLOGENETIC ANALYSIS; PHYLOGENETIC TREES; POST-PROCESSING TECHNIQUES; RANDOMIZED ALGORITHMS; UNIVERSAL HASHING;

TREES (MATHEMATICS);

EID: 84856978056     PISSN: 17516404     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1142/9781860947995_0015     Document Type: Conference Paper

References (16)

1. N. Amenta, F. Clarke, and K. S. John. A linear-time majority tree algorithm. In Workshop on Algorithms in Bioinformatics, volume 2168 of Lecture Notes in Computer Science, pages 216- 227, 2003.
2. D. Bryant. A classification of consensus methods for phylogenetics. In M. Janowitz, F. Lapointe, F. McMorris, B. Mirkin, and F. Roberts, editors, Bioconsensus, volume 61 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, pages 163-184. American Mathematical Society, DIMACS, 2003.
3. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and Systems Sciences, 18(2):143-154, 1979.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT Press, Inc., 2001.
5. W. H. E. Day. Optimal algorithms for comparing trees with labeled leaves. Journal Of Classification, 2:7-28, 1985.
6. J. Felsenstein. Phylogenetic inference package (PHYLIP), version 3.2. Cladistics, 5:164-166, 89.
7. D. M. Hillis, T. A. Heath, and K. S. John. Analysis and visualization of tree space. Syst. Biol, 54(3):471-482, 2004.
8. W. P. Maddison and D. R. Maddison. Mesquite: a modular system for evolutionary analyses. Version 1.11, 2006. http://mesquiteproject.org.
9. T. Mailund. SplitDist-calculating split-distances for sets of trees. Available from http://www.daimi.au.dk/ mailund/split-dist.html.
10. N. D. Pattengale and B. M. E. Moret. A sublinear-time randomized approximation scheme for the robinson-foulds metric". In Proc. 10th Int'l Conf. on Research in Comput. Molecular Biol. (RECOMB'06), volume 3909 of Lecture Notes in Computer Science, pages 221-230, 2006.
11. K. Rice, M. Donoghue, and R. Olmstead. Analyzing large datasets: rbcL 500 revisited. Systematic Biology, 46(3):554-563, 1997.
12. D. F. Robinson and L. R. Foulds. Comparison of phylogenetic trees. Mathematical Biosciences, 53:131-147, 1981.
13. U. Roshan, B. M. E. Moret, T. L. Williams, and T. Warnow. Rec-I-DCM3: a fast algorithmic techniques for reconstructing large phylogenetic trees. In Proc. IEEE Computer Society Bioinformatics Conference (CSB 2004), pages 98-109. IEEE Press, 2004.
14. C. Stockham, L. S. Wang, and T. Warnow. Statistically based postprocessing of phylogenetic analysis by clustering. In Proceedings of 10th Int'l Conf. on Intelligent Systems for Molecular Biology (ISMB'02), pages 285-293, 2002.
15. D. L. Swofford. PAUP: Phylogenetic analysis using parsimony (and other methods), 2002. Sinauer Associates, Underland, Massachusetts, Version 4.0.
16. J. Wuyts, Y. V. de Peer, T. Winkelmans, and R. D. Wachter. The European database on small subunit ribosomal RNA. Nucleic Acids Research, 30:183-185, 2002.