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

Lyndon分解的替代算法

Alternative Algorithms for Lyndon Factorization

Sukhpal Singh Ghuman, Emanuele Giaquinta, Jorma Tarhio

摘要:

我们提出了两种变化的杜瓦尔算法计算林登分解的一个字。第一种算法是针对小字母表的情况设计的,并且对于包含字母表中最小字符的串,能够跳过字符串的显著部分。实验结果表明,该算法比Duval的原算法速度快十倍以上,在长DNA串的情况下也有明显的提高。第二个算法,给定一个长度为$ρ$的游程编码字符串$R$,计算$R$在$O(ρ)$时间和恒定空间中的林登因子分解。

英文摘要:

We present two variations of Duval's algorithm for computing the Lyndon factorization of a word. The first algorithm is designed for the case of small alphabets and is able to skip a significant portion of the characters of the string, for strings containing runs of the smallest character in the alphabet. Experimental results show that it is faster than Duval's original algorithm, more than ten times in the case of long DNA strings. The second algorithm computes, given a run-length encoded string $R$ of length $ρ$, the Lyndon factorization of $R$ in $O(ρ)$ time and constant space.

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

↑