TY - GEN

T1 - Conservative string covering of indeterminate strings

AU - Antoniou, Pavlos

AU - Crochemore, Maxime

AU - Iliopoulos, Costas S.

AU - Jayasekera, Inuka

AU - Landau, Gad M.

PY - 2008

Y1 - 2008

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

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

UR - http://www.scopus.com/inward/record.url?scp=84855532032&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84855532032

SN - 9788001041451

T3 - Proceedings of the Prague Stringology Conference 2008

SP - 108

EP - 115

BT - Proceedings of the Prague Stringology Conference 2008

T2 - Prague Stringology Conference 2008, PSC 2008

Y2 - 1 September 2008 through 3 September 2008

ER -