ArticleInterdisciplinary sciences, computational life sciences2026
Efficient De Novo Assembly and Recovery of Microbial Genomes from Complex Metagenomes Using a Reduced Set of k-mers.
Article in Interdisciplinary sciences, computational life sciences, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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.
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.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
De novo assembly and genome binning are fundamental steps for genome-resolved metagenomics analyses. However, the availability of limited computational resources and extensive processing time limit the broader application of these analyses. To address these challenges, the optimization of the parameters employed in these processes can improve the effective utilization of available metagenomics tools. Therefore, this study tested three sets of k-mers (default, reduced, and extended) for their efficiency in metagenome assembly and suitability in recovering metagenome-assembled genomes. The results demonstrate that the reduced set of k-mers outperforms the other two sets in computational efficiency and the quality of results. The assemblies from the default set are comparable with those from the reduced set; however, less complete and highly contaminated metagenome-assembled genomes are obtained at the expense of higher processing time. The extended set of k-mers yields less contiguous but computationally expensive assemblies. This set takes approximately 3-times more processing time than the reduced k-mers and recovers the lowest proportions of high and medium-quality metagenome-assembled genomes. Contrarily, the reduced set produces better assemblies, substantially improving the number and quality of the recovered metagenome-assembled genomes in significantly reduced processing time. Validation of the reduced k-mer set on previously published metagenome datasets further demonstrates its effectiveness not only for human metagenomes but also for the metagenomes of environmental origin. These findings underscore that the reduced k-mer set is optimal for efficient metagenome analyses of varying complexities and origins. This optimization of the k-mer set used in metagenome assemblers significantly reduces computational time while improving the quality of the assemblies and recovered metagenome-assembled genomes. This efficient solution will facilitate the widespread application of genome-resolved analyses, even in resource-limited settings, and help the recovery of better-quality metagenome-assembled genomes for downstream analyses.
Indexed as
Identifiers
40455399What OpenQuestion holds
Registered trials
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.