Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching

We propose a new variant of the bit-parallel NFA of Baeza-Yates and Navarro (BPD) for approximate string matching [R. Baeza-Yates, G. Navarro, Faster approximate string matching, Algorithmica 23 (1999) 127–158]. BPD is one of the most practical approximate string matching algorithms under moderate p...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 108; no. 5; pp. 313 - 319
Main Author:	Hyyrö, Heikki
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 15.11.2008 Elsevier Science Elsevier Sequoia S.A
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximate string matching Approximation Bit-parallel algorithm Calculus of variations and optimal control Comparative analysis Computer science; control theory; systems Dynamic programming Edit distance Exact sciences and technology Mathematical analysis Mathematics Miscellaneous Sciences and techniques of general use Simulation Studies Theoretical computing Bit-parallel algorithm Edit distance Algorithms Approximate string matching OR algorithm Parallel algorithm Error estimation Computer theory Redundancy String matching Text Search algorithm Experimental result Simulation Dynamics Efficiency Information processing Dynamic programming Fast algorithm Vector Algorithm analysis Pattern matching Distance Threshold
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!