{"id":"https://openalex.org/W7164849356","doi":"https://doi.org/10.4230/lipics.sea.2026.7","title":"From Relative Compression to Hierarchical Compression","display_name":"From Relative Compression to Hierarchical Compression","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7164849356","doi":"https://doi.org/10.4230/lipics.sea.2026.7"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26011","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2026.7","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol371-sea2026/LIPIcs.SEA.2026.7/LIPIcs.SEA.2026.7.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol371-sea2026/LIPIcs.SEA.2026.7/LIPIcs.SEA.2026.7.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083100766","display_name":"Philip Bille","orcid":"https://orcid.org/0000-0002-1120-5154"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Bille, Philip","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science (DTU Compute), Technical University of Denmark, Lyngby, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-1120-5154","affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science (DTU Compute), Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070148734","display_name":"Inge Li G\u00f8rtz","orcid":"https://orcid.org/0000-0002-8322-4952"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"G\u00f8rtz, Inge Li","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science (DTU Compute), Technical University of Denmark, Lyngby, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-8322-4952","affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science (DTU Compute), Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055064899","display_name":"M. L\u00f3pez","orcid":"https://orcid.org/0009-0001-8507-4820"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"P\u00e9rez-L\u00f3pez, M\u00e1ximo","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science (DTU Compute), Technical University of Denmark, Lyngby, Denmark"],"raw_orcid":"https://orcid.org/0009-0001-8507-4820","affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science (DTU Compute), Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.79056798,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"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.9610000252723694,"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.9610000252723694,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.005900000222027302,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11106","display_name":"Data Management and Algorithms","score":0.00430000014603138,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/compression","display_name":"Compression (physics)","score":0.7666000127792358},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.6531999707221985},{"id":"https://openalex.org/keywords/compression-ratio","display_name":"Compression ratio","score":0.4909999966621399},{"id":"https://openalex.org/keywords/data-compression-ratio","display_name":"Data compression ratio","score":0.44119998812675476},{"id":"https://openalex.org/keywords/decompression","display_name":"Decompression","score":0.42010000348091125},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.4090000092983246},{"id":"https://openalex.org/keywords/image-compression","display_name":"Image compression","score":0.4009000062942505}],"concepts":[{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.7666000127792358},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.6531999707221985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6107000112533569},{"id":"https://openalex.org/C25797200","wikidata":"https://www.wikidata.org/wiki/Q828137","display_name":"Compression ratio","level":3,"score":0.4909999966621399},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4684000015258789},{"id":"https://openalex.org/C94835093","wikidata":"https://www.wikidata.org/wiki/Q3113333","display_name":"Data compression ratio","level":5,"score":0.44119998812675476},{"id":"https://openalex.org/C2779480328","wikidata":"https://www.wikidata.org/wiki/Q1183684","display_name":"Decompression","level":2,"score":0.42010000348091125},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.4090000092983246},{"id":"https://openalex.org/C13481523","wikidata":"https://www.wikidata.org/wiki/Q412438","display_name":"Image compression","level":4,"score":0.4009000062942505},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.39399999380111694},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3903999924659729},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.352400004863739},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.34310001134872437},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3156000077724457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29789999127388},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2896000146865845},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2721000015735626},{"id":"https://openalex.org/C2778192920","wikidata":"https://www.wikidata.org/wiki/Q16874989","display_name":"Signal compression","level":4,"score":0.2639999985694885}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26011","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2026.7","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol371-sea2026/LIPIcs.SEA.2026.7/LIPIcs.SEA.2026.7.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:doi:10.4230/lipics.sea.2026.7","is_oa":true,"landing_page_url":"https://gitlab.gbar.dtu.dk/hierarchical-relative-compression/hrcimplementation","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.4230/lipics.sea.2026.7","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sea.2026.7","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26011","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2026.7","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol371-sea2026/LIPIcs.SEA.2026.7/LIPIcs.SEA.2026.7.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7164849356.pdf","grobid_xml":"https://content.openalex.org/works/W7164849356.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,50,67],"introduce":[1],"a":[2,11,18,28,44,99,110],"framework":[3,70],"to":[4,47,106,109,124],"use":[5],"any":[6],"relative":[7,15,46,74,92,107],"compression":[8,75,93,96,108,115,125,154],"algorithm":[9],"as":[10],"subroutine":[12],"for":[13,64,159],"hierarchical":[14,91],"compression.":[16],"In":[17],"dataset":[19,127,141],"consisting":[20],"of":[21,26,43,137,153],"n":[22],"sequences,":[23,33],"it":[24],"consists":[25],"constructing":[27],"rooted":[29],"tree":[30],"on":[31,53,77],"the":[32,41,95,120,138,151,160],"using":[34],"hashing":[35],"and":[36,39,60,81,130,145],"similarity":[37],"techniques,":[38],"compressing":[40],"children":[42],"node":[45],"their":[48],"parent.":[49],"build":[51],"up":[52],"previous":[54],"techniques":[55],"[Bille":[56],"et":[57],"al.,":[58],"2023],":[59],"optimize":[61],"them":[62],"further":[63],"computational":[65],"efficiency.":[66],"test":[68],"our":[69],"with":[71,122,162],"three":[72],"existing":[73],"algorithms":[76],"six":[78],"genomic":[79],"datasets,":[80],"we":[82,117],"show":[83],"that":[84,87],"in":[85],"datasets":[86,161],"contain":[88],"heterogeneous":[89],"data,":[90],"improves":[94],"ratio":[97],"by":[98],"factor":[100],"2":[101],"or":[102],"more,":[103],"when":[104],"compared":[105],"single":[111],"sequence.":[112],"Apart":[113],"from":[114],"ratio,":[116],"also":[118],"explore":[119],"trade-offs":[121],"respect":[123],"speed,":[126,129],"decompression":[128,133,142,147],"average":[131],"sequence":[132,146],"speed.":[134],"With":[135],"two":[136],"surveyed":[139],"algorithms,":[140],"becomes":[143],"faster":[144],"remains":[148,157],"practical,":[149],"at":[150],"cost":[152],"time,":[155],"which":[156],"competitive":[158],"highest":[163],"variability.":[164]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-06-16T00:00:00"}