Login / Signup
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.
Gerth Stølting Brodal
Rolf Fagerberg
Thomas Mailund
Christian N. S. Pedersen
Andreas Sand
Published in:
SODA (2013)
Keyphrases
</>
efficient algorithms for computing
tree edit distance
decision trees
distance measure
euclidean distance
tree structure
ordered labeled trees
data structure
distance computation
labeled trees
object recognition
distance function
hamming distance
minimum distance
tree construction