Searching for repeats, as an example of using the generalised Ruzzo-Tompa algorithm to find optimal subsequences with gaps.
John L. SpougeLeonardo Mariño-RamírezSergey L. SheetlinPublished in: Int. J. Bioinform. Res. Appl. (2014)
Keyphrases
- optimal solution
- worst case
- times faster
- preprocessing
- cost function
- dynamic programming
- globally optimal
- computational complexity
- optimization algorithm
- computational cost
- experimental evaluation
- detection algorithm
- search space
- closed form
- learning algorithm
- hidden markov models
- k means
- matching algorithm
- improved algorithm
- genetic algorithm
- high accuracy
- linear programming
- video sequences
- data structure
- convex hull