Article
Fast genotyping of known SNPs through approximate k-mer matching.
Bioinformatics (Oxford, England) - 1 Sept 2016
Shajii Ariya, Yorukoglu Deniz, William Yu Yun, Berger Bonnie
Abstract excerpt
MOTIVATION: As the volume of next-generation sequencing (NGS) data increases, faster algorithms become necessary. Although speeding up individual components of a sequence analysis pipeline (e.g. read mapping) can reduce the computational cost of analysis, such approaches do not take full advantage of the particulars of a given problem. One problem of great interest, genotyping a known set of variants (e.g. dbSNP...
Read the complete abstract on PubMedTopics
Share this publication in a Topic to start or enrich a Post.
