A new approach to text searching
Communications of the ACM
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
The String-to-String Correction Problem
Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
New ideas in optimization
Ant algorithms for discrete optimization
Artificial Life
Experimenting an approximation algorithm for the LCS
Discrete Applied Mathematics
Meta-Heuristics: Theory and Applications
Meta-Heuristics: Theory and Applications
Essays and Surveys in Metaheuristics
Essays and Surveys in Metaheuristics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Ant System Applied to the Quadratic Assignment Problem
IEEE Transactions on Knowledge and Data Engineering
The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Two Algorithms for the Longest Common Subsequence of Three (or More) Strings
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
A Survey of Longest Common Subsequence Algorithms
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
A learning algorithm for the longest common subsequence problem
Journal of Experimental Algorithmics (JEA)
Ant colony optimization for the cell assignment problem in PCS networks
Computers and Operations Research
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant colony optimization for resource-constrained project scheduling
IEEE Transactions on Evolutionary Computation
Beam search for the longest common subsequence problem
Computers and Operations Research
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem
Fundamenta Informaticae
Computational Biology and Chemistry
A hybrid metaheuristic for the longest common subsequence problem
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
An improved algorithm for the longest common subsequence problem
Computers and Operations Research
A hyper-heuristic for the Longest Common Subsequence problem
Computational Biology and Chemistry
Fast algorithms for computing the constrained LCS of run-length encoded strings
Theoretical Computer Science
| Hi-index | 0.01 |
Finding the longest common subsequence (LCS) for a set of n (an arbitrary n2) sequences is an NP-hard problem. It is an essential operation for a wide range of applications in the areas of computational biology, pattern recognition, string editing and data compression, to name a few. In this paper, we design a novel ant colony optimization (ACO) algorithm to find the approximate solution to the LCS problem for multiple biological sequences. The performances of our ACO algorithm, the known expansion algorithm [Bonizzoni P, Vedova GD, Mauri G. Experimenting an approximation algorithm for the LCS. Discrete Applied Mathematics 2001;110:13-24] and best next for maximal available symbol algorithm [Huang KS, Yang CB, Tseng KT. Fast algorithms for finding the common subsequence of multiple sequences. In: Proceedings of international computer symposium; 2004. p. 90-95] were tested and compared by using various sets of DNA and protein sequences. The experimental results demonstrate the effectiveness and efficiency of the proposed ACO algorithm in dealing with the LCS problem for multiple biological sequences.