Conservative string covering of indeterminate strings

Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau

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


We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2]...T[n], where T[i] ⊆ Σ for each i, and σ is a given alphabet of fixed size. A conservative indeterminate string, is an indeterminate string where the number of indeterminate symbols in the positions of the string, i.e the non-solid symbols, is bounded by a constant κ. We present an algorithm for finding a conservative indeterminate pattern p in an indeterminate string t. Furthermore, we present algorithms for computing conservative covers and seeds of the string t.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2008
Number of pages8
StatePublished - 2008
EventPrague Stringology Conference 2008, PSC 2008 - Prague, Czech Republic
Duration: 1 Sep 20083 Sep 2008

Publication series

NameProceedings of the Prague Stringology Conference 2008


ConferencePrague Stringology Conference 2008, PSC 2008
Country/TerritoryCzech Republic

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Conservative string covering of indeterminate strings'. Together they form a unique fingerprint.

Cite this