Restricted LCS

Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

35 Scopus citations


The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the common subsequence must contain one or more constraint strings as subsequences, the problem becomes the Constrained LCS (CLCS) problem. In this paper we consider the Restricted LCS (RLCS) problem, where our goal is finding a longest common subsequence between two or more strings that does not contain a given set of restriction strings as subsequences. First we show that in case of two input strings and an arbitrary number of restriction strings the RLCS problem is NP-hard. Afterwards, we present a dynamic programming solution for RLCS and we show that this algorithm implies that RLCS is in FPT when parameterized by the total length of the restriction strings. In the last part of this paper we present two approximation algorithms for the hard variants of the problem.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings
Number of pages8
StatePublished - 24 Nov 2010
Externally publishedYes
Event17th International Symposium on String Processing and Information Retrieval, SPIRE 2010 - Los Cabos, Mexico
Duration: 11 Oct 201013 Oct 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6393 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference17th International Symposium on String Processing and Information Retrieval, SPIRE 2010
CityLos Cabos

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Restricted LCS'. Together they form a unique fingerprint.

Cite this