Compressing dictionary matching index via sparsification technique
From MaRDI portal
Publication:2354027
DOI10.1007/s00453-013-9863-3zbMath1322.68071OpenAlexW1983490985WikidataQ58062862 ScholiaQ58062862MaRDI QIDQ2354027
Rahul Shah, Sharma V. Thankachan, Tsung-Han Ku, Wing-Kai Hon, Jeffrey Scott Vitter, Siu-Lung Tam, Tak-Wah Lam
Publication date: 10 July 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9863-3
Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (3)
Dictionary Matching with Uneven Gaps ⋮ Dictionary matching with a bounded gap in pattern or in text ⋮ A grouping approach for succinct dynamic dictionary matching
Cites Work
- Unnamed Item
- A simple storage scheme for strings achieving entropy bounds
- Dynamic dictionary matching
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Improved dynamic dictionary matching
- Faster compressed dictionary matching
- Compressed suffix trees with full functionality
- Deterministic Dictionaries
- Multi-method dispatching
- Compressed indexes for dynamic text collections
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Suffix Arrays: A New Method for On-Line String Searches
- The string B-tree
- Indexing compressed text
- Succinct Dictionary Matching with No Slowdown
- Dictionary matching and indexing with errors and don't cares
- Priority Search Trees
- Efficient data structures for range searching on a grid
- Efficient string matching
- A Space-Economical Suffix Tree Construction Algorithm
- Optimal External Memory Interval Management
- Text Indexing and Dictionary Matching with One Error
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Lowest common ancestors in trees and directed acyclic graphs
This page was built for publication: Compressing dictionary matching index via sparsification technique
