Bookbot

Computer Algorithms

String Pattern Matching Strategies

En savoir plus sur le livre

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.

Achat du livre

Computer Algorithms, Jun-ichi Aoe

Langue
Année de publication
1994
product-detail.submit-box.info.binding
(rigide)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.

Modes de paiement

Personne n'a encore évalué .Évaluer

Titre
Computer Algorithms
Sous-titre
String Pattern Matching Strategies
Langue
Anglais
Publié
1994
Format
rigide
ISBN10
0818654627
ISBN13
9780818654626
Séries
Description
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.