Improved and self-tuned occurrence heuristics

DOI10.1016/J.JDA.2014.07.006zbMATH Open1305.68378OpenAlexW2004443209MaRDI QIDQ405578FDOQ405578

Authors: 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

Recommendations

• Analysis of Boyer-Moore-Horspool string-matching heuristic
• Fastest Pattern Matching in Strings
• Improving practical exact string matching
• scientific article; zbMATH DE number 1615293
• Simple Optimal String Matching Algorithm

zbMATH Keywords

string matchingexperimental algorithmsfrequency of charactersoccurrence heuristicstext-processingtuned-search approach

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Title not available (Why is that?)
• A fast string searching algorithm
• The exact online string matching problem: a review of the most recent results
• Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
• Title not available (Why is that?)
• The Complexity of Pattern Matching for a Random String
• Title not available (Why is that?)
• Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
• A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms

Cited In (4)

• Linear and efficient string matching algorithms based on weak factor recognition
• Title not available (Why is that?)
• A very fast string matching algorithm based on condensed alphabets
• Faster string matching based on hashing and bit-parallelism

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405578)