A Polynomial-Time Algorithm Computing Lower and Upper Bounds of the Rooted Subtree Prune and Regraft Distance.
Lavanya KannanHua LiArcady R. MushegianPublished in: J. Comput. Biol. (2011)
Keyphrases
- euclidean distance
- distance function
- lower and upper bounds
- distance measure
- distance matrix
- worst case
- computational complexity
- search space
- upper bound
- tree structure
- learning algorithm
- mathematical model
- lower bound
- linear programming
- ant colony optimization
- np hard
- upper and lower bounds
- dynamic programming
- convex hull
- distance transform
- objective function
- data sets