Motif statistics.
type: Item
instance of: scholarly article
title: Motif statistics.
zbMATH Open document ID: 1061.68118
DOI: 10.1016/S0304-3975(01)00264-X
author: Pierre Nicodème
author: Bruno Salvy
author: Philippe Flajolet
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05A16
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 1857040
describes a project that uses: gfun
MaRDI profile type: Publication
cites work: Central and local limit theorems applied to asymptotic enumeration
cites work: The distribution of subword counts is usually normal
cites work: Central and local limit theorems applied to asymptotic enumeration. III. Matrix recursions
cites work: From regular expressions to deterministic automata
cites work: Q3794956
cites work: Regular expressions into finite automata
cites work: Q5526125
cites work: Deviations from uniformity in random strings
cites work: Q3254327
cites work: Effective asymptotics of linear recurrences with rational coefficients
cites work: String overlaps, pattern matching, and nontransitive games
cites work: Q3862379
cites work: Q4851553
cites work: Q3935355
cites work: Q4344149
cites work: Q4304296
cites work: Q4322331
cites work: The computation of nearly minimal Steiner trees in graphs
cites work: On pattern frequency occurrences in a Markovian sequence
cites work: GFUN
cites work: Dynamical sources in information theory: Fundamental intervals and word prefixes
cites work: Q4315008
full work available at URL: s0304-3975(01)00264-x
OpenAlex ID: W2912570624
description: scientific article; zbMATH DE number 1857040