{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:43:35Z","timestamp":1760402615359,"version":"build-2065373602"},"reference-count":7,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T00:00:00Z","timestamp":1579219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This Special Issue of Algorithms is focused on data compression algorithms and their applications.<\/jats:p>","DOI":"10.3390\/a13010028","type":"journal-article","created":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T04:27:09Z","timestamp":1579494429000},"page":"28","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Editorial: Special Issue on Data Compression Algorithms and Their Applications"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1120-5154","authenticated-orcid":false,"given":"Philip","family":"Bille","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, 2800 Kgs. Lyngby, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,1,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Barbay, J. (2019). Optimal Prefix Free Codes with Partial Sorting. Algorithms, 13.","DOI":"10.3390\/a13010012"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Rozenberg, L., Lotan, S., and Feldman, D. (2019). Finding Patterns in Signals Using Lossy Text Compression. Algorithms, 12.","DOI":"10.3390\/a12120267"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"G\u00f6tschel, S., and Weiser, M. (2019). Compression Challenges in Large Scale Partial Differential Equation Solvers. Algorithms, 12.","DOI":"10.3390\/a12090197"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Aza\u00efs, R. (2019). Nearest Embedded and Embedding Self-Nested Trees. Algorithms, 12.","DOI":"10.3390\/a12090180"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Furuya, I., and Kida, T. (2019). Compaction of Church Numerals. Algorithms, 12.","DOI":"10.3390\/a12080159"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Wang, B., Wang, L., Yu, H., and Xin, F. (2019). A New Regularized Reconstruction Algorithm Based on Compressed Sensing for the Sparse Underdetermined Problem and Applications of One-Dimensional and Two-Dimensional Signal Recovery. Algorithms, 12.","DOI":"10.3390\/a12070126"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Ryabko, B. (2019). Time-Universal Data Compression. Algorithms, 12.","DOI":"10.3390\/a12060116"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/1\/28\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T13:43:52Z","timestamp":1760363032000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/1\/28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,17]]},"references-count":7,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1]]}},"alternative-id":["a13010028"],"URL":"https:\/\/doi.org\/10.3390\/a13010028","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2020,1,17]]}}}