Probabilistic beam search for the longest common subsequence problem

Authors:
Christian Blum;Maria J. Blesa
Affiliations:
ALBCOM, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain;ALBCOM, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain
Venue:
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Year:
2007

Citing 7
Cited 4

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
Experimenting an approximation algorithm for the LCS

Discrete Applied Mathematics
Data Structures and Algorithms

Data Structures and Algorithms
A Survey of Longest Common Subsequence Algorithms

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling

Computers and Operations Research
A probabilistic beam search approach to the shortest common supersequence problem

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization

Beam search for the longest common subsequence problem

Computers and Operations Research
Research article: Deposition and extension approach to find longest common subsequence for thousands of long sequences

Computational Biology and Chemistry
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding the common part of a set of strings has many important applications, for example, in pattern recognition or computational biology. In computer science, this problem is known as the longest common subsequence problem. In this work we present a probabilistic beam search approach to solve this classical problem. To our knowledge, this algorithm is the first stochastic local search algorithm proposed for this problem. The results show the great potential of our algorithm when compared to existing heuristic methods.