Normal view MARC view ISBD view

Algorithms on strings / Maxime Crochemore, Christophe Hancart, Thierry Lecroq.

By: Crochemore, Maxime, 1947-.
Contributor(s): Hancart, Christophe, 1964- | Lecroq, Thierry.
New York : Cambridge University Press, ©2014Description: viii, 383 p. : ill. ; 24 cm.Content type: text ISBN: 9781107670990; 9780521848992 (hardback); 0521848997 (hardback).Subject(s): Computer algorithms | Matching theory | Computational biologyDDC classification: 005.1/C87 Other classification: CCS Online resources: Publisher description | Table of contents only | Contributor biographical information
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: 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..
Item type Current location Collection Call number Status Date due Barcode
Books Books College Library
General Reference Section
GC CCS 005.1/C87 (Browse shelf) Available 81486
Browsing College Library Shelves , Shelving location: General Reference Section , Collection code: GC Close shelf browser
CBA 910.46/T48 Tourism and the lodging sector / CBA 910.68/Op26 Operations management in the travel industry / CBA 910.68/R88 Rural tourism and enterprise : CCS 005.1/C87 Algorithms on strings / CCS 005.1/D36 C : CCS 005.133/H26 Learning object-oriented programming in C# 5.0 / CCS 005.369/N16 Microsoft Excel 2000.

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

There are no comments for this item.

Log in to your account to post a comment.