An(other) Entropy-Bounded Compressed Suffix Tree
From MaRDI portal
Publication:3506950
DOI10.1007/978-3-540-69068-9_16zbMath1143.68382OpenAlexW1599991662MaRDI QIDQ3506950
Johannes Fischer, Veli Mäkinen, Gonzalo Navarro
Publication date: 17 June 2008
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10138/1169
Related Items (7)
Extended suffix array construction using Lyndon factors ⋮ Approximate string matching with compressed indexes ⋮ Finding range minima in the middle: approximations and applications ⋮ Practical compressed suffix trees ⋮ On space efficient two dimensional range minimum data structures ⋮ Permuted Longest-Common-Prefix Array ⋮ Faster entropy-bounded compressed suffix trees
This page was built for publication: An(other) Entropy-Bounded Compressed Suffix Tree
