Pattern Matching Algorithms
★★★★★
★★★★★
Regular price
€235.60
Category=PBM
Category=UYA
Category=UYQP
eq_computing
eq_isMigrated=1
eq_non-fiction
Product details
- ISBN 9780195113679
- Weight: 730g
- Dimensions: 234 x 156mm
- Publication Date: 31 Jul 1997
- Publisher: Oxford University Press Inc
- Publication City/Country: US
- Product Form: Hardback
Delivery/Collection within 10-20 working days
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
10-20 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
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.
Qty: