A filtering algorithm for \(k\)-mismatch with don't cares

DOI10.1016/j.ipl.2010.08.012zbMath1379.68368OpenAlexW2036792248MaRDI QIDQ1675785

Ely Porat, Raphaël Clifford

Publication date: 3 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.08.012

zbMATH Keywords

fast Fourier transformscombinatorial problemsfilteringdesign of algorithmspattern matchingstring algorithmsdon't cares

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (4)

Pattern matching with don't cares and few errors ⋮ A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance ⋮ On string matching with mismatches ⋮ Streaming pattern matching with \(d\) wildcards

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple deterministic wildcard matching
• Efficient string matching with k mismatches
• Sublinear approximate string matching and biological applications
• A fast string searching algorithm
• Verifying candidate matches in sparse and wildcard matching
• Dictionary matching and indexing with errors and don't cares
• Generalized String Matching
• Fast Pattern Matching in Strings
• Faster algorithms for string matching with k mismatches
• A Linear Size Index for Approximate Pattern Matching

This page was built for publication: A filtering algorithm for \(k\)-mismatch with don't cares