Sciweavers

9 search results - page 1 / 2
» Computing the Quartet Distance between Evolutionary Trees in...
Sort
View
ISAAC
2001
Springer
125views Algorithms» more  ISAAC 2001»
13 years 9 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 10 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...
APBC
2007
13 years 6 months ago
Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree
Martin Stig Stissing, Christian N. S. Pedersen, Th...
RECOMB
2010
Springer
13 years 3 months ago
Detecting Highways of Horizontal Gene Transfer
Abstract. In a horizontal gene transfer (HGT) event a gene is transferred between two species that do not share an ancestor-descendant relationship. Typically, no more than a few g...
Mukul S. Bansal, J. Peter Gogarten, Ron Shamir
ICALP
2007
Springer
13 years 11 months ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...