An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree.
Bang Ye WuChuan Yi TangPublished in: Inf. Process. Lett. (1997)
Keyphrases
- dynamic programming
- optimal solution
- learning algorithm
- worst case
- tree structure
- cost function
- preprocessing
- search space
- significant improvement
- maximum distance
- spanning tree
- closed form
- optimization algorithm
- np hard
- computational complexity
- particle swarm optimization
- detection algorithm
- clustering method
- simulated annealing
- matching algorithm
- computational cost
- binary tree
- distance matrix
- binary search trees