Optimal Construction of Compressed Indexes for Highly Repetitive Texts

Dominik Kempa. Optimal Construction of Compressed Indexes for Highly Repetitive Texts. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 1344-1357, SIAM, 2019. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.