scientific article; zbMATH DE number 1998338

MaRDI QIDQ4432973zbMATH OpenFDO

Authors Pierre Nicodème

Publication date 2003

zbMATH Keywords

generating functionsmarked automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15) Symbolic computation and algebraic computation (68W30) Protein sequences, DNA sequences (92D20)

Recommendations

• Motif statistics.
• scientific article; zbMATH DE number 1405792
• A unified approach to word occurrence probabilities
• Numerical Solutions for Patterns Statistics on Markov Chains
• Publication:4886090

Cited in

(10)

• Regexpcount
• An algorithm to compute the character access count distribution for pattern matching algorithms
• Motif statistics.
• Moments of the count of a regular expression in a heterogeneous random sequence
• Approximation of sojourn-times via maximal couplings: motif frequency distributions
• Counting regular expressions in degenerated sequences through lazy Markov chain embedding
• A word counting graph
• scientific article; zbMATH DE number 1405792 (Why is no real title available?)
• Computation of exact probabilities associated with overlapping pattern occurrences
• Multiple pattern matching: a Markov chain approach

This page was built for publication:

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