System for random access DNA sequence compression

DNA sequences are generally compressed by algorithms using approximate repeats that are found in most DNA sequences. The regions of DNA that are not part of a repeat are encoded by using arithmetic coder which estimates the probabilities for each symbol using a Markov model. Since arithmetic coding is used for compressing the bitstream, random access is very difficult in these methods as bthe itstream is tightly packed. Random access is a desirable feature as it enable to decompress only interesting regions in the sequence. This paper presents a system which uses the approximate repeats based compression algorithm and provides random access capability.