Improving Genome Compression Performance by Extending Reference Sequences

Abstract

We propose an efficient referential genome compression algorithm called RCCG. It extends reference genomes by its reverse complementation and uses coprime window sampling to detect the maximum matches (MEMs) between two genome sequences. After the assessment, those selected matches will be united to form mutation-containing matches (MCMs). The average compression ratio of the proposed algorithm is higher than that of the state-of-the-art genome compression algorithms.