A linear partitioning algorithm for Hybrid Lyndons using V-order

In this paper we extend previous work on unique maximal factorization families (UMFFs) and a total (but non-lexicographic) ordering of strings called V-order. We present new combinatorial results for V-order, in particular concatenation under V-order. We propose linear-time RAM algorithms for string comparison in V-order and for Lyndon-like factorization of a string into V-words. This asymptotic efficiency thus matches that of the corresponding …