Algorithms on strings
著者
書誌事項
Algorithms on strings
Cambridge University Press, c2007
- タイトル別名
-
Algorithmique du texte
大学図書館所蔵 件 / 全18件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 364-376) and index
内容説明・目次
内容説明
The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases.
目次
- 1. Tools
- 2. Pattern matching automata
- 3. String searching with a sliding window
- 4. Suffix arrays
- 5. Structures for indexes
- 6. Indexes
- 7. Alignments
- 8. Approximate patterns
- 9. Local periods.
「Nielsen BookData」 より
