Supersequences, Runs and CD Grammar Systems

Abstract

The Minimal Run Supersequence problem (MinRS) is the decision version of the problem to nd for a given nite set L of strings over an alphabet and integer k a supersequence of L which has at most k runs. It is shown that MinRS is polynomial time solvable over an alphabet of size 2 and NP-complete over an alphabet of size 3. Moreover, we study the algorithmic… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics