• SYED MAHAMUD HOSSEIN
• Subhajit Das

Storing and transmitting of DNA and RNA sequences is a well known research challenge. The problem has got magnified with increasing discovery and availability of DNA and RNA sequences. The paper represent a new DNA sequence compression algorithm that is based on two Look Up Table, first LUT tables consists of factorial of 4 bases that is 24 sub-sting, each sub-sting is of 4 bases long and another table consists of 43(64) bases that is 64 sub-sting , each sub-string is of 3 bases long. The sub-strings are combined into a two Look up Table based pre-coding routine. The technique can approach a compression rate of 2.6 bits /base and even lower. Information security is the most challenging question to protect the data from unauthorized user. The proposed method may protect the data from hackers. Compression of the genome sequences will help to increase the efficiency of their use. The biggest advantage of this algorithm is fast execution, small memory occupation and easy implementation. Since the program to implement the technique have been written originally in the C language, (Windows platform, and TC compiler) it is possible to run in other microcomputers with small changes (depending on platform and Compiler used). The program runs on the IBM personal computer, requires 512K main memory, without additional hardware except for disk drives and printer. The execution is quite fas, all the operations are carried out in fraction of seconds, depending on the required task and on the sequence length.

Biology and genetics, Data Compaction and Compression

"A Compression Algorithm for DNA Sequences based on two LOOK UP TABLEs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.11, Issue 6, page no.h608-h614, June-2024, Available :http://www.jetir.org/papers/JETIR2406764.pdf

"A Compression Algorithm for DNA Sequences based on two LOOK UP TABLEs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.11, Issue 6, page no. pph608-h614, June-2024, Available at : http://www.jetir.org/papers/JETIR2406764.pdf