The constrained longest common subsequence problem

Authors:
Yin-Te Tsai
Affiliations:
Department of Science and Information Management, Providence University, 200 Chung Chi Road, Shalu, Taichung Hsien 433, Taiwan, R.O.C.
Venue:
Information Processing Letters
Year:
2003

Citing 7
Cited 30

String editing and longest common subsequences

Handbook of formal languages, vol. 2
Serial computations of Levenshtein distances

Pattern matching algorithms
The String-to-String Correction Problem

Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem

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

Journal of the ACM (JACM)
Algorithms and Theory of Computation Handbook

Algorithms and Theory of Computation Handbook
A Survey of Longest Common Subsequence Algorithms

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)

A simple algorithm for the constrained sequence problems

Information Processing Letters
A fast algorithm for the constrained multiple sequence alignment problem

Acta Cybernetica
Efficient algorithms for regular expression constrained sequence alignment

Information Processing Letters
Regular expression constrained sequence alignment

Journal of Discrete Algorithms
New efficient algorithms for the LCS and constrained LCS problems

Information Processing Letters
Algorithms for computing variants of the longest common subsequence problem

Theoretical Computer Science
A New Efficient Algorithm for Computing the Longest Common Subsequence

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Constrained LCS: Hardness and Approximation

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
A space efficient algorithm for the constrained heaviest common subsequence problem

Proceedings of the 46th Annual Southeast Regional Conference on XX
Finite automata based algorithms on subsequences and supersequences of degenerate strings

Journal of Discrete Algorithms
The constrained longest common subsequence problem for degenerate strings

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Approximating constrained Lcs

SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem

Fundamenta Informaticae
Variants of constrained longest common subsequence

Information Processing Letters
Solving longest common subsequence and related problems on graphical processing units

Software—Practice & Experience
Finite automata based algorithms for the generalized constrained longest common subsequence problems

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Restricted LCS

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
On the generalized constrained longest common subsequence problems

Journal of Combinatorial Optimization
Regular language constrained sequence alignment revisited

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Regular expression constrained sequence alignment

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Approximability of constrained LCS

Journal of Computer and System Sciences
Quadratic-time algorithm for a string constrained LCS problem

Information Processing Letters
Fast algorithms for computing the constrained LCS of run-length encoded strings

Theoretical Computer Science
Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited

Information Processing Letters
Guided forest edit distance: better structure comparisons by using domain-knowledge

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Efficient algorithms for the longest common subsequence problem with sequential substring constraints

Journal of Complexity
The substring inclusion constraint longest common subsequence problem can be solved in quadratic time

Journal of Discrete Algorithms
The constrained shortest common supersequence problem

Journal of Discrete Algorithms
A dynamic programming solution to a generalized LCS problem

Information Processing Letters
Efficient parallel algorithm for multiple sequence alignments with regular expression constraints on graphics processing units

International Journal of Computational Science and Engineering

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper considers a constrained version of longest common subsequence problem for two strings. Given strings S1, S2, and P, the constrained longest common subsequence problem for S1 and S2 with respect to P is to find a longest common subsequence lcs of S1 and S1 such that P is a subsequence of this lcs. An O(rn2m2) time algorithm based upon the dynamic programming technique is proposed for this new problem, where n, m and r are lengths of S1, S2 and P, respectively.