A unified approach to word occurrence probabilities
From MaRDI portal
Publication:1585335
DOI10.1016/S0166-218X(00)00195-5zbMath0987.92017MaRDI QIDQ1585335
Publication date: 18 February 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Combinatorics in computer science (68R05) Biochemistry, molecular biology (92C40) Enumerative combinatorics (05A99) Computational methods for problems pertaining to biology (92-08) Theory of computing (68Q99)
Related Items (21)
Some probabilistic results on the nonrandomness of simple sequence repeats in DNA sequences ⋮ Context Trees, Variable Length Markov Chains and Dynamical Sources ⋮ Waiting times for clumps of patterns and for structured motifs in random sequences ⋮ String matching and 1d lattice gases ⋮ Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source ⋮ Clustering genomic words in human DNA using peaks and trends of distributions ⋮ Large deviation properties for patterns ⋮ Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics ⋮ Construction of minimal deterministic finite automata from biological motifs ⋮ Shuffling biological sequences with motif constraints ⋮ Multiple pattern matching: a Markov chain approach ⋮ Growth of repetition-free words -- a review ⋮ Markov Additive Processes and Repeats in Sequences ⋮ On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source ⋮ Distribution of base pair alternations in a periodic DNA chain: application of Pólya counting to a physical system ⋮ Waiting time and complexity for matching patterns with automata ⋮ Large deviations and full Edgeworth expansions for finite Markov chains with applications to the analysis of genomic sequences ⋮ Moderate Deviations for Word Counts in Biological Sequences ⋮ Digital search trees and chaos game representation ⋮ Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain ⋮ A Compound Poisson Model for Word Occurrences in DNA Sequences
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The distribution of subword counts is usually normal
- A martingale approach to the study of occurrence of sequence patterns in repeated experiments
- String overlaps, pattern matching, and nontransitive games
- On pattern frequency occurrences in a Markovian sequence
- The Distribution of the Frequency of Occurrence of Nucleotide Subsequences, Based on Their Overlap Capability
- Renewal theory for several patterns
- A note on repeated sequences in Markov chains
- Some useful statistical properties of position-weight matrices
- Repetitive DNA sequences: Some considerations for simple sequence repeats
- A Note on Distributional Equality in the Cyclic Tour Property for Markov Chains
- Compound Poisson approximations for word patterns under Markovian hypotheses
This page was built for publication: A unified approach to word occurrence probabilities
