A hyper-heuristic for the Longest Common Subsequence problem
- 1 February 2012
- journal article
- research article
- Published by Elsevier in Computational Biology and Chemistry
- Vol. 36, 42-54
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Beam search for the longest common subsequence problemComputers & Operations Research, 2009
- A large neighborhood search heuristic for the longest common subsequence problemJournal of Heuristics, 2007
- A fast parallel algorithm for finding the longest common sequence of multiple biosequencesBMC Bioinformatics, 2006
- SUPERSEQUENCES OF MASKS FOR OLIGO-CHIPSJournal of Bioinformatics and Computational Biology, 2004
- Experimenting an approximation algorithm for the LCSDiscrete Applied Mathematics, 2001
- On the Approximation of Shortest Common Supersequences and Longest Common SubsequencesSIAM Journal on Computing, 1995
- Performance analysis of some simple heuristics for computing longest common subsequencesAlgorithmica, 1994
- Sparse dynamic programming IIJournal of the ACM, 1992
- Computing a longest common subsequence for a set of stringsBIT Numerical Mathematics, 1984
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975