Sciweavers

91 search results - page 1 / 19
» A supertree method for rooted trees
Sort
View
DAM
2000
86views more  DAM 2000»
13 years 4 months ago
A supertree method for rooted trees
Abstract. The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree is a central problem in several areas of classification, particularly...
Charles Semple, Mike A. Steel
WABI
2010
Springer
168views Bioinformatics» more  WABI 2010»
13 years 2 months ago
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
Abstract. A recursive algorithm by Aho, Sagiv, Szymanski, and Ullman [1] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by...
Jesper Jansson, Richard S. Lemence, Andrzej Lingas
WABI
2010
Springer
141views Bioinformatics» more  WABI 2010»
13 years 3 months ago
An Experimental Study of Quartets MaxCut and Other Supertree Methods
Although many supertree methods have been developed in the last few decades, none has been shown to produce more accurate trees than the popular Matrix Representation with Parsimon...
M. Shel Swenson, Rahul Suri, C. Randal Linder, Tan...
WABI
2009
Springer
117views Bioinformatics» more  WABI 2009»
13 years 11 months ago
A Simulation Study Comparing Supertree and Combined Analysis Methods Using SMIDGen
Background: Supertree methods comprise one approach to reconstructing large molecular phylogenies given multi-marker datasets: trees are estimated on each marker and then combined...
M. Shel Swenson, François Barbançon,...
JAIR
2008
94views more  JAIR 2008»
13 years 4 months ago
The Ultrametric Constraint and its Application to Phylogenetics
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phyl...
Neil C. A. Moore, Patrick Prosser