Practical compressed suffix trees. Abeliuk, A., Ćanovas, R., & Navarro, G. Algorithms, 2013. abstract bibtex The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for suffix trees, with widely different space-time tradeoffs. In this paper we show how the use of range min-max trees yields novel representations achieving practical space/time tradeoffs. In addition, we show how those trees can be modified to index highly repetitivecollections, obtaining the first compressed suffix tree representation thateffectively adapts to that scenario. © 2013 by the authors; licensee MDPI, Basel, Switzerland.
@article{
title = {Practical compressed suffix trees},
type = {article},
year = {2013},
identifiers = {[object Object]},
keywords = {Bioinformatics,Compressed data structures,Repetitive sequence collections,Suffix trees},
volume = {6},
id = {06e79a5c-f741-3d7b-89a6-a7514ea3db32},
created = {2017-12-07T19:00:42.584Z},
file_attached = {false},
profile_id = {f36c03df-19a5-3fda-b8bb-9ed30afa057a},
last_modified = {2017-12-07T19:00:42.584Z},
read = {false},
starred = {false},
authored = {true},
confirmed = {false},
hidden = {false},
private_publication = {true},
abstract = {The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for suffix trees, with widely different space-time tradeoffs. In this paper we show how the use of range min-max trees yields novel representations achieving practical space/time tradeoffs. In addition, we show how those trees can be modified to index highly repetitivecollections, obtaining the first compressed suffix tree representation thateffectively adapts to that scenario. © 2013 by the authors; licensee MDPI, Basel, Switzerland.},
bibtype = {article},
author = {Abeliuk, A. and Ćanovas, R. and Navarro, G.},
journal = {Algorithms},
number = {2}
}
Downloads: 0
{"_id":"H6HiQgTSR2W5MsHNm","bibbaseid":"abeliuk-anovas-navarro-practicalcompressedsuffixtrees-2013","authorIDs":[],"author_short":["Abeliuk, A.","Ćanovas, R.","Navarro, G."],"bibdata":{"title":"Practical compressed suffix trees","type":"article","year":"2013","identifiers":"[object Object]","keywords":"Bioinformatics,Compressed data structures,Repetitive sequence collections,Suffix trees","volume":"6","id":"06e79a5c-f741-3d7b-89a6-a7514ea3db32","created":"2017-12-07T19:00:42.584Z","file_attached":false,"profile_id":"f36c03df-19a5-3fda-b8bb-9ed30afa057a","last_modified":"2017-12-07T19:00:42.584Z","read":false,"starred":false,"authored":"true","confirmed":false,"hidden":false,"private_publication":"true","abstract":"The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for suffix trees, with widely different space-time tradeoffs. In this paper we show how the use of range min-max trees yields novel representations achieving practical space/time tradeoffs. In addition, we show how those trees can be modified to index highly repetitivecollections, obtaining the first compressed suffix tree representation thateffectively adapts to that scenario. © 2013 by the authors; licensee MDPI, Basel, Switzerland.","bibtype":"article","author":"Abeliuk, A. and Ćanovas, R. and Navarro, G.","journal":"Algorithms","number":"2","bibtex":"@article{\n title = {Practical compressed suffix trees},\n type = {article},\n year = {2013},\n identifiers = {[object Object]},\n keywords = {Bioinformatics,Compressed data structures,Repetitive sequence collections,Suffix trees},\n volume = {6},\n id = {06e79a5c-f741-3d7b-89a6-a7514ea3db32},\n created = {2017-12-07T19:00:42.584Z},\n file_attached = {false},\n profile_id = {f36c03df-19a5-3fda-b8bb-9ed30afa057a},\n last_modified = {2017-12-07T19:00:42.584Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {true},\n abstract = {The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for suffix trees, with widely different space-time tradeoffs. In this paper we show how the use of range min-max trees yields novel representations achieving practical space/time tradeoffs. In addition, we show how those trees can be modified to index highly repetitivecollections, obtaining the first compressed suffix tree representation thateffectively adapts to that scenario. © 2013 by the authors; licensee MDPI, Basel, Switzerland.},\n bibtype = {article},\n author = {Abeliuk, A. and Ćanovas, R. and Navarro, G.},\n journal = {Algorithms},\n number = {2}\n}","author_short":["Abeliuk, A.","Ćanovas, R.","Navarro, G."],"bibbaseid":"abeliuk-anovas-navarro-practicalcompressedsuffixtrees-2013","role":"author","urls":{},"keyword":["Bioinformatics","Compressed data structures","Repetitive sequence collections","Suffix trees"],"downloads":0},"bibtype":"article","creationDate":"2020-02-03T23:47:55.068Z","downloads":0,"keywords":["bioinformatics","compressed data structures","repetitive sequence collections","suffix trees"],"search_terms":["practical","compressed","suffix","trees","abeliuk","ćanovas","navarro"],"title":"Practical compressed suffix trees","year":2013}