Constant-space string-matching in sublinear average time

DOI10.1016/S0304-3975(98)00259-XzbMath0916.68113OpenAlexW3035186240WikidataQ61677968 ScholiaQ61677968MaRDI QIDQ1292492

Maxime Crochemore, Leszek Gąsieniec, Wojciech Rytter

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00259-x

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

An artificial neural network based approach for online string matching/filtering of large databases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Speeding up two string-matching algorithms
• Saving comparisons in the Crochemore-Perrin string-matching algorithm
• The zooming method: A recursive approach to time-space efficient string-matching
• Time-space-optimal string matching
• On improving the worst case running time of the Boyer-Moore string matching algorithm
• The Complexity of Pattern Matching for a Random String
• Fast Pattern Matching in Strings
• Two-way string-matching
• Fast algorithms for two dimensional and multiple pattern matching