Sign in
BioinformaticsMolecular Biology and Evolution
Peer-reviewed journal article

kamino: fast proteome-wide variant calling for amino acid phylogenomics

Romain DerelleiD, John A. LeesiD, Leonid ChindelevitchiD

Abstract

Amino acid-based phylogenetics usually relies on first clustering and aligning orthologous proteins. This approach is powerful but computationally demanding. Here, we present kamino, a reference- and alignment-free method that rapidly builds amino acid phylogenomic alignments directly from proteomes. As with similar algorithms, homologous regions are identified through shared sequences flanking variable regions. The method uses local changes in recoded k-mer occupancy to efficiently identify variable positions within these homologous regions and extract the corresponding pseudo-aligned sequences. It generates phylogenetically informative alignments across diverse prokaryotic and eukaryotic datasets. Phylogenetic analyses show that it accurately recovers Mycobacterium tuberculosis lineages, most curated GTDB taxa, and relationships consistent with published Drosophila and mammalian phylogenies, while producing signals broadly similar to BUSCO-based approaches. Runtimes are comparable to genome-based alignment-free methods and several orders of magnitude faster than classical marker-based pipelines, with moderate memory requirements. The method performs well across a broad range of divergence levels, from within-species comparisons to family-level prokaryotic and phylum-level eukaryotic datasets. kamino therefore provides a fast and simple route from proteomes to phylogenomic alignments across a broad range of evolutionary scales. The program is implemented in Rust and freely available at https://github.com/rderelle/kamino.

02 /Specification & Classification

Click any tag to browse matching papers

In-depth summary

✦ Multi-agent verified full-text synthesis

Claude Opus 5.5 · xhigh effort · 8 Nov 2026 · from the full text of version 2 (3 Sept 2026) · CC BY 4.0

Proteome-wide variant calling builds amino acid phylogenomic alignments orders of magnitude faster than a BUSCO marker pipeline, with similar tree signal in three of four test taxa.

Amino acid phylogenomics usually needs orthogroup clustering or marker searches plus alignment, which is slow, while amino acid k-mer methods give only pairwise distances and genome variant callers (split k-mers, assembly graphs) need shared flanks that restrict them to population or species level. kamino adapts the ska lo coloured de Bruijn graph caller to recoded proteomes, calling homologous amino acid variants above the species level without marker identification or alignment.

Key results

  1. Shownkamino built alignments much faster than the BUSCO marker pipeline on the four 120-isolate datasets, but used more memory because it holds a large graph in memory.

    Prokaryotic taxa (Mycobacterium, Enterobacteriaceae): one to two orders of magnitude faster. Eukaryotic taxa (Hypocreales, Insecta): two to three orders of magnitude faster. The gap depended on which BUSCO marker set was used. Runs used 4 CPUs; BUSCO time is the combined wall-clock time of busco v6.0.0 and BUSCO_phylogenomics. · Assessing kamino efficiency and scalability; BUSCO analyses

  2. SuggestedIn Mycobacterium, Enterobacteriaceae and Hypocreales, trees grouped by inference method rather than by alignment source, so kamino and BUSCO alignments carried broadly similar signal. In Insecta, kamino trees clustered apart and differed at deep nodes.

    For each taxon, nine trees (kamino, BUSCO broad and BUSCO taxa alignments, each run with BioNJ, FastTree and IQ-TREE) were compared by cluster information and Robinson-Foulds distances. No kamino topology matched any BUSCO topology. In Insecta, only kamino trees recovered Condylognatha (Thysanoptera + Hemiptera) and only BUSCO trees recovered Palaeoptera (Odonata + Ephemeroptera), a group whose monophyly is disputed. · Comparing outputs of kamino and a marker-based…; Quality assessments and phylogenetic analyses

  3. Shownkamino alignments were less saturated than BUSCO alignments in all four comparison taxa. Except in Insecta, where BUSCO broad was comparatively short, they were about as long as the reduced BUSCO set's alignments, and all alignments had similarly low Pythia difficulty.

    The saturation slope (patristic vs uncorrected distances, 0 to 1, higher means less saturated) favoured kamino in all four datasets. It was nearly twice as high for kamino in the two eukaryotic datasets (Hypocreales, Insecta). Pythia scores ranged from 0 to 0.06 for all alignments. BUSCO taxa (taxon-specific markers) gave much larger alignments, and BUSCO broad was comparatively short for Insecta. · Comparing outputs of kamino and a marker-based…

  4. Shownkamino produced useful alignments up to phylum rank for eukaryotes. Prokaryotic alignments shrank sharply at higher ranks, which mostly restricts prokaryotic use to genera and families.

    Tested on 40-proteome datasets from 93 eukaryotic (NCBI) and 269 prokaryotic (GTDB) taxa. Eukaryotic Pythia scores were below 0.1 except for Aves and Magnoliopsida. Prokaryotic scores reached 0.8 at higher ranks, and alignments scoring above 0.2 were always the shortest. Missing data rose from about 5% (genus) to 10% (phylum). Lowering -f from 0.85 to 0.75 made most alignments about 1.5- to 2-fold longer. · Assessing the diversity limits of kamino; Discussion

  5. ShownRuntime and memory grew roughly linearly with the number of proteomes, more steeply for eukaryotes. Extra threads helped mainly up to 4 CPUs.

    Each of the four taxa was rerun at 40, 80, 120, 160 and 200 isolates on 4 CPUs. The 120-isolate sets were rerun with 1 to 12 CPUs: runtime dropped sharply from 1 to 4 CPUs, with modest gains beyond that. Hardware: Intel Xeon Platinum 8358, 2.60 GHz, 48 GB RAM. The authors note that memory may limit runs on hundreds of large eukaryotic proteomes. · Assessing kamino efficiency and scalability; Quality assessments and phylogenetic analyses

