The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances.
Carlile LavorLeo LibertiAntonio MucherinoPublished in: J. Glob. Optim. (2013)
Keyphrases
- dynamic programming
- experimental evaluation
- maximum distance
- distance function
- preprocessing
- search space
- high accuracy
- detection algorithm
- np hard
- optimal solution
- learning algorithm
- computational complexity
- times faster
- k means
- objective function
- optimization algorithm
- worst case
- computational cost
- recognition algorithm
- distance matrix
- distance map
- cost function
- distance measure
- probabilistic model
- neural network
- clustering method
- euclidean distance
- distance metric
- evolutionary algorithm
- video sequences
- geodesic distance
- data structure
- image sequences
- three dimensional
- relative distance