The complexity of the Multiple Pattern Matching Problem for random strings

DOI10.1137/1.9781611975062.5zbMath1429.68337arXiv1706.04928OpenAlexW2625106766MaRDI QIDQ5195104

Tsinjo Rakotoarimalala, Frédérique Bassino, Andrea Sportiello

Publication date: 18 September 2019

Published in: 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

This page was built for publication: The complexity of the Multiple Pattern Matching Problem for random strings