Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem

Authors:
Sebastian Deorowicz
Affiliations:
Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland. E-mail: sebastian.deorowicz@polsl.pl
Venue:
Fundamenta Informaticae
Year:
2010

Citing 18
Cited 2

A bit-string longest-common-subsequence algorithm

Information Processing Letters
An improved algorithm to find the length of the longest common subsequence of two strings

ACM SIGIR Forum
A new approach to text searching

Communications of the ACM
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Bounds for the String Editing Problem

Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences

Communications of the ACM
A fast and practical bit-vector algorithm for the longest common subsequence problem

Information Processing Letters
Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment

CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
A Survey of Longest Common Subsequence Algorithms

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

SIAM Journal on Computing
The constrained longest common subsequence problem

Information Processing Letters
A simple algorithm for the constrained sequence problems

Information Processing Letters
A memory-efficient algorithm for multiple sequence alignment with constraints

Bioinformatics
New efficient algorithms for the LCS and constrained LCS problems

Information Processing Letters
Finding the longest common subsequence for multiple biological sequences by ant colony optimization

Computers and Operations Research
Efficient dominant point algorithms for the multiple longest common subsequence (MLCS) problem

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Time and space efficient algorithms for constrained sequence alignment

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata

Quadratic-time algorithm for a string constrained LCS problem

Information Processing Letters
Parallelizing dynamic programming through rank convergence

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longest subsequence C of A and B such that P is a subsequence of C. Most of the algorithms solving the CLCS problem are based on dynamic programming. Bit-parallelism is a technique of using single bits in a machine word for concurrent computation. We propose the first bit-parallel algorithm computing a CLCS and/or its length which outperforms the other known algorithms in terms of speed.