bioRxivBioinformaticsPreprint
Accurate de novo identification of biosynthetic gene clusters with GECCO
Laura M. CarrolliD, Martin F. LarraldeiD, Jonas Simon FleckiD, Ruby Ponnudurai, Alessio MilaneseiD, Elisa Cappio BarazzoneiD, Georg ZelleriD
Abstract
Biosynthetic gene clusters (BGCs) are enticing targets for (meta)genomic mining efforts, as they may encode novel, specialized metabolites with potential uses in medicine and biotechnology. Here, we describe GECCO (GEne Cluster prediction with COnditional random fields; https://gecco.embl.de), a high-precision, scalable method for identifying novel BGCs in (meta)genomic data using conditional random fields (CRFs). Based on an extensive evaluation of de novo BGC prediction, we found GECCO to be more accurate and over 3x faster than a state-of-the-art deep learning approach. When applied to over 12,000 genomes, GECCO identified nearly twice as many BGCs compared to a rule-based approach, while achieving higher accuracy than other machine learning approaches. Introspection of the GECCO CRF revealed that its predictions rely on protein domains with both known and novel associations to secondary metabolism. The method developed here represents a scalable, interpretable machine learning approach, which can identify BGCs de novo with high precision.
- organism: bacteria (other)
- assay: whole-genome sequencing
- assay: metagenomics
- research focus: software / tool
- research focus: benchmarking
- research focus: deconvolution
- approach: machine learning (classical)
- approach: benchmark study
- approach: statistical model
In-depth summary
Claude Opus 5.5 · xhigh effort · 8 Nov 2026 · from the full text of version 1 (4 May 2021) · CC BY 4.0
A linear conditional random field over ordered protein-domain annotations finds biosynthetic gene clusters de novo more precisely than DeepBGC and runs over three times faster on one CPU.
Rule-based biosynthetic gene cluster (BGC) finders such as antiSMASH and PRISM are precise but miss clusters of unknown architecture, and model-based tools for novel clusters use either a hidden Markov model (ClusterFinder) or a black-box bidirectional long short-term memory network (DeepBGC). GECCO replaces these with a conditional random field (CRF), a discriminative and inherently interpretable sequence model, and tests it in a new benchmark keeping training and test BGCs disjoint.
Key results
ShownTrained on MIBiG v1.3 and tested on BGCs added only in MIBiG v2.0 (376-genome test set), GECCO outperformed original and retrained DeepBGC and ClusterFinder in domain-level receiver operating characteristic (ROC) and precision-recall (PR) analysis.
Area under the ROC curve (AUROC) higher than all DeepBGC/ClusterFinder variants on the 376- and six-genome sets, tied with original DeepBGC on the nine-genome set (0.94 each); area under PR curve (AUPR) higher on all three sets. Versus retrained DeepBGC in 10-fold cross-validation (CV): GECCO AUROC 0.97, AUPR 0.73. AUROC/AUPR values for the 376- and six-genome sets are not given in the text. · GECCO provides superior precision and speed…; Validation of CRF performance on external test…; Figure legends
ShownAt the level of whole predicted clusters (segment overlap), GECCO's AUPR was substantially higher than every DeepBGC/ClusterFinder implementation. The authors attribute its accuracy mainly to more precise boundary placement, which also greatly reduces fragmented predictions.
PR curves from segment overlap between predicted and known BGCs (minimum overlap 25, 50 and 75%) gave GECCO a substantially higher AUPR than all DeepBGC/ClusterFinder implementations; a histogram of predicted BGC lengths on the 376-genome set is used to show less fragmentation. No segment-level AUPR values are stated in the text. · GECCO provides superior precision and speed…; Validation of CRF performance on external test…; Figure legends
ShownWhen an entire biosynthetic class is withheld from training, GECCO still largely recovers it. Recovery is weaker for RiPP (ribosomally synthesized and post-translationally modified peptide) and saccharide clusters. A separate random forest assigns predicted clusters to MIBiG classes.
Leave-one-type-out (LOTO) CV, withholding each MIBiG class from training: AUROC > 0.98 for four of six classes, 0.91 for RiPPs and 0.88 for Saccharides. The random forest class predictor reached AUROC > 0.90 for every class in five-fold CV. · GECCO provides superior precision and speed…; CRF training and cross-validation; Prediction of biosynthetic class
ShownOn 12,221 proGenomes2 representative genomes, GECCO's BGC count fell between the two other tools: close to double antiSMASH's total, yet well below DeepBGC's. On a single CPU, GECCO ran over three times faster than both.
BGC counts: 115,131 GECCO, 59,041 antiSMASH (default parameters), 470,137 DeepBGC; most GECCO or DeepBGC calls were not detected by antiSMASH. Single-CPU runtime was compared on the three test sets (395 contigs) and on proGenomes2 (627,182 contigs from 12,221 genomes); no absolute times are given in the text. · GECCO provides superior precision and speed…; GECCO’s CRF-based approach provides insight into…; BGC identification in prokaryotic genomes
SuggestedInspecting the CRF shows that it leans on domains linked to secondary metabolism. Many high-weight domains, however, lie outside the BiG-SLiCE core biosynthetic set, including three domains of unknown function (PF19155, PF11379, PF17537) that the authors propose for functional study.
937 of 2,027 BiG-SLiCE core domains (46.2%) are in GECCO's 5,255-domain model; core domains carry higher weights than non-core TIGRFAM domains (Mann-Whitney raw P = 3.12e-07) but not non-core Pfam ones (P = 0.10). Gene Ontology enrichment: 33 biological processes and 22 molecular functions (topGO P < 0.05); 3 Pfam clans (false discovery rate P < 0.10). · GECCO’s CRF-based approach provides insight into…; Comparison of GECCO and BiG-SLiCE domain sets; GO term enrichment; Pfam clan enrichment
Methods, data and reproducibility
Open reading frames predicted by Prodigal are annotated with Pfam v33.1 and TIGRFAM v15.0 profile HMM domains, keeping the 35% most BGC-associated by a Fisher's exact test nested in cross-validation; a two-state linear CRF labels each domain as BGC or not, and a random forest on domain-composition vectors assigns the MIBiG class. Training contigs embed MIBiG BGCs in antiSMASH-masked proGenomes2 contigs.
- MIBiG v2.0 experimentally validated BGCs used as positive instances; BGCs similar to test-set sequences removed before training and CV · n = 1,923 downloaded; 1,137 retained
- proGenomes2 v12 host-associated contigs, filtered by average nucleotide identity and with antiSMASH-detected BGCs masked, used as BGC-negative background · prokaryotes · n = 8,000 candidate contigs
- 376-genome test set: MIBiG v2.0 BGCs absent from v1.3 and dissimilar to v1.3 entries, each embedded in a prokaryotic contig · prokaryotes · n = 376 contigs
- Six genome test set from Hannigan et al., previously used to evaluate DeepBGC · n = six genomes
- Nine genome bootstrapping set from Hannigan et al. · n = nine genomes
- MIBiG v1.3 BGCs used to retrain GECCO and DeepBGC for the benchmark
- proGenomes2 v12 representative genomes used for genome-wide BGC calling and runtime comparison · prokaryotes · n = 12,221 genomes (627,182 contigs)
- BiG-SLiCE v1.1.0 core biosynthetic domain set used for comparison with GECCO's domains · n = 2,027 domains
- Methods & tools
- GECCO, CRFsuite v0.12, Prodigal v2.6.3, HMMER v3.3.1, Pfam v33.1, TIGRFAM v15.0, DIAMOND v0.9.13, antiSMASH v4.2.0, DeepBGC v0.1.18, scikit-learn v0.22.1, topGO v2.36.0, fgsea v1.10.1
- Data & accessions
- https://github.com/zellerlab/GECCO/releases/tag/v0.6.0https://progenomes.embl.de/index.cgihttps://mibig.secondarymetabolites.org/download
- Software & environment
- Tool versions are stated (e.g., CRFsuite v0.12, Prodigal v2.6.3, HMMER v3.3.1, DIAMOND v0.9.13, scikit-learn v0.22.1, R v3.6.1); no container or requirements file is described.
- Assay conditions & compute
- Runtime benchmarks used a single CPU; processor model, memory and absolute run times are not given in the text.
- Reproducibility gaps
- No container or dependency file is described; AUC values for the 376- and six-genome test sets, segment-overlap AUPRs and absolute runtimes are reported only in figures, not in the text. CRF weights are supplied as Supplementary Table S1.
Limitations (3)
- Training data are scarce: MIBiG v2.0 holds only 1,923 experimentally validated BGCs, and some are so closely related that they add little as training examples. · stated by the authors
- The main 376-genome benchmark is semi-synthetic and author-designed: MIBiG BGCs were inserted into contigs whose own BGCs were masked with antiSMASH, so negatives may still contain missed BGCs. Class prediction covers six MIBiG classes ('Other' excluded), and multi-class BGCs were left out of LOTO. · noted in this summary
- The 12,221-genome comparison has no ground truth. Whether the extra BGCs GECCO calls relative to antiSMASH, or the high-weight domains of unknown function, are genuine biosynthetic loci is not tested experimentally. · noted in this summary
Read this if you mine prokaryotic genomes or metagenomes for biosynthetic gene clusters and want an interpretable, faster model-based alternative to DeepBGC to use alongside rule-based antiSMASH.
- Citations
- 86
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Deep-BGCpred: A unified deep learning genome-mining framework for biosynthetic gene cluster prediction
Ziyi Yang, Ben Liao, … Shengyu Zhang·bioRxiv·Nov 15, 2021
- A Deep Learning Genome-Mining Strategy Improves Biosynthetic Gene Cluster Prediction
Geoffrey D. Hannigan, David Příhoda, … Danny A. Bitton·Nucleic Acids ResearchPeer-reviewed·Aug 8, 2019
- BiG-SLiCE: A Highly Scalable Tool Maps the Diversity of 1.2 Million Biosynthetic Gene Clusters
Satria Ardhe Kautsar, Justin J. J. van der Hooft, … Marnix H. Medema·GigaSciencePeer-reviewed·Jan 1, 2021
- Deciphering the Biosynthetic Potential of Microbial Genomes Using a BGC Language Processing Neural Network Model
Qilong Lai, Shuai Yao, … Kang Ning·Nucleic Acids ResearchPeer-reviewed·Apr 3, 2025
- Deep self-supervised learning for biosynthetic gene cluster detection and product classification
Carolina Rios-Martinez, Nicholas Bhattacharya, … Kevin Yang·PLoS Computational BiologyPeer-reviewed·May 23, 2023
- Mining metagenomes for natural product biosynthetic gene clusters: unlocking new potential with ultrafast techniques
Emiliano Pereira-Flores, Marnix H. Medema, … Antonio Fernández-Guerra·bioRxiv·Jan 20, 2021