Article

AllSome Sequence Bloom Trees

2016-12-02

Abstract excerpt

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

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work: 97ce6a36-687f-50a2-909a-8b91629ed9c0
DOI: 10.1101/090464

Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest

AllSome Sequence Bloom TreesDOI 10.1101/090464Read

Large-Scale Search of Transcriptomic Read Sets with Sequence Bloom TreesSemantic proximity Read

Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search IndexSemantic proximity Read

MetaProFi: A protein-based Bloom filter for storing and querying sequence data for accurate identification of functionally relevant genetic variantsSemantic proximity Read

Efficient exact associative structure for sequencing dataSemantic proximity Read

Scalable sequence database search using Partitioned Aggregated Bloom Comb-TreesSemantic proximity Read

SPLASH2 provides ultra-efficient, scalable, and unsupervised discovery on raw sequencing readsSemantic proximity Read

BURST enables mathematically optimal short-read alignment for big dataSemantic proximity Read

Genestrip: Space-efficient k-mer counting, read classification and filtering for selected groups of organismsSemantic proximity Read

A run-length-compressed skiplist data structure for dynamic GBWTs supports time and space efficient pangenome operations over syncmersSemantic proximity Read

ReadBouncer: Precise and Scalable Adaptive Sampling for Nanopore SequencingSemantic proximity Read

Fast and accurate read mapping with approximate seeds and multiple backtracking.Semantic proximity Read

Lossless Indexing with Counting de Bruijn GraphsSemantic proximity Read