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. This 2009 reprint of 2007 edition of this book is in like new condition with no signs of wear or damage. PROCEEDS BENEFIT OUR LOCAL LIBRARY PROGRAMS - THANK YOU! Please visit our store for more titles.https://www.ebay.com/usr/friendsofthepaloaltolibrary
Price: 60 USD
Location: Palo Alto, California
End Time: 2024-11-02T05:23:29.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Restocking Fee: No
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Return policy details:
Country/Region of Manufacture: United States
Educational Level: Adult & Further Education
Level: Advanced
Item Length: 9 in
Item Height: 1 in
Item Width: 6 in
Author: Maxime Crochemore, Christophe Hancart, Thierry Lecroq
Publication Name: Algorithms on Strings
Format: Hardcover
Language: English
Subject: Programming / Algorithms, General, Document Management
Publisher: Cambridge University Press
Publication Year: 2007
Type: Textbook
Subject Area: Computers
Item Weight: 26.1 Oz
Number of Pages: 392 Pages
