Smaller Compressed Suffix Arrays†-Reference-Cited by-同舟云学术

Smaller Compressed Suffix Arrays†

Published:2020-04-13 Issue:5 Volume:64 Page:721-730
ISSN:0010-4620
Container-title:The Computer Journal
language:en
Short-container-title:

Author:

Benza Ekaterina¹,Klein Shmuel T²,Shapira Dana¹

Affiliation:

1. Department of Computer Science, Ariel University, Ariel 40700, Israel

2. Department of Computer Science, Bar Ilan University, Ramat-Gan 52900, Israel

Abstract

Abstract An alternative to compressed suffix arrays is introduced, based on representing a sequence of integers using Fibonacci encodings, thereby reducing the space requirements of state-of-the-art implementations of the suffix array, while retaining the searching functionalities. Empirical tests support the theoretical space complexity improvements and show that there is no deterioration in the processing times.

Publisher

Oxford University Press (OUP)

Subject

General Computer Science

Link

http://academic.oup.com/comjnl/article-pdf/64/5/721/38334902/bxaa016.pdf

Reference30 articles.

1. Compact Data Structures

2. Space-Efficient Static Trees and Graphs;Jacobson,1989

3. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets;Raman;ACM Trans. Algorithms,2007

4. Fast, small, simple rank/select on bitmaps;Navarro,2012

5. High-Order Entropy-Compressed Text Indexes;Grossi,2003

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computation over APT Compressed Data;2024 Data Compression Conference (DCC);2024-03-19

2. New compression schemes for natural number sequences;Discrete Applied Mathematics;2023-03

3. Improved characters distance sampling for online and offline text searching;Theoretical Computer Science;2023-02

4. Enhanced Context Sensitive Flash Codes†;The Computer Journal;2021-01-09