Counting Regular Expressions in Degenerated Sequences through Lazy Markov Chain Embedding

DOI10.5176/2251-1911_CMCGS14.28zbMath1332.92007OpenAlexW2087316471MaRDI QIDQ2787276

Gregory Nuel, V. Delos

Publication date: 25 February 2016

Published in: 3rd Annual International Conference on Computational Mathematics, Computational Geometry & Statistics (CMCGS 2014) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5176/2251-1911_cmcgs14.28

zbMATH Keywords

pattern matchingdeterministic finite automatonnext-generation sequencingnondeterministic finite automatonlazy determinization

Mathematics Subject Classification ID

General biostatistics (92B15) Cellular automata (computational aspects) (68Q80) Genetics and epigenetics (92D10)

Related Items (4)

Analytic combinatorics for computing seeding probabilities ⋮ Moments of the count of a regular expression in a heterogeneous random sequence ⋮ countmotif ⋮ fsaLib

This page was built for publication: Counting Regular Expressions in Degenerated Sequences through Lazy Markov Chain Embedding