@article{journals/algorithms/AbeliukCN13,
  added-at = {2018-08-14T00:00:00.000+0200},
  author = {Abeliuk, Andr{\'{e}}s and C{\'{a}}novas, Rodrigo and Navarro, Gonzalo},
  biburl = {https://www.bibsonomy.org/bibtex/20782f182ab3a13dc0f7827e29c2a7f85/dblp},
  ee = {https://doi.org/10.3390/a6020319},
  interhash = {b14f4b201fe0a9f2b8d13bd9f44ca914},
  intrahash = {0782f182ab3a13dc0f7827e29c2a7f85},
  journal = {Algorithms},
  keywords = {dblp},
  number = 2,
  pages = {319-351},
  timestamp = {2018-08-15T11:48:05.000+0200},
  title = {Practical Compressed Suffix Trees.},
  url = {http://dblp.uni-trier.de/db/journals/algorithms/algorithms6.html#AbeliukCN13},
  volume = 6,
  year = 2013,
  month = may,
  doi = {10.3390/a6020319}
}

{"_id":"DxMTsF7Ds8agg3cEy","bibbaseid":"abeliuk-cnovas-navarro-practicalcompressedsuffixtrees-2013","authorIDs":[],"author_short":["Abeliuk, A.","Cánovas, R.","Navarro, G."],"bibdata":{"bibtype":"article","type":"article","added-at":"2018-08-14T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Abeliuk"],"firstnames":["Andrés"],"suffixes":[]},{"propositions":[],"lastnames":["Cánovas"],"firstnames":["Rodrigo"],"suffixes":[]},{"propositions":[],"lastnames":["Navarro"],"firstnames":["Gonzalo"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/20782f182ab3a13dc0f7827e29c2a7f85/dblp","ee":"https://doi.org/10.3390/a6020319","interhash":"b14f4b201fe0a9f2b8d13bd9f44ca914","intrahash":"0782f182ab3a13dc0f7827e29c2a7f85","journal":"Algorithms","keywords":"dblp","number":"2","pages":"319-351","timestamp":"2018-08-15T11:48:05.000+0200","title":"Practical Compressed Suffix Trees.","url":"http://dblp.uni-trier.de/db/journals/algorithms/algorithms6.html#AbeliukCN13","volume":"6","year":"2013","month":"May","doi":"10.3390/a6020319","bibtex":"@article{journals/algorithms/AbeliukCN13,\n added-at = {2018-08-14T00:00:00.000+0200},\n author = {Abeliuk, Andr{\\'{e}}s and C{\\'{a}}novas, Rodrigo and Navarro, Gonzalo},\n biburl = {https://www.bibsonomy.org/bibtex/20782f182ab3a13dc0f7827e29c2a7f85/dblp},\n ee = {https://doi.org/10.3390/a6020319},\n interhash = {b14f4b201fe0a9f2b8d13bd9f44ca914},\n intrahash = {0782f182ab3a13dc0f7827e29c2a7f85},\n journal = {Algorithms},\n keywords = {dblp},\n number = 2,\n pages = {319-351},\n timestamp = {2018-08-15T11:48:05.000+0200},\n title = {Practical Compressed Suffix Trees.},\n url = {http://dblp.uni-trier.de/db/journals/algorithms/algorithms6.html#AbeliukCN13},\n volume = 6,\n year = 2013,\n month = may,\n doi = {10.3390/a6020319}\n}\n\n","author_short":["Abeliuk, A.","Cánovas, R.","Navarro, G."],"bibbaseid":"abeliuk-cnovas-navarro-practicalcompressedsuffixtrees-2013","role":"author","urls":{"Link":"https://doi.org/10.3390/a6020319","Paper":"http://dblp.uni-trier.de/db/journals/algorithms/algorithms6.html#AbeliukCN13"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bibbase.org/f/Bfi3yYPxhtyKncP4R/aabeliuk-isi-edu.bib","creationDate":"2020-02-03T23:48:58.445Z","downloads":0,"keywords":["dblp"],"search_terms":["practical","compressed","suffix","trees","abeliuk","cánovas","navarro"],"title":"Practical Compressed Suffix Trees.","year":2013,"dataSources":["qXmB8Cnrcvx883Fwx","efWerWm2QPDBjueMK","FSoKwX2WQoR9zQsgd"]}