Algorithms on Strings (Hardcover)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	April 2007
First published:	2001
Authors:	Maxime Crochemore • Christophe Hancart • Thierry Lecroq
Dimensions:	229 x 152 x 25mm (L x W x T)
Format:	Hardcover
Pages:	392
ISBN-13:	978-0-521-84899-2
Languages:	English
Subtitles:	French
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures
LSN:	0-521-84899-7
Barcode:	9780521848992

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!