Finite automata based algorithms for the generalized constrained longest common subsequence problems

Authors:
Effat Farhana;Jannatul Ferdous;Tanaeem Moosa;M. Sohel Rahman
Affiliations:
AlEDA Group, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;AlEDA Group, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;AlEDA Group, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;AlEDA Group, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh
Venue:
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Year:
2010

Citing 12
Cited 2

Searching subsequences

Theoretical Computer Science
The String-to-String Correction Problem

Journal of the ACM (JACM)
Elements of the Theory of Computation

Elements of the Theory of Computation
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
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
New efficient algorithms for the LCS and constrained LCS problems

Information Processing Letters
The constrained longest common subsequence problem for degenerate strings

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
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

Quadratic-time algorithm for a string constrained LCS problem

Information Processing Letters
Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. Given strings S1, S2 and P, the generalized constrained longest common subsequence problem (GC-LCS) for S1 and S2 with respect to P is to find a longest common subsequence of S1 and S2, which contains (excludes) P as a subsequence (substring). We present finite automata based algorithms with time complexity O(r(n+m)+(n+m) log(n+m)) for a fixed sized alphabet, where r, n and m are the lengths of P, S1 and S2 respectively.