TU Darmstadt / ULB / TUbiblio

Computation of mutual information from Hidden Markov Models.

Reker, D. ; Katzenbeisser, S. ; Hamacher, Kay (2010)
Computation of mutual information from Hidden Markov Models.
In: Computational biology and chemistry, 34 (5-6)
Artikel, Bibliographie

Kurzbeschreibung (Abstract)

Understanding evolution at the sequence level is one of the major research visions of bioinformatics. To this end, several abstract models--such as Hidden Markov Models--and several quantitative measures--such as the mutual information--have been introduced, thoroughly investigated, and applied to several concrete studies in molecular biology. With this contribution we want to undertake a first step to merge these approaches (models and measures) for easy and immediate computation, e.g. for a database of a large number of externally fitted models (such as PFAM). Being able to compute such measures is of paramount importance in data mining, model development, and model comparison. Here we describe how one can efficiently compute the mutual information of a homogenous Hidden Markov Model orders of magnitude faster than with a naive, straight-forward approach. In addition, our algorithm avoids sampling issues of real-world sequences, thus allowing for direct comparison of various models. We applied the method to genomic sequences and discuss properties as well as convergence issues.

Typ des Eintrags: Artikel
Erschienen: 2010
Autor(en): Reker, D. ; Katzenbeisser, S. ; Hamacher, Kay
Art des Eintrags: Bibliographie
Titel: Computation of mutual information from Hidden Markov Models.
Sprache: Englisch
Publikationsjahr: 2010
Titel der Zeitschrift, Zeitung oder Schriftenreihe: Computational biology and chemistry
Jahrgang/Volume einer Zeitschrift: 34
(Heft-)Nummer: 5-6
Kurzbeschreibung (Abstract):

Understanding evolution at the sequence level is one of the major research visions of bioinformatics. To this end, several abstract models--such as Hidden Markov Models--and several quantitative measures--such as the mutual information--have been introduced, thoroughly investigated, and applied to several concrete studies in molecular biology. With this contribution we want to undertake a first step to merge these approaches (models and measures) for easy and immediate computation, e.g. for a database of a large number of externally fitted models (such as PFAM). Being able to compute such measures is of paramount importance in data mining, model development, and model comparison. Here we describe how one can efficiently compute the mutual information of a homogenous Hidden Markov Model orders of magnitude faster than with a naive, straight-forward approach. In addition, our algorithm avoids sampling issues of real-world sequences, thus allowing for direct comparison of various models. We applied the method to genomic sequences and discuss properties as well as convergence issues.

Freie Schlagworte: Hidden Markov Model
Fachbereich(e)/-gebiet(e): 10 Fachbereich Biologie
?? fb10_mikrobiologie ??
10 Fachbereich Biologie > Computational Biology and Simulation
20 Fachbereich Informatik
Hinterlegungsdatum: 24 Jan 2011 10:15
Letzte Änderung: 30 Apr 2018 09:13
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen