Fast and accurate imputation of genotypes from noisy low-coverage sequencing data in bi-parental populations
Cécile TriayiD, Alice BoizetiD, Christopher FragosoiD, Anestis GkanogiannisiD, Jean‐François RamiiD, Mathias LorieuxiD
Abstract
MotivationGenotyping of bi-parental populations can be performed with low-coverage next-generation sequencing (LC-NGS). This allows the creation of highly saturated genetic maps at reasonable cost, precisely localized recombination breakpoints (i.e., the crossovers), and minimized mapping intervals for quantitative-trait locus analysis. The main issues with these low-coverage genotyping methods are (1) poor performance at heterozygous loci, (2) high percentage of missing data, (3) local errors due to erroneous mapping of sequencing reads and reference genome mistakes, and (4) global, technical errors inherent to NGS itself. Recent methods like Tassel-FSFHap or LB-Impute are excellent at addressing issues 1 and 2, but nonetheless perform poorly when issues 3 and 4 are persistent in a dataset (i.e., "noisy" data). Here, we present a new algorithm for imputation of LC-NGS data that eliminates the need of complex pre-filtering of noisy data, accurately types heterozygous chromosomal regions, precisely estimates crossover positions, corrects erroneous data, and imputes missing data. The imputation of genotypes and recombination breakpoints is based on maximum-likelihood estimation. We compare its performance with Tassel-FSFHap and LB-Impute using simulated data and two real datasets. NOISYmputer is consistently more efficient than the two other software tested and reaches average breakpoint precision of 99.9% and average recall of 99.6% on illumina simulated dataset. NOISYmputer consistently provides precise map size estimations when applied to real datasets while alternative tools may exhibit errors ranging from 3 to 1845 times the real size of the chromosomes in centimorgans. Furthermore, the algorithm is not only highly effective in terms of precision and recall but is also particularly economical in its use of RAM and computation time, being much faster than Hidden Markov Model methods. AvailabilityNOISYmputer and its source code are available as a multiplatform (Linux, macOS, Windows) Java executable at the URL https://gitlab.cirad.fr/noisymputer/noisymputerstandalone/-/tree/1.0.0-RELEASE?reftype=tags.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 0
- Assay
- Research Focus
- Approach
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
- NOISYmputer: genotype imputation in bi-parental populationsfor noisy low-coverage next-generation sequencing data
Mathias Lorieux, Anestis Gkanogiannis, … Jean‐François Rami·bioRxiv·Jun 3, 2019
- A Novel Efficient Algorithm for Common Variants Genotyping from Low-Coverage Sequencing Data
Shixuan Zhang, Kanglong Xiao, … Yi Wang·Computational and Structural Biotechnology ReportsPeer-reviewed·Jan 1, 2025
- Efficient phasing and imputation of low-coverage sequencing data using large reference panels
Simone Rubinacci, Diogo M. Ribeiro, … Olivier Delaneau·Nature GeneticsPeer-reviewed·Jan 1, 2021
- Accounting for Errors in Low Coverage High-Throughput Sequencing Data when Constructing Genetic Maps using Biparental Outcrossed Populations
Timothy P. Bilton, Matthew Schofield, … K. G. Dodds·GeneticsPeer-reviewed·Feb 27, 2018
- Benchmarking Imputed Low Coverage Genomes in a Human Population Genetics Context
Gludhug A. Purnomo, João C. Teixeira, … Raymond Tobler·Molecular Ecology ResourcesPeer-reviewed·Jul 8, 2025
- Genotyping by low-coverage whole-genome sequencing in intercross pedigrees from outbred founders: a cost efficient approach
Yanjun Zan, Thibaut Payen, … Örjan Carlborg·Genetics Selection EvolutionPeer-reviewed·Aug 14, 2019