A word counting graph

MaRDI QIDQ3084794zbMATH OpenFDO

Authors Mireille Régnier, Zara Kirakosyan, Evgenia Furletova, Mikhail Roytberg

Publication date 25 March 2011

zbMATH Keywords

Aho-Corasick automatonalgorithm analysisBernoulli modelcounting occurrences of wordsgraph algorithmMarkov model

Mathematics Subject Classification ID

Combinatorial probability (60C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorics on words (68R15) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1746442
• scientific article; zbMATH DE number 1615294
• Distribution of clump statistics for a collection of words
• scientific article; zbMATH DE number 1998338
• A unified approach to word occurrence probabilities

Cited in

(7)

• Analytic combinatorics for computing seeding probabilities
• scientific article; zbMATH DE number 1615294 (Why is no real title available?)
• Counting occurrences for a finite set of words: an inclusion-exclusion approach
• scientific article; zbMATH DE number 1746442 (Why is no real title available?)
• Clump combinatorics, automata, and word asymptotics
• AWLCO: All-Window Length Co-Occurrence
• Words and graphs

This page was built for publication: A word counting graph

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