A hybrid algorithm for the longest common transposition-invariant subsequence problem.
Sebastian DeorowiczSzymon GrabowskiPublished in: Comput. Informatics (2009)
Keyphrases
- hybrid algorithm
- simulated annealing
- particle swarm optimization
- ant algorithm
- tabu search
- imperialist competitive algorithm
- genetic algorithm
- artificial bee colony algorithm
- pattern matching
- particle swarm optimization pso
- differential evolution
- premature convergence
- hybrid method
- optimal solution
- standard test problems
- ant colony optimization
- hybrid algorithms
- evolutionary algorithm
- dynamic time warping
- approximation algorithms
- initial population
- suffix array
- particle swarm algorithm
- biogeography based optimization
- particle swarm optimization algorithm
- particle swarm
- traveling salesman problem
- hybrid optimization algorithm
- optimization algorithm