654 search results - page 7 / 131 » On the Approximation of Computing Evolutionary Trees |
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
WABI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number...
75
Voted
CPM
2000
Springer
15 years 2 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
IPL
2010
14 years 8 months ago
2010
89
Voted
BMCBI
2006
14 years 9 months ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...