Faster entropy-bounded compressed suffix trees
Authors:
- Johannes FischerJFJohannes Fischer
- Veli MäkinenVMVeli Mäkinen
- Gonzalo NavarroGNGonzalo Navarro
- 1 November 2009
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 410 (51) , 5354-5364
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries2008
- Compressed representations of sequences and full-text indexesACM Transactions on Algorithms, 2007
- Compressed indexes for dynamic text collectionsACM Transactions on Algorithms, 2007
- A simple optimal representation for balanced parenthesesTheoretical Computer Science, 2006
- Lowest common ancestors in trees and directed acyclic graphsJournal of Algorithms, 2005
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String MatchingSIAM Journal on Computing, 2005
- Replacing suffix trees with enhanced suffix arraysJournal of Discrete Algorithms, 2004
- Nearest common ancestors2002
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller ValuesJournal of Algorithms, 1993
- Recursive Star-Tree Parallel Data StructureSIAM Journal on Computing, 1993