arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.07038cs.DS
收藏

$V$中的字符串比较--顺序:新的词典学性质及在线应用

String Comparison in $V$-Order: New Lexicographic Properties & On-line Applications

Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman, W. F. Smyth

摘要:

$V$ -order是与唯一最大因子分解族(UMFF)相关的字符串的全局顺序,UMFF本身是林登词的推广。$V$ -序最近被提出作为字典序的替代,用于后缀数组的计算和Burrows-Wheeler变换引起的后缀排序。高效的$V$ -字符串排序因此成为一个相当感兴趣的问题。在本文中,我们提出了关于$V$ -字符串中的顺序的新的且令人惊讶的结果,然后继续探索算法的后果。

英文摘要:

$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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