An(other) Entropy-Bounded Compressed Suffix Tree

Johannes Fischer, Veli Mäkinen, Gonzalo Navarro. An(other) Entropy-Bounded Compressed Suffix Tree. In Paolo Ferragina, Gad M. Landau, editors, Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings. Volume 5029 of Lecture Notes in Computer Science, pages 152-165, Springer, 2008. [doi]

@inproceedings{FischerMN08,
  title = {An(other) Entropy-Bounded Compressed Suffix Tree},
  author = {Johannes Fischer and Veli Mäkinen and Gonzalo Navarro},
  year = {2008},
  doi = {10.1007/978-3-540-69068-9_16},
  url = {http://dx.doi.org/10.1007/978-3-540-69068-9_16},
  researchr = {https://researchr.org/publication/FischerMN08},
  cites = {0},
  citedby = {0},
  pages = {152-165},
  booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings},
  editor = {Paolo Ferragina and Gad M. Landau},
  volume = {5029},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-69066-5},
}