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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Daykin, D. E., Daykin, J. W., & Smyth, W. F. (2011). String comparison and lyndon-like factorization using V-order in linear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6661 LNCS, pp. 65–76). https://doi.org/10.1007/978-3-642-21458-5_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
