메뉴 건너뛰기




Volumn 45, Issue 1, 2008, Pages 226-243

Pattern Markov chains: Optimal Markov chain embedding through deterministic finite automata

Author keywords

Exact distribution; Language; PROSITE signature; Regular expression; Structured motif

Indexed keywords


EID: 43049111077     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1208358964     Document Type: Article
Times cited : (48)

References (32)
  • 1
    • 0035596069 scopus 로고    scopus 로고
    • Waiting times for patterns in a sequence of multistate trials
    • ANTZOULAKOS, D. L. (2001). Waiting times for patterns in a sequence of multistate trials. J. Appl. Prob. 38, 508-518.
    • (2001) J. Appl. Prob , vol.38 , pp. 508-518
    • ANTZOULAKOS, D.L.1
  • 2
    • 0001616513 scopus 로고
    • Markov renewal processes, counters and repeated sequences in Markov chains
    • BIGGINS, J. D. AND CANNINGS, C. (1987). Markov renewal processes, counters and repeated sequences in Markov chains. Adv. Appl. Prob. 19, 521-545.
    • (1987) Adv. Appl. Prob , vol.19 , pp. 521-545
    • BIGGINS, J.D.1    CANNINGS, C.2
  • 3
    • 0034266845 scopus 로고    scopus 로고
    • Joint distribution of successes, failures and patterns in enumeration problems
    • CHADJICONSTANTINIDIS, S., ANTZOULAKOS, D. L. AND KOUTRAS, M. V. (2000). Joint distribution of successes, failures and patterns in enumeration problems. Adv. Appl. Prob. 32, 866-884.
    • (2000) Adv. Appl. Prob , vol.32 , pp. 866-884
    • CHADJICONSTANTINIDIS, S.1    ANTZOULAKOS, D.L.2    KOUTRAS, M.V.3
  • 4
    • 0009159166 scopus 로고
    • The occurrence of a sequence of patterns in repeated dependent experiments
    • CHRYSSAPHINOU, O. AND PAPASTAVRIDIS, S. (1990). The occurrence of a sequence of patterns in repeated dependent experiments. Theory Prob. Appl. 35, 167-173.
    • (1990) Theory Prob. Appl , vol.35 , pp. 167-173
    • CHRYSSAPHINOU, O.1    PAPASTAVRIDIS, S.2
  • 5
    • 85083123011 scopus 로고    scopus 로고
    • CROCHEMORE, M. AND HANCART, C. (1997). Automata for matching patterns. In Handbook of Formal Languages, 2, Linear Modeling: Background and Application, Springer, Berlin, pp. 399-462.
    • CROCHEMORE, M. AND HANCART, C. (1997). Automata for matching patterns. In Handbook of Formal Languages, Vol. 2, Linear Modeling: Background and Application, Springer, Berlin, pp. 399-462.
  • 6
    • 0038347439 scopus 로고    scopus 로고
    • Waiting time and complexity for matching patterns with automata
    • CROCHEMORE, M. AND STEFANOV, V. T. (2003). Waiting time and complexity for matching patterns with automata. Inf. Proc. Lett. 87, 119-125.
    • (2003) Inf. Proc. Lett , vol.87 , pp. 119-125
    • CROCHEMORE, M.1    STEFANOV, V.T.2
  • 7
    • 21444442040 scopus 로고    scopus 로고
    • Distribution theory of runs and patterns associated with a sequence of multi-state trials
    • FU, J. C. (1996). Distribution theory of runs and patterns associated with a sequence of multi-state trials. Statistica Sinica 6, 957-974.
    • (1996) Statistica Sinica , vol.6 , pp. 957-974
    • FU, J.C.1
  • 8
    • 85083133953 scopus 로고    scopus 로고
    • On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
    • FU, J. C. AND CHANG, Y. M. (2002). On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials. J. Appl. Prob. 30, 183-208.
    • (2002) J. Appl. Prob , vol.30 , pp. 183-208
    • FU, J.C.1    CHANG, Y.M.2
  • 9
    • 84950460234 scopus 로고
    • Distribution theory of runs: A Markov chain approach
    • FU, J. C. AND KOUTRAS, M. V. (1994). Distribution theory of runs: a Markov chain approach. J. Amer. Statist. Assoc. 89, 1050-1058.
    • (1994) J. Amer. Statist. Assoc , vol.89 , pp. 1050-1058
    • FU, J.C.1    KOUTRAS, M.V.2
  • 11
    • 0034924493 scopus 로고    scopus 로고
    • SWISS-PROT: Connecting biological knowledge via a protein database
    • GASTEIGER, E., JUNG, E. AND BAIROCH, A. (2001). SWISS-PROT: Connecting biological knowledge via a protein database. Current Issues Molec. Biol. 3, 47-55.
    • (2001) Current Issues Molec. Biol , vol.3 , pp. 47-55
    • GASTEIGER, E.1    JUNG, E.2    BAIROCH, A.3
  • 12
    • 33845315540 scopus 로고    scopus 로고
    • Gambling teams and waiting times for patterns in two-state Markov chains
    • GLAZ, J., KULLDORFF, M., POZDNYAKOV, V. AND STEELE, J. M. (2006). Gambling teams and waiting times for patterns in two-state Markov chains. J. Appl. Prob. 43, 127-140.
    • (2006) J. Appl. Prob , vol.43 , pp. 127-140
    • GLAZ, J.1    KULLDORFF, M.2    POZDNYAKOV, V.3    STEELE, J.M.4
  • 13
    • 34250201608 scopus 로고
    • String overlaps, pattern matching and transitive games
    • GUIBAS, L. J. AND ODLYZKO, A. M. (1981). String overlaps, pattern matching and transitive games. J. Combinatorial Theory A 30, 183-208.
    • (1981) J. Combinatorial Theory A , vol.30 , pp. 183-208
    • GUIBAS, L.J.1    ODLYZKO, A.M.2
  • 15
    • 33644876022 scopus 로고    scopus 로고
    • The PROSITE database
    • HULO, N. et al. (2006). The PROSITE database. Nucleic Acid Res. 34, D227-D230.
    • (2006) Nucleic Acid Res , vol.34
    • HULO, N.1
  • 17
    • 0001530766 scopus 로고
    • A martingale approach to the study of occurrence of sequence patterns in repeated experiments
    • LI, S.-Y. R. (1980). A martingale approach to the study of occurrence of sequence patterns in repeated experiments. Ann. Prob. 8, 1171-1176.
    • (1980) Ann. Prob , vol.8 , pp. 1171-1176
    • LI, S.-Y.R.1
  • 18
    • 0030342868 scopus 로고    scopus 로고
    • On runs and longest run tests: A method of finite Markov chain imbedding
    • LOU, W. Y. W. (1996). On runs and longest run tests: a method of finite Markov chain imbedding. J. Amer. Statist. Assoc. 91, 1595-1601.
    • (1996) J. Amer. Statist. Assoc , vol.91 , pp. 1595-1601
    • LOU, W.Y.W.1
  • 19
    • 0033677426 scopus 로고    scopus 로고
    • Algorithms for extracting structured motifs using a suffix tree with an application to promoter consensus identification
    • MARSAN, L. AND SAGOT, M.-F. (2000). Algorithms for extracting structured motifs using a suffix tree with an application to promoter consensus identification. J. Comput. Biol. 7, 345-362.
    • (2000) J. Comput. Biol , vol.7 , pp. 345-362
    • MARSAN, L.1    SAGOT, M.-F.2
  • 21
    • 34248358126 scopus 로고    scopus 로고
    • Effective p-value computations using finite Markov chain imbedding (FMCI): Application to local score and to pattern statistics
    • NUEL, G. (2006a). Effective p-value computations using finite Markov chain imbedding (FMCI): application to local score and to pattern statistics. Algo. Molec. Biol. 1.
    • (2006) Algo. Molec. Biol , vol.1
    • NUEL, G.1
  • 22
    • 33750243061 scopus 로고    scopus 로고
    • Numerical solutions for patterns statistics on Markov chains
    • NUEL, G. (2006b). Numerical solutions for patterns statistics on Markov chains. Statist. Appl. Gen. Molec. Biol. 5.
    • (2006) Statist. Appl. Gen. Molec. Biol , vol.5
    • NUEL, G.1
  • 23
    • 39449108456 scopus 로고    scopus 로고
    • Cumulative distribution function of a geometric Poisson distribution
    • NUEL, G. (2007). Cumulative distribution function of a geometric Poisson distribution. J. Statist. Comput. Simul. 77.
    • (2007) J. Statist. Comput. Simul , vol.77
    • NUEL, G.1
  • 24
    • 0034125366 scopus 로고    scopus 로고
    • Probabilistic and statistical properties of words, an overview
    • REINERT, G., SCHBATH, S. AND WATERMAN, M. (2000). Probabilistic and statistical properties of words, an overview. J. Comput. Biology 7, 1-46.
    • (2000) J. Comput. Biology , vol.7 , pp. 1-46
    • REINERT, G.1    SCHBATH, S.2    WATERMAN, M.3
  • 25
    • 0033238297 scopus 로고    scopus 로고
    • Exact distribution of word occurrences in a random sequence of letters
    • ROBIN, S. AND DAUDIN, J.-J. (1999). Exact distribution of word occurrences in a random sequence of letters. J. Appl. Prob. 36, 179-193.
    • (1999) J. Appl. Prob , vol.36 , pp. 179-193
    • ROBIN, S.1    DAUDIN, J.-J.2
  • 26
    • 0000180851 scopus 로고    scopus 로고
    • Exact distribution of the distances between any occurrences of a set of words
    • ROBIN, S. AND DAUDIN, J.-J. (2001). Exact distribution of the distances between any occurrences of a set of words. Ann. Inst. Statist. Math. 36, 895-905.
    • (2001) Ann. Inst. Statist. Math , vol.36 , pp. 895-905
    • ROBIN, S.1    DAUDIN, J.-J.2
  • 27
    • 0036997774 scopus 로고    scopus 로고
    • Occurrence probability of structured motifs in random sequences
    • ROBIN, S. et al. (2002). Occurrence probability of structured motifs in random sequences. J. Comput. Biol. 9, 761-773.
    • (2002) J. Comput. Biol , vol.9 , pp. 761-773
    • ROBIN, S.1
  • 28
    • 85037751874 scopus 로고    scopus 로고
    • On some waiting time problems
    • STEFANOV, V. T. (2000). On some waiting time problems. J. Appl. Prob. 37, 756-764.
    • (2000) J. Appl. Prob , vol.37 , pp. 756-764
    • STEFANOV, V.T.1
  • 29
    • 0442323012 scopus 로고    scopus 로고
    • The intersite distances between pattern occurrences in strings generated by general discrete-and continuous-time models: An algorithmic approach
    • STEFANOV, V. T. (2003). The intersite distances between pattern occurrences in strings generated by general discrete-and continuous-time models: an algorithmic approach. J. Appl. Prob. 40, 881-892.
    • (2003) J. Appl. Prob , vol.40 , pp. 881-892
    • STEFANOV, V.T.1
  • 30
    • 0031526698 scopus 로고    scopus 로고
    • Explicit distributional results in pattern formation
    • STEFANOV, V. T. AND PAKES, A. G. (1997). Explicit distributional results in pattern formation. Ann. Appl. Prob. 7, 666-678.
    • (1997) Ann. Appl. Prob , vol.7 , pp. 666-678
    • STEFANOV, V.T.1    PAKES, A.G.2
  • 31
    • 0033418478 scopus 로고    scopus 로고
    • Explicit distributional results in pattern formation. II
    • STEFANOV, V. T. AND PAKES, A. G. (1999). Explicit distributional results in pattern formation. II. Austral. N. Z. J. Statist. 41, 79-90, 254.
    • (1999) Austral. N. Z. J. Statist , vol.41 , Issue.79-90 , pp. 254
    • STEFANOV, V.T.1    PAKES, A.G.2
  • 32
    • 33846796002 scopus 로고    scopus 로고
    • Waiting times for clumps of patterns and for structured motifs in random sequences
    • STEFANOV, V. T., ROBIN, S. AND SCHBATH, S. (2007). Waiting times for clumps of patterns and for structured motifs in random sequences. Discrete Appl. Math. 155, 868-880.
    • (2007) Discrete Appl. Math , vol.155 , pp. 868-880
    • STEFANOV, V.T.1    ROBIN, S.2    SCHBATH, S.3


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