Abstract: Genetic data may be compressed efficiently by selecting for each bi-allelic marker, from among multiple compression algorithms with different associated storage requirements that depend on the minor allele frequency of the respective marker, the algorithm that has the lowest storage requirements. Efficient approaches compress, store, and load pedigree file data. A hybrid method is used that selects between multiple alternative compression algorithms whose performance depends on the frequency of certain observable genetic variations. The hybrid method may achieve higher compression ratios than PLINK or PBAT. Further, it results in a compressed data format that, generally, does not require any overhead memory space and CPU time for decompression, and, consequently, has shorter loading times for compressed files than the binary format in PLINK or PBAT.

Abstract: Genetic data may be compressed efficiently by selecting for each bi-allelic marker, from among multiple compression algorithms with different associated storage requirements that depend on the minor allele frequency of the respective marker, the algorithm that has the lowest storage requirements. Efficient approaches compress, store, and load pedigree file data. A hybrid method is used that selects between multiple alternative compression algorithms whose performance depends on the frequency of certain observable genetic variations. The hybrid method may achieve higher compression ratios than PLINK or PBAT. Further, it results in a compressed data format that, generally, does not require any overhead memory space and CPU time for decompression, and, consequently, has shorter loading times for compressed files than the binary format in PLINK or PBAT.