654 search results - page 7 / 131 » On the Approximation of Computing Evolutionary Trees |
142
Voted
FOCS
1998
IEEE
15 years 12 months ago
1998
IEEE
177
click to vote
WABI
2005
Springer
16 years 1 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...
190
click to vote
CPM
2000
Springer
16 years 1 days 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...
242
click to vote
BMCBI
2006
15 years 7 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...