Text Algorithms

Livro digital

Título:
Text Algorithms

Autor:
Maxime Crochemore, Wojciech Rytter

Categoria:
Tecnologia > Backend

Doador:
Raffaello D. N.

Sinopse:
Text Algorithms addresses the core problem of making sense of long strings, starting from Chapter 1’s opening sweep through “Texts and their processing,” “Text file facilities,” and “Dictionaries.” That structure matters: the book begins with practical string matching, then moves immediately into Unix tools like grep, sed, awk, lex, and diff, so the reader is brought from everyday text handling into algorithmic thinking without losing sight of real use cases. The scope is broader than a simple pattern-matching manual. The table of contents and opening pages point to variations on string matching, regular-expression matching, approximate matching, edit distance, compression, regularities in texts, and extensions to two-dimensional images and trees. The authors also connect the topic to indexes, suffix trees, factor automata, suffix arrays, and lexical analysis, which shows a strong emphasis on both data structures and algorithm design. This is a serious technical reference for readers who want the theory behind text processing, not just tools that happen to work. Its value is the bridge it builds between practical Unix workflows and deep algorithmic methods, making it useful for students and practitioners who need efficient ways to search, transform, compare, and index text at scale.