### 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 string-matching algorithms which works in o(n) average time and constant additional space for one-dimensional texts and two-dimensional arrays. This is a first attempt to the small-space string-matching problem in which sublinear time algorithms are achieved. 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 of P (size of the longest repeated subword of P).

Original language | English (US) |
---|---|

Pages (from-to) | 197-203 |

Number of pages | 7 |

Journal | Theoretical Computer Science |

Volume | 218 |

Issue number | 1 |

DOIs | |

State | Published - Apr 28 1999 |

Event | Proceedings of the 1997 International Conference on Compression and Complexity of Sequences - Positano, Italy Duration: Jun 11 1997 → Jun 13 1997 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Constant-space string-matching in sublinear average time'. Together they form a unique fingerprint.

## Cite this

Crochemore, M., Ga̧sieniec, L., & Rytter, W. (1999). Constant-space string-matching in sublinear average time.

*Theoretical Computer Science*,*218*(1), 197-203. https://doi.org/10.1016/S0304-3975(98)00259-X