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)
68R05: Combinatorics in computer science
92C40: Biochemistry, molecular biology
05A99: Enumerative combinatorics
92-08: Computational methods for problems pertaining to biology
68Q99: Theory of computing
Related Items
Markov Additive Processes and Repeats in Sequences, Digital search trees and chaos game representation, Construction of minimal deterministic finite automata from biological motifs, Waiting times for clumps of patterns and for structured motifs in random sequences, String matching and 1d lattice gases, Shuffling biological sequences with motif constraints, Multiple pattern matching: a Markov chain approach, Waiting time and complexity for matching patterns with automata, Growth of repetition-free words -- a review, On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source, Moderate Deviations for Word Counts in Biological Sequences, 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, Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
