Compression and genetic sequence analysis

A novel approach to genetic sequence analysis is presented. This approach, based on compression of algorithms, has been launched simultaneously by Grumbach and Tahi, Milosavljevic and Rivals. To reduce the description of an object, a compression algorithm replaces some regularities in the descriptio...

Full description

Saved in:
Bibliographic Details
Published in:Biochimie 1996, Vol.78 (5), p.315-322
Main Authors: Rivals, É., Dauchet, M., Delahaye, J.P., Delgrange, O.
Format: Article
Language:English
Subjects:
Algorithms
compression algorithms
Information Systems
Information Theory
Kolmogorov complexity
regularity detection
Repetitive Sequences, Nucleic Acid
Sequence Analysis - methods
sequence classification
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A novel approach to genetic sequence analysis is presented. This approach, based on compression of algorithms, has been launched simultaneously by Grumbach and Tahi, Milosavljevic and Rivals. To reduce the description of an object, a compression algorithm replaces some regularities in the description by special codes. Thus a compression algorithm can be applied to a sequence in order to study the presence of those regularities all over the sequence. This paper explains this ability, gives examples of compression algorithms already developed and mentions their applications. Finally, the theoretical foundations of the approach are presented in an overview of the algorithmic theory of information.
ISSN:0300-9084
1638-6183
DOI:10.1016/0300-9084(96)84763-8