Abstract
We use a simple observation about the locations of critical factorizations to derive a real-time variation of the Crochemore-Perrin constant-space string matching algorithm. The real-time variation has a simple and efficient control structure.
Work partially supported by the European Research Council (ERC) project SFEROT, by the Israeli Science Foundation grant 347/09 and by Italian project PRIN AlgoDEEP (2008TFBWL4) of MIUR. Part of the work of the first author originated while visiting at the University of Palermo and of the second author originated while visiting the Caesarea Rothschild Institute.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, Z.K., Prasanna, V.K.: Time and area efficient pattern matching on FPGAs. In: Tessier, R., Schmit, H. (eds.) FPGA, pp. 223–232. ACM, New York (2004)
Breslauer, D.: Saving Comparisons in the Crochemore-Perrin String Matching Algorithm. Theoret. Comput. Sci. 158(1), 177–192 (1996)
Breslauer, D., Galil, Z.: Real-Time Streaming String-Matching (2011), this conference proceedings
Breslauer, D., Jiang, T., Jiang, Z.: Rotations of periodic strings and short superstrings. J. Algorithms 24(2), 340–353 (1997)
Césari, Y., Vincent, M.: Une caractérisation des mots périodiques. C.R. Acad. Sci. Paris 286(A), 1175–1177 (1978)
Crochemore, M.: String-matching on ordered alphabets. Theoret. Comput. Sci. 92, 33–47 (1992)
Crochemore, M., Perrin, D.: Two-way string-matching. J. Assoc. Comput. Mach. 38(3), 651–675 (1991)
Crochemore, M., Rytter, W.: Periodic Prefixes in Texts. In: Capocelli, R., Santis, A.D., Vaccaro, U. (eds.) Proc. of Sequences II: Methods in Communication, Security and Computer Science, pp. 153–165. Springer, Heidelberg (1993)
Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)
Crochemore, M., Rytter, W.: Sqares, Cubes, and Time-Space Efficient String Searching. Algorithmica 13(5), 405–425 (1995)
Crochemore, M., Rytter, W.: Jewels of stringology. World Scientific, Singapore (2002)
Duval, J.P., Kolpakov, R., Kucherov, G., Lecroq, T., Lefebvre, A.: Linear-time computation of local periods. Theor. Comput. Sci. 326(1-3), 229–240 (2004)
Duval, J.: Factorizing Words over an Ordered Alphabet. J. Algorithms 4, 363–381 (1983)
Ergun, F., Jowhari, H., Salgan, M.: Periodicity in Streams (2010) (manuscript)
Galil, Z.: String Matching in Real Time. J. Assoc. Comput. Mach. 28(1), 134–149 (1981)
Galil, Z., Seiferas, J.: Saving space in fast string-matching. SIAM J. Comput. 2, 417–438 (1980)
Galil, Z., Seiferas, J.: Linear-time string-matching using only a fixed number of local storage locations. Theoret. Comput. Sci. 13, 331–336 (1981)
Galil, Z., Seiferas, J.: Time-space-optimal string matching. J. Comput. System Sci. 26, 280–294 (1983)
Gasieniec, L., Kolpakov, R.M.: Real-time string matching in sublinear space. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 117–129. Springer, Heidelberg (2004)
Gasieniec, L., Plandowski, W., Rytter, W.: Constant-space string matching with smaller number of comparisons: Sequential sampling. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol. 937, pp. 78–89. Springer, Heidelberg (1995)
Gasieniec, L., Plandowski, W., Rytter, W.: The zooming method: A recursive approach to time-space efficient string-matching. Theor. Comput. Sci. 147(1&2), 19–30 (1995)
Jiang, T., Li, M.: K one-way heads cannot do string-matching. J. Comput. Syst. Sci. 53(3), 513–524 (1996)
Karp, R., Rabin, M.: Efficient randomized pattern matching algorithms. IBM J. Res. Develop. 31(2), 249–260 (1987)
Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput. 6, 322–350 (1977)
Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)
Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)
Porat, B., Porat, E.: Exact And Approxiamate Pattern Matching In The Streaming Model. In: Proc. 50th IEEE Symp. on Foundations of Computer Science, pp. 315–323 (2009)
Rytter, W.: On maximal suffices and constant-space linear-time versions of kmp algorithm. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 196–208. Springer, Heidelberg (2002)
Seiferas, J.I., Galil, Z.: Real-time recognition of substring repetition and reversal. Mathematical Systems Theory 11, 111–146 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Breslauer, D., Grossi, R., Mignosi, F. (2011). Simple Real-Time Constant-Space String Matching. In: Giancarlo, R., Manzini, G. (eds) Combinatorial Pattern Matching. CPM 2011. Lecture Notes in Computer Science, vol 6661. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21458-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-21458-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21457-8
Online ISBN: 978-3-642-21458-5
eBook Packages: Computer ScienceComputer Science (R0)