Cited by 678Genomics and Phylogenetic StudiesChromosomal and Genetic VariationsRNA and protein synthesis mechanisms

The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index; 5 of the 15 sources its claims cite were checked for support.

BRAKER3: Fully automated genome annotation using RNA-seq and protein evidence with GeneMark-ETP, AUGUSTUS, and TSEBRA

Open access

Published version of a preprint

Abstract

Gene prediction has remained an active area of bioinformatics research for a long time. Still, gene prediction in large eukaryotic genomes presents a challenge that must be addressed by new algorithms. The amount and significance of the evidence available from transcriptomes and proteomes vary across genomes, between genes, and even along a single gene. User-friendly and accurate annotation pipelines that can cope with such data heterogeneity are needed. The previously developed annotation pipelines BRAKER1 and BRAKER2 use RNA-seq or protein data, respectively, but not both. A further significant performance improvement integrating all three data types was made by the recently released GeneMark-ETP. We here present the BRAKER3 pipeline that builds on GeneMark-ETP and AUGUSTUS, and further improves accuracy using the TSEBRA combiner. BRAKER3 annotates protein-coding genes in eukaryotic genomes using both short-read RNA-seq and a large protein database, along with statistical models learned iteratively and specifically for the target genome. We benchmarked the new pipeline on genomes of 11 species under an assumed level of relatedness of the target species proteome to available proteomes. BRAKER3 outperforms BRAKER1 and BRAKER2. The average transcript-level F1-score is increased by about 20 percentage points on average, whereas the difference is most pronounced for species with large and complex genomes. BRAKER3 also outperforms other existing tools, MAKER2, Funannotate, and FINDER. The code of BRAKER3 is available on GitHub and as a ready-to-run Docker container for execution with Docker or Singularity. Overall, BRAKER3 is an accurate, easy-to-use tool for eukaryotic genome annotation.

Overview

AI snapshot

Written from the paper’s full text.

TL;DR

BRAKER3 is a fully automated eukaryotic genome annotation pipeline that integrates RNA-seq and protein evidence using GeneMark-ETP, AUGUSTUS, and TSEBRA. It outperforms BRAKER1, BRAKER2, and other existing tools in benchmarks, with the largest gains on large and complex genomes.

Key findings

  • On 11 species with order-excluded protein databases, BRAKER3 had the highest average accuracy; the average transcript-level F1-score increased by about 20 percentage points relative to BRAKER1/BRAKER2, with the highest increase in *G. gallus* (gene/transcript F1 improved by 55/48 points compared with TSEBRA combining BRAKER1 and BRAKER2).
  • Compared with MAKER2 and Funannotate on eight species using close-relatives-included protein databases, BRAKER3’s F1-scores were higher than Funannotate by 10.2 points at exon level, 25.9 at gene level, and 21.6 at transcript level; Funannotate exceeded MAKER2 by 2.2, 3.8, and 4.4 points at exon, gene, and transcript levels, respectively. FINDER completed only 7 of 11 species and its best result (*D. melanogaster*, approximately 15 gene F1 and 11 transcript F1) was much below other methods.
  • Transcript-level sensitivity increased with expression: 23% of low-expression transcripts, 55% of medium-expression transcripts, and 76% of highly expressed transcripts were correctly identified. BRAKER3 predicted acceptor/donor splice sites with F1 >87% averaged over species, and start/stop codons with F1 of 70%/76%.
  • BUSCO completeness averaged 96% for well-annotated compact genomes, 83.6% for well-annotated large genomes, 91% for other genomes with reference annotation, and 93.7% for three recently sequenced genomes. Runtime ranged from 5 h 37 min for *A. thaliana* to 64 h 16 min for *M. musculus*.

Methods

  • BRAKER3 requires a genome sequence, short-read RNA-seq data (BAM, FASTQ, or SRA library IDs), and a protein database. It runs GeneMark-ETP for iterative training and prediction with RNA-seq/protein hints, trains AUGUSTUS on high-confidence genes, and uses TSEBRA to combine GeneMark-ETP and AUGUSTUS predictions while ensuring inclusion of high-confidence genes.
  • Benchmarks used 11 species plus three recently sequenced genomes without established reference annotations. Protein databases were prepared as species excluded, order excluded, and close relatives included; comparisons included BRAKER1, BRAKER2, TSEBRA, GeneMark-ETP, MAKER2, FINDER, and Funannotate.
  • Accuracy was assessed against reference annotations at exon, gene, and transcript levels using sensitivity, precision, and F1-score; BUSCO was used for genomes lacking reference annotations. Runtime was measured on an HPC node with 48 threads.

