A faster implementation of online run-length Burrows-Wheeler transform
From MaRDI portal
Publication:1642727
DOI10.1007/978-3-319-78825-8_33zbMath1498.68381arXiv1704.05233OpenAlexW2607576200MaRDI QIDQ1642727
Hiroshi Sakamoto, Yoshimasa Takabatake, Tatsuya Ohno, Tomohiro I.
Publication date: 15 June 2018
Full work available at URL: https://arxiv.org/abs/1704.05233
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)
Related Items
Constructing and indexing the bijective and extended Burrows-Wheeler transform, Space-efficient algorithms for computing minimal/shortest unique substrings, A faster implementation of online RLBWT and its application to LZ77 parsing, Indexing the bijective BWT, A Space-Optimal Grammar Compression., Online LZ77 Parsing and Matching Statistics with RLBWTs
