A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
Self-indexes are able to represent a text within asymptotically the information-theoretic lower bound under the kth order entropy model, and offer access to any text substring and indexed pattern searches. Their time complexities are not optimal, however; in particular they are always multiplied by a factor that depends on the alphabet size. In this paper we achieve, for the first time, full alphabet-independence in the time complexities of self-indexes, while retaining space optimality. We obtain also some relevant byproducts.doi:10.1145/2635816 fatcat:minh3t7w7rfuhce7ibeni65xtu