Computing Patterns in Strings

Лицевая обложка
Pearson/Addison-Wesley, 2003 - Всего страниц: 423

The computation of patterns in strings is a fundamental requirement in many areas of science and information processing. The operation of a text editor, the lexical analysis of a computer program, the functioning of a finite automaton, the retrieval of information from a database - these are all activities which may require that patterns be located and computed. In other areas of science, the algorithms that compute patterns have applications in such diverse fields as data compression, cryptography, speech recognition, computer vision, computational geometry and molecular biology.

Отзывы - Написать отзыв

Не удалось найти ни одного отзыва.

Об авторе (2003)

Bill Smyth is currently teaching at McMaster University, Canada

Библиографические данные