Switch to
| Predicate | Object |
|---|---|
| rdf:type | |
| lifeskim:mentions | |
| pubmed:issue |
2
|
| pubmed:dateCreated |
1998-10-19
|
| pubmed:abstractText |
We derive a Poisson process approximation for the occurrences of clumps of multiple words and a compound Poisson process approximation for the number of occurrences of multiple words in a sequence of letters generated by a stationary Markov chain. Using the Chen-Stein method, we provide a bound on the error in the approximations. For rare words, these errors tend to zero as the length of the sequence increases to infinity. Modeling a DNA sequence as a stationary Markov chain, we show as an application that the compound Poisson approximation is efficient for the number of occurrences of rare stem-loop motifs.
|
| pubmed:language |
eng
|
| pubmed:journal | |
| pubmed:citationSubset |
IM
|
| pubmed:chemical | |
| pubmed:status |
MEDLINE
|
| pubmed:issn |
1066-5277
|
| pubmed:author | |
| pubmed:issnType |
Print
|
| pubmed:volume |
5
|
| pubmed:owner |
NLM
|
| pubmed:authorsComplete |
Y
|
| pubmed:pagination |
223-53
|
| pubmed:dateRevised |
2006-11-15
|
| pubmed:meshHeading | |
| pubmed:year |
1998
|
| pubmed:articleTitle |
Compound Poisson and Poisson process approximations for occurrences of multiple words in Markov chains.
|
| pubmed:affiliation |
Department of Statistics, UCLA 90095, USA.
|
| pubmed:publicationType |
Journal Article,
Research Support, U.S. Gov't, Non-P.H.S.,
Research Support, Non-U.S. Gov't
|