Show simple item record

dc.coverage.spatialBERLIN
dc.creatorMakinen, Veli
dc.creatorNavarro Badino, Gonzalo
dc.date.accessioned2016-12-27T21:50:13Z
dc.date.available2016-12-27T21:50:13Z
dc.date.issued2004
dc.identifier.isbn978-3-540-27801-6
dc.identifier.isbn978-3-540-22341-2
dc.identifier.urihttp://hdl.handle.net/10533/165486
dc.description.abstractThe compact suffix array (CSA) is a space-efficient full-text index, which is fast in practice to search for patterns in a static text. Compared to other xompressed suffix arrays (Grossi an dVitter, Sadakane, Ferragina and Manzini), the CSA is significantly larger (2,7 times the text size, as opposed to 0.6-0.8 of compressed suffix arrays). The space of the CASA includes that of the text, which the CSA needs separately available. Compressed suffix arrays, on the other hand, include the text, that is, they are self-indexes. Although compressed suffix arrays are very fast to determine the number of occurrences of a pattern, they are in practice very slow to report even a few occurrence positions or text contexts. In this aspect the CSA is much faster. In this paper we contribute a self-index that improves the space usage of the CSA in exchange for search speed. We show, that the occ occurrence positions of a pattern of length m in a text of length n can be reported in O((m + occ) log n) time using the CCSA, whose representation needs O(n(1 + Hk log n)) bits for any k, Hk being the k-th order empirical entropy of the text. In practice the CCSA takes 1.6 times the text size (and includes the text). This is still larger than current compressed suffix arrays, and similar in size to the LZ-index of Navarro. Search times are by far better than for self-indexes that take less space than the text, and competitive against the LZ-index and versions of compressed suffix arrays tailored to take 1.6 times the text size.
dc.language.isoeng
dc.relationinstname: Conicyt
dc.relationreponame: Repositorio Digital RI2.0
dc.relationinstname: Conicyt
dc.relationreponame: Repositorio Digital RI 2.0
dc.titleCOMPRESSED COMPACT SUFFIX ARRAYS
dc.typeCapitulo de libro
dc.countryALEMANIA
dc.bibliographicCitation.stpage420
dc.bibliographicCitation.endpage433
dc.identifier.folio1020831
dc.description.conicytprogramFONDECYT
dc.relation.projectidinfo:eu-repo/grantAgreement/Fondecyt/1020831
dc.relation.setinfo:eu-repo/semantics/dataset/hdl.handle.net/10533/93479
dc.rights.driverinfo:eu-repo/semantics/openAccess
dc.type.driverinfo:eu-repo/semantics/bookPart
dc.description.shortconicytprogramFONDECYT
dc.title.libroCOMBINATORIAL PATTERN MATCHING: 15TH ANNUAL SYMPOSIUM, CPM 2004
dc.creator.libroSahinalp, Suleyman C.,
dc.creator.libroMuthukrishnan, S.
dc.creator.libroDogrusoz, Ugur
dc.description.libropages492
dc.publisher.editorialSPRINGER


Files in this item

FilesSizeFormatView

There are no files associated with this item

This item appears in the following Collection(s)

Show simple item record