Pages that link to "Item:Q472482"
From MaRDI portal
The following pages link to Efficient fully-compressed sequence representations (Q472482):
Displaying 13 items.
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- High-order entropy compressed bit vectors with rank/select (Q1736624) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Range majorities and minorities in arrays (Q2032347) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Compressed spaced suffix arrays (Q2363990) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction (Q5136278) (← links)
- Spaces, Trees, and Colors (Q5176183) (← links)
- (Q6065455) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)
