Pattern matching in the Hamming distance with thresholds

DOI10.1016/j.ipl.2011.04.004zbMath1260.68487OpenAlexW1985046248MaRDI QIDQ1944111

Mikhail J. Atallah, Timothy W. Duket

Publication date: 4 April 2013

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

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

zbMATH Keywords

convolutionHamming distancepattern matching

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (4)

Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. ⋮ On approximate pattern matching with thresholds ⋮ Hamming Distance Completeness ⋮ Recent advances in text-to-pattern distance algorithms

Cites Work

• Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
• Generalized String Matching
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pattern matching in the Hamming distance with thresholds