{"cited_by_count":696423,"description":"This cluster of papers focuses on the development and optimization of algorithms for compressing and indexing text data, with applications to genomic data, string matching, suffix arrays, and entropy-based compression techniques.","display_name":"Algorithms and Data Compression","domain_id":"3","external_ids":{"openalex":"https://openalex.org/T11269","wikipedia":"https://en.wikipedia.org/wiki/Data_compression"},"field_id":"17","id":"T11269","keywords":[{"display_name":"string matching","id":"string-matching","score":0.5662,"url":"https://openalex.org/keywords/string-matching"},{"display_name":"lossless compression","id":"lossless-compression","score":0.2742,"url":"https://openalex.org/keywords/lossless-compression"},{"display_name":"sorting algorithms","id":"sorting-algorithms","score":0.3568,"url":"https://openalex.org/keywords/sorting-algorithms"},{"display_name":"Huffman coding","id":"huffman-coding","score":0.3427,"url":"https://openalex.org/keywords/huffman-coding"},{"display_name":"string algorithms","id":"string-algorithms","score":0.8177,"url":"https://openalex.org/keywords/string-algorithms"},{"display_name":"text compression","id":"text-compression","score":0.617,"url":"https://openalex.org/keywords/text-compression"},{"display_name":"approximate string matching","id":"approximate-string-matching","score":0.3517,"url":"https://openalex.org/keywords/approximate-string-matching"},{"display_name":"source coding","id":"source-coding","score":0.2366,"url":"https://openalex.org/keywords/source-coding"},{"display_name":"edit distance","id":"edit-distance","score":0.2955,"url":"https://openalex.org/keywords/edit-distance"},{"display_name":"hash tables","id":"hash-tables","score":0.3271,"url":"https://openalex.org/keywords/hash-tables"},{"display_name":"suffix trees","id":"suffix-trees","score":0.6708,"url":"https://openalex.org/keywords/suffix-trees"},{"display_name":"succinct data structures","id":"succinct-data-structures","score":0.8413,"url":"https://openalex.org/keywords/succinct-data-structures"},{"display_name":"binary search trees","id":"binary-search-trees","score":0.4331,"url":"https://openalex.org/keywords/binary-search-trees"},{"display_name":"suffix arrays","id":"suffix-arrays","score":0.7713,"url":"https://openalex.org/keywords/suffix-arrays"},{"display_name":"Burrows-Wheeler transform","id":"burrows-wheeler-transform","score":0.7925,"url":"https://openalex.org/keywords/burrows-wheeler-transform"},{"display_name":"longest common subsequence","id":"longest-common-subsequence","score":0.3849,"url":"https://openalex.org/keywords/longest-common-subsequence"},{"display_name":"arithmetic coding","id":"arithmetic-coding","score":0.2753,"url":"https://openalex.org/keywords/arithmetic-coding"},{"display_name":"text indexing","id":"text-indexing","score":0.3948,"url":"https://openalex.org/keywords/text-indexing"},{"display_name":"inverted index","id":"inverted-index","score":0.2637,"url":"https://openalex.org/keywords/inverted-index"},{"display_name":"dictionary-based compression","id":"dictionary-based-compression","score":0.6875,"url":"https://openalex.org/keywords/dictionary-based-compression"},{"display_name":"space-efficient data structures","id":"space-efficient-data-structures","score":0.5422,"url":"https://openalex.org/keywords/space-efficient-data-structures"},{"display_name":"quicksort","id":"quicksort","score":0.4273,"url":"https://openalex.org/keywords/quicksort"},{"display_name":"dynamic data structures","id":"dynamic-data-structures","score":0.2178,"url":"https://openalex.org/keywords/dynamic-data-structures"},{"display_name":"string compression","id":"string-compression","score":0.8361,"url":"https://openalex.org/keywords/string-compression"},{"display_name":"Boyer-Moore algorithm","id":"boyer-moore-algorithm","score":0.6857,"url":"https://openalex.org/keywords/boyer-moore-algorithm"}],"legacy_keywords":["Compression","Suffix Arrays","Text Indexing","Data Structures","String Matching","Genomic Data","Entropy","Hashing","Approximate Matching","Algorithms"],"openalex_id":"https://openalex.org/T11269","source_created_date":"2024-01-23T15:27:10","source_updated_date":"2026-10-17T03:02:00","subfield_id":"1702","url":"/topics/T11269","works_api_url":"https://api.openalex.org/works?filter=topics.id:T11269","works_count":63221,"label":"Algorithms and Data Compression","provider":"openalex","revision":"f8fed1eb692224c5","taxonomy_revision":"f050b5d4780b1289","title":"Algorithms and Data Compression","kind":"topic-directory","aeo_cohort":"topic-directory","catalogue_revision":"f050b5d4780b1289","numeric_address":"36183004602829915","address_version":"morton4x16-v1","coordinates":[3,17,1702,11269],"answer_status":"Directory metadata; local answer requires separate source review","truth_status":"Subject descriptor, not a factual answer or a demonstrated knowledge gap","reviewed_answer":null}