The practical efficiency of convolutions in pattern matching algorithms

MaRDI QIDQ5506324zbMATH OpenFDO

Authors Amihood Amir, Liron Reuveni, Avivit Levy

Publication date 28 January 2009

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• On string pattern matching: A quantitative analysis and a proposal
• Faster algorithm for single pattern matching
• Some perils of performance prediction: A case study on pattern matching
• Algorithms for pattern matching
• scientific article; zbMATH DE number 2052914

Cited in

(6)

• Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
• Some perils of performance prediction: A case study on pattern matching
• Quasi-distinct Parsing and Optimal Compression Methods
• Quasi-distinct parsing and optimal compression methods
• On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
• A logarithmic time complexity algorithm for pattern searching using product-sum property

This page was built for publication: The practical efficiency of convolutions in pattern matching algorithms

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