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

February 06, 2015 Β· Declared Dead Β· πŸ› PLoS ONE

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Tomasz Kowalski, Szymon Grabowski, Sebastian Deorowicz arXiv ID 1502.01861 Category cs.DS: Data Structures & Algorithms Cross-listed q-bio.GN Citations 16 Venue PLoS ONE Last Checked 3 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted