Paper Info
Title
Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences.
Abstract
Motivation: Compression algorithms cart be used to analyse genetic sequences. A compression algorithm tests a given property on the sequence and uses it to encode the sequence: if the properly is true, it reveals some structure of the sequence which can be described briefly, this yields a description of the sequence which is shorter than the sequence of nucleotides given in extenso. The more a sequence is compressed by the algorithm, the more significant is the property for that sequence. Results: We present a compression algorithm that tests the presence of a particular type of dosDNA (defined ordered sequence-DNA): approximate tandem repents of small motifs (i.e. of lengths <4). This algorithm has been experimented with on four yeast chromosomes. The presence of approximate ?late tandem repents seems to be a uniform structural property of yeast chromosomes.
Year
DOI
Venue
1997
10.1093/bioinformatics/13.2.131
COMPUTER APPLICATIONS IN THE BIOSCIENCES
Field
DocType
Volume
Tandem repeat,ENCODE,Nucleic acid sequence,Computer science,Algorithm,Structural property,DNA sequencing,Bioinformatics,Data compression,Structural unit
Journal
13
Issue
ISSN
Citations 
2
0266-7061
24
PageRank 
References 
Authors
3.86
3
7
Name
Order
Citations
PageRank
Eric Rivals138841.14
O Delgrange211211.20
Jean-Paul Delahaye332554.60
Max Dauchet465567.02
Marie-Odile Delorme5285.14
Alain Hénaut66216.25
E Ollivier7265.08