A Universal Algorithm for Random-Access Compression and Applications for Annotated DNA Sequences

Author

Korodi, Gergely ; Tabus, Ioan

Author_Institution

Tampere Univ. of Technol., Tampere

fYear

2007

fDate

10-12 June 2007

Firstpage

1

Lastpage

4

Abstract

This article introduces a universal algorithm for creating compressed archives with instantaneous access and decodability of designated functional elements. A special-purpose variant is also given to enhance performance for DNA sequences. The resulting algorithm integrated into an earlier scheme achieves a marked improvement at the randomly accessible coding for annotated genome files, while completely retaining the functionality of instantaneous retrieval of all feature entries.

Keywords

DNA; biology computing; decoding; genetics; information retrieval; molecular biophysics; annotated DNA sequences; annotated genome files; compressed archives; decodability; information retrieval; instantaneous access; random-access compression; randomly accessible coding; universal algorithm; Algorithm design and analysis; Bioinformatics; Context modeling; DNA; Decoding; Genomics; Information retrieval; Sequences; Signal design; Signal processing algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Genomic Signal Processing and Statistics, 2007. GENSIPS 2007. IEEE International Workshop on

Conference_Location

Tuusula

Print_ISBN

978-1-4244-0998-3

Electronic_ISBN

978-1-4244-0999-0

Type

conf

DOI

10.1109/GENSIPS.2007.4365843

Filename

4365843