Lyndon factorization of grammar compressed texts revisited
DOI10.4230/LIPICS.CPM.2018.24zbMATH Open1497.68601OpenAlexW2803338549MaRDI QIDQ5140789FDOQ5140789
Authors: Isamu Furuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomohiro I 
Publication date: 16 December 2020
Full work available at URL: http://doi.org/10.4230/LIPIcs.CPM.2018.24
Recommendations
- Efficient Lyndon factorization of grammar compressed text
- Efficient LZ78 factorization of grammar compressed text
- scientific article; zbMATH DE number 2087040
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- LZD factorization: simple and practical online grammar compression with variable-to-fixed encoding
- A fully linear-time approximation algorithm for grammar-based compression
- A fully linear-time approximation algorithm for grammar-based compression
- Approximation of Grammar-Based Compression via Recompression
- Approximation of grammar-based compression via recompression
- Automata, Languages and Programming
Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)
Cites Work
- Efficient Lyndon factorization of grammar compressed text
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Factorizing words over an ordered alphabet
- Lyndon + Christoffel = digitally convex
- Longest common extensions with recompression
- The Smallest Grammar Problem
- Parallel RAM algorithms for factorizing words
- Free differential calculus. IV: The quotient groups of the lower central series
- Fast parallel Lyndon factorization with applications
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
- Title not available (Why is that?)
- Minimal suffix and rotation of a substring in optimal time
Cited In (6)
- Efficient Lyndon factorization of grammar compressed text
- Inferring strings from Lyndon factorization
- Suffix array and Lyndon factorization of a text
- Efficient LZ78 factorization of grammar compressed text
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
- Computing minimal and maximal suffixes of a substring revisited
Uses Software
This page was built for publication: Lyndon factorization of grammar compressed texts revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140789)
