Bookbot

Book rating

5.0(1)Add rating

Parameters

  • 392 pages
  • 14 hours of reading

More about the book

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.

Book purchase

Algorithms on Strings, Maxime Crochemore, Christophe Hancart, Thierry Lecroq

Language
Released
2014
product-detail.submit-box.info.binding
(Paperback)
We’ll email you as soon as we track it down.

Payment methods

5.0
Excellent
1 Ratings

We’re missing your review here.