A Linear-Time Majority Tree Algorithm
We give a randomized linear-time algorithm for computing the majority rule consensus tree. The majority rule tree is widely used for summarizing a set of phylogenetic trees, which is usually a post-processing step in constructing a phylogeny. We are implementing the algorithm as part of an interactive visualization system for exploring distributions of trees, where speed is a serious concern for real-time interaction. The linear running time is achieved by using succinct representation of the subtrees and efficient methods for the final tree reconstruction.
KeywordsHash Function Majority Rule Consensus Tree Hash Table Input Tree
Unable to display preview. Download preview PDF.
- 1.Amenta, N., Klingner, J.: Case study: Visualizing sets of evolutionary trees. In: 8th IEEE Symposium on Information Visualization (InfoVis 2002), pp. 71–74 (2002), Software available at http://www.cs.utexas.edu/users/phylo/
- 3.Bryant, D.: Hunting for trees, building trees and comparing trees: theory and method in phylogenetic analysis. PhD thesis, Dept. of Mathematics, University of Canterbury (1997)Google Scholar
- 8.Felsenstein, J.: Phylip (phylogeny inference package) version 3.6, 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 (2002)Google Scholar
- 9.Huelsenbeck, J.P., Ronquist, F.: MrBayes: Bayesian inference of phylogeny (2001)Google Scholar
- 10.Maddison, W.P., Maddison, D.R.: Mesquite: a modular system for evolutionary analysis. version 0.992 (2002), Available from http://mesquiteproject.org
- 12.McMorris, F.R., Meronk, D.B., Neumann, D.A.: A view of some consensus methods for trees. In: Numerical Taxonomy: Proceedings of the NATO Advanced Study Institute on Numerical Taxonomy. Springer, Heidelberg (1983)Google Scholar
- 17.Swofford, D.L.: PAUP*. Phylogenetic Analysis Using Parsimony (*and Other Methods). Version 4. Sinauer Associates, Sunderland, Massachusetts (2002)Google Scholar
- 18.Wareham, H.T.: An efficient algorithm for computing Ml consensus trees, BS honors thesis, CS, Memorial University Newfoundland (1985)Google Scholar