Gratis Versand ab 16,99 €. Mehr Infos.
Bookbot

Computer Algorithms

String Pattern Matching Strategies

Autor*innen

Mehr zum Buch

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, and hardware matching.

Buchkauf

Computer Algorithms, Jun-ichi Aoe

Sprache
Erscheinungsdatum
1994
product-detail.submit-box.info.binding
(Hardcover)
Wir benachrichtigen dich per E-Mail.

Lieferung

  • Gratis Versand ab 16,99 € in ganz Deutschland! Mehr Infos.

Zahlungsmethoden

Keiner hat bisher bewertet.Abgeben

Titel
Computer Algorithms
Untertitel
String Pattern Matching Strategies
Sprache
Englisch
Autor*innen
Jun-ichi Aoe
Erscheinungsdatum
1994
Einband
Hardcover
ISBN10
0818654627
ISBN13
9780818654626
Reihe
Beschreibung
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, and hardware matching.