The most probable annotation problem in HMMs and its application to bioinformatics
Journal of Computer and System Sciences
Comparative gene prediction based on gene structure conservation
PRIB'06 Proceedings of the 2006 international conference on Pattern Recognition in Bioinformatics
On-line viterbi algorithm for analysis of long biological sequences
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
| Hi-index | 3.84 |
Motivation: We present ExonHunter, a new and comprehensive gene finding system that outperforms existing systems and features several new ideas and approaches. Our system combines numerous sources of information (genomic sequences, expressed sequence tags and protein databases of related species) into a gene finder based on a hidden Markov model in a novel and systematic way. In our framework, various sources of information are expressed as partial probabilistic statements about positions in the sequence and their annotation. We then combine these into the final prediction via a quadratic programming method, which we show to be an extension of existing methods. Allowing only partial statements is key to our transparent handling of missing information and coping with the heterogeneous character of individual sources of information. In addition, we give a new method for modeling the length distribution of intergenic regions in hidden Markov models. Results: On a commonly used test set, ExonHunter performs significantly better than the existing gene finders ROSETTA, SLAM and TWINSCAN, with more than two-thirds of genes predicted completely correctly. Availability: Supplementary material available at http://www.bioinformatics.uwaterloo.ca/supplements/05eh/ Contact: bbrejova@uwaterloo.ca