V-order is a total order on strings that determines an instance of Unique Maximal Factorization Families (UMFFs), a generalization of Lyndon words. The fundamental V-comparison of strings can be done in linear time and constant space. V-order has been proposed as an alternative to lexicographic order (lexorder) in the computation of suffix arrays and in the suffix-sorting induced by the Burrows-Wheeler transform (BWT). In line with the recent interest in the connection between suffix arrays and Lyndon factorization, in this paper we obtain similar results for the V-order factorization. Indeed, we show that the results describing the connection between suffix arrays and Lyndon factorization are matched by analogous V-order processing. We also describe a methodology for efficiently computing the FM-Index in V-order, as well as V-order substring pattern matching using backward search.

V- order 是字符串上的总顺序，它确定唯一最大分解族 (UMFF) 的实例，这是 Lyndon 词的概括。字符串的基本V比较可以在线性时间和恒定空间中完成。在后缀数组的计算和由 Burrows-Wheeler 变换 (BWT) 引起的后缀排序中，V- order 已被提议作为字典顺序 (lexorder) 的替代方案。根据最近对后缀数组和 Lyndon 分解之间的联系的兴趣，在本文中，我们获得了类似的V阶分解结果。事实上，我们表明描述后缀数组和林登分解之间的联系的结果与类似的V匹配-订单处理。我们还描述了一种以V阶有效计算 FM-Index 的方法，以及使用向后搜索的V阶子串模式匹配。