Beam-ACO for the Repetition-Free Longest Common Subsequence Problem

In this paper we propose a Beam-ACO approach for a combinatorial optimization problem known as the repetition-free longest common subsequence problem. Given two input sequences \(x\) and \(y\) over a finite alphabet \(\varSigma \), this problem concerns to find a longest common subsequence of \(x\) and \(y\) in which no letter is repeated. Beam-ACO algorithms are combinations between the metaheuristic ant colony optimization and a deterministic tree search technique called beam search. The algorithm that we present is an adaptation of a previously published Beam-ACO algorithm for the classical longest common subsequence problem. The results of the proposed algorithm outperform existing heuristics from the literature.

[1]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[2]  Bryant A. Julstrom,et al.  Starting from Scratch: Growing Longest Common Subsequences with Evolution , 2006, PPSN.

[3]  Bin Ma,et al.  A General Edit Distance between RNA Structures , 2002, J. Comput. Biol..

[4]  Paola Bonizzoni,et al.  Variants of constrained longest common subsequence , 2009, Inf. Process. Lett..

[5]  James A. Storer,et al.  Data Compression: Methods and Theory , 1987 .

[6]  Shyong Jian Shyu,et al.  Finding the longest common subsequence for multiple biological sequences by ant colony optimization , 2009, Comput. Oper. Res..

[7]  Edmund K. Burke,et al.  Parallel Problem Solving from Nature - PPSN IX: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Proceedings , 2006, PPSN.

[8]  Carlos Eduardo Ferreira,et al.  Repetition-free longest common subsequence , 2010, Discret. Appl. Math..

[9]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[10]  David Maier,et al.  The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.

[11]  Christian Blum.  Beam-ACO for the longest common subsequence problem , 2010, IEEE Congress on Evolutionary Computation.

[12]  Todd Easton,et al.  A large neighborhood search heuristic for the longest common subsequence problem , 2008, J. Heuristics.

[13]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[14]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[15]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).