Computing the likelihood of sequence segmentation under Markov modelling - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2009

Computing the likelihood of sequence segmentation under Markov modelling

Résumé

I tackle the problem of partitioning a sequence into homogeneous segments, where homogeneity is defined by a set of Markov models. The problem is to study the likelihood that a sequence is divided into a given number of segments. Here, the moments of this likelihood are computed through an efficient algorithm. Unlike methods involving Hidden Markov Models, this algorithm does not require probability transitions between the models. Among many possible usages of the likelihood, I present a maximum \textit{a posteriori} probability criterion to predict the number of homogeneous segments into which a sequence can be divided, and an application of this method to find CpG islands.
Fichier principal
Vignette du fichier
proba_partition.pdf (605.47 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00432383 , version 1 (16-11-2009)

Identifiants

Citer

Laurent Guéguen. Computing the likelihood of sequence segmentation under Markov modelling. 2009. ⟨hal-00432383⟩
99 Consultations
128 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More