Distribution of Clump Statistics for a Collection of Words

Abstract

We give an efficient method based on minimal deterministic finite automata for computing the exact distribution of the number of occurrences and coverage of clumps (maximal sets of overlapping words) of a collection of words. In addition, we compute probabilities for the number ofh-clumps, word groupings where gaps of a maximal lengthhbetween occurrences of words are allowed. The method facilitates the computation ofp-values for testing procedures. A word is allowed to contain other words of the collection, making the computation more general, but also more difficult. The underlying sequence is assumed to be Markovian of an arbitrary order.