Finger Search in Grammar-Compressed Strings
Open Access
- 11 January 2018
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 62 (8) , 1715-1735
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Det Frie Forskningsråd (4005-00267)
- Højteknologifonden
- Det Frie Forskningsråd (1323-00178)
This publication has 43 references indexed in Scilit:
- Fingerprints in compressed stringsJournal of Computer and System Sciences, 2017
- Bookmarks in Grammar-Compressed Strings2016
- Access, Rank, and Select in Grammar-compressed Strings2015
- Compressed Subsequence Matching and Packed Tree ColoringAlgorithmica, 2015
- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding2015
- LZ77-Based Self-indexing with Faster Pattern Matching2014
- A Faster Grammar-Based Self-index2012
- Perfect hashing for strings: Formalization and algorithms1996
- A constant update time finger search treeInformation Processing Letters, 1994
- An almost optimal algorithm for unbounded searchingInformation Processing Letters, 1976