An enhanced beam search algorithm for the Shortest Common Supersequence Problem

Authors:
Sayyed Rasoul Mousavi;Fateme Bahri;Farzaneh Sadat Tabataba
Affiliations:
Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan 84156-83111, Iran;Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan 84156-83111, Iran;Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan 84156-83111, Iran
Venue:
Engineering Applications of Artificial Intelligence
Year:
2012

Citing 16
Cited 0

Multiple-query optimization

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

Data compression: methods and theory
Theory and algorithms for plan merging

Artificial Intelligence
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences

SIAM Journal on Computing
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
An ACO algorithm for the shortest common supersequence problem

New ideas in optimization
An approximation algorithm for the shortest common supersequence problem: an experimental analysis

Proceedings of the 2001 ACM symposium on Applied computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
An approximate A* algorithm and its application to the SCS problem

Theoretical Computer Science
Beam search for the longest common subsequence problem

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
Efficient stochastic local search algorithm for solving the shortest common supersequence problem

Proceedings of the 12th annual conference on Genetic and evolutionary computation
An improved algorithm for the longest common subsequence problem

Computers and Operations Research
On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Shortest Common Supersequence Problem asks to obtain a shortest string that is a supersequence of every member of a given set of strings. It has applications, among others, in data compression and oligonucleotide microarray production. The problem is NP-hard, and the existing exact solutions are impractical for large instances. In this paper, a new beam search algorithm is proposed for the problem, which employs a probabilistic heuristic and uses the dominance property to further prune the search space. The proposed algorithm is compared with three recent algorithms proposed for the problem on both random and biological sequences, outperforming them all by quickly providing solutions of higher average quality in all the experimental cases. The Java source and binary files of the proposed IBS_SCS algorithm and our implementation of the DR algorithm and all the random and real datasets used in this paper are freely available upon request.