Welcome to IOU Digital Library

This book is a comprehensive and authoritative reference on algorithms for string processing and pattern matching. It covers foundational topics such as pattern‑matching automata, sliding‑window searching, suffix arrays and various index structures, regularities, repetitions and combinatorial properties of strings, approximate matching, string alignments, and local periods. Algorithms are presented in a C‑like pseudocode, with correctness proofs and complexity analyses — making them ready for implementation. The work serves as a core resource for students and researchers in theoretical computer science, computational biology, computational linguistics, and text‑processing or database applications where efficient string algorithms are essential.

no reviews

245: $a: Algorithms on Strings
245: $b:
082: $a:
100: $a: Maxime Crochemore & Christophe Hancart & Thierry Lecroq
650: $a: Computer Science
250: $a:
440: $v:
250: $b: Cambridge University Press
250: $c: 2007
020: $a: 9780521848992
300: $a: 392