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.

R3,697

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles36970
Mobicred@R346pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 12 - 17 working days


Toggle WishListAdd to wish list
Review this Item

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

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Cambridge UniversityPress

Country of origin

United Kingdom

Release date

April 2007

Availability

Expected to ship within 12 - 17 working days

First published

2001

Authors

, ,

Dimensions

229 x 152 x 25mm (L x W x T)

Format

Hardcover

Pages

392

ISBN-13

978-0-521-84899-2

Barcode

9780521848992

Languages

value

Subtitles

value

Categories

LSN

0-521-84899-7



Trending On Loot