Skip to Main content Skip to Navigation
Journal articles

Faster exact distributions of pattern statistics through sequential elimination of states

Donald E. K. Martin 1 Laurent Noé 2 
2 BONSAI - Bioinformatics and Sequence Analysis
Université de Lille, Sciences et Technologies, Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189, CNRS - Centre National de la Recherche Scientifique
Abstract : 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.
Complete list of metadata
Contributor : Laurent Noé Connect in order to contact the contributor
Submitted on : Wednesday, December 2, 2015 - 4:02:01 PM
Last modification on : Wednesday, March 23, 2022 - 3:51:19 PM



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



Record views