A filtering algorithm for \(k\)-mismatch with don't cares
type: Item
instance of: scholarly article
title: A filtering algorithm for \(k\)-mismatch with don't cares
zbMATH Open document ID: 1379.68368
author: Raphaël Clifford
author: Ely Porat
published in: Information Processing Letters
publication date: 2017-11-03T00:00:00Z
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6802652
zbMATH Keywords: design of algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: string algorithms
zbMATH Keywords: don't cares
zbMATH Keywords: pattern matching
zbMATH Keywords: filtering
zbMATH Keywords: fast Fourier transforms
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.08.012
OpenAlex ID: W2036792248
cites work: Generalized String Matching
cites work: Faster algorithms for string matching with k mismatches
cites work: A fast string searching algorithm
cites work: A Linear Size Index for Approximate Pattern Matching
cites work: Sublinear approximate string matching and biological applications
cites work: Simple deterministic wildcard matching
cites work: Dictionary matching and indexing with errors and don't cares
cites work: Verifying candidate matches in sparse and wildcard matching
cites work: Q3619797
cites work: Q4055156
cites work: Q4828997
cites work: Fast Pattern Matching in Strings
cites work: Efficient string matching with k mismatches
DOI: 10.1016/J.IPL.2010.08.012
description: scientific article; zbMATH DE number 6802652