An acceleration of FFT-based algorithms for the match-count problem

DOI10.1016/J.IPL.2017.04.013zbMath1409.68349OpenAlexW2609041023MaRDI QIDQ2628276

Kensuke Baba

Publication date: 13 June 2017

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

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

zbMATH Keywords

algorithmsconvolutionFFTprocessing timematch-count problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Numerical methods for discrete and fast Fourier transforms (65T50) Algorithms on strings (68W32)

Uses Software

• word2vec

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
• A lower-variance randomized algorithm for approximate string matching
• Generalized String Matching
• Algorithms on Strings, Trees and Sequences
• FFT-based algorithms for the string matching with mismatches problem
• A randomized algorithm for approximate string matching

This page was built for publication: An acceleration of FFT-based algorithms for the match-count problem