arXiv (All)
open access
Engineering Lightweight Burrows-Wheeler Transform Construction on the GPU via Prefix-Free Parsing
The Burrows-Wheeler transform (BWT) is the core of many compressed full-text indexes and most read aligners. The fastest BWT constructions on GPUs need about $20$ bytes of device memory per character, which severely limits the texts that can be processed there. For example, on our GPU with 24 GB dev
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Comparative Studies of Differential Gene Calling Methods for RNA-seq Data#982860
- Bind-n-Seq: high-throughput analysis of in vitro protein–DNA interactions using massively parallel sequencing#1433911
- Dacom 450/500 facsimile data transcoding#262408
- Pareto optimization of masked superstrings improves compression of pan-genome k-mer sets#1242635
- Pruning the Search, Not the Signal: Adaptive-Banding Needleman-Wunsch Sequence Alignment via Protein Language Model Confidence#1436310
Record · ID 1456712
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive