Lyndon factorization algorithms for small alphabets and run-length encoded strings

DOI10.3390/A12060124zbMath1461.68266OpenAlexW2952991946MaRDI QIDQ2004905

Sukhpal Singh Ghuman, Emanuele Giaquinta, Jorma Tarhio

Publication date: 7 October 2020

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a12060124

zbMATH Keywords

run-length encodingstring algorithmsLyndon factorization

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
• Improving practical exact string matching
• Factorizing words over an ordered alphabet
• Fast parallel Lyndon factorization with applications
• Efficient Lyndon Factorization of Grammar Compressed Text
• Suffixes, Conjugates and Lyndon Words
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Free differential calculus. IV: The quotient groups of the lower central series

This page was built for publication: Lyndon factorization algorithms for small alphabets and run-length encoded strings