Faster entropy-bounded compressed suffix trees

High-order entropy-compressed text indexes

Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter · KU ScholarWorks (The University of Kansas) · 2003 · 672 citations · Full text

Computing, Computer Science, Algorithms +14

Replacing suffix trees with enhanced suffix arrays

Mohamed Abouelhoda, Stefan Kurtz, Enno Ohlebusch · Journal of Discrete Algorithms · 2004 · 667 citations

Computing, Computer Science, Computational Linguistics +8

Space-efficient static trees and graphs

G. Jacobson · 1989 · 649 citations

Computing, Computer Science, Algorithms +12

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching Read More: http://epubs.siam.org/doi/abs/10.1137/S0097539702402354

Roberto Grossi, Jeffrey Scott Vitter · KU ScholarWorks (The University of Kansas) · 2005 · 438 citations · Full text

Computing, Computer Science, Algorithms +13

Succinct indexable dictionaries with applications to encoding k-ary trees and multisets

Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti · 2002 · 401 citations

Computing, Computer Science, Mathematics +10