Using ideas of Kolmogorov complexity for studying biological texts

DOI10.1007/s00224-012-9403-6zbMath1261.68078OpenAlexW2010240536MaRDI QIDQ1946512

Sofia Panteleeva, Zhanna Reznikova, Alexey Druzyaka, Boris Ya. Ryabko

Publication date: 15 April 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-012-9403-6

zbMATH Keywords

hypothesis testingKolmogorov complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Randomized algorithms (68W20)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using data compressors to construct order tests for homogeneity and component independence
• Prediction of random sequences and universal coding
• Universal artificial intelligence. Sequential decisions based on algorithmic probability.
• Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
• Clustering by Compression
• The Similarity Metric
• Universal coding, information, prediction, and estimation
• Grammar-based codes: a new class of universal lossless source codes
• Information Distance in Multiples
• Elements of Information Theory
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

This page was built for publication: Using ideas of Kolmogorov complexity for studying biological texts