http://www.math-evry.cnrs.fr/ 2026-04-10T06:02:53+02:00 http://www.math-evry.cnrs.fr/ http://www.math-evry.cnrs.fr/lib/tpl/lamme/images/favicon.ico text/html 2014-11-28T15:51:52+02:00 http://www.math-evry.cnrs.fr/logiciels/drimm/abstract?rev=1417186312&do=diff PhD thesis - Abstract The statistical analysis of biological sequence such as nucleotidic sequences (DNA and RNA) or amino-acids (proteins) needs the conception of different models according to the study. Since the way the nucleotides succeed one another in DNA sequences is dependant, Markov models are widely used for this purpose. The problem of these models is to consider the homogeneity of biological sequences. But, biological sequences are not homogeneous. A well-known example is the gc per… text/html 2014-11-28T15:51:52+02:00 http://www.math-evry.cnrs.fr/logiciels/drimm/help?rev=1417186312&do=diff Help DRIMM This program is dedicated to the estimation and the use of Drifting Markov Models (DMM). Two different ways to use * DMM is estimated on a sequence. * DMM is given in a model file. Description of parameters -SpM Estimation by splines M. -N must be used. text/html 2014-11-28T15:51:52+02:00 http://www.math-evry.cnrs.fr/logiciels/drimm/help_problength?rev=1417186312&do=diff Help PROBAlength This program is dedicated to the computation, at each position of the sequence of the probability of appearance of the word of size <word_size> who appears at this position according to a Drifting Markov Model (DMM). Description of parameters text/html 2014-11-28T15:51:52+02:00 http://www.math-evry.cnrs.fr/logiciels/drimm/help_probword?rev=1417186312&do=diff Help PROBAword This program is dedicated to the computation, at each position in the sequence, of the probability of a word according to a Drifting Markov Model (DMM). Description of parameters -w <word> Word to studied. -a <alphabet_file> A file describing the alphabet to use. text/html 2014-11-28T15:51:52+02:00 http://www.math-evry.cnrs.fr/logiciels/drimm/help_pvalue?rev=1417186312&do=diff Help PVALUEdmm This program is dedicated to the computation of pvalue of words. It needs a markov file generated by Spatt(*). Results are given at this order: Word Nobs Expectation - log(P(N>Nobs) P(N>Nobs) if Nobs>=E(N) Word Nobs Expectation +log(P(N<Nobs) P(N<Nobs) if Nobs<E(N)