Improved and self-tuned occurrence heuristics

DOI10.1016/j.jda.2014.07.006zbMath1305.68378OpenAlexW2004443209MaRDI QIDQ405578

Domenico Cantone, Simone Faro

Publication date: 5 September 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2014.07.006

zbMATH Keywords

string matchingexperimental algorithmsfrequency of charactersoccurrence heuristicstext-processingtuned-search approach

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (3)

Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition ⋮ Faster string matching based on hashing and bit-parallelism ⋮ A Very Fast String Matching Algorithm Based on Condensed Alphabets

Cites Work

• A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
• Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
• The exact online string matching problem
• A fast string searching algorithm
• The Complexity of Pattern Matching for a Random String
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved and self-tuned occurrence heuristics