Pages that link to "Item:Q3455566"
From MaRDI portal
The following pages link to Compressing and indexing labeled trees, with applications (Q3455566):
Displayed 33 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Fast construction of wavelet trees (Q294942) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- Succinct representation of labeled trees (Q476876) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- FM-index of alignment with gaps (Q1698723) (← links)
- Succinct data structures for nearest colored node in a tree (Q1705642) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Computing the multi-string BWT and LCP array in external memory (Q1998862) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
- Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
- Constructing LZ78 tries and position heaps in linear time for large alphabets (Q2346553) (← links)
- Tree compression with top trees (Q2347804) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Fast Compressed Tries through Path Decompositions (Q2828185) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- (Q5002720) (← links)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
- (Q5088915) (← links)
- Slowing Down Top Trees for Better Worst-Case Compression (Q5140780) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
- Compressed string dictionaries via data-aware subtrie compaction (Q6111589) (← links)
- On the hardness of computing the edit distance of shallow trees (Q6111592) (← links)