Space Efficient Suffix Trees
From MaRDI portal
Publication:2729650
DOI10.1006/jagm.2000.1151zbMath0977.68069MaRDI 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
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
68P05: Data structures
Related Items
Unnamed Item, Unnamed Item, Space-efficient data structure for next/previous larger/smaller value queries, Simultaneous encodings for range and next/previous larger/smaller value queries, Cross-document pattern matching, Ultra-succinct representation of ordered trees with applications, 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, A simple optimal representation for balanced parentheses, Indexing text using the Ziv--Lempel trie, Succinct data structures for flexible text retrieval systems, Improved approximate string matching using compressed suffix data structures, On-line construction of compact suffix vectors and maximal repeats, Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays, Faster entropy-bounded compressed suffix trees, Practical compressed suffix trees, Time-space trade-offs for compressed suffix arrays., Approximate query processing over static sets and sliding windows, An efficient variable-to-fixed length encoding using multiplexed parse trees, Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits, On the succinct representation of equivalence classes, Parallel construction of succinct trees, Optimal lower bounds for rank and select indexes, Constructing suffix arrays in linear time, Fully Functional Static and Dynamic Succinct Trees, Succinct Representations of Ordinal Trees, Unnamed Item, Space-Efficient Frameworks for Top- k String Retrieval, Online Suffix Tree Construction for Streaming Sequences, THE VIRTUAL SUFFIX TREE
