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

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.