Compressed suffix trees with full functionality
Compressed suffix trees with full functionality
复制标题
DOI：
10.1007/s00224-006-1198-x
复制
发表时间：
2007-11-01
影响因子：
0.5
通讯作者：
Sadakane, Kunihiko
中科院分区：
文献类型：
--
作者：
Sadakane, Kunihiko
我们介绍了新的数据结构，用于压缩后缀树，其大小在文本大小中是线性的。大小以钻头进行测量；因此，它们仅占用o（n log垂直杆垂直条），用于字母内的长度n的文本A。这是对当前的后缀树的显着改进，需要O（n log n），位。尽管已经压缩了后缀树的某些组件，但没有针对具有完整功能的后缀树的线性大小数据结构，例如计算后缀链接，字符串深度和最低的共同祖先。本文提出的数据结构是第一个是第一个是具有线性大小，并有效地支持所有操作。在后缀树上运行的任何算法也可以在我们的压缩后缀树上执行，而略微放缓了一定的polygog（n）。
We introduce new data structures for, compressed suffix trees whose size are linear in the text size. The size is measured in bits; thus they occupy only O(n log vertical bar A vertical bar) bits for a text of length n on an alphabet A. This is a remarkable improvement on current suffix trees which require O(n log n), bits. Though some components of suffix trees have been compressed, there is no linear-size data structure for suffix trees with full functionality such as computing suffix links, string-depths and lowest common ancestors.The data structure proposed in this paper is the first one that has linear size and supports all operations efficiently. Any algorithm running on a suffix tree can also be executed on our compressed suffix trees with a slight slowdown of a factor of polylog(n).