z-logo
open-access-imgOpen Access
Interpolated markov chains for eukaryotic promoter recognition.
Author(s) -
Uwe Ohler,
Stefan Harbeck,
H. Niemann,
Elmar N�th,
Martin G. Reese
Publication year - 1999
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/15.5.362
Subject(s) - markov chain , promoter , gene , computational biology , coding region , hidden markov model , gene prediction , biology , coding (social sciences) , genome , dna sequencing , genetics , computer science , mathematics , algorithm , artificial intelligence , gene expression , machine learning , statistics
We describe a new content-based approach for the detection of promoter regions of eukaryotic protein encoding genes. Our system is based on three interpolated Markov chains (IMCs) of different order which are trained on coding, non-coding and promoter sequences. It was recently shown that the interpolation of Markov chains leads to stable parameters and improves on the results in microbial gene finding (Salzberg et al., Nucleic Acids Res., 26, 544-548, 1998). Here, we present new methods for an automated estimation of optimal interpolation parameters and show how the IMCs can be applied to detect promoters in contiguous DNA sequences. Our interpolation approach can also be employed to obtain a reliable scoring function for human coding DNA regions, and the trained models can easily be incorporated in the general framework for gene recognition systems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom