Space Efficient Suffix Trees

DOI10.1006/jagm.2000.1151zbMath0977.68069OpenAlexW4361867045MaRDI QIDQ2729650

J. Ian Munro, S. Srinivasa Rao, Venkatesh Raman

Publication date: 2001

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1151

zbMATH Keywords

suffix tree

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (31)

Unnamed Item ⋮ Space-Efficient Frameworks for Top- k String Retrieval ⋮ A simple optimal representation for balanced parentheses ⋮ Simultaneous encodings for range and next/previous larger/smaller value queries ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ Indexing text using the Ziv--Lempel trie ⋮ On the succinct representation of equivalence classes ⋮ Parallel construction of succinct trees ⋮ Cross-document pattern matching ⋮ Ultra-succinct representation of ordered trees with applications ⋮ Space-efficient data structure for next/previous larger/smaller value queries ⋮ Unnamed Item ⋮ Succinct data structures for flexible text retrieval systems ⋮ Improved approximate string matching using compressed suffix data structures ⋮ Practical compressed suffix trees ⋮ Approximate query processing over static sets and sliding windows ⋮ Optimal lower bounds for rank and select indexes ⋮ On-line construction of compact suffix vectors and maximal repeats ⋮ Combined data structure for previous- and next-smaller-values ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ Succinct data structures for searchable partial sums with optimal worst-case performance ⋮ Unnamed Item ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays ⋮ Online Suffix Tree Construction for Streaming Sequences ⋮ Faster entropy-bounded compressed suffix trees ⋮ THE VIRTUAL SUFFIX TREE ⋮ Succinct Representations of Ordinal Trees ⋮ Constructing suffix arrays in linear time ⋮ Time-space trade-offs for compressed suffix arrays. ⋮ An efficient variable-to-fixed length encoding using multiplexed parse trees

This page was built for publication: Space Efficient Suffix Trees