A faster quick search algorithm

DOI10.3390/a7020253zbMath1461.68269OpenAlexW2165292775MaRDI QIDQ1736618

Donald A. Adjeroh, Jie Lin, Yue Jiang

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a7020253

zbMATH Keywords

exact pattern matchingmaximum statistical expected shiftquick search algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Protein sequences, DNA sequences (92D20) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• A simple fast hybrid pattern-matching algorithm
• Average-optimal string matching
• Optimal canonization of all substrings of a string
• Pattern Matching in Compressed Texts and Images
• The exact online string matching problem
• On improving the worst case running time of the Boyer-Moore string matching algorithm
• A fast string searching algorithm
• The Boyer–Moore–Galil String Searching Strategies Revisited
• Efficient randomized pattern-matching algorithms
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences

This page was built for publication: A faster quick search algorithm