An efficient algorithm to locate all locally optimal alignments between two sequences allowing for gaps.
Geoffrey J. BartonPublished in: Comput. Appl. Biosci. (1993)
Keyphrases
- locally optimal
- globally optimal
- dynamic programming
- objective function
- sequence alignment
- experimental evaluation
- preprocessing
- computational complexity
- k means
- np hard
- computational cost
- learning algorithm
- improved algorithm
- optimization algorithm
- recognition algorithm
- times faster
- multiple sequence alignment
- memory efficient
- long sequences
- matching algorithm
- tree structure
- detection algorithm
- computationally efficient
- particle swarm optimization
- optimal solution
- highly efficient
- expectation maximization
- scheduling problem
- hidden markov models
- search space