COMPUTER ALGORITHMS; STRING PATTERN MAKING STRATEGIES Hardback - 1994 - 1st Edition
by Aoe, Jun-Ichi
- Used
- Fine
- Hardback
Standard delivery: 7 to 14 days
Details
- Title COMPUTER ALGORITHMS; STRING PATTERN MAKING STRATEGIES
- Author Aoe, Jun-Ichi
- Binding Hardback
- Edition number 1st
- Edition 1
- Condition Used - Fine
- Pages 300
- Volumes 1
- Language ENG
- Publisher IEEE Computer Society Press, Los Alamitos, CA
- Publication date 1994
- Illustrated Yes
- Features Bibliography, Illustrated, Table of Contents
- Bookseller's Inventory # 60233
- 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 Large 4to
- Category Computers - General Information
- Library of Congress subjects Computer algorithms
- Library of Congress Catalogue Number 93040355
- Dewey Decimal Code 005.1
- Quantity available 1
- Bookseller catalogues Technical
About Harbinger Books Michigan, United States
Harbinger Books is actively engaged in the used, out-of-print & rare book business, specializing in "library-quality" books of all descriptions. We aim to please. Thank You. Tom
Books are returnable for any reason if we're notified within 5 days of receipt. Return postage will be refunded if there was a mistake in describing the book. Please request a quote for multiple book orders, overseas, priority or air mail, and for heavy books. Thank You.
Reader reviews for COMPUTER ALGORITHMS; STRING PATTERN MAKING 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
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