Logo image
String comparison in V-Order: New lexicographic properties & On-line applications
Other   Open access

String comparison in V-Order: New lexicographic properties & On-line applications

A. Alatabbi, J.W. Daykin, M.S. Rahman and W.F. Smyth
Unpublished Publication
Cornell University Library
2015
pdf
string_comparison.pdfDownloadView
Pre-print Open Access
url
Free to Read *No subscription requiredView

Abstract

V-order is a global order on strings related to Unique Maximal Factorization Families (UMFFs), which are themselves generalizations of Lyndon words. V-order has recently been proposed as an alternative to lexicographical order in the computation of suffix arrays and in the suffix-sorting induced by the Burrows-Wheeler transform. Efficient V-ordering of strings thus becomes a matter of considerable interest. In this paper we present new and surprising results on V-order in strings, then go on to explore the algorithmic consequences.

Details

Metrics

54 File views/ downloads
40 Record Views
Logo image