An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees.
David BryantCéline ScornavaccaPublished in: Algorithmica (2019)
Keyphrases
- path length
- detection algorithm
- worst case
- dynamic programming
- tree structure
- distance matrix
- k means
- distance transform
- expectation maximization
- np hard
- learning algorithm
- optimal solution
- search space
- tree edit distance
- objective function
- small world
- unordered trees
- distance function
- distance measure
- simulated annealing
- lower bound
- computational complexity