Constant-space string-matching in sublin
β
Maxime Crochemore; Leszek GaΜ§sieniec; Wojciech Rytter
π
Article
π
1999
π
Elsevier Science
π
English
β 462 KB
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