Quadratic-time Algorithm for the String Constrained LCS Problem

Details Quadratic-time Algorithm for the String Constrained LCS Problem Quadratic-time Algorithm for the String Constrained LCS Problem

2011-06-30

arxiv.org/abs/1106.6342v1

Computer Science

Data Structures and Algorithms

6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Quadratic-time Algorithm for the String Constrained LCS Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quadratic-time Algorithm for the String Constrained LCS Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quadratic-time Algorithm for the String Constrained LCS Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-35862