Skip to main content
Article thumbnail
Location of Repository

Finding frequent patterns in a string in sublinear time.

By P. Berenbrink, F. Ergun and T. Friedetzky


We consider the problem of testing whether (a large part of) a given string X of length n over some finite alphabet is covered by multiple occurrences of some (unspecified) pattern Y of arbitrary length in the combinatorial property testing model. Our algorithms randomly query a sublinear number of positions of X, and run in sublinear time in n. We first focus on finding patterns of a given length, and then discuss finding patterns of unspecified length

Publisher: Springer
Year: 2005
DOI identifier: 10.1007/11561071_66
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.