Faster exact distributions of pattern statistics through sequential elimination of states - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of the Institute of Statistical Mathematics Année : 2017

Faster exact distributions of pattern statistics through sequential elimination of states

(1) , (2)
1
2

Résumé

When using an auxiliary Markov chain (AMC) to compute sampling distributions, the computational complexity is directly related to the number of Markov chain states. For certain complex pattern statistics, minimal deterministic finite automata (DFA) have been used to facilitate efficient computation by reducing the number of AMC states. For example, when statistics of overlapping pattern occurrences are counted differently than non-overlapping occurrences, a DFA consisting of prefixes of patterns extended to overlapping occurrences has been generated and then minimized to form an AMC. However, there are situations where forming such a DFA is computationally expensive, e.g., with computing the distribution of spaced seed coverage. In dealing with this problem, we develop a method to obtain a small set of states during the state generation process without forming a DFA, and show that a huge reduction in the size of the AMC can be attained.
Fichier non déposé

Dates et versions

hal-01237045 , version 1 (02-12-2015)

Identifiants

Citer

Donald E. K. Martin, Laurent Noé. Faster exact distributions of pattern statistics through sequential elimination of states. Annals of the Institute of Statistical Mathematics, 2017, 69 (1), pp.231--248. ⟨10.1007/s10463-015-0540-y⟩. ⟨hal-01237045⟩
118 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More