Quick-MLCS: a new algorithm for the multiple longest common subsequence problem.
Majid SazvarMahmoud NaghibzadehNayyereh SaadatiPublished in: C3S2E (2012)
Keyphrases
- dynamic programming
- beam search
- times faster
- computational complexity
- preprocessing
- optimization algorithm
- computational cost
- segmentation algorithm
- learning algorithm
- search strategy
- np hard
- optimal solution
- simulated annealing
- particle swarm optimization
- probabilistic model
- detection algorithm
- cost function
- convergence rate
- genetic algorithm