{"id":"https://openalex.org/W2146346985","doi":"https://doi.org/10.1145/1498698.1594228","title":"Engineering a compressed suffix tree implementation","display_name":"Engineering a compressed suffix tree implementation","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2146346985","doi":"https://doi.org/10.1145/1498698.1594228","mag":"2146346985"},"language":"en","primary_location":{"id":"doi:10.1145/1498698.1594228","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1498698.1594228","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070318939","display_name":"Niko V\u00e4lim\u00e4ki","orcid":"https://orcid.org/0000-0001-9200-9560"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"N. V\u00e4lim\u00e4ki","raw_affiliation_strings":["University of Helsinki, Helsinki, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Helsinki, Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043558409","display_name":"Veli M\u00e4kinen","orcid":"https://orcid.org/0000-0003-4454-1493"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"V. M\u00e4kinen","raw_affiliation_strings":["University of Helsinki, Helsinki, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Helsinki, Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054085463","display_name":"Wolfgang Gerlach","orcid":"https://orcid.org/0000-0002-1480-1242"},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"W. Gerlach","raw_affiliation_strings":["Bielefeld University, AG Genominformatik, Bielefeld","Bielefeld University, AG Genominformatik, Bielefeld#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bielefeld University, AG Genominformatik, Bielefeld","institution_ids":["https://openalex.org/I20121455"]},{"raw_affiliation_string":"Bielefeld University, AG Genominformatik, Bielefeld#TAB#","institution_ids":["https://openalex.org/I20121455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059193887","display_name":"Kartikeya Dixit","orcid":"https://orcid.org/0000-0003-1878-4117"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"K. Dixit","raw_affiliation_strings":["IIT Kanpur, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Kanpur, New Delhi, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.2476,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.97093652,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"14","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9733999967575073,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9650999903678894,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.9505998492240906},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.9468018412590027},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.8981052041053772},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.6295788884162903},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.607006311416626},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5826174020767212},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5446805357933044},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5437409281730652},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4551025927066803},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4519105851650238},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43041902780532837},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.42572811245918274},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41147270798683167}],"concepts":[{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.9505998492240906},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.9468018412590027},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.8981052041053772},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.6295788884162903},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.607006311416626},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5826174020767212},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5446805357933044},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5437409281730652},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4551025927066803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4519105851650238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43041902780532837},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.42572811245918274},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41147270798683167},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1498698.1594228","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1498698.1594228","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.159.7621","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.7621","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.helsinki.fi/u/vmakinen/papers/jea08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.80.8871","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.8871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.helsinki.fi/u/vmakinen/papers/wea07.pdf","raw_type":"text"},{"id":"pmh:oai:pub.librecat.org:1902192","is_oa":false,"landing_page_url":"https://pub.uni-bielefeld.de/record/1902192","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"V\u00e4lim\u00e4ki N, Gerlach W, Dixit K, M\u00e4kinen V. Engineering a Compressed Suffix Tree Implementation. In:  <em>Proceedings of 6th Workshop on Experimental Algorithms (WEA'07)</em>. Springer-Verlag;  2007: 217-228.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pub.librecat.org:2406118","is_oa":false,"landing_page_url":"https://pub.uni-bielefeld.de/record/2406118","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"V\u00e4lim\u00e4ki N, M\u00e4kinen V, Gerlach W, Dixit K. Engineering a compressed suffix tree implementation. <em>Journal of Experimental Algorithmics (JEA)</em>. 2009;14:4.2-2:4.23.","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1416533899","display_name":null,"funder_award_id":"119815","funder_id":"https://openalex.org/F4320321108","funder_display_name":"Academy of Finland"}],"funders":[{"id":"https://openalex.org/F4320321108","display_name":"Academy of Finland","ror":"https://ror.org/05k73zm37"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W642038236","https://openalex.org/W938539187","https://openalex.org/W1485516007","https://openalex.org/W1485847476","https://openalex.org/W1485941238","https://openalex.org/W1487662321","https://openalex.org/W1489909987","https://openalex.org/W1496038746","https://openalex.org/W1509727978","https://openalex.org/W1530061632","https://openalex.org/W1557034006","https://openalex.org/W1590204465","https://openalex.org/W1600258932","https://openalex.org/W1608371561","https://openalex.org/W1965853364","https://openalex.org/W1990061958","https://openalex.org/W2027244654","https://openalex.org/W2055043387","https://openalex.org/W2059513841","https://openalex.org/W2073921136","https://openalex.org/W2085218027","https://openalex.org/W2088386938","https://openalex.org/W2095592472","https://openalex.org/W2114790712","https://openalex.org/W2121252285","https://openalex.org/W2124348703","https://openalex.org/W2128777897","https://openalex.org/W2130080588","https://openalex.org/W2134283755","https://openalex.org/W2134696992","https://openalex.org/W2137120608","https://openalex.org/W2149243190","https://openalex.org/W2152486057","https://openalex.org/W2158874082","https://openalex.org/W2159647614","https://openalex.org/W2161488606","https://openalex.org/W2170899819","https://openalex.org/W2533248932","https://openalex.org/W2582397176","https://openalex.org/W2646645486","https://openalex.org/W4285719527","https://openalex.org/W4389615664","https://openalex.org/W6628959611"],"related_works":["https://openalex.org/W2003608043","https://openalex.org/W2405892617","https://openalex.org/W153119118","https://openalex.org/W2583658747","https://openalex.org/W2158874082","https://openalex.org/W1575722140","https://openalex.org/W4293529780","https://openalex.org/W1498395615","https://openalex.org/W2073921136","https://openalex.org/W1965532872"],"abstract_inverted_index":{"Suffix":[0,258],"tree":[1,81,108,118,139,163,279],"is":[2,41,181,241],"one":[3],"of":[4,52,104,166,169,268,277],"the":[5,33,38,45,92,105,123,160,167,170,175,190,220,224,231,235,245,269],"most":[6,143],"important":[7],"data":[8],"structures":[9],"in":[10,71,193],"string":[11],"algorithms":[12,24],"and":[13,25,134,217,264],"biological":[14],"sequence":[15,51],"analysis.":[16],"Unfortunately,":[17],"when":[18],"it":[19],"comes":[20],"to":[21,28,122,255,272],"implementing":[22],"those":[23],"applying":[26],"them":[27],"real":[29],"genomic":[30],"sequences,":[31],"often":[32],"main":[34],"memory":[35],"size":[36,93],"becomes":[37],"bottleneck.":[39],"This":[40],"easily":[42,95],"explained":[43],"by":[44,112,184],"fact":[46],"that":[47,126],"while":[48,227],"a":[49,155,178,253,265],"DNA":[50,158,233],"length":[53],"n":[54,72,77,85,87,130,145,212,214],"from":[55,261,280],"alphabet":[56],"\u03a3":[57],"=":[58,75],"{":[59],"A":[60],",":[61,63,65],"C":[62],"G":[64],"T":[66],"}":[67],"can":[68],"be":[69],"stored":[70],"log":[73,86,131,144,213,215],"|\u03a3|":[74],"2":[76],"bits,":[78,133],"its":[79],"suffix":[80,107,117,138,162,172,278],"occupies":[82,119],"O":[83,128,210],"(":[84,129,211],")":[88],"bits.":[89],"In":[90],"practice,":[91],"difference":[94],"reaches":[96],"factor":[97,146,185],"50.":[98],"We":[99],"report":[100],"on":[101,154,230],"an":[102],"implementation":[103,188],"compressed":[106,116,161],"very":[109],"recently":[110],"proposed":[111],"Sadakane":[113],"(2007).":[114],"The":[115],"space":[120,168,222,237],"proportional":[121],"text":[124],"size,":[125],"is,":[127],"|\u03a3|)":[132,216],"supports":[135],"all":[136],"typical":[137],"operations":[140],"with":[141],"at":[142],"slowdown.":[147],"Our":[148,187,204],"experiments":[149],"show":[150],"that,":[151],"for":[152],"example,":[153],"10":[156],"MB":[157],"sequence,":[159,234],"takes":[164],"10%":[165],"normal":[171],"tree.":[173],"At":[174],"same":[176,221],"time,":[177],"representative":[179],"algorithm":[180,206,271],"slowed":[182],"down":[183],"30.":[186],"follows":[189],"original":[191],"proposal":[192],"spirit,":[194],"but":[195],"some":[196],"internal":[197],"parts":[198],"are":[199],"tailored":[200],"toward":[201],"practical":[202],"implementation.":[203],"construction":[205,240],"has":[207],"time":[208],"requirement":[209],"uses":[218],"closely":[219],"as":[223],"final":[225,246],"structure":[226],"constructing":[228],"it:":[229],"10MB":[232],"maximum":[236],"usage":[238],"during":[239],"only":[242],"1.5":[243],"times":[244],"product":[247],"size.":[248],"As":[249],"by-products,":[250],"we":[251],"develop":[252],"method":[254],"create":[256],"Succinct":[257],"Array":[259],"directly":[260],"Burrows-Wheeler":[262],"transform":[263],"space-efficient":[266],"version":[267],"suffixes-insertion":[270],"build":[273],"balanced":[274],"parentheses":[275],"representation":[276],"LCP":[281],"information.":[282]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}