| Description |
viii, 383 pages : illustrations ; 24 cm |
| 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 |
| Summary |
"This book is intended for lectures on string processing and pattering 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." "This 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."--BOOK JACKET |
| Notes |
Formerly CIP. Uk |
| Bibliography |
Includes bibliographical references (pages 364-376) and index |
| Subject |
Computer algorithms.
|
|
Matching theory.
|
|
Computational biology.
|
| Author |
Hancart, Christophe, 1964-
|
|
Lecroq, Thierry.
|
|
MyiLibrary.
|
| LC no. |
2006039263 |
| ISBN |
9780521848992 hardback |
|
0521848997 hardback |
|
