The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Gene prediction in novel fungal genomes using an ab initio algorithm with unsupervised training
Open accessAbstract
We describe a new ab initio algorithm, GeneMark-ES version 2, that identifies protein-coding genes in fungal genomes. The algorithm does not require a predetermined training set to estimate parameters of the underlying hidden Markov model (HMM). Instead, the anonymous genomic sequence in question is used as an input for iterative unsupervised training. The algorithm extends our previously developed method tested on genomes of Arabidopsis thaliana, Caenorhabditis elegans, and Drosophila melanogaster. To better reflect features of fungal gene organization, we enhanced the intron submodel to accommodate sequences with and without branch point sites. This design enables the algorithm to work equally well for species with the kinds of variations in splicing mechanisms seen in the fungal phyla Ascomycota, Basidiomycota, and Zygomycota. Upon self-training, the intron submodel switches on in several steps to reach its full complexity. We demonstrate that the algorithm accuracy, both at the exon and the whole gene level, is favorably compared to the accuracy of gene finders that employ supervised training. Application of the new method to known fungal genomes indicates substantial improvement over existing annotations. By eliminating the effort necessary to build comprehensive training sets, the new algorithm can streamline and accelerate the process of annotation in a large number of fungal genome sequencing projects.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
<tt>BLAT</tt> —The <tt>BLAST</tt> -Like Alignment Tool
Kent, W. J. (2002) · Genome Research · doi:10.1101/gr.229202 · Cited by 8,480
Prediction of complete gene structures in human genomic DNA
Burge, C., & Karlin, S. (1997) · Journal of Molecular Biology · doi:10.1006/jmbi.1997.0951 · Cited by 4,228
Biological sequence analysis probabilistic models of proteins and nucleic acids
Durbin, R. M., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cited by 3,565
Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids
Durbin, R., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511790492 · Cited by 3,246
Korf, I. (2004) · BMC Bioinformatics · doi:10.1186/1471-2105-5-59 · Cited by 3,192
Identifying bacterial genes and endosymbiont DNA with Glimmer
Delcher, A. L., Bratke, K. A., Powers, E. C., & Salzberg, S. L. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm009 · Cited by 3,134
Using native and syntenically mapped cDNA alignments to improve de novo gene finding
Stanke, M., Diekhans, M., Baertsch, R., & Haussler, D. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn013 · Cited by 2,605
Birney, E., Clamp, M., & Durbin, R. (2004) · Genome Research · doi:10.1101/gr.1865504 · Cited by 2,542
Besemer, J. (2001) · Nucleic Acids Research · doi:10.1093/nar/29.12.2607 · Cited by 2,351
Detecting Subtle Sequence Signals: a Gibbs Sampling Strategy for Multiple Alignment
Lawrence, C. E., Altschul, S. F., Boguski, M. S., Liu, J. S., Neuwald, A. F., & Wootton, J. C. (1993) · Science · doi:10.1126/science.8211139 · Cited by 1,807
GeneMark.hmm: new solutions for gene finding
Lukashin, A. (1998) · Nucleic Acids Research · doi:10.1093/nar/26.4.1107 · Cited by 1,538
Gene prediction with a hidden Markov model and a new intron submodel
Stanke, M., & Waack, S. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg1080 · Cited by 1,439
Microbial gene identification using interpolated Markov models
Salzberg, S. L., Delcher, A. L., Kasif, S., & White, O. (1998) · Nucleic Acids Research · doi:10.1093/nar/26.2.544 · Cited by 996
Gene identification in novel eukaryotic genomes by self-training algorithm
Lomsadze, A. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki937 · Cited by 975
Self-citationCDD: a conserved domain database for interactive domain family analysis
Marchler-Bauer, A., Anderson, J. B., Derbyshire, M. K., DeWeese-Scott, C., Gonzales, N. R., Gwadz, M., Hao, L., He, S., Hurwitz, D. I., Jackson, J. D., et al. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkl951 · Cited by 852
Hebsgaard, S. (1996) · Nucleic Acids Research · doi:10.1093/nar/24.17.3439 · Cited by 821
Current methods of gene prediction, their strengths and weaknesses
Mathe, C. (2002) · Nucleic Acids Research · doi:10.1093/nar/gkf543 · Cited by 476
Integrating genomic homology into gene structure prediction
Korf, I., Flicek, P., Duan, D., & Brent, M. R. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.suppl_1.s140 · Cited by 466
Heuristic approach to deriving models for gene finding
Besemer, J. (1999) · Nucleic Acids Research · doi:10.1093/nar/27.19.3911 · Cited by 407
Parra, G., Blanco, E., & Guigó, R. (2000) · Genome Research · doi:10.1101/gr.10.4.511 · Cited by 394
A generalized hidden Markov model for the recognition of human genes in DNA.
Kulp, D., Haussler, D. H., Reese, M. G., & Eeckman, F. H. (1996) · PubMed · Cited by 386
A computational analysis of sequence features involved in recognition of short introns
Lim, L. P., & Burge, C. B. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.201407298 · Cited by 374
EGASP: the human ENCODE Genome Annotation Assessment Project.
Guigó, R., Flicek, P., Abril, J. F., Reymond, A., Lagarde, J., Denœud, F., Antonarakis, S. E., Ashburner, M., Bajić, V. B., Birney, E., et al. (2006) · Genome biology · doi:10.1186/gb-2006-7-s1-s2 · Cited by 340
Gibbs Recursive Sampler: finding transcription factor binding sites
Thompson, W. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg608 · Cited by 316
Gene recognition via spliced sequence alignment.
Gelfand, M. S., Mironov, A. A., & Pevzner, P. A. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.17.9061 · Cited by 307
Introns and Splicing Elements of Five Diverse Fungi
Kupfer, D. M., Drabenstot, S. D., Buchanan, K. L., Lai, H., Zhu, H., Dyer, D. W., Roe, B. A., & Murphy, J. W. (2004) · Eukaryotic Cell · doi:10.1128/ec.3.5.1088-1100.2004 · Cited by 291
Two methods for improving performance of an HMM and their application for gene finding.
Krogh, A. (1997) · PubMed · Cited by 290
EST_GENOME: a program to align spliced DNA sequences to unspliced genomic DNA
Mott, R. (1997) · Bioinformatics · doi:10.1093/bioinformatics/13.4.477 · Cited by 276
Genome Annotation Assessment in Drosophila melanogaster
Reese, M. G., Hartzell, G., Harris, N. L., Ohler, U., Abril, J. F., & Lewis, S. E. (2000) · Genome Research · doi:10.1101/gr.10.4.483 · Cited by 203
EasyGene – a prokaryotic gene finder that ranks ORFs by statistical significance
Larsen, T. S., & Krogh, A. (2003) · BMC Bioinformatics · doi:10.1186/1471-2105-4-21 · Cited by 162
Pavy, N., Rombauts, S., Déhais, P., Mathé, C., Davuluri, R. V., Leroy, P., & Rouzé, P. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.11.887 · Cited by 104
APDB: a novel measure for benchmarking sequence alignment methods without reference alignments
O’Sullivan, Ó., Zehnder, M., Higgins, D. G., Bücher, P., Grosdidier, A., & Notredame, C. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg1029 · Cited by 80
Self-identification of protein-coding regions in microbial genomes
Audic, S., & Claverie, J. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.17.10026 · Cited by 68
Multiple alignment using simulated annealing: branch point definition in human mRNA splicing
Lukashin, A. V., Engelbrecht, J., & Brunak, S. (1992) · Nucleic Acids Research · doi:10.1093/nar/20.10.2511 · Cited by 56
Gene prediction and verification in a compact genome with numerous small intronsPreprint
Tenney, A. E., Brown, R. H., Vaske, C. J., Lodge, J. K., Doering, T. L., & Brent, M. R. (2004) · Genome Research · doi:10.1101/gr.2816704 · Cited by 45
Sensitivity of hidden Markov models
Mitrophanov, A. Y., Lomsadze, A., & Borodovsky, M. Y. (2005) · Journal of Applied Probability · doi:10.1017/s002190020000067x · Cited by 31
Self-citation
Cited by
Ab initio gene identification in metagenomic sequences
Zhu, W., Lomsadze, A., & Borodovsky, M. (2010) · Nucleic Acids Research · doi:10.1093/nar/gkq275 · Cited by 1,819
Self-citationMycoCosm portal: gearing up for 1000 fungal genomes
Grigoriev, I. V., Nikitin, R., Haridas, S., Kuo, A., Ohm, R., Otillar, R., Riley, R., Salamov, A., Zhao, X., Korzeniewski, F., et al. (2014) · Nucleic Acids Research · doi:10.1093/nar/gkt1183 · Cited by 1,498
BRAKER1: Unsupervised RNA-Seq-Based Genome Annotation with GeneMark-ET and AUGUSTUS
Hoff, K. J., Lange, S., Lomsadze, A., Borodovsky, M., & Stanke, M. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btv661 · Cited by 1,153
Self-citationRiley, R., Salamov, A. A., Brown, D. W., Nagy, L. G., Floudas, D., Held, B. W., Levasseur, A., Lombard, V., Morin, E., Otillar, R., et al. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1400592111 · Cited by 745
WormBase ParaSite − a comprehensive resource for helminth genomics
Howe, K. L., Bolt, B. J., Shafie, M., Kersey, P., & Berriman, M. (2017) · Molecular and Biochemical Parasitology · doi:10.1016/j.molbiopara.2016.11.005 · Cited by 745
Metadata
- Authors
- Ter-Hovhannisyan, V., Lomsadze, A., Chernoff, Y. O., & Borodovsky, M.
- Venue
- Genome Research
- Publisher
- Cold Spring Harbor Laboratory
- Published
- 2008-08-29
- Volume
- 18
- Issue
- 12
- Pages
- 1979-1990
- ISSN
- 1088-9051 (ISSN-L)
- OpenAlex
- W2128242967
- Cited by
- 1,026
- References
- 36
- Type
- posted content
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.