Indexing arbitrary-length k-mers in sequencing reads

11Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

We propose a lightweight data structure for indexing and querying collections of NGS reads data in main memory. The data structure supports the interface proposed in the pioneering work by Philippe et al. for counting and locating k-mers in sequencing reads. Our solution, PgSA (pseudogenome suffix array), based on finding overlapping reads, is competitive to the existing algorithms in the space use, query times, or both. The main applications of our index include variant calling, error correction and analysis of reads from RNA-seq experiments. Copyright:

Cite

CITATION STYLE

APA

Kowalski, T., Grabowski, S., & Deorowicz, S. (2015). Indexing arbitrary-length k-mers in sequencing reads. PLoS ONE, 10(7). https://doi.org/10.1371/journal.pone.0133198

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free