Name
Abstract | ||
|---|---|---|
We present a text compression scheme dedicated to DNA sequences. The exponential growing of the number of sequences creates a real need for analyzing tools. A specific need emerges for methods that perform sequences classification upon various criteria, one of which is the sequence repetitiveness. A good lossless compression scheme is able to distinguish between “random” and “significative” repeats. Theoretical bases for this statement are found in Kolmogorov complexity theory |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1109/DCC.1996.488385 | Data Compression Conference |
Keywords | Field | DocType |
DNA,computational complexity,data compression,medical signal processing,pattern classification,random processes,Kolmogorov complexity theory,guaranteed compression scheme,lossless compression scheme,random repeats,repetitive DNA sequences,sequence repetitiveness,sequences classification,significative repeats,text compression | Exponential function,Repeated sequence,Kolmogorov complexity,Computer science,Stochastic process,Theoretical computer science,Linguistic sequence complexity,Data compression,Lossless compression,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1068-0314 | 0-8186-7358-3 | 38 |
PageRank | References | Authors |
2.79 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eric Rivals | 1 | 388 | 41.14 |
| Jean-Paul Delahaye | 2 | 325 | 54.60 |
| Max Dauchet | 3 | 655 | 67.02 |
| O Delgrange | 4 | 112 | 11.20 |