Smaller compressed suffix arrays

Ekaterina Benza; Shmuel T. Klein; Dana Shapira

doi:10.1093/comjnl/bxaa016

Smaller compressed suffix arrays

Ekaterina Benza, Shmuel T. Klein, Dana Shapira

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English
Article number	5
Pages (from-to)	721-730
Number of pages	10
Journal	Computer Journal
Volume	64
Issue number	5
DOIs	https://doi.org/10.1093/comjnl/bxaa016
State	Published - 1 May 2021

Access to Document

10.1093/comjnl/bxaa016

https://dblp.org/db/journals/cj/cj64.html#BenzaKS21

Cite this

@article{348f5abf12314c68a8e4a936c3951ef2,

title = "Smaller compressed suffix arrays",

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.",

author = "Ekaterina Benza and Klein, {Shmuel T.} and Dana Shapira",

year = "2021",

month = may,

day = "1",

doi = "10.1093/comjnl/bxaa016",

language = "אנגלית",

volume = "64",

pages = "721--730",

journal = "Computer Journal",

issn = "0010-4620",

publisher = "Oxford University Press",

number = "5",

}

TY - JOUR

T1 - Smaller compressed suffix arrays

AU - Benza, Ekaterina

AU - Klein, Shmuel T.

AU - Shapira, Dana

PY - 2021/5/1

Y1 - 2021/5/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85107980143&partnerID=8YFLogxK

U2 - 10.1093/comjnl/bxaa016

DO - 10.1093/comjnl/bxaa016

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85107980143

SN - 0010-4620

VL - 64

SP - 721

EP - 730

JO - Computer Journal

JF - Computer Journal

IS - 5

M1 - 5

ER -

Smaller compressed suffix arrays

Abstract

Access to Document

Other files and links

Fingerprint

Cite this