AllSome Sequence Bloom Trees - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

AllSome Sequence Bloom Trees

(1) , (1) , (2) , (1)
1
2

Abstract

The ubiquity of next generation sequencing has transformed the size and nature of many databases, pushing the boundaries of current indexing and searching methods. One particular example is a database of 2,652 human RNA-seq experiments uploaded to the Sequence Read Archive. Recently, Solomon and Kingsford proposed the Sequence Bloom Tree data structure and demonstrated how it can be used to accurately identify SRA samples that have a transcript of interest potentially expressed. In this paper, we propose an improvement called the AllSome Sequence Bloom Tree. Results show that our new data structure significantly improves performance, reducing the tree construction time by 52.7% and query time by 39–85%, with a price of up to 3x memory consumption during queries. Notably, it can query a batch of 198,074 queries in under 8 h (compared to around two days previously) and a whole set of k-mers from a sequencing experiment (about 27 mil k-mers) in under 11 min.
Fichier principal
Vignette du fichier
allsome.pdf (3.61 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01575350 , version 1 (18-08-2017)

Identifiers

Cite

Chen Sun, Robert S. Harris, Rayan Chikhi, Paul Medvedev. AllSome Sequence Bloom Trees. RECOMB 2017 - 21st Annual International Conference on Research in Computational Molecular Biology, May 2017, Hong Kong, China. ⟨10.1007/978-3-319-56970-3_17⟩. ⟨hal-01575350⟩
508 View
203 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More