Cargando…
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is known that such approaches need to be first rewritten using recursive relations. We propose here to give here a general re...
Autor principal: | Nuel, Grégory |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2006
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1479348/ https://www.ncbi.nlm.nih.gov/pubmed/16722531 http://dx.doi.org/10.1186/1748-7188-1-5 |
Ejemplares similares
-
Pattern statistics on Markov chains and sensitivity to parameter estimation
por: Nuel, Grégory
Publicado: (2006) -
Self-learning control of finite Markov chains /
por: Poznyak, Alexander S.
Publicado: (2000) -
An introduction to invariant imbedding
por: Bellman, Richard Ernest, et al.
Publicado: (1975) -
Direct and inverse imbedding theorems
por: Kudrjavcev, L D, et al.
Publicado: (1974) -
Imbedding methods in applied mathematics
por: Casti, John L
Publicado: (1973)