Crochemore, Maxime, 1947-

Algorithms on strings / Maxime Crochemore, Christophe Hancart, Thierry Lecroq. - viii, 383 p. : ill. ; 24 cm.

Includes bibliographical references (p. 364-376) and index.

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.

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..

College of Engineering and Computer Studies

9781107670990 9780521848992 (hardback) 0521848997 (hardback)

2006039263

GBA741927 bnb

013756736 Uk


Computer algorithms.
Matching theory.
Computational biology.

QA76.9.A43 / C757 2007

005.1/C87