Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Linear-Time Majority Tree Algorithm Nina Amenta1
 

Summary: A Linear-Time Majority Tree Algorithm
Nina Amenta1
, Frederick Clarke2
, and Katherine St. John2,3
1
Computer Science Department
University of California, 2063 Engineering II
One Sheilds Ave, Davis, CA 95616.
amenta@cs.ucdavis.edu
2
Dept. of Mathematics & Computer Science
Lehman College­ City University of New York
Bronx, NY 12581
fclarke72@aol.com, stjohn@lehman.cuny.edu
3
Department of Computer Science
CUNY Graduate Center, New York, NY 10016
Abstract. 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-

  

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

 

Collections: Biology and Medicine; Computer Technologies and Information Sciences