Stock photo: cover may vary
Computer Algorithms: String Pattern Matching Strategies Paperback - 1994 - 1st Edition
by Aoe, Jun-ichi
- New
- Paperback
- first
A$79.60
A$21.86
Delivery within USA
Standard delivery: 12 to 14 days
More delivery options
Standard delivery: 12 to 14 days
Dropship order
Ships from Ergodebooks (Texas, United States)
Details
- Title Computer Algorithms: String Pattern Matching Strategies
- Author Aoe, Jun-ichi
- Binding Paperback
- Edition number 1st
- Edition 1
- Condition New
- Pages 300
- Volumes 1
- Language ENG
- Publisher Wiley-Interscience, -
- Publication date 1994-05-30
- Illustrated Yes
- Features Bibliography, Illustrated, Table of Contents
- Bookseller's Inventory # DADAX0818654627
- ISBN 9780818654626 / 0818654627
- Weight 1.57 lbs (0.71 kg)
- Dimensions 10.9 x 8.18 x 0.66 in (27.69 x 20.78 x 1.68 cm)
- Size 8.78x0.96x11.34
- Category Computers - General Information
- Library of Congress subjects Computer algorithms
- Library of Congress Catalogue Number 93040355
- Dewey Decimal Code 005.1
- Quantity available 1
About Ergodebooks Texas, United States
Biblio member since 2005
Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.
We have 30 day return policy.
Reader reviews for Computer Algorithms: String Pattern Matching Strategies
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
Introduces the basic concepts and characteristics of string pattern matching strategies and provides numerous references for further reading.
The text describes and evaluates the BF, KMP, BM, and KR algorithms, discusses improvements for string pattern matching machines, and details a technique for detecting and removing the redundant operation of the AC machine. Also explored are typical problems in approximate string matching . In addition, the reader will find a description for applying string pattern matching algorithms to multidimensional matching problems, an investigation of numerous hardware-based solutions for pattern matching, and an examination of hardware approaches for full text search.
The first chapter's survey paper describes the basic concepts of algorithm classifications. The five chapters that follow include 15 papers further illustrating these classifications:
- Single keyword matching
- Matching sets of keywords
- Approximate string matching
- Multidimensional matching
- Hardware matching
