Quadratic-time algorithm for a string constrained LCS problem

Authors:
Sebastian Deorowicz
Affiliations:
Silesian University of Technology, Institute of Informatics, Akademicka 16, Gliwice, Poland
Venue:
Information Processing Letters
Year:
2012

Citing 8
Cited 2

Searching subsequences

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

Algorithms on strings, trees, and sequences: computer science and computational biology
Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM (JACM)
The constrained longest common subsequence problem

Information Processing Letters
Directed acyclic subsequence graph: overview

Journal of Discrete Algorithms
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem

Fundamenta Informaticae
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
On the generalized constrained longest common subsequence problems

Journal of Combinatorial Optimization

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.89

Visualization

Abstract

The problem of finding a longest common subsequence of two main sequences with some constraint that must be a substring of the result (STR-IC-LCS) was formulated recently. It is a variant of the constrained longest common subsequence problem. As the known algorithms for the STR-IC-LCS problem are cubic-time, the presented quadratic-time algorithm is significantly faster.