Faster algorithms for string matching problems: matching the convolution bound

DOI10.1109/SFCS.1998.743440MaRDI QIDQ6909506zbMATH OpenFDO

Authors Piotr Indyk

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1109/SFCS.1998.743440

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(3)

• Exploiting pseudo-locality of interchange distance
• Longest common extensions with wildcards: trade-off and applications
• Pattern matching with mismatches and wildcards

This page was built for publication: Faster algorithms for string matching problems: matching the convolution bound

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