Compressed property suffix trees
From MaRDI portal
Publication:386003
DOI10.1016/j.ic.2013.09.001zbMath1435.68399OpenAlexW2055638053MaRDI QIDQ386003
Sharma V. Thankachan, Wing-Kai Hon, Rahul Shah, Manish Patil
Publication date: 13 December 2013
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2013.09.001
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)
Related Items (3)
The property suffix tree with dynamic properties ⋮ Property Suffix Array with Applications in Indexing Weighted Sequences ⋮ Orthogonal Range Searching for Text Indexing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Property matching and weighted matching
- Errata for ``Faster index for property matching
- Faster index for property matching
- Compressed suffix trees with full functionality
- Compressed representations of sequences and full-text indexes
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Alphabet-Independent Compressed Text Indexing
- Suffix Arrays: A New Method for On-Line String Searches
- Linear work suffix array construction
- Indexing compressed text
- An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
- The Property Suffix Tree with Dynamic Properties
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Dynamic entropy-compressed sequences and full-text indexes
- A Framework for Dynamizing Succinct Data Structures
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
This page was built for publication: Compressed property suffix trees
