Open AccessThis article is
- freely available
An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms
Centrum Wiskunde & Informatica (CWI), Science Park 123, 1098 XG Amsterdam, The Netherlands
Genome Informatics, Faculty of Medicine, University of Duisburg-Essen, Hufelandstr. 55, 45122 Essen, Germany
Bioinformatics, Computer Science XI, TU Dortmund, 44221 Dortmund, Germany
* Authors to whom correspondence should be addressed.
Received: 14 October 2011; in revised form: 26 October 2011 / Accepted: 26 October 2011 / Published: 31 October 2011
Abstract: 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 algorithm’s running time cost (such as the number of text character accesses) for any given pattern in a random text model. Text models range from simple uniform models to higher-order Markov models or hidden Markov models (HMMs). Furthermore, we provide an algorithm to compute the exact distribution of differences in running time cost of two pattern matching algorithms. Methodologically, we use extensions of finite automata which we call deterministic arithmetic automata (DAAs) and probabilistic arithmetic automata (PAAs) . Given an algorithm, a pattern, and a text model, a PAA is constructed from which the sought distributions can be derived using dynamic programming. To our knowledge, this is the first time that substring- or suffix-based pattern matching algorithms are analyzed exactly by computing the whole distribution of running time cost. Experimentally, we compare Horspool’s algorithm, Backward DAWG Matching, and Backward Oracle Matching on prototypical patterns of short length and provide statistics on the size of minimal DAAs for these computations.
Keywords: pattern matching; analysis of algorithms; finite automaton; minimization; deterministic arithmetic automaton; probabilistic arithmetic automaton
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Marschall, T.; Rahmann, S. An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms. Algorithms 2011, 4, 285-306.
Marschall T, Rahmann S. An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms. Algorithms. 2011; 4(4):285-306.
Marschall, Tobias; Rahmann, Sven. 2011. "An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms." Algorithms 4, no. 4: 285-306.