Pages that link to "Item:Q390898"
From MaRDI portal
The following pages link to Lightweight algorithms for constructing and inverting the BWT of string collections (Q390898):
Displaying 29 items.
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Inducing enhanced suffix arrays for string collections (Q526901) (← links)
- A four-stage algorithm for updating a Burrows-Wheeler transform (Q732025) (← links)
- Divide and conquer computation of the multi-string BWT and LCP array (Q1670729) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- Computing the multi-string BWT and LCP array in external memory (Q1998862) (← links)
- Wheeler languages (Q2051845) (← links)
- Computing the original eBWT faster, simpler, and with less memory (Q2146134) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
- An external-memory algorithm for string graph construction (Q2362353) (← links)
- Algorithms to compute the Burrows-Wheeler similarity distribution (Q2420649) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- Lightweight LCP construction for very large collections of strings (Q2628803) (← links)
- Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
- Comparing DNA Sequence Collections by Direct Comparison of Compressed Text Indexes (Q4916910) (← links)
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform (Q5088894) (← links)
- (Q5088915) (← links)
- Detecting Mutations by eBWT (Q5090327) (← links)
- Haplotype-aware graph indexes (Q5090328) (← links)
- (Q5090335) (← links)
- SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET (Q5247182) (← links)
- The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words (Q5326383) (← links)
- Bidirectional Variable-Order de Bruijn Graphs (Q5384620) (← links)
- A new class of string transformations for compressed text indexing (Q6053405) (← links)
- Efficient construction of the BWT for repetitive text using string compression (Q6077847) (← links)
- Constructing and indexing the bijective and extended Burrows-Wheeler transform (Q6204171) (← links)
- The ring: worst-case optimal joins in graph databases using (almost) no extra space (Q6536406) (← links)
