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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Berenbrink, P., Ergun, F., & Friedetzky, T. (2005). Finding frequent patterns in a string in sublinear time. In Lecture Notes in Computer Science (Vol. 3669, pp. 746–757). Springer Verlag. https://doi.org/10.1007/11561071_66
Mendeley helps you to discover research relevant for your work.