IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0279994.html
   My bibliography  Save this article

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

Author

Listed:
  • Yujun Wang
  • Xinjing Yao
  • Rui Liu
  • Chang Liu

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.

Suggested Citation

  • Yujun Wang & Xinjing Yao & Rui Liu & Chang Liu, 2023. "DDQR (dynamic DNA QR coding): An efficient algorithm to represent DNA barcode sequences," PLOS ONE, Public Library of Science, vol. 18(1), pages 1-14, January.
    • Handle: RePEc:plo:pone00:0279994
    DOI: 10.1371/journal.pone.0279994
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0279994
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0279994&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0279994?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0279994. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.