Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly
arXiv:1203.6364 · doi:10.1093/bioinformatics/bts280
Abstract
Motivation: Eugene Myers in his string graph paper (Myers, 2005) suggested that in a string graph or equivalently a unitig graph, any path spells a valid assembly. As a string/unitig graph also encodes every valid assembly of reads, such a graph, provided that it can be constructed correctly, is in fact a lossless representation of reads. In principle, every analysis based on whole-genome shotgun sequencing (WGS) data, such as SNP and insertion/deletion (INDEL) calling, can also be achieved with unitigs. Results: To explore the feasibility of using de novo assembly in the context of resequencing, we developed a de novo assembler, fermi, that assembles Illumina short reads into unitigs while preserving most of information of the input reads. SNPs and INDELs can be called by mapping the unitigs against a reference genome. By applying the method on 35-fold human resequencing data, we showed that in comparison to the standard pipeline, our approach yields similar accuracy for SNP calling and better results for INDEL calling. It has higher sensitivity than other de novo assembly based methods for variant calling. Our work suggests that variant calling with de novo assembly be a beneficial complement to the standard variant calling pipeline for whole-genome resequencing. In the methodological aspects, we proposed FMD-index for forward-backward extension of DNA sequences, a fast algorithm for finding all super-maximal exact matches and one-pass construction of unitigs from an FMD-index. Availability: http://github.com/lh3/fermi Contact: [email protected]
Rev2: submitted version with minor improvements; 7 pages
Cited by in corpus (18)
- Haplotype-resolved de novo assembly with phased assembly graphs
- Minimap and miniasm: fast mapping and de novo assembly for noisy long sequences
- Towards Better Understanding of Artifacts in Variant Calling from High-Coverage Samples
- Assemblathon 2: evaluating de novo methods of genome assembly in three vertebrate species
- biobambam: tools for read pair collation based algorithms on BAM files
- Rust-Bio - a fast and safe bioinformatics library
- Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs
- BWT construction and search at the terabase scale
- GPU-Accelerated BWT Construction for Large Collection of Short Reads
- On the representation of de Bruijn graphs
- LISA: Towards Learned DNA Sequence Search
- Computing the BWT and LCP array of a Set of Strings in External Memory
- Correcting Illumina sequencing errors for human data
- A New Lightweight Algorithm to compute the BWT and the LCP array of a Set of Strings
- FMtree: A fast locating algorithm of FM-indexes for genomic data
- FindeR: Accelerating FM-Index-based Exact Pattern Matching in Genomic Sequences through ReRAM technology
- FermiKit: assembly-based variant calling for Illumina resequencing data
- EXMA: A Genomics Accelerator for Exact-Matching