z-logo
open-access-imgOpen Access
Mapping-free variant calling using haplotype reconstruction from k-mer frequencies
Author(s) -
Peter A. Audano,
Shashidhar Ravishankar,
Fredrik Vannberg
Publication year - 2017
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btx753
Subject(s) - computer science , kestrel , source code , contig , computational biology , sequence assembly , biology , haplotype , genome , genetics , algorithm , gene , programming language , paleontology , gene expression , transcriptome , genotype , predation
The standard protocol for detecting variation in DNA is to map millions of short sequence reads to a known reference and find loci that differ. While this approach works well, it cannot be applied where the sample contains dense variants or is too distant from known references. De novo assembly or hybrid methods can recover genomic variation, but the cost of computation is often much higher. We developed a novel k-mer algorithm and software implementation, Kestrel, capable of characterizing densely packed SNPs and large indels without mapping, assembly or de Bruijn graphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom