An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms
We propose a framework for the exact probabilistic analysis of window-based pattern matching algorithms, such as Boyer–Moore, Horspool, Backward DAWG Matching, Backward Oracle Matching, and more. In particular, we develop an algorithm that efficiently computes the distribution of a pattern matching...
Main Authors: | Sven Rahmann, Tobias Marschall |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2011-10-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/4/4/285/ |
Similar Items
-
Fast Algorithms for Computing the Statistics of Pattern Matching
by: Danna Zhang, et al.
Published: (2021-01-01) -
Permuted Pattern Matching Algorithms on Multi-Track Strings
by: Diptarama Hendrian, et al.
Published: (2019-04-01) -
Finite Automata Implementations Considering CPU Cache
by: J. Holub
Published: (2007-01-01) -
Some Accepting Powers of Bottom-Up Pyramid Cellular Acceptors with n-dimensional Layers
by: Makoto Sakamoto, et al.
Published: (2014-12-01) -
Homogeneous Systolic Pyramid Automata with n-Dimensional Layers
by: Makoto Sakamoto, et al.
Published: (2014-12-01)