Evidence map›Paper›PMID 16314312›Full record

ArticleNucleic acids research2005

Gene identification in novel eukaryotic genomes by self-training algorithm.

Alexandre Lomsadze, Vardges Ter-Hovhannisyan, Yury O Chernoff, Mark Borodovsky

Abstract readComparative StudyEvaluation Study
In one paragraph

Article in Nucleic acids research, 2005. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 585 papers.

0numbers the graph read from it
0cells of the map it votes in
585citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

585 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Draft genome sequence of the basidiomycetous yeastMicrobiology resource announcements · 2026
    Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Defining thebioRxiv : the preprint server for biology · 2026
    Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article

525 more citing papers are in PubMed but not listed here.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Alexandre LomsadzeSchool of Biology, Georgia Institute of Technology, Atlanta, GA 30332-0230, USA.
Vardges Ter-Hovhannisyan
Yury O Chernoff
Mark Borodovsky

Funding

PREDICTION OF GENE LOCATIONS USING STOCHASTIC MODELSR01HG000783 · NHGRI · GEORGIA INSTITUTE OF TECHNOLOGY · PI BORODOVSKY, MARK · 1993 to 2014
$4.7M
GENETIC STUDY OF THE YEAST PRION INTERACTING PROTEINSR01GM058763 · NIGMS · GEORGIA INSTITUTE OF TECHNOLOGY · PI CHERNOFF, YURY O · 1999 to 2010
$2.6M
NHGRI NIH HHS HG00783NHGRI NIH HHS R01 HG000783NIGMS NIH HHS GM58763NIGMS NIH HHS R01 GM058763
6 · The paper itself

Abstract

Finding new protein-coding genes is one of the most important goals of eukaryotic genome sequencing projects. However, genomic organization of novel eukaryotic genomes is diverse and ab initio gene finding tools tuned up for previously studied species are rarely suitable for efficacious gene hunting in DNA sequences of a new genome. Gene identification methods based on cDNA and expressed sequence tag (EST) mapping to genomic DNA or those using alignments to closely related genomes rely either on existence of abundant cDNA and EST data and/or availability on reference genomes. Conventional statistical ab initio methods require large training sets of validated genes for estimating gene model parameters. In practice, neither one of these types of data may be available in sufficient amount until rather late stages of the novel genome sequencing. Nevertheless, we have shown that gene finding in eukaryotic genomes could be carried out in parallel with statistical models estimation directly from yet anonymous genomic DNA. The suggested method of parallelization of gene prediction with the model parameters estimation follows the path of the iterative Viterbi training. Rounds of genomic sequence labeling into coding and non-coding regions are followed by the rounds of model parameters estimation. Several dynamically changing restrictions on the possible range of model parameters are added to filter out fluctuations in the initial steps of the algorithm that could redirect the iteration process away from the biologically relevant point in parameter space. Tests on well-studied eukaryotic genomes have shown that the new method performs comparably or better than conventional methods where the supervised model training precedes the gene prediction step. Several novel genomes have been analyzed and biologically interesting findings are discussed. Thus, a self-training algorithm that had been assumed feasible only for prokaryotic genomes has now been developed for ab initio eukaryotic gene identification.

Indexed as

AlgorithmsGenesAnimalsExonsGenomeGenomicsMarkov ChainsPhylogenyReproducibility of Results

Identifiers

PMID16314312
PMCPMC1298918

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.