Evidence map›Paper›PMID 16712739›Full record

ArticleBMC bioinformatics2006

Automatic generation of gene finders for eukaryotic species.

Kasper Munch, Anders Krogh

Abstract read
In one paragraph

Article in BMC bioinformatics, 2006. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.

0numbers the graph read from it
0cells of the map it votes in
11citing 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

11 citing papers in PubMed.

  1. Article
  2. Tokenization and deep learning architectures in genomics: A comprehensive review.Computational and structural biotechnology journal · 2025
    Review
  3. Optimized splitting of mixed-species RNA sequencing data.Journal of bioinformatics and computational biology · 2022
    Article
  4. Article
  5. Review
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
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

2 authors.

Kasper MunchBioinformatics Centre, University of Copenhagen, Universitetsparken 15, 2100 Copenhagen Ø, Denmark. kasper@binf.ku.dk
Anders Krogh

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundThe number of sequenced eukaryotic genomes is rapidly increasing. This means that over time it will be hard to keep supplying customised gene finders for each genome. This calls for procedures to automatically generate species-specific gene finders and to re-train them as the quantity and quality of reliable gene annotation grows.

resultsWe present a procedure, Agene, that automatically generates a species-specific gene predictor from a set of reliable mRNA sequences and a genome. We apply a Hidden Markov model (HMM) that implements explicit length distribution modelling for all gene structure blocks using acyclic discrete phase type distributions. The state structure of the each HMM is generated dynamically from an array of sub-models to include only gene features represented in the training set.

conclusionAcyclic discrete phase type distributions are well suited to model sequence length distributions. The performance of each individual gene predictor on each individual genome is comparable to the best of the manually optimised species-specific gene finders. It is shown that species-specific gene finders are superior to gene finders trained on other species.

Indexed as

Artificial IntelligenceAlgorithmsBase SequenceChromosome MappingComputer SimulationConserved SequenceEukaryotic CellsMarkov ChainsModels, GeneticModels, StatisticalMolecular Sequence DataPattern Recognition, AutomatedRNA, MessengerSequence AlignmentSequence Analysis, DNASequence Analysis, RNARNA, Messenger

Identifiers

PMID16712739
PMCPMC1522026

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.