Affiliation:
1. University of Chile, Santiago, Chile
2. University of A Coruña, A Coruña, Spain
Abstract
Recent compressed suffix trees targeted to highly repetitive sequence collections reach excellent compression performance, but operation times are very high. We design a new suffix tree representation for this scenario that still achieves very low space usage, only slightly larger than the best previous one, but supports the operations orders of magnitude faster. Our suffix tree is still orders of magnitude slower than general-purpose compressed suffix trees, but these use several times more space when the collection is repetitive. Our main novelty is a practical grammar-compressed tree representation with full navigation functionality, which is useful in all applications where large trees with repetitive topology must be represented.
Funder
basal funds
Conicyt, Chile, by Fondecyt
CDTI EXP
Xunta de Galicia
MICINN
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science
Reference55 articles.
1. Practical Compressed Suffix Trees
2. A.
Abeliuk
and
G.
Navarro
.
2012
. Compressed suffix trees for repetitive texts. In Proceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE) Lecture Notes in Computer Science Vol.
7608
.
Springer 30--41. 10.1007/978-3-642-34109-0_5 A. Abeliuk and G. Navarro. 2012. Compressed suffix trees for repetitive texts. In Proceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE) Lecture Notes in Computer Science Vol. 7608. Springer 30--41. 10.1007/978-3-642-34109-0_5
3. Replacing suffix trees with enhanced suffix arrays
4. The Myriad Virtues of Subword Trees
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献