Computing the likelihood of sequence segmentation under Markov modelling - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2009

Computing the likelihood of sequence segmentation under Markov modelling

Abstract

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
Origin Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

Laurent Guéguen. Computing the likelihood of sequence segmentation under Markov modelling. 2009. ⟨hal-00432383⟩
99 View
130 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More