PLoS Computational BiologyGenomicsPeer-reviewed journal article
Estimating repeat spectra and genome length from low-coverage genome skims with RESPECT
Shahab SarmashghiiD, Metin BalabaniD, Eleonora RachtmaniD, Behrouz TouriiD, Siavash MirarabiD, Vineet BafnaiD
Abstract
The cost of sequencing the genome is dropping at a much faster rate compared to assembling and finishing the genome. The use of lightly sampled genomes (genome-skims) could be transformative for genomic ecology, and results using k-mers have shown the advantage of this approach in identification and phylogenetic placement of eukaryotic species. Here, we revisit the basic question of estimating genomic parameters such as genome length, coverage, and repeat structure, focusing specifically on estimating the k-mer repeat spectrum. We show using a mix of theoretical and empirical analysis that there are fundamental limitations to estimating the k-mer spectra due to ill-conditioned systems, and that has implications for other genomic parameters. We get around this problem using a novel constrained optimization approach (Spline Linear Programming), where the constraints are learned empirically. On reads simulated at 1X coverage from 66 genomes, our method, REPeat SPECTra Estimation (RESPECT), had < 1.5% error in length estimation compared to 34% error previously achieved. In shotgun sequenced read samples with contaminants, RESPECT length estimates had median error 4%, in contrast to other methods that had median error 80%. Together, the results suggest that low-pass genomic sequencing can yield reliable estimates of the length and repeat content of the genome. The RESPECT software will be publicly available at https://github.com/shahab-sarmashghi/RESPECT.git
- assay: whole-genome sequencing
- research focus: variant calling
- research focus: genome assembly
- approach: statistical model
- approach: optimal transport
- Citations
- 39
- FWCI
- 1.80
- Field percentile
- top 13%
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
- A k-mer-based estimator of the substitution rate between repetitive sequences
Haonan Wu, Antonio Blanca, Paul Medvedev·Algorithms for Molecular BiologyPeer-reviewed·Jul 3, 2026
- Read-Consistent Minimum Unique Substrings: A Parameter-Free, Linear-Time Framework for Genomic Sequence Representation
Andrews Frimpong Adu, Elliot Sarpong Menkah, … Samson Pandam Salifu·bioRxiv·May 25, 2026
- Genome size estimation from long read overlaps
Michael B. Hall, Chenxi Zhou, Lachlan Coin·BioinformaticsPeer-reviewed·Nov 1, 2025
- ntHits: de novo repeat identification of genomics data using a streaming approach
Hamid Mohamadi, Justin Chu, … İnanç Birol·bioRxiv·Nov 2, 2020
- KmerStream: Streaming algorithms for k-mer abundance estimation
Páll Melsted, Bjarni V. Halldórsson·bioRxiv·Apr 7, 2014
- The gift of novelty: repeat-robust k-mer-based estimators of mutation rates
Haonan Wu, Paul Medvedev·BioinformaticsPeer-reviewed·Jul 1, 2026