Compressed DNA Coding Using Minimum Variance Huffman Tree

被引：19

作者：

Mishra, Pooja ^{[1
]}

Bhaya, Chiranjeev ^{[1
]}

Pal, Arup Kumar ^{[1
]}

Singh, Abhay Kumar ^{[2
]}

机构：

[1] Indian Sch Mines, Indian Inst Technol, Dept Comp Sci & Engn, Dhanbad 826004, Bihar, India

[2] Indian Sch Mines, Indian Inst Technol, Dept Math & Comp, Dhanbad 826004, Bihar, India

来源：

IEEE COMMUNICATIONS LETTERS | 2020年 / 24卷 / 08期

关键词：

Compression; data storage; DNA; Huffman coding; DIGITAL INFORMATION; STORAGE; CODES;

D O I：

10.1109/LCOMM.2020.2991461

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

DNA data storage is a highly emerging technology of storing large amount of data in a small volume for a long period of time. However, synthesis of DNA sequences come with a cost that depends on the number of nucleotides present in it. An efficient algorithm to store large amount of data in small number of nucleotides has been proposed which uses minimum-variance Huffman coding. The DNA sequences generated follow GC-constraint and run-length constraint of at most 1. Texts have been stored in lossless manner. Images have been stored in both lossless and lossy manner. In either of the cases, a high code-rate has been attained, thus implying good compression and reduction in cost of synthesis.

引用

页码：1602 / 1606

页数：5

共 50 条

[41] Mean-variance model based on filters of minimum spanning tree
Huang, Feixue
Sun, Lei
Wang, Yun
JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING, 2011, 20 (04) : 495 - 506
[42] MEAN-VARIANCE MODEL BASED ON FILTERS OF MINIMUM SPANNING TREE
Feixue HUANG1 Lei SUN2 Yun WANG3 1Economics School
JournalofSystemsScienceandSystemsEngineering, 2011, 20 (04) : 495 - 506
[43] Voicing Class Dependent Huffman Coding of Compressed Front-End Feature Vector for Distributed Speech Recognition
Kim, Deok Su
Kim, Hong Kook
2008 SECOND INTERNATIONAL CONFERENCE ON FUTURE GENERATION COMMUNICATION AND NETWORKING SYMPOSIA, VOLS 1-5, PROCEEDINGS, 2008, : 218 - 221
[44] Clusterhead Selection using Huffman Coding Algorithm for Wireless Sensor Networks
Potthuri, Sweta
Shankar, T.
Rajesh, A.
2015 INTERNATIONAL CONFERENCE ON INNOVATIONS IN INFORMATION, EMBEDDED AND COMMUNICATION SYSTEMS (ICIIECS), 2015,
[45] QUAD-TREE PARTITIONED COMPRESSED SENSING FOR DEPTH MAP CODING
Liu, Ying
Vijayanagar, Krishna Rao
Kim, Joohee
2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2014,
[46] Anomaly Detection in Audio With Concept Drift Using Dynamic Huffman Coding
Kumari, Pratibha
Saini, Mukesh
IEEE SENSORS JOURNAL, 2022, 22 (17) : 17126 - 17138
[47] Efficient Compression of Secured Images using Subservient Data and Huffman Coding
Kasmeera, K. S.
James, Shine P.
Sreekumar, K.
1ST GLOBAL COLLOQUIUM ON RECENT ADVANCEMENTS AND EFFECTUAL RESEARCHES IN ENGINEERING, SCIENCE AND TECHNOLOGY - RAEREST 2016, 2016, 25 : 60 - 67
[48] A Hybrid Technique for Quadrant Based Data Hiding Using Huffman Coding
Keerthy, Venkata S.
Kishore, Rhishi T. K. C.
Karlhikeyan, B.
Vaithiyanathan, V.
Raj, Anishin M. M.
2015 INTERNATIONAL CONFERENCE ON INNOVATIONS IN INFORMATION, EMBEDDED AND COMMUNICATION SYSTEMS (ICIIECS), 2015,
[49] Study on constructing generalized decision tree by using DNA coding genetic algorithm
Du Haizhou
Ma Chong
WISM: 2009 INTERNATIONAL CONFERENCE ON WEB INFORMATION SYSTEMS AND MINING, PROCEEDINGS, 2009, : 163 - +
[50] Lightweight Data Compression in Wireless Sensor Networks Using Huffman Coding
Medeiros, Henry Ponti
Maciel, Marcos Costa
Souza, Richard Demo
Pellenz, Marcelo Eduardo
INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2014,

← 1 2 3 4 5 →