Text Algorithms - Maxime Crochemore

Text Algorithms

Maxime Crochemore

出版时间

1994-01-01

ISBN

9780195086096

评分

★★★★★

标签

算法

书籍介绍

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

显示全部
用户评论
理论与实用性兼备,对后缀树、后缀数组、DAWG的讲解很有启发性,把它们统一在一个可靠的框架下
收藏