Article

Efficient exact associative structure for sequencing data

2019-02-11

Abstract excerpt

<h4>Motivation</h4> A plethora of methods and applications share the fundamental need to associate information to words for high throughput sequence analysis. Doing so for billions of k -mers is commonly a scalability problem, as exact associative indexes can be memory expensive. Recent works take advantage of overlaps between k -mers to leverage this challenge. Yet existing data structures are either unable to...

Topics

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

Identifiers and source

Literature Corpus work: 304aa154-42bf-598d-b617-57a1efc23974
DOI: 10.1101/546309

Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest

Efficient exact associative structure for sequencing dataDOI 10.1101/546309Read

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

DRUMS: Disk Repository with Update Management and Select option for high throughput sequencing data.Semantic proximity Read

aaKomp: Alignment-free amino acid <i>k</i> -mer matching for genome completeness assessment at scaleSemantic proximity Read

Hierarchical genomic feature annotation with variable-length queriesSemantic proximity Read

KmerKeys: a web resource for searching indexed genome assemblies and variantsSemantic proximity Read

AllSome Sequence Bloom TreesSemantic proximity Read

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

DiviSSR: Simple arithmetic for efficient identification of tandem repeatsSemantic proximity Read

Lossless Indexing with Counting de Bruijn GraphsSemantic proximity Read

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

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

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