Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
type: Item
instance of: scholarly article
title: Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
zbMATH Open document ID: 1356.68302
author: Yuto Nakashima
author: Shunsuke Inenaga
author: Hideo Bannai
author: Masayuki Takeda
author: Tomohiro I
published in: Theoretical Computer Science
publication date: 2017-02-06T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6680847
zbMATH Keywords: Lyndon factorization
zbMATH Keywords: straight line program
zbMATH Keywords: Lempel-Ziv 78 factorization
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.03.005
OpenAlex ID: W2293945882
cites work: Fast parallel Lyndon factorization with applications
cites work: Converting SLP to LZ78 in almost Linear Time
cites work: The level ancestor problem simplified
cites work: Lyndon + Christoffel = digitally convex
cites work: Free differential calculus. IV: The quotient groups of the lower central series
cites work: Parallel RAM algorithms for factorizing words
cites work: Factorizing words over an ordered alphabet
cites work: Tying up the loose ends in fully LZW-compressed pattern matching
cites work: Detecting regularities on grammar-compressed strings
cites work: Efficient Lyndon Factorization of Grammar Compressed Text
cites work: Compression of individual sequences via variable-rate coding
DOI: 10.1016/J.TCS.2016.03.005
description: scientific article; zbMATH DE number 6680847