FFT-based algorithms for the string matching with mismatches problem

DOI10.1016/J.JALGOR.2005.01.001zbMath1105.68117OpenAlexW1966672061MaRDI QIDQ5711729

David Yu Zhang, Tor Schoenmeyr

Publication date: 8 December 2005

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2005.01.001

zbMATH Keywords

FFTHamming distanceRandomized algorithmsString matching with mismatches

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (3)

An acceleration of FFT-based algorithms for the match-count problem ⋮ A lower-variance randomized algorithm for approximate string matching ⋮ Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform

This page was built for publication: FFT-based algorithms for the string matching with mismatches problem