DDQR (dynamic DNA QR coding): An efficient algorithm to represent DNA barcode sequences.

Abstract

A DNA barcode is a short piece of standard DNA sequence used for species determination and discrimination. Representation of DNA barcodes is essential for DNA barcodes' applications in the transportation and recognition of biological materials. Previously, we have compared different strategies for representing the DNA barcodes. In the present study, we have developed a compression algorithm based on binary coding or Huffman coding scheme, followed by converting the binary digits into Base64 digits. The combination of this compression algorithm and the QR representation leads to the dynamic DNA QR coding algorithm (DDQR). We tested the DDQR algorithm on simulated data and real DNA barcode sequences from the commonly used plant and animal DNA barcode markers: rbcL, matK, trnH-psbA, ITS2, and COI. We compared the compression efficiency of DDQR and another state-of-the-art DNA compression algorithm GeCo3 for sequences with various base compositions and lengths. We found that DDQR had a higher compression rate than GeCo3 for DNA sequences shorter than 800 bp, which is the typical size range for DNA barcodes. We also upgraded a web server (http://www.1kmpg.cn/ddqr) that provides three functions: retrieval of DNA barcode sequences, encoding DNA barcode sequences to DDQR codes, and decoding DDQR codes to DNA barcode sequences. The DDQR algorithm and the webserver will be invaluable to applying DNA barcode technology in the food and traditional medicine industries.