{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:46:57Z","timestamp":1760244417713,"version":"build-2065373602"},"reference-count":5,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T00:00:00Z","timestamp":1669939200000},"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>As the production of massive data has outpaced Moore\u2019s law in many scientific areas, the very notion of algorithms is transforming [...]<\/jats:p>","DOI":"10.3390\/a15120457","type":"journal-article","created":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T04:40:09Z","timestamp":1670215209000},"page":"457","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Special Issue on Algorithms and Data-Structures for Compressed Computation"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8502-5896","authenticated-orcid":false,"given":"Alberto","family":"Policriti","sequence":"first","affiliation":[{"name":"Department of Mathematics, Computer Science, and Physics, University of Udine, 33100 Udine, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3553-4953","authenticated-orcid":false,"given":"Nicola","family":"Prezza","sequence":"additional","affiliation":[{"name":"Department of Environmental Sciences, Informatics and Statistics, Ca\u2019 Foscari University, 30172 Venice, Italy"}]}],"member":"1968","published-online":{"date-parts":[[2022,12,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Matsuda, K., Denzumi, S., and Sadakane, K. (2021). Storing Set Families More Compactly with Top ZDDs. Algorithms, 14.","DOI":"10.3390\/a14060172"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"K\u00f6ppl, D. (2021). Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees. Algorithms, 14.","DOI":"10.3390\/a14020044"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Mitsuya, S., Nakashima, Y., Inenaga, S., Bannai, H., and Takeda, M. (2021). Compressed Communication Complexity of Hamming Distance. Algorithms, 14.","DOI":"10.3390\/a14040116"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Gibney, D., and Thankachan, S.V. (2021). Text Indexing for Regular Expression Matching. Algorithms, 14.","DOI":"10.3390\/a14050133"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Hucke, D., and Reh, C.P. (2021). Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings. Algorithms, 14.","DOI":"10.3390\/a14020065"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/12\/457\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:33:17Z","timestamp":1760146397000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/12\/457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,2]]},"references-count":5,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["a15120457"],"URL":"https:\/\/doi.org\/10.3390\/a15120457","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2022,12,2]]}}}