Compressed Suffix Trees for Repetitive Texts. Abeliuk, A. & Navarro, G. In Calderón-Benavides, L., González-Caro, C. N., Chávez, E., & Ziviani, N., editors, SPIRE, volume 7608, of Lecture Notes in Computer Science, pages 30-41, 2012. Springer.
Compressed Suffix Trees for Repetitive Texts. [link]Link  Compressed Suffix Trees for Repetitive Texts. [link]Paper  doi  bibtex   
@inproceedings{conf/spire/AbeliukN12,
  added-at = {2017-05-24T00:00:00.000+0200},
  author = {Abeliuk, Andr{\'{e}}s and Navarro, Gonzalo},
  biburl = {https://www.bibsonomy.org/bibtex/243772cae508a320d57841ee973faef0d/dblp},
  booktitle = {SPIRE},
  crossref = {conf/spire/2012},
  editor = {Calder{\'{o}}n{-}Benavides, Liliana and Gonz{\'{a}}lez{-}Caro, Cristina N. and Ch{\'{a}}vez, Edgar and Ziviani, Nivio},
  ee = {https://doi.org/10.1007/978-3-642-34109-0_5},
  interhash = {87b94e1e18c510c15e002daf7451f0d5},
  intrahash = {43772cae508a320d57841ee973faef0d},
  isbn = {978-3-642-34108-3},
  keywords = {dblp},
  pages = {30-41},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T20:17:56.000+0200},
  title = {Compressed Suffix Trees for Repetitive Texts.},
  url = {http://dblp.uni-trier.de/db/conf/spire/spire2012.html#AbeliukN12},
  volume = 7608,
  year = 2012,
  doi = {10.1007/978-3-642-34109-0\_5}
}

Downloads: 0