The invention relates to a Leon-RC compression method for genome sequencing data, which mainly improves the steps of constructing an anchor dictionary by the LEON algorithm, including the following steps: (1) dividing short reads into multiple Kmers; (2) selecting one Kmer, calculate the Kmer value of its direct repetition, mirror repetition, inverted repetition, and complementary palindrome, compare these four values, and obtain the smallest Kmer value; (3) Put the smallest Kmer value into the Bloom filter for matching Search, Solid Kmer is stored in the Bloom filter, and judge whether there is a minimum Kmer value in Solid Kmer; if it exists, add the minimum Kmer value to the anchor dictionary and end the search; if not, obtain the next One Kmer, repeat steps (2), (3); (4) If the minimum Kmer value of all Kmers does not exist in Solid Kmer, it means that there is no anchor point for this short read; (5) Pass step (1) ~(4) Construct the anchor dictionary.