Skip to main page content
Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
Comparative Study
. 1998 Feb 15;26(4):1107-15.
doi: 10.1093/nar/26.4.1107.

GeneMark.hmm: New Solutions for Gene Finding

Affiliations
Free PMC article
Comparative Study

GeneMark.hmm: New Solutions for Gene Finding

A V Lukashin et al. Nucleic Acids Res. .
Free PMC article

Abstract

The number of completely sequenced bacterial genomes has been growing fast. There are computer methods available for finding genes but yet there is a need for more accurate algorithms. The GeneMark. hmm algorithm presented here was designed to improve the gene prediction quality in terms of finding exact gene boundaries. The idea was to embed the GeneMark models into naturally derived hidden Markov model framework with gene boundaries modeled as transitions between hidden states. We also used the specially derived ribosome binding site pattern to refine predictions of translation initiation codons. The algorithm was evaluated on several test sets including 10 complete bacterial genomes. It was shown that the new algorithm is significantly more accurate than GeneMark in exact gene prediction. Interestingly, the high gene finding accuracy was observed even in the case when Markov models of order zero, one and two were used. We present the analysis of false positive and false negative predictions with the caution that these categories are not precisely defined if the public database annotation is used as a control.

Similar articles

See all similar articles

Cited by 589 articles

See all "Cited by" articles

References

    1. Trends Microbiol. 1997 Sep;5(9):355-9 - PubMed
    1. Science. 1997 Sep 5;277(5331):1453-62 - PubMed
    1. J Bacteriol. 1997 Nov;179(22):7135-55 - PubMed
    1. Nature. 1997 Nov 20;390(6657):249-56 - PubMed
    1. Nature. 1997 Nov 27;390(6658):364-70 - PubMed

Publication types

LinkOut - more resources

Feedback