Other available formats:
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact email@example.com providing details of the course you are teaching.
This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases. Algorithms are described in a C-like language, with correctness proofs and complexity analysis, to make them ready to implement. The book will be an important resource for students and researchers in theoretical computer science, computational linguistics, computational biology, and software engineering.Read more
- Few books on the topic, some of which are research monographs or conference proceedings, not suitable for teaching
- Well adapted to Masters courses on algorithms or text processing
- Many concepts and examples explained in 135 figures
Reviews & endorsements
"The material is well explained and the treatment of the subjects covered is quite complete."
Ricardo Baeza-Yates, Mathematical Reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: April 2007
- format: Hardback
- isbn: 9780521848992
- length: 392 pages
- dimensions: 229 x 152 x 25 mm
- weight: 0.74kg
- contains: 6 tables 142 exercises
- availability: Available, despatch within 1-2 weeks
Table of Contents
2. Pattern matching automata
3. String searching with a sliding window
4. Suffix arrays
5. Structures for indexes
8. Approximate patterns
9. Local periods.
You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×