Simple Optimal String Matching Algorithm

Journal of Algorithms

Volumn 36, Issue 1, 2000, Pages 102-116

  Allauzen, Cyril ^a   Raffinot, Mathieu ^a  

^a Université de Marne la Vallée   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347937344     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1087     Document Type: Article

References (12)

1. R. S. Boyer and J. S. Moore, A fast string searching algorithm, Comm. ACM 20, No. 10 (1977) 762-772.
2. M. Crochemore, Transducers and repetitions, Theoret. Comput. Sci. 45, No. 1 (1986), 63-86.
3. M. Crochemore, Constant-space string-matching, in Proceedings of the 8th Conference on Foundations of Software Technology and Theoretical Computer Science" (K. V. Nori and S. Kumar, Eds.), Lecture Notes in Computer Science, No. 338, pp. 80-87, Springer-Verlag, Berlin, 1988.
4. M. Crochemore, L. Gasieniec, and W. Rytter, Constant-space string matching in sublinear average time, in "Compression and Complexity of Sequences" (B. Carpentieri, A. De Santis, U. Vaccaro, and J. A. Storer, Eds.), pp. 230-239, IEEE Compu. Soc., Los Alamitos, CA, 1998.
5. M. Crochemore and W. Rytter, "Text Algorithm," Oxford Univ. Press, London, 1994.
6. A. Czumaj, M. Crochemore, L. Gasieniec, S. Jarominek, T. Lecroq, W. Plandowski, and W. Rytter, Speeding up two string-matching algorithms, Algorithmica 12 (1994), 247-267.
7. Z. Galil and J. Seiferas, Time-space optimal string matching, J. Comput. System Sci. 26, No. 3 (1983), 280-294.
8. L. Ga̧sieniec, W. Plandowski, and W. Rytter, Constant-space string matching with smaller number of comparisons: Sequential sampling, in "Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching," Espoo, Finland, (Z. Galil and E. Ukkonen, Eds.), Lecture Notes in Computer Science, No. 937, pp. 78-89, Springer-Verlag, Berlin, 1995.
9. D. E. Knuth, J. H. Morris, Jr, and V. R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6, No. 1 (1977), 323-350.
10. T. Lecroq, "Recherches de Mot," These de doctorat, Université d'Orléans, France, 1992.
11. A. C. Yao, The complexity of pattern matching for a random string, SIAM J. Comput. 8, No. 3 (1979), 368-387.
12. J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inform Theory 23 (1977), 337-343.