String searching algorithms
著者
書誌事項
String searching algorithms
（Lecture notes series on computing, v. 3）
World Scientific, c1994
大学図書館所蔵 件 / 全18件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Bibliography: p. 211-233
Includes index
内容説明・目次
内容説明
String searching is a subject of both theoretical and practical interest in computer science. This book presents a bibliographic overview of the field and an anthology of detailed descriptions of the principal algorithms available. The aim is twofold: on the one hand, to provide an easy-to-read comparison of the available techniques in each area, and on the other, to furnish the reader with a reference to in-depth descriptions of the major algorithms. Topics covered include methods for finding exact and approximate string matches, calculating ‘edit’ distances between strings, finding common sequences and finding the longest repetitions within strings. For clarity, all the algorithms are presented in a uniform format and notation.
目次
- String Matching
- String Distance and Common Sequences
- Suffix Trees
- Approximate String Matching
- Repeated Substrings.
「Nielsen BookData」 より