{'fraction_non_alphanumeric': 0.02155576382380506, 'fraction_numerical': 0.006560449859418931, 'mean_word_length': 5.2823529411764705, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Towards block-based compression of genomic data with random access functionality

Current algorithms for compressing genomic data mostly focus on achieving high levels of effectiveness and reasonable levels of efficiency, ignoring the need for features such as random access and stream processing. Therefore, in this paper, we introduce a novel framework for compressing genomic data, with the aim of allowing for a better trade-off between effectiveness, efficiency and functionality. To that end, we draw upon concepts taken from the area of media data processing. In particular, we propose to compress genomic data as small blocks of data, using encoding tools that predict the nucleotides and that correct the prediction made by storing a residue. We also propose two techniques that facilitate random access. Our experimental results demonstrate that the compression effectiveness of the proposed approach is up to 1.91 bits per nucleotide, which is significantly better than binary encoding (3 bits per nucleotide) and Huffman coding (2.21 bits per nucleotide).