On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences
SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Experimenting an approximation algorithm for the LCS
Discrete Applied Mathematics
A large neighborhood search heuristic for the longest common subsequence problem
Journal of Heuristics
Finding the longest common subsequence for multiple biological sequences by ant colony optimization
Computers and Operations Research
Beam search for the longest common subsequence problem
Computers and Operations Research
Probabilistic beam search for the longest common subsequence problem
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
A hyper-heuristic for the Longest Common Subsequence problem
Computational Biology and Chemistry
| Hi-index | 0.00 |
The problem of finding the longest common subsequence (LCS) for an arbitrary number of sequences is a very interesting and challenging problem in computer science. This problem is NP-complete, but because of its importance, many heuristic algorithms have been proposed, such as Long Run, Expansion Algorithm and THSB. However, the performance, either in result quality or in process time, of many current heuristic algorithms deteriorates fast when the number of sequences and sequence length increase. In this paper, we have proposed a post-process heuristic algorithm for the LCS problem, the Deposition and Extension Algorithm (DEA). This algorithm first generates common subsequence by ''sequence deposition'' based on fine tuning of search range, and then extends this common subsequence. The algorithm is proven to generate Common Subsequences (CSs) with guaranteed lengths. The experiments on different dataset showed that the results of DEA algorithm were better than those of Long Run and Expansion Algorithm, especially on many long sequences. The algorithm also had superior efficiency both in time and memory space.