@inproceedings{0487e9cf30af4902ba8a5e7c5a083844,
title = "V-Words, Lyndon Words and Substring circ-UMFFs",
abstract = "We say that a family W of strings over Σ+ forms a Unique Maximal Factorization Family if and only if for every w∈ W, w has a unique maximal factorization. Then an UMFF W is a circ-UMFF whenever it contains exactly one rotation of every primitive string x∈ Σ+. V-order is a non-lexicographical total ordering on strings that determines a circ-UMFF. In this paper we propose a generalization of circ-UMFF called the substring circ-UMFF and extend the combinatorial research on V-order by investigating connections to Lyndon words. Then we extend concepts to considering any total order. Applications of this research arise in efficient text indexing, compression, and search tasks.",
keywords = "circ-UMFF, Combinatorics, Factorization, Lyndon word, Substring circ-UMFF, Total order, UMFF, V-order, V-word",
author = "Daykin, {Jacqueline W.} and Neerja Mhaskar and Smyth, {W. F.}",
note = "Publisher Copyright: {\textcopyright} 2024, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 16th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2023 ; Conference date: 15-12-2023 Through 17-12-2023",
year = "2024",
doi = "10.1007/978-3-031-49611-0_34",
language = "English",
isbn = "9783031496103",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "471--484",
editor = "Weili Wu and Jianxiong Guo",
booktitle = "Combinatorial Optimization and Applications - 16th International Conference, COCOA 2023, Proceedings",
address = "Switzerland",
}