Sciweavers

2 search results - page 1 / 1
» Evolutionary Trees and Ordinal Assertions
Sort
View
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 4 months ago
Evolutionary Trees and Ordinal Assertions
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
Paul E. Kearney, Ryan Hayward, Henk Meijer
ESA
1999
Springer
82views Algorithms» more  ESA 1999»
13 years 8 months ago
Quartet Cleaning: Improved Algorithms and Simulations
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...
Vincent Berry, Tao Jiang, Paul E. Kearney, Ming Li...