A linear-time majority tree algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2812, Issue , 2003, Pages 216-227

  Amenta, Nina ^a   Clarke, Frederick ^b   St John, Katherine ^b,c  

^a Davis   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGY; CLUSTERING ALGORITHMS; VISUALIZATION;

CONSENSUS TREES; INTERACTIVE VISUALIZATION SYSTEMS; LINEAR-TIME ALGORITHMS; PHYLOGENETIC TREES; POST PROCESSING; REAL TIME INTERACTIONS; SUCCINCT REPRESENTATION; TREE RECONSTRUCTION;

TREES (MATHEMATICS);

EID: 35248827290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39763-2_17     Document Type: Article

References (18)

1. Nina Amenta and Jeff Klingner. Case study: Visualizing sets of evolutionary trees. In 8th IEEE Symposium on Information Visualization (Info Vis 2002), pages 71-74, 2002. Software available at www.cs.utexas.edu/users/phylo/.
2. B.R. Baum. Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. Taxon, 41:3-10, 1992.
3. David Bryant. Hunting for trees, building trees and comparing trees: theory and method in phylogenetic analysis. PhD thesis, Dept. of Mathematics, University of Canterbury, 1997.
4. J. Lawrence Carter and Mark N. Wegman. Universal classes of hash functions. Journal of Computer and Systems Sciences, 18(2):143-154, 1979.
5. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to algorithms. MIT Press, Cambridge, MA, second edition, 2001.
6. William H.E. Day. Optimal algorithms for comparing trees with labeled leaves. J. Classification, 2(1):7-28, 1985.
7. Martin Farach, Teresa M. Przytycka, and Mikkel Thorup. On the agreement of many trees. Information Processing Letters, 55(6):297-301, 1995.
8. J. Felsenstein. Phylip (phylogeny inference package) version 3.6, 2002. Distributed by the author. Department of Genetics, University of Washington, Seattle. The consensus tree code is in consense.c and is co-authored by Hisashi Horino, Akiko Fuseki, Sean Lamont and Andrew Keeffe.
9. John P. Huelsenbeck and Fredrik Ronquist. MrBayes: Bayesian inference of phylogeny, 2001.
10. W.P. Maddison and D.R. Maddison. Mesquite: a modular system for evolutionary analysis. version 0.992, 2002. Available from http://mesquiteproject.org.
11. T. Margush and F.R. McMorris. Consensus n-trees. Bulletin of Mathematical Biology, 43:239-244, 1981.
12. F.R. McMorris, D.B. Meronk, and D.A. Neumann. A view of some consensus methods for trees. In Numerical Taxonomy: Proceedings of the NATO Advanced Study Institute on Numerical Taxonomy. Springer-Verlag, 1983.
13. R.D.M. Page. Modified mincut supertrees. Lecture Notes in Computer Science (WABI 2002), 2452:537-551, 2002.
14. M.A. Ragan. Phylogenetic inference based on matrix representation of trees. Molecular Phylogenetics and Evolution, 1:53-58, 1992.
15. M.J. Sanderson, A. Purvis, and C. Henze. Phylogenetic supertrees: assembling the trees of life. Trends in Ecology and Evolution, 13:105-109, 1998.
16. Charles Semple and Mike Steel. A supertree method for rooted trees. Discrete Applied Mathematics, 105(1-3):147-158, 2000.
17. D.L. Swofford. PAUP*. Phylogenetic Analysis Using Parsimony (*and Other Methods). Version 4. Sinauer Associates, Sunderland, Massachusetts, 2002.
18. l consensus trees, 1985. BS honors thesis, CS, Memorial University Newfoundland.