Algorithms on Strings
Cambridge University Press
Edition: Illustrated, 6/21/2007
EAN 9780521848992, ISBN10: 0521848997
Hardcover, 392 pages, 22.9 x 15.2 x 2.5 cm
Language: English
The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases.
1. Tools
2. Pattern matching automata
3. String searching with a sliding window
4. Suffix arrays
5. Structures for indexes
6. Indexes
7. Alignments
8. Approximate patterns
9. Local periods.