{"id":"https://openalex.org/W1975136411","doi":"https://doi.org/10.1016/s0304-3975(03)00053-7","title":"Truncated suffix trees and their application to data compression","display_name":"Truncated suffix trees and their application to data compression","publication_year":2003,"publication_date":"2003-04-23","ids":{"openalex":"https://openalex.org/W1975136411","doi":"https://doi.org/10.1016/s0304-3975(03)00053-7","mag":"1975136411"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(03)00053-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(03)00053-7","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5111458886","display_name":"Joong Chae Na","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Joong Chae Na","raw_affiliation_strings":["School of Computer Science & Engineering, Seoul National University, South Korea"],"affiliations":[{"raw_affiliation_string":"School of Computer Science & Engineering, Seoul National University, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029039590","display_name":"Alberto Apostolico","orcid":null},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]},{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["IT","US"],"is_corresponding":false,"raw_author_name":"Alberto Apostolico","raw_affiliation_strings":["Department of Computer Sciences, Purdue University, USA","Dipartimento di Elettronica e Informatica, Universit\u00e0 di Padova, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Dipartimento di Elettronica e Informatica, Universit\u00e0 di Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058155947","display_name":"Costas S. Iliopoulos","orcid":"https://orcid.org/0000-0003-3909-0077"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]},{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU","GB"],"is_corresponding":false,"raw_author_name":"Costas S. Iliopoulos","raw_affiliation_strings":["Department of Computer Science, King's College London, UK","School of Computing, Curtin University of Technology, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King's College London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"School of Computing, Curtin University of Technology, Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039462502","display_name":"Kunsoo Park","orcid":"https://orcid.org/0000-0001-5225-0907"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Kunsoo Park","raw_affiliation_strings":["School of Computer Science & Engineering, Seoul National University, South Korea"],"affiliations":[{"raw_affiliation_string":"School of Computer Science & Engineering, Seoul National University, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5039462502"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":2.3588,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.89394476,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"304","issue":"1-3","first_page":"87","last_page":"101"},"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.9857000112533569,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9314000010490417,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.9281613826751709},{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.8664839863777161},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.8436397910118103},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.8376299142837524},{"id":"https://openalex.org/keywords/sliding-window-protocol","display_name":"Sliding window protocol","score":0.7395178079605103},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.642575740814209},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5880798697471619},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5521251559257507},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48050034046173096},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4576612114906311},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.420802503824234},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.4124104380607605},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.357449471950531},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3462046980857849},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18003299832344055}],"concepts":[{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.9281613826751709},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.8664839863777161},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.8436397910118103},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.8376299142837524},{"id":"https://openalex.org/C102392041","wikidata":"https://www.wikidata.org/wiki/Q592860","display_name":"Sliding window protocol","level":3,"score":0.7395178079605103},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.642575740814209},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5880798697471619},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5521251559257507},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48050034046173096},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4576612114906311},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.420802503824234},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.4124104380607605},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.357449471950531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3462046980857849},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18003299832344055},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0304-3975(03)00053-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(03)00053-7","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/77b227df-c66f-4595-997d-52f63d70439c","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/77b227df-c66f-4595-997d-52f63d70439c","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Na, J C, Apostolico, A, Iliopoulos, C S & Park, K 2003, 'Truncated suffix trees and their application to data compression', Theoretical Computer Science, vol. 304, no. 1-3, pp. 87 - 101. https://doi.org/10.1016/S0304-3975(03)00053-7","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:www.research.unipd.it:11577/1363082","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/1363082","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W938539187","https://openalex.org/W1485516007","https://openalex.org/W1513153538","https://openalex.org/W1520568851","https://openalex.org/W1570198449","https://openalex.org/W1982026570","https://openalex.org/W1990061958","https://openalex.org/W1990653637","https://openalex.org/W2004083484","https://openalex.org/W2011066062","https://openalex.org/W2017661493","https://openalex.org/W2022126655","https://openalex.org/W2029353114","https://openalex.org/W2059513841","https://openalex.org/W2097530618","https://openalex.org/W2104462630","https://openalex.org/W2107079154","https://openalex.org/W2107745473","https://openalex.org/W2117946854","https://openalex.org/W2121252285","https://openalex.org/W2122962290","https://openalex.org/W2135255312","https://openalex.org/W2136968076","https://openalex.org/W2139483553","https://openalex.org/W2148761915","https://openalex.org/W2153295096","https://openalex.org/W2205652643","https://openalex.org/W2533248932","https://openalex.org/W2610179052","https://openalex.org/W2611477341","https://openalex.org/W4230452403","https://openalex.org/W6628959611"],"related_works":["https://openalex.org/W1807007002","https://openalex.org/W1848961842","https://openalex.org/W3044224375","https://openalex.org/W2158874082","https://openalex.org/W1975136411","https://openalex.org/W148509842","https://openalex.org/W3089043377","https://openalex.org/W2005977804","https://openalex.org/W2136043658","https://openalex.org/W288569921"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2016-06-24T00:00:00"}