We present two variations of Duval's algorithm for computing the Lyndon factorization of a word. The first algorithm is designed for the case of small alphabets and is able to skip a significant portion of the characters of the string, for strings containing runs of the smallest character in the alphabet. Experimental results show that it is faster than Duval's original algorithm, more than ten times in the case of long DNA strings. The second algorithm computes, given a run-length encoded string R of length ρ, the Lyndon factorization of R in O(ρ) time and constant space.
@article{arxiv.1405.4892,
title = {Alternative Algorithms for Lyndon Factorization},
author = {Sukhpal Singh Ghuman and Emanuele Giaquinta and Jorma Tarhio},
journal= {arXiv preprint arXiv:1405.4892},
year = {2014}
}