Abstract
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 processes the searched text with constant memory space in addition to the string.
This work has been supported by PRC Math.-Info.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
4. References
A.V. Aho & M.J. Corasick, Efficient string matching: An aid to bibliographic search, Comm. ACM18 (1975) 333–340.
A. Apostolico & R. Giancarlo, The Boyer-Moore-Galil searching strategies revisited, SIAM J. Comput.15, 1 (1986) 98–105.
A. Apostolico & F.P. Preparata, Optimal off-line detection of repetitionsin a string, Theoret. Comput. Sci.22 (1983) 297–315.
D.R. Bean, A. Ehrenfeucht & G.F. McNulty, Avoidable patterns in strings of symbols, Pacific J. Math.85 (1979) 261–294.
A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M.T. Chen & J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoret. Comput. Sci.40, 1 (1985) 31–56.
K.S. Booth, Lexicographically least circular substrings, Inform. Process. Lett.10, 4, 5 (1980) 240–242.
R.S. Boyer & J.S. Moore, A fast string searching algorithm, Comm. ACM20 (1977) 762–772.
Y. Cesari & M. Vincent, Une caractérisation des mots périodiques, C.R. Acad.Sc. t.286, série A (1978) 1175.
C. Choffrut & M.P. Schützenberger, Counting with rationnal functions, to appear in Theoret. Comput. Sci. (1988).
M. Crochemore, Transducers and repetitions, Theoret. Comput. Sci.45 (1986) 63–86.
M. Crochemore & D. Perrin, Pattern matching in strings, to appear in J. Assoc. Comput. Mach. (1988).
J.P. Duval, Factorizing Words over an Ordered Alphabet, J. Algorithms4 (1983) 363–381.
Z. Galil, On improving the most case running time of the Boyer-Moore string-matching algorithm, Comm. ACM22, 9 (1979) 505–508.
Z. Galil, String Matching in real time, J. Assoc. Comput. Mach.28, 1 (1981) 134–149.
Z. Galil & J. Seiferas, Time Space Optimal String Matching, J. Comput. Syst. Sci.26 (1983) 280–294.
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.
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.
D.E. Knuth, J.H. Morris & V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput.6, 2 (1977) 323–350.
Lothaire, Combinatorics on Words, Addison-Wesley, Reading, Mass., 1982.
G.M. Landau & U. Vishkin, Efficient string matching with k differences, Technical Report 186, Courant Institute of Mathematical Sciences, New York University (1985).
E.M. McCreight, A space-economical suffix tree construction algorithms, J. Assoc. Comput. Mach.28, 2 (1976) 262–272.
R.L. Rivest, On the worst-case behavior of string-searching algorithms, SIAM J. Comput.6, 4 (1977) 669–674.
W. Rytter, A correct preprocessing algorithm for Boyer-Moore string-searching, SIAM J. Comput.9, 3 (1980) 509–512.
V. Shiloach, Fast canonization of circular strings, J. Algorithms2 (1981) 107–121.
A.O. Slisenko, Detection of periodicities and string-matching in real-time, J. of Soviet Mathematics22, 3 (1983) 1316–1387.
K. Thompson, Regular expression search algorithm, Comm. ACM11 (1968) 419–442.
E. Ukkonen, Finding Approximate Patterns in Strings, J.Algorithms6 (1985) 132–137.
U. Vishkin, Optimal parallel pattern matching in strings, in: (Proc. 12th ICALP, Lecture Notes in Computer Science 194, Springer-Verlag (1985)) 497–508.
P. Weiner, Linear pattern matching algorithms, IEEE Symposium on Switching and Automata Theory, Vol. 14, IEEE, New York (1972)) 1–11.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crochemore, M. (1988). Constant-space string-matching. In: Nori, K.V., Kumar, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1988. Lecture Notes in Computer Science, vol 338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50517-2_72
Download citation
DOI: https://doi.org/10.1007/3-540-50517-2_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50517-4
Online ISBN: 978-3-540-46030-5
eBook Packages: Springer Book Archive