Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Randomized Linear-time Majority Tree Algorithm Nina Amenta
 

Summary: A Randomized Linear-time Majority Tree Algorithm
Nina Amenta
Frederick Clarke
Katherine St. John
Abstract
We give a randomized linear-time algorithm for computing the
majority tree, a technique widely used for summarizing sets of
phylogenetic trees. We are implementing the algorithm as part
of an interactive visualization system for analyzing large sets of
trees.
(Keywords: phylogeny, majority consensus, visualization)
With the recent explosion in the amount of genomic
data available, and exponential increases in computing
power, biologists are now able to consider larger scale
problems in phylogeny, such as the construction of evo-
lutionary trees on hundreds or thousands of taxa, and ul-
timately of the entire "Tree of Life" which would include
millions of taxa. One difficulty is that most programs used
for phylogeny reconstruction [6, 7, 11] are based upon
heuristics for NP-hard optimization problems which gen-

  

Source: Amenta, Nina - Department of Computer Science, University of California, Davis

 

Collections: Biology and Medicine; Computer Technologies and Information Sciences