Beam search for the longest common subsequence problem

Authors:
Christian Blum;Maria J. Blesa;Manuel López-Ibáñez
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;School of Engineering and The Built Environment, Napier University, Edinburgh, UK
Venue:
Computers and Operations Research
Year:
2009

Citing 14
Cited 7

Multiple-query optimization

ACM Transactions on Database Systems (TODS)
Data compression: methods and theory

Data compression: methods and theory
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 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)
Ant Colony Optimization

Ant Colony Optimization
Area-efficient instruction set synthesis for reconfigurable system-on-chip designs

Proceedings of the 41st annual Design Automation Conference
Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time

Computers and Industrial Engineering
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
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

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

Computational Biology and Chemistry
On solving the assembly line worker assignment and balancing problem via beam search

Computers and Operations Research
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
An enhanced beam search algorithm for the Shortest Common Supersequence Problem

Engineering Applications of Artificial Intelligence
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

Quantified Score

Hi-index	0.02

Visualization

Abstract

The longest common subsequence problem is a classical string problem that concerns finding the common part of a set of strings. It has several important applications, for example, pattern recognition or computational biology. Most research efforts up to now have focused on solving this problem optimally. In comparison, only few works exist dealing with heuristic approaches. In this work we present a deterministic beam search algorithm. The results show that our algorithm outperforms the current state-of-the-art approaches not only in solution quality but often also in computation time.