 |
HAL UPEC - UPEM Portal |  |
 |
Conference papers
Constant-space string matching in sublinear average time
Abstract : Given two strings: pattern P of length m and text T of length n. The string-matching problem is to find all occurrences of the pattern P in the text T. We present a simple string-matching algorithm which works in average o(n) time with constant additional space for one-dimensional texts and two-dimensional arrays. This is the first attempt to the small-space string-matching problem in which sublinear time algorithms are delivered. More precisely we show that all occurrences of one- or two-dimensional patterns can be found in O(n/r) average time with constant memory, where r is the repetition size (size of the longest repeated subword) of P
Cited literature [12 references]
https://hal-upec-upem.archives-ouvertes.fr/hal-00619976
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Tuesday, March 26, 2013 - 10:37:39 PM
Last modification on : Tuesday, October 19, 2021 - 11:25:53 AM
Long-term archiving on: : Thursday, June 27, 2013 - 2:30:12 AM
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Tuesday, March 26, 2013 - 10:37:39 PM
Last modification on : Tuesday, October 19, 2021 - 11:25:53 AM
Long-term archiving on: : Thursday, June 27, 2013 - 2:30:12 AM
File
seq97.pdf
Files produced by the author(s)