Pages that link to "Item:Q5406217"
From MaRDI portal
The following pages link to Engineering a compressed suffix tree implementation (Q5406217):
Displaying 13 items.
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Constructing large suffix trees on a computational grid (Q860000) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Truncated suffix trees and their application to data compression. (Q1401392) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- A comparison of imperative and purely functional suffix tree constructions (Q1916355) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Counter based suffix tree for DNA pattern repeats (Q2304543) (← links)
- Distributed suffix trees (Q2569396) (← links)
- Lempel Ziv Computation in Small Space (LZ-CISS) (Q2942255) (← links)
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943) (← links)