{"id":"https://openalex.org/W2094341933","doi":"https://doi.org/10.1109/dcc.2010.64","title":"TreeZip: A New Algorithm for Compressing Large Collections of Evolutionary Trees","display_name":"TreeZip: A New Algorithm for Compressing Large Collections of Evolutionary Trees","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2094341933","doi":"https://doi.org/10.1109/dcc.2010.64","mag":"2094341933"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.2010.64","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2010.64","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Data Compression Conference","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/A5083319931","display_name":"Suzanne J. Matthews","orcid":"https://orcid.org/0000-0001-9170-2240"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Suzanne J. Matthews","raw_affiliation_strings":["Department of Computer Science & Engineering, Texas A and M University, USA","Department of Computer Science and Engineering, Texas A&M University , College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Texas A and M University, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Texas A&M University , College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078271763","display_name":"Seung-Jin Sul","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seung-Jin Sul","raw_affiliation_strings":["Department of Computer Science & Engineering, Texas A and M University, USA","Department of Computer Science and Engineering, Texas A&M University , College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Texas A and M University, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Texas A&M University , College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113709903","display_name":"Tiffani L. Williams","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tiffani L. Williams","raw_affiliation_strings":["Department of Computer Science & Engineering, Texas A and M University, USA","Department of Computer Science and Engineering, Texas A&M University , College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Texas A and M University, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Texas A&M University , College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083319931"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.1235107,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"544","last_page":"544"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9976999759674072,"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"}},"topics":[{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9976999759674072,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9866999983787537,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9789000153541565,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/phylogenetic-tree","display_name":"Phylogenetic tree","score":0.7876215577125549},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6721675992012024},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6611511707305908},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5962862372398376},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.582459032535553},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.5314423441886902},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5210170745849609},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4569471478462219},{"id":"https://openalex.org/keywords/hash-tree","display_name":"Hash tree","score":0.4545338749885559},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4389401972293854},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38909101486206055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2898954153060913},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2776590585708618},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.16054975986480713},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.15358051657676697},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.1127532422542572},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07466524839401245}],"concepts":[{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.7876215577125549},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6721675992012024},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6611511707305908},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5962862372398376},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.582459032535553},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5314423441886902},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5210170745849609},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4569471478462219},{"id":"https://openalex.org/C27353603","wikidata":"https://www.wikidata.org/wiki/Q16948622","display_name":"Hash tree","level":4,"score":0.4545338749885559},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4389401972293854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38909101486206055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2898954153060913},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2776590585708618},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.16054975986480713},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.15358051657676697},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.1127532422542572},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07466524839401245},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dcc.2010.64","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2010.64","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Data Compression Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","score":0.6299999952316284,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2144564205","https://openalex.org/W4387259453","https://openalex.org/W2768195082","https://openalex.org/W2144265691","https://openalex.org/W2154676777","https://openalex.org/W4382562202","https://openalex.org/W113683524","https://openalex.org/W93624718","https://openalex.org/W4387251676","https://openalex.org/W2026512586"],"abstract_inverted_index":{"The":[0],"primary":[1],"advantage":[2],"of":[3,8,59,114],"TreeZip":[4,47,101],"is":[5,98],"its":[6],"use":[7],"semantic":[9],"compression,":[10],"which":[11,32],"allows":[12],"us":[13],"to":[14,36,55],"uniquely":[15],"store":[16],"tree":[17,66],"relationship":[18],"information.":[19],"Phylogenetic":[20],"trees":[21,88],"are":[22],"stored":[23],"in":[24,53,64,79,111],"a":[25,29,44],"format":[26],"known":[27],"as":[28],"Newick":[30],"representation,":[31],"uses":[33,48],"nested":[34],"parentheses":[35],"represent":[37,56],"the":[38,60,65,95,100,104,108,112],"evolutionary":[39,62],"relationships":[40,63],"(or":[41],"subtrees)":[42],"within":[43],"phylogenetic":[45,115],"tree.":[46],"two":[49],"universal":[50,76],"hashing":[51],"functions":[52,78],"order":[54],"compactly":[57],"all":[58],"shared":[61],"collection.":[67],"In":[68],"our":[69,80],"previous":[70],"work,":[71],"we":[72],"have":[73],"used":[74],"successively":[75],"hash":[77,96],"HashCS":[81],"and":[82,89],"HashRF":[83],"algorithms":[84],"that":[85],"build":[86],"consensus":[87],"topological":[90],"distance":[91],"matrices,":[92],"respectively.":[93],"Once":[94],"table":[97],"constructed,":[99],"then":[102],"writes":[103],"compressed":[105],"file":[106],"depicting":[107],"information":[109],"contained":[110],"collection":[113],"trees.":[116]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}