We present a string-matching algorithm with the following properties: it is linear in time with a small multiplicative constant during all its phases; it preprocesses the string and scans the searched text with constant memory space in addition to the strings.
KeywordsPattern Match Regular Expression Memory Space String Match Suffix Tree
Unable to display preview. Download preview PDF.
- C. Choffrut and M.P. Schützenberger, Counting with rationnai functions, to appear in Theoret. Comput. Sci. (1988).Google Scholar
- M. Crochemore and D. Perrin, Pattern matching in strings, submitted to J. Assoc. Comput. Mach. (1988).Google Scholar
- L.J. Guibas & A.M. Odlysko, A new proof of the linearity of the Boyer-Moore string searching algorithm, in: (Proc. 18 th Annual IEEE Symposium on Fundations of Computer Science (1977)) 189–195.Google Scholar
- R.M. Karp, R.E. Miller & A.L. Rosenberg, Rapid identification of repeated patterns in strings, trees, and arrays,in: (ACM Symposium on Theory of Computing, Vol. 4, ACM, New York (1972)) 125–136.Google Scholar
- Lothaire, Combinatorics on Words, Addison-Wesley, Reading, Mass., 1982.Google Scholar
- G.M. Landau & U. Vishkin, Efficient string matching with k differences, Technical Report 186, Courant Institute of Mathematical Sciences, New York University (1985).Google Scholar
- U. Vishkin, Optimal parallel pattern matching in strings, in: (Proc. 12th ICALP, Lecture Notes in Computer Science 194, Springer-Verlag (1985)) 497–508.Google Scholar
- P. Weiner, Linear pattern matching algorithms, IEEE Symposium on Switching and Automata Theory, Vol. 14, IEEE, New York (1972)) 1–11.Google Scholar