ACM Transactions on Database Systems (TODS)
Data compression: methods and theory
Data compression: methods and theory
Sparse dynamic programming II: convex and concave cost functions
Journal of the ACM (JACM)
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences
SIAM Journal on Computing
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Experimenting an approximation algorithm for the LCS
Discrete Applied Mathematics
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Two Algorithms for the Longest Common Subsequence of Three (or More) Strings
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Area-efficient instruction set synthesis for reconfigurable system-on-chip designs
Proceedings of the 41st annual Design Automation Conference
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
An Efficient Parallel Algorithm for the Multiple Longest Common Subsequence (MLCS) Problem
ICPP '08 Proceedings of the 2008 37th International Conference on Parallel Processing
Beam search for the longest common subsequence problem
Computers and Operations Research
Efficient dominant point algorithms for the multiple longest common subsequence (MLCS) problem
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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
Computational Biology and Chemistry
A Fast Multiple Longest Common Subsequence (MLCS) Algorithm
IEEE Transactions on Knowledge and Data Engineering
An improved algorithm for the longest common subsequence problem
Computers and Operations Research
Computing longest common subsequences with the B-cell algorithm
ICARIS'12 Proceedings of the 11th international conference on Artificial Immune Systems
| Hi-index | 0.00 |
The Longest Common Subsequence Problem is the problem of finding a longest string that is a subsequence of every member of a given set of strings. It has applications in FPGA circuit minimization, data compression, and bioinformatics, among others. The problem is NP-hard in its general form, which implies that no exact polynomial-time algorithm currently exists for the problem. Consequently, inexact algorithms have been proposed to obtain good, but not necessarily optimal, solutions in an affordable time. In this paper, a hyper-heuristic algorithm incorporated within a constructive beam search is proposed for the problem. The proposed hyper-heuristic is based on two basic heuristic functions, one of which is new in this paper, and determines dynamically which one to use for a given problem instance. The proposed algorithm is compared with state-of-the-art algorithms on simulated and real biological sequences. Extensive experimental reveals that the proposed hyper-heuristic is superior to the state-of-the-art methods with respect to the solution quality and the running-time.