Pattern Matching Algorithms
- Publisher's listprice GBP 200.00
-
95 550 Ft (91 000 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 9 555 Ft off)
- Discounted price 85 995 Ft (81 900 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
95 550 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher OUP USA
- Date of Publication 31 July 1997
- ISBN 9780195113679
- Binding Hardback
- No. of pages400 pages
- Size 156x234x22 mm
- Weight 730 g
- Language English
- Illustrations line figures 0
Categories
Short description:
This book attempts an overview of the current state of the art in Pattern Matching as seen by specialists who have devoted years of study to the field. It covers most of the basic principles and presents material advanced enough to portray faithfully the current frontier of research in the field. An in-depth reference for specialists in the field, the book can be used in an advanced graduate course.
MoreLong description:
Issues of matching and searching on elementary discrete structures arise pervasively in computer science and many of its applications, and their relevance is expected to grow as information is amassed and shared at an accelerating pace. Several algorithms were discovered as a result of these needs, which in turn created the subfield of Pattern Matching. This book provides an overview of the current state of Pattern Matching as seen by specialists who have devoted years of study to the field. It covers most of the basic principles and presents material advanced enough to faithfully portray the current frontier of research. Because of these recent advances, this is the right time for a book that brings together information relevant to both graduate students and specialists in need of an in-depth reference.
MoreTable of Contents:
Off-Line Serial Exact String Searching
Off-Line Parallel Exact String Searching
On-Line String Searching
Serial Computations of Levenshtein Distances
Parallel Computations of Levenshtein Distances
Approximate String Searching
Dynamic Programming: Special Cases
Shortest Common Superstrings
Two Dimensional Matching
Suffix Tree Data Structures for Matrices
Tree Pattern Matching
