Using ideas of Kolmogorov complexity for studying biological texts
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3647917 (Why is no real title available?)
- scientific article; zbMATH DE number 3117956 (Why is no real title available?)
- scientific article; zbMATH DE number 3867211 (Why is no real title available?)
- scientific article; zbMATH DE number 3227613 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- scientific article; zbMATH DE number 3070160 (Why is no real title available?)
- Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
- Clustering by Compression
- Elements of Information Theory
- Grammar-based codes: a new class of universal lossless source codes
- Information Distance in Multiples
- Prediction of random sequences and universal coding
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The Similarity Metric
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
- Universal coding, information, prediction, and estimation
- Using data compressors to construct order tests for homogeneity and component independence
Cited in
(4)
This page was built for publication: Using ideas of Kolmogorov complexity for studying biological texts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946512)