Using Sequence Ensembles for Seeding Alignments of MinION Sequencing Data

June 28, 2016 Β· Declared Dead Β· πŸ› Conference on Theory and Practice of Information Technologies

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Rastislav Rabatin, Broňa BrejovΓ‘, TomΓ‘Ε‘ VinaΕ™ arXiv ID 1606.08719 Category cs.DS: Data Structures & Algorithms Cross-listed q-bio.GN Citations 1 Venue Conference on Theory and Practice of Information Technologies Last Checked 4 months ago
Abstract
Oxford Nanopore MinION sequencer is currently the smallest sequencing device available. While being able to produce very long reads (reads of up to 100~kbp were reported), it is prone to high sequencing error rates of up to 30%. Since most of these errors are insertions or deletions, it is very difficult to adapt popular seed-based algorithms designed for aligning data sets with much lower error rates. Base calling of MinION reads is typically done using hidden Markov models. In this paper, we propose to represent each sequencing read by an ensemble of sequences sampled from such a probabilistic model. This approach can improve the sensitivity and false positive rate of seeding an alignment compared to using a single representative base call sequence for each read.
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