Complexity of substring search in a set of strings

DOI10.3103/S0027132218030038zbMath1400.68265OpenAlexW2850045997MaRDI QIDQ1791617

E. M. Perper

Publication date: 10 October 2018

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132218030038

Mathematics Subject Classification ID

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

Related Items (1)

Complexity of substring search in a set of strings

Cites Work

• Unnamed Item
• Complexity of substring search in a set of strings
• On improving the worst case running time of the Boyer-Moore string matching algorithm
• Fast Pattern Matching in Strings

This page was built for publication: Complexity of substring search in a set of strings