Referential DNA sequence compressing method and system

Abstract

The invention provides a referential DAN sequence compressing method and system. The method comprises the step of matching repeated patterns, namely, creating an inverted full-text subsequence structure based on an input reference sequence, and performing the longest matching subsequence searching on the input sequence to be compressed, wherein the matching information is applied to the compressed encoding step, and the unmatched symbols are applied to the step of predictive encoding of non-repeated symbols; the step of compressed encoding step, namely, performing compressed encoding on the matching sequence length and location information, wherein the encoding information is applied to decompressing; the step of predictive encoding of non-repeated symbols, namely, receiving unmatched symbols in the step of matching the repeated patterns, and predicting the symbol occurrence probability and encoding through a mixed context model. According to the method, the properties of efficient searching of index data and efficient compressing of the mixed context model to single symbol are fully combined, so that when being compared with that of other referential DNA sequence methods, the compressing rate is high within the acceptable compressing time consumption; the method is high in practicability.

Description

technical field [0001] The invention relates to a DNA sequence compression system, in particular to a reference DNA sequence compression method and system based on a Full-text index structure and a mixed context prediction model. Background technique [0002] DNA molecules are composed of four deoxyribonucleotides: adenine (A), guanine (G), cytosine (C), and thymine (T). The DNA sequence contains the important genetic information of the living body, which is of great significance to the fields of biology, medicine and information. With the development of DNA sequencing technology, more and more DNA data has been stored and utilized, and the number of DNA sequences has grown exponentially. However, the growth rate of data storage capacity is far lower than the growth rate of data. Insufficient data storage space has become an unavoidable real challenge in the process of scientific development. Therefore, how to efficiently store DNA data has become a concern of many researc...

AI Technical Summary

Problems solved by technology

However, this method gives the length of the subsequence when searching for repeats, so it cannot make full use of the repetitive nature of DNA sequences.

The high redundancy between DNA sequences and the insufficiency of current compression algorithms make the applicant find a more effective compression method for DNA sequence compression

Images