A faster implementation of online RLBWT and its application to LZ77 parsing
Authors:
- Tatsuya OhnoTOTatsuya Ohno
- Kensuke SakaiKSKensuke Sakai
- Yoshimasa TakabatakeYTYoshimasa Takabatake
- Tomohiro ITITomohiro I
- Hiroshi SakamotoHSHiroshi Sakamoto
Open Access
- 1 September 2018
- journal article
- research article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 52-53, 18-28
Abstract
No abstract availableKeywords
Funding Information
- JST CREST (JPMJCR1402)
- KAKENHI (17H01791, 16K16009, 17H06954)
This publication has 7 references indexed in Scilit:
- Wheeler graphs: A framework for BWT-based data structuresTheoretical Computer Science, 2017
- LZ77 Computation Based on the Run-Length Encoded BWTAlgorithmica, 2017
- Fully Functional Static and Dynamic Succinct TreesACM Transactions on Algorithms, 2014
- Optimal Dynamic Sequence RepresentationsSIAM Journal on Computing, 2014
- Succinct data structures for Searchable Partial Sums with optimal worst-case performanceTheoretical Computer Science, 2011
- Storage and Retrieval of Highly Repetitive Sequence CollectionsJournal of Computational Biology, 2010
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977