Algorithms on Strings

Discover the intricate world of string algorithms with Algorithms on Strings by Maxime Crochemore. Published by Cambridge University Press in 2014, this comprehensive paperback spans 392 pages and serves as both a text and a reference for enthusiasts and professionals alike.

This book delves into essential string processes and pattern matching, showcasing practical examples relevant to automatic natural language processing, molecular sequence analysis, and effective textual database management. Each algorithm is articulated in a C-like language, accompanied by rigorous correctness proofs and complexity analyses, ensuring you are well-equipped to implement these techniques in real-world applications.

Whether you are a student, researcher, or practitioner in computer science, Algorithms on Strings is an invaluable resource that will deepen your understanding of text processing and enhance your algorithmic skills.