Shift finding in sub-linear time

DOI10.1137/1.9781611973105.33MaRDI QIDQ5741741zbMATH OpenOpenAlexFDO

Authors Alexandr Andoni, Haitham Hassanieh, Dina Katabi, Piotr Indyk

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973105.33

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Recommendations

• On approximate pattern matching with thresholds
• scientific article; zbMATH DE number 1555939
• Combinatorial Pattern Matching
• Efficient randomized pattern-matching algorithms
• A linear-time algorithm for Hamming distance with shifts

Cited in

(1)

• Quantum pattern matching fast on average

This page was built for publication: Shift finding in sub-linear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741741)