Toward the asymptotic count of bi-modular hidden patterns under probabilistic dynamical sources: a case study

MaRDI QIDQ2920876zbMATH OpenFDO

Authors Loïck Lhote, Manuel E. Lladser

Publication date 29 September 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAQ0133/0.html

zbMATH Keywords

pattern matchinghidden patternprobabilistic dynamical sourcenon-Markovian sequence

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial probability (60C05) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 1984547
• Pattern Matching Statistics on Correlated Sources
• Hidden words statistics for large patterns
• scientific article; zbMATH DE number 1754591
• Hidden word statistics

Cited in

(2)

• Pattern Matching Statistics on Correlated Sources
• Hidden words statistics for large patterns

This page was built for publication: Toward the asymptotic count of bi-modular hidden patterns under probabilistic dynamical sources: a case study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920876)