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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Information processing letters Ročník 108; číslo 5; s. 313 - 319
Hlavní autor:	Hyyrö, Heikki
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 15.11.2008 Elsevier Science Elsevier Sequoia S.A
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!