Improved pattern-scan-order algorithms for string matching

DOI10.1016/j.jda.2018.05.002zbMath1400.68266OpenAlexW2806655200WikidataQ129761708 ScholiaQ129761708MaRDI QIDQ1784983

Cheol Ryu, Kun Soo Park

Publication date: 27 September 2018

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

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

zbMATH Keywords

string matchingasymptotic speedpattern scan order

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (1)

Fast string matching for DNA sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Designing optimal- and fast-on-average pattern matching algorithms
• Correctness and efficiency of pattern matching algorithms
• Average running time of the Boyer-Moore-Horspool algorithm
• A taxonomy of sublinear multiple keyword pattern matching algorithms
• The exact online string matching problem
• A fast string searching algorithm
• Exact Analysis of Horspool’s and Sunday’s Pattern Matching Algorithms with Probabilistic Arithmetic Automata
• The Complexity of Pattern Matching for a Random String
• On the Exact Complexity of String Matching: Upper Bounds
• Fast Pattern Matching in Strings
• Fastest Pattern Matching in Strings
• Tighter Upper Bounds on the Exact Complexity of String Matching
• Irredundant intervals
• Average case analysis of the Boyer‐Moore algorithm

This page was built for publication: Improved pattern-scan-order algorithms for string matching