Kmer2SNP: reference-free SNP calling from raw reads based on matching
Abstract
The development of DNA sequencing technologies provides the opportunity to call heterozygous SNPs for each individual. SNP calling is a fundamental problem of genetic analysis and has many applications, such as gene-disease diagnosis, drug design, and ancestry inference. Reference-based SNP calling approaches generate highly accurate results, but they face serious limitations especially when high-quality reference genomes are not available for many species. Although reference-free approaches have the potential to call SNPs without using the reference genome, they have not been widely applied on large and complex genomes because existing approaches suffer from low recall/precision or high runtime. We develop a reference-free algorithm Kmer2SNP to call SNP directly from raw reads. Kmer2SNP first computes the k-mer frequency distribution from reads and identifies potential heterozygous k-mers which only appear in one haplotype. Kmer2SNP then constructs a graph by choosing these heterozygous k-mers as vertices and connecting edges between pairs of heterozygous k-mers that might correspond to SNPs. Kmer2SNP further assigns a weight to each edge using overlapping information between heterozygous k-mers, computes a maximum weight matching and finally outputs SNPs as edges between k-mer pairs in the matching. We benchmark Kmer2SNP against reference-free methods including hybrid (assembly-based) and assembly-free methods on both simulated and real datasets. Experimental results show that Kmer2SNP achieves better SNP calling quality while being an order of magnitude faster than the state-of-the-art methods. Kmer2SNP shows the potential of calling SNPs only using k-mers from raw reads without assembly. The source code is freely available at https://github.com/yanboANU/Kmer2SNP.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 6
- FWCI
- 2.21
- Field percentile
- top 11%
- 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
- Using 2k + 2 bubble searches to find SNPs in k-mer graphs
Reda Younsi, Dan MacLean·bioRxiv·Oct 27, 2014
- Mapping-free variant calling using haplotype reconstruction from k-mer frequencies
Peter A. Audano, Shashidhar Ravishankar, Fredrik O. Vannberg·BioinformaticsPeer-reviewed·Nov 23, 2017
- Fast genotyping of known SNPs through approximate k-mer matching
Ariya R Shajii, Deniz Yorukoglu, … Bonnie Berger·BioinformaticsPeer-reviewed·Aug 29, 2016
- FastGT: an alignment-free method for calling common SNVs directly from raw sequencing reads
Fanny‐Dhelia Pajuste, Lauris Kaplinski, … Maido Remm·Scientific ReportsPeer-reviewed·May 24, 2017
- KAGE: Fast alignment-free graph-based genotyping of SNPs and short indels
Ivar Grytten, Knut Dagestad Rand, Geir Kjetil Sandve·bioRxiv·Dec 3, 2021
- DiscoSnp++: de novo detection of small variants from raw unassembled read set(s)
Pierre Peterlongo, Chloé Riou, … Claire Lemaitre·bioRxiv·Oct 27, 2017