A faster implementation of online RLBWT and its application to LZ77 parsing
type: Item
instance of: scholarly article
title: A faster implementation of online RLBWT and its application to LZ77 parsing
zbMATH Open document ID: 1410.68417
author: Tatsuya Ohno
author: Kensuke Sakai
author: Yoshimasa Takabatake
author: Tomohiro I
author: Hiroshi Sakamoto
published in: Journal of Discrete Algorithms
publication date: 2019-01-18T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 7003346
zbMATH Keywords: run-length Burrows-Wheeler transformation
zbMATH Keywords: LZ77 factorization
zbMATH Keywords: recompression
describes a project that uses: DYNAMIC
describes a project that uses: get-git-revisions
describes a project that uses: r-index
MaRDI profile type: Publication
full work available at URL: j.jda.2018.11.002
OpenAlex ID: W2901851084
cites work: Online LZ77 Parsing and Matching Statistics with RLBWTs
cites work: Composite Repetition-Aware Data Structures
cites work: Q4411355
cites work: Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation
cites work: Wheeler graphs: a framework for BWT-based data structures
cites work: Q4607985
cites work: Succinct data structures for searchable partial sums with optimal worst-case performance
cites work: Compressed Data Structures for Dynamic Sequences
cites work: Optimal Dynamic Sequence Representations
cites work: Fully functional static and dynamic succinct trees
cites work: A faster implementation of online run-length Burrows-Wheeler transform
cites work: LZ77 computation based on the run-length encoded BWT
cites work: Q4580155
cites work: Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
cites work: A universal algorithm for sequential data compression
Wikidata QID: Q128991069
DOI: 10.1016/J.JDA.2018.11.002
description: scientific article; zbMATH DE number 7003346