| Autor: |
Apostolico, Alberto, Crochemore, Maxime, Kunsoo Park, Behzadi, Behshad, Fessant, Fabrice |
| Zdroj: |
Combinatorial Pattern Matching; 2005, p190-200, 11p |
| Abstrakt: |
Standard compression algorithms are not able to compress DNA sequences. Recently, new algorithms have been introduced specifically for this purpose, often using detection of long approximate repeats. In this paper, we present another algorithm, DNAPack, based on dynamic programming. In comparison with former existing programs, it compresses DNA slightly better, while the cost of dynamic programming is almost negligible. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
