On the generalized constrained longest common subsequence problems

Authors:
Yi-Ching Chen;Kun-Mao Chao
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan 106;Department of Computer Science and Information Engineering, Graduate Institute of Biomedical Electronics and Bioinformatics, Graduate Institute of Networking and Multimedia, National Taiwan Univer ...
Venue:
Journal of Combinatorial Optimization
Year:
2011

Citing 16
Cited 10

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

Algorithms on strings, trees, and sequences: computer science and computational biology
The String-to-String Correction Problem

Journal of the ACM (JACM)
Bounds on the Complexity of the Longest Common Subsequence 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)
A fast algorithm for computing longest common subsequences

Communications of the ACM
A linear space algorithm for computing maximal common subsequences

Communications of the ACM
Introduction to Algorithms

Introduction to Algorithms
A Survey of Longest Common Subsequence Algorithms

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
The constrained longest common subsequence problem

Information Processing Letters
A simple algorithm for the constrained sequence problems

Information Processing Letters
Exemplar Longest Common Subsequence

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
New efficient algorithms for the LCS and constrained LCS problems

Information Processing Letters
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
Sequence Comparison: Theory and Methods

Sequence Comparison: Theory and Methods

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
Regular language constrained sequence alignment revisited

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
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
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
A dynamic programming solution to a generalized LCS problem

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate four variants of the longest common subsequence problem. Given two sequences X, Y and a constrained pattern P of lengths m, n, and 驴, respectively, the generalized constrained longest common subsequence (GC-LCS) problems are to find a longest common subsequence of X and Y including (or excluding) P as a subsequence (or substring). We propose new dynamic programming algorithms for solving the GC-LCS problems in O(mn 驴) time. We also consider the case where the number of constrained patterns is arbitrary.