Article

Large-Scale Search of Transcriptomic Read Sets with Sequence Bloom Trees

2015-03-26

Abstract excerpt

Enormous databases of short-read RNA-seq sequencing experiments such as the NIH Sequence Read Archive (SRA) are now available. However, these collections remain difficult to use due to the inability to search for a particular expressed sequence. A natural question is which of these experiments contain sequences that indicate the expression of a particular sequence such as a gene isoform, lncRNA, or uORF. However,...

Topics

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

Identifiers and source

Literature Corpus work: 14d41e7b-c93f-50a0-bae5-ba9193e5c4db
DOI: 10.1101/017087

Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 8 closest

Large-Scale Search of Transcriptomic Read Sets with Sequence Bloom TreesDOI 10.1101/017087Read

AllSome 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

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

LISA: A Case For Learned Index based Acceleration of Biological Sequence AnalysisSemantic proximity Read

SpiderSeqR: an R package for crawling the web of high-throughput multi-omic data repositories for data-sets and annotationSemantic proximity Read

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

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