메뉴 건너뛰기




Volumn 57, Issue 6, 1996, Pages 307-312

On pattern occurrences in a random text

Author keywords

Asymptotic analysis; Autocorrelation polynomial; Bernoulli model; Generating functions; Pattern occurrence

Indexed keywords


EID: 0012483980     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00022-1     Document Type: Article
Times cited : (10)

References (16)
  • 1
    • 0028447376 scopus 로고
    • Sleepers and workaholics -caching in mobile wireless environments
    • Minneapolis
    • D. Barbara and T. Imielinski, Sleepers and workaholics -Caching in mobile wireless environments, in: Proc. ACM SIGMOD, Minneapolis (1994) 1-15.
    • (1994) Proc. ACM SIGMOD , pp. 1-15
    • Barbara, D.1    Imielinski, T.2
  • 2
    • 0013655609 scopus 로고
    • The occurrence of sequence patterns in ergodic markov chains
    • R. Benevento, The occurrence of sequence patterns in ergodic Markov chains, Stochastic Process. Appl. 17 (1984) 369-373.
    • (1984) Stochastic Process. Appl. , vol.17 , pp. 369-373
    • Benevento, R.1
  • 3
    • 0001371942 scopus 로고
    • Renewal theory for several patterns
    • S. Breen, M. Waterman and N. Zhang, Renewal theory for several patterns, J. Appl. Probab. 22 (1985) 228-234.
    • (1985) J. Appl. Probab. , vol.22 , pp. 228-234
    • Breen, S.1    Waterman, M.2    Zhang, N.3
  • 5
    • 0018006616 scopus 로고
    • Maximal prefix-synchronized codes
    • L. Guibas and A. Odlyzko, Maximal prefix-synchronized codes, SIAM J. Appl. Math. 35 (1978) 401-418.
    • (1978) SIAM J. Appl. Math. , vol.35 , pp. 401-418
    • Guibas, L.1    Odlyzko, A.2
  • 7
    • 34250201608 scopus 로고
    • String overlaps, pattern matching and nontransitive games
    • L. Guibas and A.W. Odlyzko, String overlaps, pattern matching and nontransitive games, J. Combin. Theory Ser. A 30 (1981) 183-208.
    • (1981) J. Combin. Theory Ser. A , vol.30 , pp. 183-208
    • Guibas, L.1    Odlyzko, A.W.2
  • 8
    • 38049072692 scopus 로고
    • Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
    • P. Jacquet and W. Szpankowski, Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach, J. Combin. Theory Ser. A 66 (1994) 237-269.
    • (1994) J. Combin. Theory Ser. A , vol.66 , pp. 237-269
    • Jacquet, P.1    Szpankowski, W.2
  • 9
    • 84988278426 scopus 로고
    • Two algorithms for approximate string matching in static texts
    • Springer, Berlin
    • P. Jokinen and E. Ukkonen, Two algorithms for approximate string matching in static texts, in: Proc. MFCS 91, Lecture Notes in Computer Science 520 (Springer, Berlin, 1991) 240-248.
    • (1991) Proc. MFCS 91, Lecture Notes in Computer Science , vol.520 , pp. 240-248
    • Jokinen, P.1    Ukkonen, E.2
  • 10
    • 0001530766 scopus 로고
    • A martingale approach to the study of occurrences of sequence patterns in repeated experiments
    • S.R. Li, A martingale approach to the study of occurrences of sequence patterns in repeated experiments, Ann. Probab. 8 (1980) 1171-1176.
    • (1980) Ann. Probab. , vol.8 , pp. 1171-1176
    • Li, S.R.1
  • 12
    • 0024514063 scopus 로고
    • Linguistic of nucleotide sequences: The significance of deviations from mean statistical characteristics and prediction of the frequency of occurrence of words
    • P. Pevzner, M. Borodovsky and A. Mironov, Linguistic of nucleotide sequences: The significance of deviations from mean statistical characteristics and prediction of the frequency of occurrence of words, J. Biomol. Struct. Dynam. 6 (1991) 1013-1026.
    • (1991) J. Biomol. Struct. Dynam. , vol.6 , pp. 1013-1026
    • Pevzner, P.1    Borodovsky, M.2    Mironov, A.3
  • 15
    • 0027113212 scopus 로고
    • Approximate string-matching with q-grams and maximal matches
    • E. Ukkonen, Approximate string-matching with q-grams and maximal matches, Theoret. Comput. Sci. 92 (1992) 191-211.
    • (1992) Theoret. Comput. Sci. , vol.92 , pp. 191-211
    • Ukkonen, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.