The gift of novelty: repeat-robust k -mer-based estimators of mutation rates
Year: 2026
Type: article
Abstract: MOTIVATION: Estimating mutation rates between evolutionarily related sequences is a central problem in molecular evolution. Due to the rapid expansion of datasets, modern methods avoid costly alignment and instead compare sketches of sets of constituent k-mers. While these methods perform well on many sequences, they are not robust to highly repetitive sequences such as centromeres. RESULTS: We present three new estimators that are robust to the presence of repeats. The estimators are applicable in different settings, depending on whether count information is available from zero, one, or both sequences. We evaluate our estimators empirically using highly repetitive alpha satellite sequences. Each estimator performs best within its class, and our strongest estimator outperforms all other tested estimators. AVAILABILITY AND IMPLEMENTATION: Our software is open-source and freely available at https://github.com/medvedevgroup/Accurate_repeat-aware_kmer_based_estimator.
Source: Bioinformatics
Authors: Haonan Wu, Paul Medvedev
Institution: Pennsylvania State University
Language: English
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: gold
Estimated APC paid: $3,989
OpenAlex ID: W7167622081
