An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms

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...

Full description

Bibliographic Details
Main Authors: Sven Rahmann, Tobias Marschall
Format: Article
Language:English
Published: MDPI AG 2011-10-01
Series:Algorithms
Subjects:
pattern matching
analysis of algorithms
finite automaton
minimization
deterministic arithmetic automaton
probabilistic arithmetic automaton
Online Access:http://www.mdpi.com/1999-4893/4/4/285/

Internet

http://www.mdpi.com/1999-4893/4/4/285/

Similar Items