Sciweavers

76 search results - page 1 / 16
» On the maximum quartet distance between phylogenetic trees
Sort
View
ISAAC
2001
Springer
125views Algorithms» more  ISAAC 2001»
13 years 10 months ago
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
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...
Gerth Stølting Brodal, Rolf Fagerberg, Chri...
WABI
2005
Springer
13 years 11 months ago
Computing the Quartet Distance Between Trees of Arbitrary Degree
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...
Chris Christiansen, Thomas Mailund, Christian N. S...
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
13 years 11 months ago
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung
APBC
2007
13 years 7 months ago
Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree
Martin Stig Stissing, Christian N. S. Pedersen, Th...
ALMOB
2006
81views more  ALMOB 2006»
13 years 5 months ago
Fast calculation of the quartet distance between trees of arbitrary degrees
Chris Christiansen, Thomas Mailund, Christian N. S...