Algorithms on Strings

Detailed algorithms for string processes and pattern matching have examples from natural language processing, molecular sequencing, and databases.

Maxime Crochemore (Author), Christophe Hancart (Author), Thierry Lecroq (Author)

9780521848992, Cambridge University Press

Hardback, published 9 April 2007

392 pages
22.9 x 15.2 x 2.5 cm, 0.74 kg

'This is a good book on string matching and other related algorithms, especially from the theoretical point of view. … The material is well explained and the treatment of the subjects covered is quite complete. … Overall, this book will be of interest to people doing research in combinatorial biology and computational linguistics.' Mathematical Reviews

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.

Subject Areas: Algorithms & data structures [UMB], Biotechnology [TCB], Biology, life sciences [PS], Discrete mathematics [PBD]