Bit-parallel witnesses and their applications to approximate string matching
type: Item
instance of: scholarly article
title: Bit-parallel witnesses and their applications to approximate string matching
zbMATH Open document ID: 1069.68115
author: Heikki Hyyrö
author: Gonzalo Navarro
published in: Algorithmica
publication date: 2005-02-21T00:00:00Z
full work available at URL: http://hdl.handle.net/10533/176171
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 2135863
zbMATH Keywords: sublinear-time exact algorithm
MaRDI profile type: Publication
OpenAlex ID: W2070409660
DOI: 10.1007/S00453-004-1108-Z
Recommended article: Bit-parallel approximate string matching algorithms with transposition
Recommended article: String Processing and Information Retrieval
Recommended article: Q4737701
Recommended article: Increased bit-parallelism for approximate and multiple string matching
Recommended article: Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
Recommended article: A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
Recommended article: Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
Recommended article: Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
Recommended article: On the lower bound for parallel string matching
description: scientific article; zbMATH DE number 2135863