Waiting times for clumps of patterns and for structured motifs in random sequences

Discrete Applied Mathematics

Volumn 155, Issue 6-7, 2007, Pages 868-880

  Stefanov, V T ^a   Robin, S ^b   Schbath, S ^c  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

^b AGROPARISTECH   (France)

^c INRA Institut National de la Recherche Agronomique   (France)

Author keywords

Clump; DNA sequence; Pattern; Probability generating function; Random sum; Structured motif

Indexed keywords

APPROXIMATION THEORY; DATA STRUCTURES; DNA SEQUENCES; FUNCTION EVALUATION; NUMBER THEORY; PROBABILITY DISTRIBUTIONS;

INTERARRIVAL TIME; PROBABILITY GENERATING FUNCTIONS; RANDOM SUM; STRUCTURED MOTIF;

RANDOM PROCESSES;

EID: 33846796002     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.07.016     Document Type: Article

References (17)

1. Abate J., and Whitt W. Numerical inversion of probability generating functions. Oper. Res. Lett. 12 (1992) 245-251
2. Chryssaphinou O., Papastavridis S., and Vaggelatou E. Poisson approximation for the non-overlapping appearances of several words in Markov chains. Combin. Probab. Comput. 10 (2001) 293-308
3. Eskin E., and Pevzner P.A. Finding composite regulatory patterns in DNA sequences. Bioinformatics 18 (2002) S354-S363
4. Feller W. An Introduction to Probability Theory and its Applications, vol. 1. third ed. (1968), Wiley, New York
5. Guibas L.J., and Odlyzko A.M. Periods in strings. J. Combin. Theory A 30 (1981) 14-42
6. Lothaire M. Applied Combinatorics on Words (2005), Cambridge University Press, Cambridge
7. Marsan L., and Sagot M.-F. Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. J. Comput. Biol. 7 (2000) 345-360
8. Morgante M., Policriti A., Vitacolonna N., and Zuccolo A. Structured motifs search. RECOMB'04, Proceedings of the Eighth Annual International Conference on Computational Molecular Biology. San Diego, CA, USA (2004) 133-139
9. 70 Promoters and the Kinetics of the Steps of Transcription Initiation vol. 1 (1996), ASM Press
10. Régnier M. A unified approach to word occurrence probabilities. Discrete Appl. Math. 104 (2000) 259-280
11. Reinert G., and Schbath S. Compound Poisson and Poisson process approximations for occurrences of multiple words in Markov chains. J. Comput. Biol. 5 (1998) 223-253
12. Reinert G., Schbath S., and Waterman M. Probabilistic and statistical properties of words. J. Comput. Biol. 7 (2000) 1-46
13. Robin S., and Daudin J.-J. Exact distribution of word occurrences in a random sequence of letters. J. Appl. Probab. 36 (1999) 179-193
14. Robin S., and Daudin J.-J. Exact distribution of the distances between any occurrences of a set of words. Ann. Inst. Statist. Math. 36 (2001) 895-905
15. Robin S., Daudin J.-J., Richard H., Sagot M.-F., and Schbath S. Occurrence probability of structured motifs in random sequences. J. Comput. Biol. 9 (2002) 761-773
16. Schbath S. Compound Poisson approximation of word counts in DNA sequences. ESAIM: Probab. Statist. 1 (1995) 1-16
17. Stefanov V.T. The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach. J. Appl. Probab. 40 (2003) 881-892