Article

Scalable sequence database search using Partitioned Aggregated Bloom Comb-Trees

2022-02-14

Abstract excerpt

The Sequence Read Archive public database has reached 45 Peta-bytes of raw sequences and doubles its nucleotide content every two years. Although BLAST-like methods can routinely search for a sequence in a small collection of genomes, making searchable immense public resources accessible is beyond the reach of alignment-based strategies. In recent years, abundant literature tackled the task of finding a sequence i...

Topics

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

Identifiers and source

Literature Corpus work: cc3cadab-6eda-5e05-b129-d089e2795dfc
DOI: 10.1101/2022.02.11.480089

Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest

Scalable sequence database search using Partitioned Aggregated Bloom Comb-TreesDOI 10.1101/2022.02.11.480089Read

AllSome Sequence Bloom TreesSemantic proximity Read

Efficient exact associative structure for sequencing dataSemantic proximity Read

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

Optimized <i>k</i> -mer search across millions of bacterial genomes on laptopsSemantic proximity Read

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

<i>k</i> ache-hash: A dynamic, concurrent, and cache-efficient hash table for streaming <i>k</i> -mer operationsSemantic proximity Read

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

RLBWT-Based LCP Computation in Compressed Space for Terabase-Scale Pangenome AnalysisSemantic proximity Read

Sequencing thousands of single-cell genomes with combinatorial indexingSemantic proximity Read

Sapling: Accelerating Suffix Array Queries with Learned Data ModelsSemantic proximity Read

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

Lossless Indexing with Counting de Bruijn GraphsSemantic proximity Read