An algorithm to compute the character access count distribution for pattern matching algorithms
DOI10.3390/A4040285zbMATH Open1461.68270DBLPjournals/algorithms/MarschallR11OpenAlexW2105205612WikidataQ61704584 ScholiaQ61704584MaRDI QIDQ1736492FDOQ1736492
Authors: Tobias Marschall, Sven Rahmann 
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a4040285
Recommendations
- Exact analysis of Horspool's and Sunday's pattern matching algorithms with probabilistic arithmetic automata
- Analysis of Boyer-Moore-Horspool string-matching heuristic
- Designing optimal- and fast-on-average pattern matching algorithms
- On the Expected Sublinearity of the Boyer–Moore Algorithm
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
minimizationanalysis of algorithmspattern matchingfinite automatondeterministic arithmetic automatonprobabilistic arithmetic automaton
Cites Work
- Title not available (Why is that?)
- Motif statistics.
- Title not available (Why is that?)
- Speeding up two string-matching algorithms
- A fast string searching algorithm
- Fast Pattern Matching in Strings
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
- Title not available (Why is that?)
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
- Multiple pattern matching: a Markov chain approach
- Re-describing an algorithm by Hopcroft
- Average running time of the Boyer-Moore-Horspool algorithm
- The Boyer-Moore-Horspool heuristic with Markovian input
- Analysis of Boyer-Moore-Horspool string-matching heuristic
- Exact analysis of Horspool's and Sunday's pattern matching algorithms with probabilistic arithmetic automata
- Title not available (Why is that?)
- Average case analysis of the Boyer‐Moore algorithm
- Title not available (Why is that?)
Cited In (5)
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
- Waiting time and complexity for matching patterns with automata
- Optimal pattern matching algorithms
- Exact analysis of Horspool's and Sunday's pattern matching algorithms with probabilistic arithmetic automata
- Designing optimal- and fast-on-average pattern matching algorithms
Uses Software
This page was built for publication: An algorithm to compute the character access count distribution for pattern matching algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736492)
