Skip to main content
×
×
Home

Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata

  • Grégory Nuel (a1)
Abstract

In the framework of patterns in random texts, the Markov chain embedding techniques consist of turning the occurrences of a pattern over an order-m Markov sequence into those of a subset of states into an order-1 Markov chain. In this paper we use the theory of language and automata to provide space-optimal Markov chain embedding using the new notion of pattern Markov chains (PMCs), and we give explicit constructive algorithms to build the PMC associated to any given pattern problem. The interest of PMCs is then illustrated through the exact computation of P-values whose complexity is discussed and compared to other classical asymptotic approximations. Finally, we consider two illustrative examples of highly degenerated pattern problems (structured motifs and PROSITE signatures), which further illustrate the usefulness of our approach.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
      Available formats
      ×
Copyright
Corresponding author
Current address: MAP5, UMR CNRS 8145, Université Paris Descartes, 45 rue des Saints-Pères, F-75006 Paris, France. Email address: gregory.nuel@math-info.univ-paris5.fr
References
Hide All
Antzoulakos, D. L. (2001). Waiting times for patterns in a sequence of multistate trials. J. Appl. Prob. 38, 508518.
Biggins, J. D. and Cannings, C. (1987). Markov renewal processes, counters and repeated sequences in Markov chains. Adv. Appl. Prob. 19, 521545.
Chadjiconstantinidis, S., Antzoulakos, D. L. and Koutras, M. V. (2000). Joint distribution of successes, failures and patterns in enumeration problems. Adv. Appl. Prob. 32, 866884.
Chryssaphinou, O. and Papastavridis, S. (1990). The occurrence of a sequence of patterns in repeated dependent experiments. Theory Prob. Appl. 35, 167173.
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. 399462.
Crochemore, M. and Stefanov, V. T. (2003). Waiting time and complexity for matching patterns with automata. Inf. Proc. Lett. 87, 119125.
Fu, J. C. (1996). Distribution theory of runs and patterns associated with a sequence of multi-state trials. Statistica Sinica 6, 957974.
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, 183208.
Fu, J. C. and Koutras, M. V. (1994). Distribution theory of runs: a Markov chain approach. J. Amer. Statist. Assoc. 89, 10501058.
Fu, J. C. and Lou, W. Y. W. (2003). Distribution Theory of Runs and Patterns and Its Applications: A Finite Markov Chain Approach. World Scientific, Singapore.
Gasteiger, E., Jung, E. and Bairoch, A. (2001). SWISS-PROT: Connecting biological knowledge via a protein database. Current Issues Molec. Biol. 3, 4755.
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, 127140.
Guibas, L. J. and Odlyzko, A. M. (1981). String overlaps, pattern matching and transitive games. J. Combinatorial Theory A 30, 183208.
Hopcroft, J. E., Motwani, R. and Ullman, J. D. (2001). Introduction to Automata Theory, Languages, and Computation, 2nd edn. ACM Press, New York.
Hulo, N. et al. (2006). The PROSITE database. Nucleic Acid Res. 34, D227D230.
Lehoucq, R. B., Sorensen, D. C. and Yang, C. (1998). ARPACK Users' Guide. Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. Society for Industrial and Applied Mathematics, Philadelphia, PA.
Li, S.-Y. R. (1980). A martingale approach to the study of occurrence of sequence patterns in repeated experiments. Ann. Prob. 8, 11711176.
Lou, W. Y. W. (1996). On runs and longest run tests: a method of finite Markov chain imbedding. J. Amer. Statist. Assoc. 91, 15951601.
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, 345362.
Nicodeme, P., Salvy, B. and Flajolet, P. (2002). Motifs statistics. Theoret. Comput. Sci. 28, 593617.
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.
Nuel, G. (2006b). Numerical solutions for patterns statistics on Markov chains. Statist. Appl. Gen. Molec. Biol. 5.
Nuel, G. (2007). Cumulative distribution function of a geometric Poisson distribution. J. Statist. Comput. Simul. 77.
Reinert, G., Schbath, S. and Waterman, M. (2000). Probabilistic and statistical properties of words, an overview. J. Comput. Biology 7, 146.
Robin, S. and Daudin, J.-J. (1999). Exact distribution of word occurrences in a random sequence of letters. J. Appl. Prob. 36, 179193.
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, 895905.
Robin, S. et al. (2002). Occurrence probability of structured motifs in random sequences. J. Comput. Biol. 9, 761773.
Stefanov, V. T. (2000). On some waiting time problems. J. Appl. Prob. 37, 756764.
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, 881892.
Stefanov, V. T. and Pakes, A. G. (1997). Explicit distributional results in pattern formation. Ann. Appl. Prob. 7, 666678.
Stefanov, V. T. and Pakes, A. G. (1999). Explicit distributional results in pattern formation. II. Austral. N. Z. J. Statist. 41, 7990, 254.
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, 868880.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Applied Probability
  • ISSN: 0021-9002
  • EISSN: 1475-6072
  • URL: /core/journals/journal-of-applied-probability
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed