Algorithms on strings
Author(s)
Bibliographic Information
Algorithms on strings
Cambridge University Press, 2014
- : pbk
- Other Title
-
Algorithmique du texte
Available at / 3 libraries
-
No Libraries matched.
- Remove all filters.
Note
"First published in this edition 2007, Reprinted 2009, First paperback edition 2014" -- T.p verso
Includes bibliographical references (p. 364-376) and index
Description and Table of Contents
Description
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.
Table of Contents
- 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.
by "Nielsen BookData"
