Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
type: Item
instance of: scholarly article
title: Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
zbMATH Open document ID: 1194.68255
author: Heikki Hyyrö
published in: Information Processing Letters
publication date: 2010-06-09T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 5719204
zbMATH Keywords: algorithms
zbMATH Keywords: edit distance
zbMATH Keywords: approximate string matching
zbMATH Keywords: bit-parallel algorithm
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.05.026
OpenAlex ID: W2090921859
cites work: Faster approximate string matching
cites work: Q4849531
cites work: Experimental and Efficient Algorithms
cites work: Bit-parallel approximate string matching algorithms with transposition
cites work: Tighter Packed Bit-Parallel NFA for Approximate String Matching
cites work: Q5528329
cites work: A fast bit-vector algorithm for approximate string matching based on dynamic programming
cites work: Q4534878
cites work: A subquadratic algorithm for approximate limited expression matching
DOI: 10.1016/J.IPL.2008.05.026
description: scientific article; zbMATH DE number 5719204