A large neighborhood search heuristic for the longest common subsequence problem
- 18 August 2007
- journal article
- Published by Springer Nature in Journal of Heuristics
- Vol. 14 (3) , 271-283
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Area-efficient instruction set synthesis for reconfigurable system-on-chip designs2004
- New approximation algorithms for longest common subsequences2002
- A survey of longest common subsequence algorithms2002
- A survey of very large-scale neighborhood search techniquesDiscrete Applied Mathematics, 2002
- Experimenting an approximation algorithm for the LCSDiscrete Applied Mathematics, 2001
- Computing similarity between RNA strings1995
- Sparse dynamic programming IIJournal of the ACM, 1992
- Two algorithms for the longest common subsequence of three (or more) stringsLecture Notes in Computer Science, 1992
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977