Abstract
Key messageAn improved estimator of genomic relatedness using low-depth high-throughput sequencing data for autopolyploids is developed. Its outputs strongly correlate with SNP array-based estimates and are available in the package GUSrelate.High-throughput sequencing (HTS) methods have reduced sequencing costs and resources compared to array-based tools, facilitating the investigation of many non-model polyploid species. One important quantity that can be computed from HTS data is the genetic relatedness between all individuals in a population. However, HTS data are often messy, with multiple sources of errors (i.e. sequencing errors or missing parental alleles) which, if not accounted for, can lead to bias in genomic relatedness estimates. We derive a new estimator for constructing a genomic relationship matrix (GRM) from HTS data for autopolyploid species that accounts for errors associated with low sequencing depths, implemented in the R package GUSrelate. Simulations revealed that GUSrelate performed similarly to existing GRM methods at high depth but reduced bias in self-relatedness estimates when the sequencing depth was low. Using a panel consisting of 351 tetraploid potato genotypes, we found that GUSrelate produced GRMs from genotyping-by-sequencing (GBS) data that were highly correlated with a GRM computed from SNP array data, and less biased than existing methods when benchmarking against the array-based GRM estimates. GUSrelate provides researchers with a tool to reliably construct GRMs from low-depth HTS data.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.