Introduction of a distance cut-off into structural alignment by the double dynamic programming algorithm.
Hiroyuki TohPublished in: Comput. Appl. Biosci. (1997)
Keyphrases
- dynamic programming
- preprocessing
- experimental evaluation
- sequence alignment
- cost function
- learning algorithm
- worst case
- search space
- computational complexity
- optimal solution
- k means
- np hard
- computational cost
- times faster
- objective function
- knn
- high accuracy
- simulated annealing
- distance metric
- matching algorithm
- multiple sequence alignment
- convergence rate
- clustering method
- detection algorithm
- optimization algorithm
- segmentation algorithm
- search algorithm
- reinforcement learning