Sensitivity of string compressors and repetitiveness measures
Authors:
- Tooru AkagiTATooru Akagi
- Mitsuru FunakoshiMFMitsuru Funakoshi
- Shunsuke InenagaShunsuke Inenaga
Open Access
- 22 December 2022
- journal article
- research article
- Published by Elsevier in Information and Computation
- Vol. 291
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Precursory Research for Embryonic Science and Technology (JPMJPR1922)
- Japan Society for the Promotion of Science (JP20J21147, JP22H03551)
- JST
This publication has 29 references indexed in Scilit:
- The Smallest Grammar ProblemIEEE Transactions on Information Theory, 2005
- Linear time algorithms for finding and representing all the tandem repeats in a stringJournal of Computer and System Sciences, 2004
- Indexing text using the Ziv–Lempel trieJournal of Discrete Algorithms, 2004
- Application of Lempel–Ziv factorization to the approximation of grammar-based compressionTheoretical Computer Science, 2003
- Grammar-based codes: a new class of universal lossless source codesIEEE Transactions on Information Theory, 2000
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context modelsIEEE Transactions on Information Theory, 2000
- Complete inverted files for efficient text retrieval and analysisJournal of the ACM, 1987
- Data compression via textual substitutionJournal of the ACM, 1982
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977