English

Indexing arbitrary-length $k$-mers in sequencing reads

Data Structures and Algorithms 2017-03-03 v3 Genomics

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 kk-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.

Keywords

Cite

@article{arxiv.1502.01861,
  title  = {Indexing arbitrary-length $k$-mers in sequencing reads},
  author = {Tomasz Kowalski and Szymon Grabowski and Sebastian Deorowicz},
  journal= {arXiv preprint arXiv:1502.01861},
  year   = {2017}
}
R2 v1 2026-06-22T08:23:41.836Z