Improving the sampling process in the interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem.
Carlile LavorMichael SouzaLuiz Mariano CarvalhoDouglas Soares GonçalvesAntonio MucherinoPublished in: Appl. Math. Comput. (2021)
Keyphrases
- preprocessing
- search space
- k means
- np hard
- dynamic programming
- matching algorithm
- experimental evaluation
- computational cost
- learning algorithm
- probabilistic model
- segmentation algorithm
- high accuracy
- objective function
- recognition algorithm
- distance metric
- theoretical analysis
- particle swarm optimization
- worst case
- significant improvement
- computational complexity
- linear programming
- distance function
- tree structure
- search algorithm
- distance transform
- improved algorithm
- pruning strategy