Compressing biological sequences using self adjusting data structures

In this paper, we investigate experimentally the exploitation of self adjusting data structures for compressing biological sequences. We have evaluated the practical performance of splay tree alternates in comparison with the original version of splay trees. In this investigation, we utilize plain splay trees, a log log n-competitive variation, and a randomized version of splay trees. It is experimentally observed that the compression achieved in the case of the log log n-competitive technique is, as expected, more efficient than the one of the plain splay trees.