scientific article; zbMATH DE number 1998338

zbMATH Open1051.68154MaRDI QIDQ4432973FDOQ4432973

Authors: Pierre Nicodème 

Publication date: 2003

Title of this publication is not available (Why is that?)

Recommendations

• Motif statistics.
• Publication:4938777
• A unified approach to word occurrence probabilities
• Numerical Solutions for Patterns Statistics on Markov Chains
• Publication:4886090

zbMATH Keywords

generating functionsmarked automata

Mathematics Subject Classification ID

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

Cited In (10)

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

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)