On the longest path algorithm for reconstructing trees from distance matrices.
Lev ReyzinNikhil SrivastavaPublished in: Inf. Process. Lett. (2007)
Keyphrases
- preprocessing
- detection algorithm
- computational complexity
- distance matrix
- objective function
- optimal solution
- binary tree
- cost function
- dynamic programming
- experimental evaluation
- probabilistic model
- learning algorithm
- worst case
- tree construction
- times faster
- optimization algorithm
- computational cost
- np hard
- clustering method
- euclidean distance
- tree structure
- matching algorithm
- singular value decomposition
- hamming distance
- significant improvement
- minimum distance
- search space
- bayesian networks