Hidden pattern statistics

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

Volumn 2076 LNCS, Issue , 2001, Pages 152-165

  Flajolet, Philippe ^a   Guivarch, Yves ^b   Szpankowski, Wojciech ^c   Vallée, Brigitte ^d  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITÉ DE RENNES 1   (France)

^c Purdue University   (United States)

^d UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; FORMAL LANGUAGES; INTRUSION DETECTION; MOLECULAR BIOLOGY; AUTOMATA THEORY; DATA HANDLING;

ANALYTIC COMBINATORICS; COMBINATORICS ON WORDS; CONVERGENCE OF MOMENTS; GAUSSIAN LIMIT; GENERATING FUNCTIONS; HIDDEN PATTERNS; MEMORYLESS SOURCE; SEQUENCE COMPARISONS;

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS;

EID: 84879531303     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_13     Document Type: Conference Paper

References (26)

1. A. Aczel, The Mystery of the Aleph. Mathematics, the Kabbalah, and the Search for Infinity, Four Walls Eight Windows, New York, 2000.
2. A. Apostolico and M. Atallah, Compact Recognizers of Episode Sequences, Submitted to Information and Computation.
3. E. Bender and F. Kochman, The Distribution of Subword Counts is Usually Normal, European Journal of Combinatorics, 14, 265-275, 1993.
4. P. Billingsley, Probability and Measure, Second Edition, John Wiley & Sons, New York, 1986.
5. L. Boasson, P. Cegielski, I. Guessarian, and Yuri Matiyasevich, Window-Accumulated Subsequence Matching Problem is Linear, In Proceedings of the Eighteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems: PODS 1999, ACM Press, 327-336, 1999.
6. J. Cĺement, P. Flajolet, and B. Valĺee, Dynamical Sources in Information Theory: A General Analysis of Trie Structures, Algorithmica, 29, 307-369, 2001.
7. M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, New York, 1994.
8. G. Das, R. Fleischer, L. G asieniec, D. Gunopulos, and J. K̈arkk̈ainen, Episode Matching, In Combinatorial Pattern Matching, 8th Annual Symposium, Lecture Notes in Computer Science vol. 1264, 12-27, 1997.
9. L. Guibas and A. M. Odlyzko, Periods in Strings, J. Combinatorial Theory Ser. A, 30, 19-43, 1981.
10. L. Guibas and A. M. Odlyzko, String Overlaps, Pattern Matching, and Nontran-sitive Games, J. Combinatorial Theory Ser. A, 30, 183-208, 1981.
11. Y. Guivarc'h, Marches aĺeatoires sur les groupes, Fascicule de probabilit́e s, Publ. Inst. Rech. Math. Rennes, 2000.
12. D. E. Knuth, The Art of Computer Programming, Fundamental Algorithms, Vol. 1, Third Edition, Addison-Wesley, Reading, MA, 1997.
13. G. Kucherov and M. Rusinowitch, Matching a Set of Strings with Variable Length Don't Cares, Theoretical Computer Science 178, 129-154, 1997.
14. S. Kumar and E. H. Spafford, A Pattern-Matching Model for Intrusion Detection, Proceedings of the National Computer Security Conference, 11-21, 1994.
15. P. Nicod̀eme, B. Salvy, and P. Flajolet, Motif Statistics, European Symposium on Algorithms, Lecture Notes in Computer Science, No. 1643, 194-211, 1999.
16. M. Ŕegnier and W. Szpankowski, On the Approximate Pattern Occurrences in a Text, Proc. Compression and Complexity of SEQUENCE'97, IEEE Computer Society, 253-264, Positano, 1997.
17. M. Ŕegnier and W. Szpankowski, On Pattern Frequency Occurrences in a Marko-vian Sequence, Algorithmica, 22, 631-649, 1998.
18. I. Rigoutsos, A. Floratos, L. Parida, Y. Gao and D. Platt, The Emergence of Pattern Discovery Techniques in Computational Biology, Metabolic Engineering, 2, 159-177, 2000.
19. R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA, 1995.
20. J. M. Steele, Probability Theory and Combinatorial Optimization, SIAM, Philadelphia, 1997.
21. W. Szpankowski, Average Case Analysis of Algorithms on Sequences, John Wiley & Sons, New York, 2001.
22. B. Valĺee, Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes, Algorithmica, 29, 262-306, 2001.
23. A. Vanet, L. Marsan, and M.-F. Sagot, Promoter sequences and algorithmical methods for identifying them, Res. Microbiol. , 150, 779-799, 1999.
24. M. Waterman, Introduction to Computational Biology, Chapman and Hall, London, 1995.
25. A. Wespi, H. Debar, M. Dacier, and M. Nassehi, Fixed vs. Variable-Length Patterns For Detecting Suspicious Process Behavior, J. Computer Security, 8, 159-181, 2000.
26. S. Wu and U. Manber, Fast Text Searching Allowing Errors, Comm. ACM, 35:10, 83-991, 1995.