Suffix arrays: what are they good for?
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 practic...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
Australian Computer Society, Inc.
2006
|
| Online Access: | http://portal.acm.org/citation.cfm?id=1151736.1151738 http://hdl.handle.net/20.500.11937/5640 |
| _version_ | 1848744853192572928 |
|---|---|
| author | Puglisi, Simon Smyth, Bill Turpin, A. |
| author2 | Gillian Dobbie |
| author_facet | Gillian Dobbie Puglisi, Simon Smyth, Bill Turpin, A. |
| author_sort | Puglisi, Simon |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T06:08:04Z |
| format | Conference Paper |
| id | curtin-20.500.11937-5640 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T06:08:04Z |
| publishDate | 2006 |
| publisher | Australian Computer Society, Inc. |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-56402022-10-20T06:58:53Z Suffix arrays: what are they good for? Puglisi, Simon Smyth, Bill Turpin, A. Gillian Dobbie James Bailey 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 Conference Paper http://hdl.handle.net/20.500.11937/5640 http://portal.acm.org/citation.cfm?id=1151736.1151738 Australian Computer Society, Inc. fulltext |
| spellingShingle | Puglisi, Simon Smyth, Bill Turpin, A. Suffix arrays: what are they good for? |
| title | Suffix arrays: what are they good for? |
| title_full | Suffix arrays: what are they good for? |
| title_fullStr | Suffix arrays: what are they good for? |
| title_full_unstemmed | Suffix arrays: what are they good for? |
| title_short | Suffix arrays: what are they good for? |
| title_sort | suffix arrays: what are they good for? |
| url | http://portal.acm.org/citation.cfm?id=1151736.1151738 http://hdl.handle.net/20.500.11937/5640 |