Login / Signup
An O(n log n) time Algorithm for computing the Path-length Distance between Trees.
David Bryant
Céline Scornavacca
Published in:
CoRR (2018)
Keyphrases
</>
path length
worst case
learning algorithm
dynamic programming
np hard
distance metric
simulated annealing
detection algorithm
computational complexity
expectation maximization
distance function
distance transform
hamming distance
minimum distance
tree edit distance