Suffix arrays on words

DMCA

Suffix arrays on words (2007)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Paolo Ferragina , Johannes Fischer

Venue:	In Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching, volume 4580 of LNCS
Citations:	13 - 5 self

BibTeX

@INPROCEEDINGS{Ferragina07suffixarrays,
    author = {Paolo Ferragina and Johannes Fischer},
    title = {Suffix arrays on words},
    booktitle = {In Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching, volume 4580 of LNCS},
    year = {2007},
    pages = {328--339},
    publisher = {Springer}
}

OpenURL

Abstract

Abstract. Surprisingly enough, it is not yet known how to build directly a suffix array that indexes just the k positions at word-boundaries of a text T[1,n], taking O(n)timeandO(k) space in addition to T.Wepropose a class-note solution to this problem that achieves such optimal time and space bounds. Word-based versions of indexes achieving the same time/space bounds were already known for suffix trees [1,2] and (compact) DAWGs [3,4]. Our solution inherits the simplicity and efficiency of suffix arrays, with respect to such other word-indexes, and thus it foresees applications in word-based approaches to data compression [5] and computational linguistics [6]. To support this, we have run a large set of experiments showing that word-based suffix arrays may beconstructed twice as fast as their full-text counterparts, and with a working space as low as 20%. The space reduction of the final word-based suffix array impacts also in their query time (i.e. less random access binary-search steps!), being faster by a factor of up to 3. 1

Keyphrases

suffix array optimal time random access binary-search step suffix tree word-based approach word-based suffix array space reduction final word-based suffix array impact space bound large set word-based version computational linguistics full-text counterpart time space bound class-note solution query time

DMCA