Cited in
(7)- An algorithm to compute the character access count distribution for pattern matching algorithms
- Multiple pattern matching: a Markov chain approach
- Approximation of sojourn-times via maximal couplings: motif frequency distributions
- SPatt
- RSEARCH
- On correlation polynomials and subword complexity
- Counting occurrences for a finite set of words: an inclusion-exclusion approach
This page was built for software: Regexpcount
