Toward a Definitive Compressibility Measure for Repetitive Sequences-Reference-Cited by-同舟云学术

Toward a Definitive Compressibility Measure for Repetitive Sequences

Published:2023-04 Issue:4 Volume:69 Page:2074-2092
ISSN:0018-9448
Container-title:IEEE Transactions on Information Theory
language:
Short-container-title:IEEE Trans. Inform. Theory

Author:

Kociumaka Tomasz¹,Navarro Gonzalo²^ORCID,Prezza Nicola³^ORCID

Affiliation:

1. Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel

2. Department of Computer Science, Center for Biotechnology and Bioengineering (CeBiB) and Millennium Institute for Foundational Research on Data (IMFD), University of Chile, Santiago, Chile

3. Department of Environmental Sciences, Informatics and Statistics, Ca’ Foscari University of Venice, Venice, Italy

Funder

Israel Science Foundation

United States-Israel Binational Science Foundation

European Research Council (ERC) through the European Union’s (EU’s) Horizon 2020 Research and Innovation Program

NSF

HDR TRIPODS

Alfred P. Sloan Fellowship

Agencia Nacional de Investigación y Desarrollo (ANID), with Basal Funds

Millennium Science Initiative Program

Fondecyt

European Research Council (ERC) through the European Union’s (EU’s) Horizon Europe Research and Innovation Program

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Library and Information Sciences,Computer Science Applications,Information Systems

Link

https://ieeexplore.ieee.org/ielam/18/10073961/9961143-aam.pdf

Reference50 articles.

1. String compression algorithms;gallant,1982

2. On the Approximation Ratio of Ordered Parsings

3. The Smallest Grammar Problem

4. Application of Lempel–Ziv factorization to the approximation of grammar-based compression

5. Data compression via textual substitution

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New string attractor-based complexities for infinite words;Journal of Combinatorial Theory, Series A;2024-11

2. String Attractors of Some Simple-Parry Automatic Sequences;Theory of Computing Systems;2024-09-10

3. Reordering Functions in Mobiles Apps for Reduced Size and Faster Start-Up;ACM Transactions on Embedded Computing Systems;2024-06-10

4. Sketching and Streaming for Dictionary Compression;2024 Data Compression Conference (DCC);2024-03-19

5. DandD: Efficient measurement of sequence growth and similarity;iScience;2024-03