In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
d abstract Philip M. Long Apostol I. Natsevy Je rey Scott Vittery We consider re-representing the alphabet so that a representation of a character re ects its properties as a pr...
Philip M. Long, Apostol Natsev, Jeffrey Scott Vitt...
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Abstract-- The paper details a scheme for lossless compression of short data series larger than 50 Bytes. The method uses arithmetic coding and context modeling with a low-complexi...