Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
type: Item
instance of: scholarly article
title: Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
zbMATH Open document ID: 1251.68306
author: Kimmo Fredriksson
author: Szymon Grabowski
published in: European Journal of Combinatorics
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 6106893
zbMATH Keywords: approximate string matching
zbMATH Keywords: pattern matching
zbMATH Keywords: convolutions
zbMATH Keywords: word RAM model of computation
MaRDI profile type: Publication
full work available at URL: j.ejc.2012.07.013
OpenAlex ID: W1994855795
cites work: Generalized String Matching
cites work: Q5506324
cites work: Q4952702
cites work: Combinatorial Pattern Matching
cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
cites work: An improved construction of progression-free sets
cites work: Q4055156
cites work: Surpassing the information theoretic bound with fusion trees
cites work: Fast Convolutions and Their Applications in Approximate String Matching
cites work: Q3747742
cites work: Data structures and algorithms for approximate string matching
cites work: Finding large 3-free sets. I. The small \(n\) case
cites work: Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
cites work: Q3997075
cites work: Algorithms on Strings, Trees and Sequences
cites work: Q5585020
cites work: Efficient string matching with k mismatches
cites work: Faster pattern matching with character classes using prime number encoding
cites work: On Certain Sets of Integers
cites work: On Roth's theorem on progressions
cites work: Q4471360
DOI: 10.1016/J.EJC.2012.07.013
description: scientific article; zbMATH DE number 6106893