@inproceedings{fc8885ca91e74c44b0b307e1f97785e4,
title = "String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time",
abstract = "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 describe linear-time algorithms for string comparison and Lyndon factorization based on V-order. We propose extensions of these algorithms to other forms of order",
author = "Daykin, {David E.} and Daykin, {Jacqueline W.} and Smyth, {W. F.}",
year = "2011",
doi = "10.1007/978-3-642-21458-5_8",
language = "English",
isbn = "978-3-642-21457-8",
series = "Combinatorial Pattern Matching",
publisher = "Springer Nature",
pages = "65--76",
editor = "Raffaele Giancarlo and Giovanni Manzini",
booktitle = "Combinatorial Pattern Matching",
address = "Switzerland",
}