Faster entropy-bounded compressed suffix trees
type: Item
instance of: scholarly article
title: Faster entropy-bounded compressed suffix trees
zbMATH Open document ID: 1187.68171
author: Johannes Fischer
author: Veli Mäkinen
author: Gonzalo Navarro
published in: Theoretical Computer Science
publication date: 2009-11-18T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 5634880
zbMATH Keywords: suffix trees
zbMATH Keywords: compressed data structures
zbMATH Keywords: range minimum queries
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.09.012
OpenAlex ID: W2154803978
Wikidata QID: Q56768697
cites work: Replacing suffix trees with enhanced suffix arrays
cites work: Nearest common ancestors: a survey and a new algorithm for a distributed environment
cites work: Q3690245
cites work: Lowest common ancestors in trees and directed acyclic graphs
cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
cites work: Recursive Star-Tree Parallel Data Structure
cites work: Compressed indexes for dynamic text collections
cites work: Suffix trays and suffix trists: structures for faster text indexing
cites work: Q4910720
cites work: Finding Patterns in Given Intervals
cites work: Engineering the LOUDS Succinct Tree Representation
cites work: Compressed text indexes
cites work: Compressed representations of sequences and full-text indexes
cites work: Q2934654
cites work: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
cites work: A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
cites work: Q3104275
cites work: An(other) Entropy-Bounded Compressed Suffix Tree
cites work: A simple optimal representation for balanced parentheses
cites work: Optimal Lower Bounds for Rank and Select Indexes
cites work: Compressed Text Indexes with Fast Locate
cites work: Q4471381
cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
cites work: Algorithms on Strings, Trees and Sequences
cites work: Q4428995
cites work: Q4449231
cites work: Q4547749
cites work: Linear-Time Construction of Suffix Arrays
cites work: Space Efficient Linear Time Construction of Suffix Arrays
cites work: Q5708460
cites work: Rank and select revisited and extended
cites work: An analysis of the Burrows—Wheeler transform
cites work: Space efficient suffix trees
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: Fully-Compressed Suffix Trees
cites work: New text indexing functionalities of the compressed suffix arrays
cites work: Compressed suffix trees with full functionality
cites work: Succinct data structures for flexible text retrieval systems
cites work: A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
DOI: 10.1016/J.TCS.2009.09.012
description: scientific article; zbMATH DE number 5634880