Fast Packed String Matching for Short Patterns

DOI10.1137/1.9781611972931.10zbMath1430.68460arXiv1209.6449OpenAlexW4205287277MaRDI QIDQ5232452

M. Oğuzhan Külekci, Simone Faro

Publication date: 12 September 2019

Published in: 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.6449

Mathematics Subject Classification ID

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

Related Items

Fast and flexible packed string matching, Compact suffix automata representations for searching long patterns, The order-preserving pattern matching problem in practice, Parallel String Matching, Efficient string matching based on a two-step simulation of the suffix automaton