6 search results - page 1 / 2 » Computing the Quartet Distance Between Evolutionary Trees of... |
APBC
2007
13 years 8 months ago
2007
WABI
2005
Springer
14 years 18 days 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...
ISAAC
2001
Springer
13 years 11 months ago
2001
Springer
Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is an important tas...
WG
2004
Springer
14 years 13 days ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
JCB
2006
13 years 7 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...