📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

Optimal Construction of Compressed Indexes for Highly Repetitive Texts

First Author: Kempa D

Attributed to: Sublinear Algorithms for Big Graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1137/1.9781611975482.82

Publication URI: http://dx.doi.org/10.1137/1.9781611975482.82

Type: Book Chapter

Book Title: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (2019)

Page Reference: 1344-1357