Limitations

  • The paper states that BRAKER3 cannot be used without RNA-seq evidence, performs worse for weakly expressed transcripts, and currently predicts only protein-coding genes. It also notes benchmark sampling bias toward well-annotated, early-sequenced species, limited RNA-seq input to at most six libraries, eliminated same-order homology evidence, and cautions that reference annotations may fall short and BUSCO does not fully evaluate gene-structure errors or false-positive genes.
  • The paper states that the close-relatives-included protein database was manually selected and would not scale well to very large numbers of annotated species.
  • Evident from the text: FINDER completed only 7 of 11 species; Funannotate or MAKER2 failed on some large genomes; MAKER2 was trained on the reference annotation, so its reported accuracy is an upper limit; and BRAKER3 had the longest runtime among the compared methods.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1101/gr.278090.123

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

5 of 15 cited sources checked · 2 supported · 0 flagged · accuracy not yet measured

Show all 59 claims

  • Probably not a substantial claim. 15
  • It may state two separate claims as one. 31
  • The quote only partly states this claim. 1
42 of 42
  • The authors state this as an assumption.

    The reference annotations used as ground truth are sufficiently accurate for benchmarking.

    “This long-established approach to benchmark gene prediction methods allows measurement of grave as well as subtle errors and is informative in absolute terms if the reference annotations are of high quality.”
  • The authors state this as an assumption.

    The target species' proteome has an assumed level of relatedness to available proteomes.

    “We benchmarked the new pipeline on genomes of 11 species under an assumed level of relatedness of the target species proteome to available proteomes.”
  • The authors state this as an assumption.

    The order excluded protein database is a conservative assumption.

    “we performed experiments with the particularly favorable case of the species excluded database and with the rather conservative assumption of the order excluded database.”
  • The paper relies on this without support.

    The five or six randomly selected short-read RNA-seq libraries per species are sufficient and representative for annotation.

    “For each species, we retrieved genome assemblies, five or six randomly selected short-read RNA-seq libraries from NCBI's Sequence Read Archive (https://www.ncbi.nlm.nih.gov/sra) (for detailed list, see Supplemental Table S15), a protein database, and a reference genome annotation (for detailed list, see Supplemental Table S1).”
  • The paper relies on this without support.

    The OrthoDB-based protein databases from the broad clade contain useful homologous informants for the target species.

    “The protein database is a FASTA file with proteins from the broad clade of the target genome in question, for example, a subset from the partitioning of OrthoDB that we provide (see Supplemental Methods).”
  • The paper relies on this without support.

    Modern genome annotation pipelines depend on an increasing number of tools, which can make their installation and maintenance difficult.

    “One problem with modern genome annotation pipelines is their dependence on an increasing number of tools, which can make their installation and maintenance difficult.”
  • The paper relies on this without support.

    BUSCO uses a set of genes that are well conserved and, therefore, arguably relatively easy to predict.

    “Moreover, BUSCO uses a set of genes that are well conserved and, therefore, arguably relatively easy to predict.”
  • The paper relies on this without support.

    A comprehensive gold-standard annotation for a set of test genomes representing the whole space of eukaryotic genomes does not exist.

    “However, a comprehensive gold-standard annotation for such a set of genomes does not exist.”
  • The paper relies on this without support.

    The error rates in eukaryotic gene annotation remain significant.

    “As long as the error rates in eukaryotic gene annotation remain significant, a trade-off between the numbers of false-positive and false-negative genes has to be made.”
9 of 9

Citations

Cites

Flagged first, then by citations

Show all 26 references

Cited by

Sorted by citations

Items 101–200 of 678

Metadata

Authors
Gabriel, L., Brůna, T., Hoff, K. J., Ebel, M., Lomsadze, A., Borodovsky, M., & Stanke, M.
Affiliations
  • Universität Greifswald (DE)
  • Lawrence Berkeley National Laboratory (US)
  • Georgia Institute of Technology (US)
Corresponding author
  • Hoff, Katharina J.
  • Lomsadze, Alexandre
Venue
Genome Research
Published
2024-05
Volume
34
Issue
5
Pages
769-777
ISSN
  • 1088-9051 (ISSN-L)
  • 1549-5469
OpenAlex
W4399560644
Cited by
676
References
26
Citations by year
2026: 360 · 2025: 245 · 2024: 63
Type
posted content
Language
en
Open access
Licence
cc-by-nc-sa
Locations
  • Genome Research (publishedVersion)
  • PubMed Central (publishedVersion, cc-by-nc-sa)
  • PubMed (publishedVersion)
  • OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion, other-oa)
  • HighWire Press Open Archive (submittedVersion)
Funders
U.S. National Institutes of Health (GM128145)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Chromosomal and Genetic Variations
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA and protein synthesis mechanisms
Keywords
BRAKER3, genome annotation, gene prediction, RNA-seq, Augustus, eukaryotic genomes, transcriptome, proteome, annotation pipeline, Funannotate, Finder, Docker containers
MeSH terms
RNA-Seq, Algorithms, Animals, Humans, Software, Genome, Computational Biology, Genomics, Molecular Sequence Annotation, Transcriptome

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.

A language model drew the claims from the paper on 2026-11-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-11-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

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