Home
Scholarly Works
Suffix arrays: What are they good for?
Conference

Suffix arrays: What are they good for?

Abstract

Recently the theoretical community has displayed a flurry of interest in suffix arrays, and compressed suffix arrays. New, asymptotically optimal algorithms for construction, search, and compression of suffix arrays have been proposed. In this talk we will present our investigations into the practicalities of these latest developments. In particular, we investigate whether suffix arrays can indeed replace inverted files, as suggested in recent literature on suffix arrays. © 2006, Australian Computer Society, Inc.

Authors

Puglisi SJ; Smyth WF; Turpin A

Volume

49

Pagination

pp. 17-18

Publication Date

December 1, 2006

Conference proceedings

Conferences in Research and Practice in Information Technology Series

ISSN

1445-1336

Contact the Experts team