Multiple-sequence BM algorithm can be replaced by a succession of single-sequence BM algorithm.
Shojiro SakataPublished in: ISIT (2005)
Keyphrases
- learning algorithm
- times faster
- detection algorithm
- dynamic programming
- improved algorithm
- preprocessing
- np hard
- experimental evaluation
- k means
- segmentation algorithm
- long sequences
- sequence alignment
- recognition algorithm
- convergence rate
- search space
- computational cost
- high accuracy
- clustering method
- data sets
- pseudorandom
- objective function
- optimal solution
- computational complexity
- cost function
- ant colony optimization
- optimization algorithm
- worst case
- theoretical analysis
- computationally efficient
- particle swarm optimization
- input data