Index
A, B, C
- ant colony optimization
- branch & bound
- combinatorial optimization
- consensus string
- Construct, merge, solve & adapt
D, E, F
- DNA sequencing
- dynamic programming
- evolutionary algorithm
- founder sequence reconstruction problem
G, H, I
- genetic algorithm
- greedy randomized adaptive search procedure
- hybrid metaheuristic
- integer
- linear programming
- programming
- Iterated local search
L, M, S
- large neighborhood search
- longest common subsequence
- minimum common string partition
- most strings with few bad columns
- multiple sequence alignment
- simulated annealing
T, U, V
- Tabu search
- traveling salesman problem
- unbalanced minimum common string partition
- variable neighborhood search
Get Metaheuristics for String Problems in Bio-informatics now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
