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.
Keywords
Hidden Markov modelBiologyGene predictionAnnotationGenomeGeneTranslation (biology)Computational biologyGeneticsMarkov chainBacterial genome sizeAlgorithmComputer scienceArtificial intelligenceMachine learning
Affiliated Institutions
Related Publications
GeneMarkS: a self-training method for prediction of gene starts in microbial genomes. Implications for finding sequence motifs in regulatory regions
Improving the accuracy of prediction of gene starts is one of a few remaining open problems in computer prediction of prokaryotic genes. Its difficulty is caused by the absence ...
TigrScan and GlimmerHMM: two open source <i>ab initio</i> eukaryotic gene-finders
Abstract Summary: We describe two new Generalized Hidden Markov Model implementations for ab initio eukaryotic gene prediction. The C/C++ source code for both is available as op...
On the inference of ancestries in admixed populations
Inference of ancestral information in recently admixed populations, in which every individual is composed of a mixed ancestry (e.g., African Americans in the United States), is ...
RepeatModeler2 for automated genomic discovery of transposable element families
The accelerating pace of genome sequencing throughout the tree of life is driving the need for improved unsupervised annotation of genome components such as transposable element...
STRING v11: protein–protein association networks with increased coverage, supporting functional discovery in genome-wide experimental datasets
Proteins and their functional interactions form the backbone of the cellular machinery. Their connectivity network needs to be considered for the full understanding of biologica...
Publication Info
- Year
- 1998
- Type
- article
- Volume
- 26
- Issue
- 4
- Pages
- 1107-1115
- Citations
- 1534
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1534
OpenAlex
Cite This
Alex Lukashin
(1998).
GeneMark.hmm: new solutions for gene finding.
Nucleic Acids Research
, 26
(4)
, 1107-1115.
https://doi.org/10.1093/nar/26.4.1107
Identifiers
- DOI
- 10.1093/nar/26.4.1107