On the optimality of the neighbor-joining algorithm.
Kord EickmeyerPeter HugginsLior PachterRuriko YoshidaPublished in: Algorithms Mol. Biol. (2008)
Keyphrases
- optimal solution
- preprocessing
- significant improvement
- dynamic programming
- single pass
- tree structure
- detection algorithm
- optimization algorithm
- high accuracy
- improved algorithm
- objective function
- k means
- probabilistic model
- computational complexity
- recognition algorithm
- memory requirements
- cost function
- np hard
- times faster
- clustering method
- convergence rate
- matching algorithm
- artificial neural networks
- experimental study
- input data
- simulated annealing
- image segmentation
- worst case
- experimental evaluation