Pattern matching statistics on correlated sources

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3887 LNCS, Issue , 2006, Pages 224-237

  Bourdon, Jérémie ^a   Vallée, Brigitte ^b  

^a UNIVERSITÉ DE NANTES   (France)

^b UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CORRELATION THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; PARAMETER ESTIMATION; STATISTICS;

CORRELATED MODEL; DYNAMICAL SYSTEMS; MEMORYLESS SOURCES; PATTERN MATCHING ALGORITHMS;

PATTERN MATCHING;

EID: 33745588542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_24     Document Type: Conference Paper

References (18)

1. J. BOURDON, B. VALLÉE, Generalized pattern matching statistics. In Birkhauser, T.i.M., ed,: Mathematics and Computer Science II. (2002) 249-265
2. J. BOURDON, Size and path length of Patricia tries: dynamical sources context. Random Structures Algorithms 10 (2001) 289-315
3. E. BENDER, F. KOCHMAN, The distribution of subword counts is usually normal. European Journal of Combinatorics 14 (1993) 265-275
4. F. CHAZAL, V. MAUME-DESCHAMPS, B. VALLÉE, Systémes dynamiques et algorithmique. In INRIA Research Report 5003. (2003) 121-150
5. J. CLÉMENT, P. FLAJOLET, B. VALLÉE, Dynamical sources in information theory: a general analysis of trie structures. Algorithmica 20 (2001) 307-369
6. P. FLAJOLET, W. SZPANKOWSKI, B. VALLÉE, Hidden word statistics, to appear in Journal de 1'ACM (2005)
7. H.K. HWANG, Théorèmes limites pour les structures combinatoires et les fonctions arithmétiques. PhD thesis, Ecole Polytechnique, Palaiseau, France (1994)
8. P. NICODÉME, T. DOERKS, M. VINGRON, Proteome analysis baaed on motif statistics. Bioinformatics 18 (2002) 161-171
9. P. NICODÉME, B. SALVY, P. FLAJOLET, Motif statistics. Theoretical Computer Science 287 (2002) 593-617
10. M. RÉGNIER, W. SZPANKOWSKI, On the approximate pattern occurrences in a text. In: Proc. SEQUENCE'97, IEEE Computer Society. (1997) 253-264
11. M. RÉGNIER, W. SZPANKOWSKI, On pattern frequency occurrences in a Markovian sequence. Algorithmica 22 (1998) 631-649
12. I. RIGOUTSOS, A. FLORATOS, L. PARIDA, Y. CAO, D. PLATT, The emergence of pattern discovery techniques in computational biology. J. of Met. Eng. 2 (2000) 159-177
13. R. SEDGEWICK, P. FLAJOLET, An introduction to the analysis of algorithms. Foreword by D. E. Knuth. Amsterdam: Addison-Wesley. xv, 492 p. (1996)
14. W. SZPANKOWSKI, Average case analysis of algorithms on sequences. Wiloy-Interscience Series in Discrete Mathematics and Optimization (2001)
15. B. VALLÉE, Euclidean Dynamics to appear in Discrete and Continuous Dynamical Systems, 2005, web page: www.info.unicaen.fr/~brigitte
16. B. VALLÉE, Dynamical sources in information theory: fundamental intervals and word prefixes. Algorithmica 20 (2001) 262-306
17. A. VANET, L. MARSAN, M.F. SAGOT, Promoter sequences and algorithmical methods for identifying them. Research in Microbiology 150 (1999) 779-799
18. M. S. WATERMAN, Introduction to Computational Biology. Chapman & Hall (1995)