Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees.

@inproceedings{caceres-2019-faster, author = {Manuel C\'{a}ceres and Gonzalo Navarro}, editor = {Nieves R. Brisaboa and Simon J. Puglisi}, title = {{Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees}}, booktitle = {{String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {11811}, pages = {434--451}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-32686-9_31}, doi = {https://doi.org/10.1007/978-3-030-32686-9_31} }