Back to search

Article

Fast genotyping of known SNPs through approximate <i>k</i> -mer matching

2016-07-12

Abstract excerpt

<h4>Motivation</h4> 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...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work
e525fd07-5cda-5454-a759-258e9930d7ba
DOI
10.1101/063446
Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest
Interactive article relationship graphSelect a related publication card to move it into the centre and load its closest explainable connections. Solid lines are source-backed structured connections. Dashed lines are semantic discovery signals and are not scientific evidence.
Fast genotyping of known SNPs through approximate <i>k</i> -mer matchingDOI 10.1101/063446
Select a neighboring publication to make it the new centre.