Algorithms on Strings
Algorithms on Strings
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.
- Few books on the topic, some of which are research monographs or conference proceedings, not suitable for teaching
- Well adapted to Master's courses on algorithms or text processing
- Many concepts and examples explained in 135 figures
Reviews & endorsements
'… perfect for lectures on 'stringology', for graduate students as a reference on the topic and for appliers in linguistic or molecular biology …' Acta Scientiarum Mathematicarum
'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
Product details
No date availablePaperback
9781107670990
392 pages
229 × 152 × 21 mm
0.52kg
Table of Contents
- 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.
