Pattern-Matching and Text-Compression Algorithms

ACM Computing Surveys

Volumn 28, Issue 1, 1996, Pages 39-41

  Crochemore, Maxime ^a   Lecroq, Thierry ^b  

^a UNIVERSITÉ GUSTAVE EIFFEL   (France)

^b UNIVERSITÉ DE ROUEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3142535067     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/234313.234331     Document Type: Article

References (8)

1. Aho, A. V. 1990. Algorithms for finding patterns in strings. In Handbook of Theoretical Computer Science, Algorithms and Complexity, Vol. A. J. van Leeuwen Ed., Elsevier, Amsterdam, Ch. 5, 255-330.
2. Bell, T. C., Cleary J. G., and Witten, I. H. 1990. Text Compression. Prentice Hall, Englewood Cliffs, NJ.
3. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. 1990. Introduction to Algorithms. MIT Press, Cambridge, MA, Ch. 34, 853-885.
4. Crochemore, M. and Rytter, W. 1994. Text Algorithms. Oxford University Press, New York.
5. Gonnet, G. H. and Baeza-Yates, R. A. 1991. Handbook of Algorithms and Data Structures. Addison-Wesley, Reading, MA, Ch. 7, 251-288.
6. Nelson, M. 1992. The Data Compression Book. M&T Books, New York.
7. Sedgewick, R. 1990. Algorithms in C. Addison-Wesley, Reading, MA, Ch. 19 and 22.
8. Stephen, G. A. 1994. String Searching Algorithms. World Scientific Press, River Edge, NJ.