{"id":"https://openalex.org/W2154208961","doi":"https://doi.org/10.1109/dcc.2004.1281482","title":"Linear time universal coding of tree sources via FSM closure","display_name":"Linear time universal coding of tree sources via FSM closure","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2154208961","doi":"https://doi.org/10.1109/dcc.2004.1281482","mag":"2154208961"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.2004.1281482","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281482","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2004. Proceedings. DCC 2004","raw_type":"proceedings-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/A5033879041","display_name":"\u00c1lvaro Mart\u00edn","orcid":"https://orcid.org/0000-0001-8601-1242"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]},{"id":"https://openalex.org/I180910786","display_name":"Universidad de la Rep\u00fablica","ror":"https://ror.org/030bbe882","country_code":"UY","type":"education","lineage":["https://openalex.org/I180910786"]}],"countries":["US","UY"],"is_corresponding":true,"raw_author_name":"A. Martin","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA, USA","Institute de Computac\u00edon, Universidad de la Rep\u00fablica, Montevideo, Uruguay"],"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]},{"raw_affiliation_string":"Institute de Computac\u00edon, Universidad de la Rep\u00fablica, Montevideo, Uruguay","institution_ids":["https://openalex.org/I180910786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029865536","display_name":"G. Seroussi","orcid":"https://orcid.org/0000-0002-2893-189X"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. Seroussi","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041025739","display_name":"M.J. Weinberger","orcid":null},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.J. Weinberger","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033879041"],"corresponding_institution_ids":["https://openalex.org/I1324840837","https://openalex.org/I180910786"],"apc_list":null,"apc_paid":null,"fwci":0.4497,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.76206774,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"124","issue":null,"first_page":"372","last_page":"381"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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.9997000098228455,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9702000021934509,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6832985877990723},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6788197159767151},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5672812461853027},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5537378787994385},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5508183240890503},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.5383573174476624},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5376225113868713},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.5175339579582214},{"id":"https://openalex.org/keywords/context-model","display_name":"Context model","score":0.5059248805046082},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.4790588319301605},{"id":"https://openalex.org/keywords/tunstall-coding","display_name":"Tunstall coding","score":0.47785136103630066},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4765882194042206},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.448247492313385},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.4453403651714325},{"id":"https://openalex.org/keywords/entropy-encoding","display_name":"Entropy encoding","score":0.4438122808933258},{"id":"https://openalex.org/keywords/context-adaptive-variable-length-coding","display_name":"Context-adaptive variable-length coding","score":0.41328591108322144},{"id":"https://openalex.org/keywords/context-adaptive-binary-arithmetic-coding","display_name":"Context-adaptive binary arithmetic coding","score":0.40626031160354614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2829424738883972},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19808313250541687},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.05925974249839783}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6832985877990723},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6788197159767151},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5672812461853027},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5537378787994385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5508183240890503},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.5383573174476624},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5376225113868713},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.5175339579582214},{"id":"https://openalex.org/C183322885","wikidata":"https://www.wikidata.org/wiki/Q17007702","display_name":"Context model","level":3,"score":0.5059248805046082},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.4790588319301605},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.47785136103630066},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4765882194042206},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.448247492313385},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.4453403651714325},{"id":"https://openalex.org/C1769480","wikidata":"https://www.wikidata.org/wiki/Q1345239","display_name":"Entropy encoding","level":3,"score":0.4438122808933258},{"id":"https://openalex.org/C135534801","wikidata":"https://www.wikidata.org/wiki/Q1128721","display_name":"Context-adaptive variable-length coding","level":4,"score":0.41328591108322144},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.40626031160354614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2829424738883972},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19808313250541687},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.05925974249839783},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dcc.2004.1281482","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281482","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2004. Proceedings. DCC 2004","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1968908999","https://openalex.org/W1982026570","https://openalex.org/W1993720950","https://openalex.org/W1999120268","https://openalex.org/W2034323860","https://openalex.org/W2082967074","https://openalex.org/W2095963120","https://openalex.org/W2104462630","https://openalex.org/W2114257671","https://openalex.org/W2116190532","https://openalex.org/W2119047110","https://openalex.org/W2129902114","https://openalex.org/W2132119275","https://openalex.org/W2137380713","https://openalex.org/W2161488606","https://openalex.org/W2161628678","https://openalex.org/W2163294786","https://openalex.org/W2171560765","https://openalex.org/W2183235533","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W2809627566","https://openalex.org/W6683504902","https://openalex.org/W6752446581"],"related_works":["https://openalex.org/W1587903609","https://openalex.org/W2123072960","https://openalex.org/W2045024766","https://openalex.org/W1579872668","https://openalex.org/W4312628177","https://openalex.org/W2668751350","https://openalex.org/W2213686625","https://openalex.org/W3083947873","https://openalex.org/W2181465137","https://openalex.org/W1994532706"],"abstract_inverted_index":{"Applying":[0],"generalized":[1],"context":[2,36,42,92],"trees":[3],"and":[4,39,62,104],"their":[5],"finite":[6],"state":[7],"machine":[8],"closures,":[9],"a":[10,15,72],"two-pass":[11],"version":[12],"of":[13,57,101,107,113],"context,":[14],"twice-universal":[16,111],"lossless":[17],"coding":[18,112],"scheme":[19],"for":[20,110],"tree":[21,114],"models,":[22],"can":[23],"be":[24],"implemented":[25],"in":[26,54,64],"linear":[27],"encoding/decoding":[28],"time.":[29],"As":[30],"it":[31],"turns":[32],"out,":[33],"an":[34,90],"optimal":[35,91],"selection":[37],"rule":[38],"the":[40,50,55,58,69,77,83,99,102,105],"corresponding":[41],"transitions":[43],"are":[44],"computationally":[45],"not":[46],"more":[47],"expensive":[48],"than":[49],"various":[51],"steps":[52],"involved":[53],"implementation":[56],"Burrows-Wheeler":[59],"transform":[60,74,95],"(BWT)":[61],"use,":[63],"fact,":[65],"similar":[66],"tools.":[67],"Also":[68],"paper":[70],"presents":[71],"reversible":[73],"that":[75],"displays":[76],"same":[78],"\"context":[79],"deinterleaving\"":[80],"feature":[81],"as":[82],"BWT":[84,103],"but":[85],"is":[86],"naturally":[87],"based":[88],"on":[89],"tree.":[93],"This":[94],"offers":[96],"insight":[97],"into":[98],"workings":[100],"nature":[106],"its":[108],"suboptimality":[109],"models.":[115]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}