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 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.
Laboratoire d'Informatique Fondamentale de Lille, URA 369 du CNRS, Université de Lille I, Villeneuve d'Ascq, France.
E
E
Rivals
M
M
Dauchet
J P
JP
Delahaye
O
O
Delgrange
D000465:Algorithms; D007256:Information Systems; D007257:Information Theory; D012091:Repetitive Sequences, Nucleic Acid; D017421:Sequence Analysis / Q000379:methods*