Succinct Gapped Suffix Arrays
Gapped suffix arrays (also known as bi-factor arrays) were recently presented for approximate searching under the Hamming distance. These structures can be used to find occurrences of a pattern P, where the characters inside a gap do not have to match. This paper describes a succinct representation of gapped suffix arrays.
Unable to display preview. Download preview PDF.
- 1.Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical report, Digital SRC Research Report (1994)Google Scholar
- 6.Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841–850 (2003)Google Scholar
- 7.Jacobson, G.: Space-efficient Static Trees and Graphs. In: Foundations of Computer Science, pp. 549–554 (1989)Google Scholar