Pattern Matching Algorithms
Book information
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.
Similar books
Combinatorial Pattern Matching: 4th Annual Symposium, CPM 93 Padova, Italy, June 2–4, 1993 Proceedings
1993 · PDF
Combinatorial Pattern Matching: Third Annual Symposium Tucson, Arizona, USA, April 29–May 1, 1992 Proceedings
1992 · PDF
Pattern Matching Algorithms
1997 · PDF
Combinatorial Pattern Matching: 4th Annual Symposium, CPM 93 Padova, Italy, June 2–4, 1993 Proceedings
1993 · DJVU
Combinatorial Pattern Matching: Third Annual Symposium Tucson, Arizona, USA, April 29–May 1, 1992 Proceedings
1992 · DJVU
Combinatorial Algorithms on Words
1985 · DJVU
Combinatorial Pattern Matching: 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3–5, 2002 Proceedings
2002 · PDF
Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005. Proceedings
2005 · PDF