Text Algorithms
出版信息
Maxime Crochemore、Wojciech Rytter / Oxford University Press / 1994
内容简介
This much-needed book on the design of algorithms and data structures for text processing emphasizes both theoretical foundations and practical applications. It is intended to serve both as a textbook for courses on algorithm design, especially those related to text processing, and as a reference for computer science professionals. The work takes a unique approach, to other more general books one that goes more deeply into its topic than other more general books. It contains both classical algorithms and recent results of research on the subject. The book is the first text to contain a collection of a wide range of text algorithms, many of them quite new and appearing here for the first time. Other algorithms, while known by reputation, have never been published in the journal literature.
目录
Preface by Zvi Galil
Introduction, pp 1-11
Foundations, pp 13-31
Basic string-matching algorithms, pp 33-53
The Boyer-Moore algorithm and its variations, pp 55-72
Suffix trees, pp 73-104
Subword graphs, pp 105-130
Automata theoretic approach, pp 131-159
Regularities in texts: symmetries and repetitions, pp 161-179
Almost optimal parallel algorithms, pp 181-211
Text compression techniques, pp 213-236
Approximate pattern matching, pp 237-251
Two-dimensional pattern matching, pp 253-288
Time-space optimal string matching, pp 289-325
Time-processors optimal string matching, pp 327-351
Miscellanies, pp 353-375
Exercises, pp 377-385
Bibliography, pp 387-404
Index, pp 405-412
