The following pages link to Wavelet trees for all (Q2442812):
Displaying 23 items.
- Compressed matching for feature vectors (Q294934) (← links)
- Fast construction of wavelet trees (Q294942) (← links)
- Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences (Q315651) (← links)
- Practical space-efficient index for structural pattern matching (Q2169971) (← links)
- Using compressed suffix-arrays for a compact representation of temporal-graphs (Q2200556) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Simpler FM-index for parameterized string matching (Q2224844) (← links)
- Space-efficient fully dynamic DFS in undirected graphs (Q2312405) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Parallel lightweight wavelet tree, suffix array and FM-index construction (Q2397146) (← links)
- Range selection and predecessor queries in data aware space and time (Q2397147) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs (Q2980917) (← links)
- (Q5009616) (← links)
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform (Q5088894) (← links)
- Practical Wavelet Tree Construction (Q5102058) (← links)
- Structural Pattern Matching - Succinctly. (Q5136254) (← links)
- A Self-index on Block Trees (Q5150940) (← links)
- Efficient and compact representations of some non-canonical prefix-free codes (Q5918490) (← links)
- Compact representations of spatial hierarchical structures with support for topological queries (Q6040665) (← links)
