×

Jewels of stringology. Text algorithms. (English) Zbl 1078.68151

River Edge, NJ: World Scientific (ISBN 981-02-4897-0/pbk; 981-02-4782-6/hbk; 978-981-277-822-2/ebook). x, 310 p. (2003).
Efficient algorithms for matching a text sample against a given text are not only theoretically interesting; they also have many important applications, ranging from basic text editor functions, over look-up operations in dictionaries, to alignment problems for DNA sequences.
In their new book, the authors present some algorithmic jewels of this field, starting from textbook classics like the Knuth-Morris-Pratt and Boyer-Moore algorithms, then moving on to two-dimensional and parallel algorithms. One can only agree with the authors that such jewels deserve to shine. On the other hand, it is not so clear which group of readers profit most from this collection. Students may find the – seemingly smooth – text hard to read at some places, whereas the experienced reader can always resort to the excellent book on text algorithms by the same authors [Text algorithms. New York, NY: Oxford Univ. Press (1994; Zbl 0844.68101)]. Still, the book is a valuable addition to the field.
Reviewer: Rolf Klein (Bonn)

MSC:

68U15 Computing methodologies for text processing; mathematical typography
68R15 Combinatorics on words
68-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68-02 Research exposition (monographs, survey articles) pertaining to computer science
68Q45 Formal languages and automata
68W05 Nonnumerical algorithms
68W10 Parallel algorithms in computer science
68W40 Analysis of algorithms
68P10 Searching and sorting

Citations:

Zbl 0844.68101
PDFBibTeX XMLCite
Full Text: DOI