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. 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
{"_id":"7k4tCtqfYsZRjHaC8","bibbaseid":"abeliuk-navarro-compressedsuffixtreesforrepetitivetexts-2012","authorIDs":[],"author_short":["Abeliuk, A.","Navarro, G."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2017-05-24T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Abeliuk"],"firstnames":["Andrés"],"suffixes":[]},{"propositions":[],"lastnames":["Navarro"],"firstnames":["Gonzalo"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/243772cae508a320d57841ee973faef0d/dblp","booktitle":"SPIRE","crossref":"conf/spire/2012","editor":[{"propositions":[],"lastnames":["Calderón-Benavides"],"firstnames":["Liliana"],"suffixes":[]},{"propositions":[],"lastnames":["González-Caro"],"firstnames":["Cristina","N."],"suffixes":[]},{"propositions":[],"lastnames":["Chávez"],"firstnames":["Edgar"],"suffixes":[]},{"propositions":[],"lastnames":["Ziviani"],"firstnames":["Nivio"],"suffixes":[]}],"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","bibtex":"@inproceedings{conf/spire/AbeliukN12,\n added-at = {2017-05-24T00:00:00.000+0200},\n author = {Abeliuk, Andr{\\'{e}}s and Navarro, Gonzalo},\n biburl = {https://www.bibsonomy.org/bibtex/243772cae508a320d57841ee973faef0d/dblp},\n booktitle = {SPIRE},\n crossref = {conf/spire/2012},\n editor = {Calder{\\'{o}}n{-}Benavides, Liliana and Gonz{\\'{a}}lez{-}Caro, Cristina N. and Ch{\\'{a}}vez, Edgar and Ziviani, Nivio},\n ee = {https://doi.org/10.1007/978-3-642-34109-0_5},\n interhash = {87b94e1e18c510c15e002daf7451f0d5},\n intrahash = {43772cae508a320d57841ee973faef0d},\n isbn = {978-3-642-34108-3},\n keywords = {dblp},\n pages = {30-41},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T20:17:56.000+0200},\n title = {Compressed Suffix Trees for Repetitive Texts.},\n url = {http://dblp.uni-trier.de/db/conf/spire/spire2012.html#AbeliukN12},\n volume = 7608,\n year = 2012,\n doi = {10.1007/978-3-642-34109-0\\_5}\n}\n\n","author_short":["Abeliuk, A.","Navarro, G."],"editor_short":["Calderón-Benavides, L.","González-Caro, C. N.","Chávez, E.","Ziviani, N."],"bibbaseid":"abeliuk-navarro-compressedsuffixtreesforrepetitivetexts-2012","role":"author","urls":{"Link":"https://doi.org/10.1007/978-3-642-34109-0_5","Paper":"http://dblp.uni-trier.de/db/conf/spire/spire2012.html#AbeliukN12"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","creationDate":"2020-02-03T23:47:55.061Z","downloads":0,"keywords":["dblp"],"search_terms":["compressed","suffix","trees","repetitive","texts","abeliuk","navarro"],"title":"Compressed Suffix Trees for Repetitive Texts.","year":2012,"biburl":"https://bibbase.org/f/Bfi3yYPxhtyKncP4R/aabeliuk-isi-edu.bib","dataSources":["qXmB8Cnrcvx883Fwx","efWerWm2QPDBjueMK","FSoKwX2WQoR9zQsgd"]}