Methods, data and reproducibility

kamino recodes proteomes into a six-letter alphabet (SR6 by default), keeps proteins with shared k-mer anchors (Bloom filter plus count-min sketch), and traverses a coloured de Bruijn graph for variant groups (equal-length alternative paths between shared anchors), which are decoded to amino acids and concatenated. Alignments were compared with BUSCO pipelines by Pythia, PhyKIT saturation and tree distances.

  • Eukaryotic test datasets: 40 isolate proteomes per taxon, genus to phylum ranks, drawn from NCBI taxonomy (annotated genomes with at least 2,000 predicted proteins) · eukaryotes (multiple taxa) · n = 93 taxa, 40 proteomes each
  • Prokaryotic test datasets: 40 isolate proteomes per taxon, drawn from GTDB release 226 (annotated genomes with at least 400 predicted proteins) · prokaryotes (multiple taxa) · n = 269 taxa, 40 proteomes each
  • Mycobacterium proteomes for the BUSCO comparison and scaling tests · bacteria (genus Mycobacterium) · n = 120 isolates (40 to 200 in scaling tests)
  • Enterobacteriaceae proteomes for the BUSCO comparison and scaling tests · bacteria (family Enterobacteriaceae) · n = 120 isolates (40 to 200 in scaling tests)
  • Hypocreales proteomes for the BUSCO comparison and scaling tests · fungi (order Hypocreales) · n = 120 isolates (40 to 200 in scaling tests)
  • Insecta proteomes for the BUSCO comparison and scaling tests · insects (class Insecta) · n = 120 isolates (40 to 200 in scaling tests)
  • BUSCO odb12 marker sets: broad bacteria, fungi and metazoa sets plus larger taxon-specific sets
Methods & tools
kamino v1.0.0, ska lo, BUSCO v6.0.0, BUSCO_phylogenomics, NCBI datasets v18.19.0, GTDB release 226, Pythia v2.0.0, PhyKIT v2.1.90, IQ-TREE v3.0.1, FastTree v2.2.0, TreeDist v2.12.0, ape v5.8.1
Software & environment
kamino v1.0.0 (Rust; precompiled binaries via Bioconda), default parameters unless stated; busco v6.0.0, datasets v18.19.0, Pythia v2.0.0 with RAxML-NG v2.0.0-beta3, PhyKIT v2.1.90, IQ-TREE v3.0.1 (LG+G+I), FastTree v2.2.0 (LG), R packages TreeDist v2.12.0, ape v5.8.1, phangorn v2.12.1.
Assay conditions & compute
Runtime and memory benchmarks: one Intel Xeon Platinum 8358 processor (2.60 GHz), 48 GB of RAM. Comparisons used 4 CPUs (4 threads for the BUSCO tools); multithreading was tested with 1 to 12 CPUs.
Reproducibility gaps
The text reports no absolute runtime or memory values; these, and per-dataset alignment statistics, are in figures and Supplementary Data. No container or lock file is described.
Limitations (6)
  • Weaker on deeply divergent prokaryotic datasets: useful alignments are mostly limited to genera and families, probably because higher divergence and gene-content turnover leave fewer shared local anchors. · stated by the authors
  • Large eukaryotic datasets need substantial memory. The authors call this the main practical constraint on scalability, especially for hundreds of large eukaryotic proteomes. · stated by the authors
  • Not intended for within-species phylogenetics: recoding discards informative variants, and without genomic coordinates recombination tracts cannot be detected or removed. · stated by the authors
  • There is no outlier detection, so hidden paralogy, incomplete lineage sorting and lateral gene transfer can still affect alignments. The expectation that these cause less noise than in marker pipelines was not tested. · stated by the authors
  • Speed comparisons with BUSCO used 4 CPUs and should be read with caution: all-versus-one marker pipelines parallelise more easily and may gain more from extra CPUs. · stated by the authors
  • Tree accuracy was never checked against a known or simulated true phylogeny. Agreement with BUSCO trees, Pythia scores and saturation are proxies, and the head-to-head comparison covered only four taxa. · noted in this summary

Who should read:Read this if you build amino acid phylogenomic datasets for eukaryotes, or for bacterial genera and families, and want a fast, alignment-free alternative or complement to BUSCO-style marker pipelines.

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.

Similarity Map
SelectedSame fieldCross-field
THISLiu '21Leimeister '18Zuo '21Booth '25Tsai '26Dylus '22
62% semantic matchBioinformatics
Xuemei Liu, Wen Li, Guanda Huang+4 more·bioRxiv·Aug 16, 2021