Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Rare Events and Cond ...
Article

Rare Events and Conditional Events on Random Strings

Mireille Régnier (1), Alain Denise ORCID (2)
(1) Algorithms
(2) Laboratoire de Recherche en Informatique
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2004
Last modified on
March 31, 2025
Volume 6
vol. 6:2
DOI
10.46298/dmtcs.310
License
https://about.hal.science/hal-authorisation-v1
Indicators
1037
Views
969
Downloads

Rare Events and Conditional Events on Random Strings

Mireille Régnier (1), Alain Denise ORCID (2)
(1) Algorithms
(2) Laboratoire de Recherche en Informatique
Abstract
Some strings -the texts- are assumed to be randomly generated, according to a probability model that is either a Bernoulli model or a Markov model. A rare event is the over or under-representation of a word or a set of words. The aim of this paper is twofold. First, a single word is given. One studies the tail distribution of the number of its occurrences. Sharp large deviation estimates are derived. Second, one assumes that a given word is overrepresented. The distribution of a second word is studied; formulae for the expectation and the variance are derived. In both cases, the formulae are accurate and actually computable. These results have applications in computational biology, where a genome is viewed as a text.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • large deviations
  • combinatorics
  • generating fumctions
  • words
  • genome
  • computable closed formulae.
  • computable closed formulae
Cited by

Source: OpenCitations

  • Bayesian Centroid Estimation for Motif Discovery

    PLoS ONE

    Authors : Luis Carvalho ORCID

    Journal reference : Volume 8, 2013, pp. e80511

    DOI : 10.1371/journal.pone.0080511
Preview
Loading PDF preview...