Improved pattern-scan-order algorithms for string matching
From MaRDI portal
Publication:1784983
DOI10.1016/J.JDA.2018.05.002zbMATH Open1400.68266OpenAlexW2806655200WikidataQ129761708 ScholiaQ129761708MaRDI QIDQ1784983FDOQ1784983
Authors: Cheol Ryu, Kunsoo 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
Recommendations
Cites Work
- Introduction to algorithms.
- A fast string searching algorithm
- Fast Pattern Matching in Strings
- Title not available (Why is that?)
- The exact online string matching problem: a review of the most recent results
- The Complexity of Pattern Matching for a Random String
- On the Exact Complexity of String Matching: Upper Bounds
- Average running time of the Boyer-Moore-Horspool algorithm
- Exact analysis of Horspool's and Sunday's pattern matching algorithms with probabilistic arithmetic automata
- Designing optimal- and fast-on-average pattern matching algorithms
- Average case analysis of the Boyer‐Moore algorithm
- Correctness and efficiency of pattern matching algorithms
- Fastest Pattern Matching in Strings
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- Tighter Upper Bounds on the Exact Complexity of String Matching
- Title not available (Why is that?)
- Irredundant intervals
Cited In (3)
This page was built for publication: Improved pattern-scan-order algorithms for string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784983)
