{
"item_title" : "Handbook of Exact String Matching Algorithms",
"item_author" : [" Christian Charras", "Thierry Lecroq "],
"item_description" : "String matching is a very important subject in the wider domain of text processing. It consists of finding one, or more generally, all the occurrences of a string (more generally called a pattern) in a text. The Handbook of Exact String Matching Algorithms presents 38 methods for solving this problem. For each, it gives the main features, a description, its C code, an example and references.",
"item_img_path" : "https://covers4.booksamillion.com/covers/bam/0/95/430/064/0954300645_b.jpg",
"price_data" : {
"retail_price" : "37.00", "online_price" : "37.00", "our_price" : "37.00", "club_price" : "37.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Overview
String matching is a very important subject in the wider domain of text processing. It consists of finding one, or more generally, all the occurrences of a string (more generally called a pattern) in a text. The Handbook of Exact String Matching Algorithms presents 38 methods for solving this problem. For each, it gives the main features, a description, its C code, an example and references.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9780954300647
- ISBN-10: 0954300645
- Publisher: College Publications
- Publish Date: February 2004
- Dimensions: 9.21 x 6.14 x 0.54 inches
- Shipping Weight: 0.8 pounds
- Page Count: 256
Related Categories
