Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order

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