menu
{ "item_title" : "Algorithms on Strings", "item_author" : [" Maxime Crochemore", "Christophe Hancart", "Thierry Lecroq "], "item_description" : "This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases. Algorithms are described in a C-like language, with correctness proofs and complexity analysis, to make them ready to implement. The book will be an important resource for students and researchers in theoretical computer science, computational linguistics, computational biology, and software engineering.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/1/10/767/099/1107670993_b.jpg", "price_data" : { "retail_price" : "55.00", "online_price" : "55.00", "our_price" : "55.00", "club_price" : "55.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Algorithms on Strings|Maxime Crochemore

Algorithms on Strings

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases. Algorithms are described in a C-like language, with correctness proofs and complexity analysis, to make them ready to implement. The book will be an important resource for students and researchers in theoretical computer science, computational linguistics, computational biology, and software engineering.

This item is Non-Returnable

Details

  • ISBN-13: 9781107670990
  • ISBN-10: 1107670993
  • Publisher: Cambridge University Press
  • Publish Date: November 2014
  • Dimensions: 9 x 6 x 0.81 inches
  • Shipping Weight: 1.15 pounds
  • Page Count: 392

Related Categories

You May Also Like...

    1

BAM Customer Reviews