Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees

Manuel Cáceres, Gonzalo Navarro. Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees. In Nieves R. Brisaboa, Simon J. Puglisi, editors, String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings. Volume 11811 of Lecture Notes in Computer Science, pages 434-451, Springer, 2019. [doi]

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