Design of DNA Storage Coding with Enhanced Constraints

Traditional storage media have been gradually unable to meet the needs of data storage around the world, and one solution to this problem is DNA storage. However, it is easy to make errors in the subsequent sequencing reading process of DNA storage coding. To reduces error rates, a method to enhance...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Entropy (Basel, Switzerland) Ročník 24; číslo 8; s. 1151
Hlavní autoři: Li, Xiangjun, Zhou, Shihua, Zou, Lewang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Switzerland MDPI AG 19.08.2022
MDPI
Témata:
ISSN:1099-4300, 1099-4300
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Traditional storage media have been gradually unable to meet the needs of data storage around the world, and one solution to this problem is DNA storage. However, it is easy to make errors in the subsequent sequencing reading process of DNA storage coding. To reduces error rates, a method to enhance the robustness of the DNA storage coding set is proposed. Firstly, to reduce the likelihood of secondary structure in DNA coding sets, a repeat tandem sequence constraint is proposed. An improved DTW distance constraint is proposed to address the issue that the traditional distance constraint cannot accurately evaluate non-specific hybridization between DNA sequences. Secondly, an algorithm that combines random opposition-based learning and eddy jump strategy with Aquila Optimizer (AO) is proposed in this paper, which is called ROEAO. Finally, the ROEAO algorithm is used to construct the coding sets with traditional constraints and enhanced constraints, respectively. The quality of the two coding sets is evaluated by the test of the number of issuing card structures and the temperature stability of melting; the data show that the coding set constructed with ROEAO under enhanced constraints can obtain a larger lower bound while improving the coding quality.
AbstractList Traditional storage media have been gradually unable to meet the needs of data storage around the world, and one solution to this problem is DNA storage. However, it is easy to make errors in the subsequent sequencing reading process of DNA storage coding. To reduces error rates, a method to enhance the robustness of the DNA storage coding set is proposed. Firstly, to reduce the likelihood of secondary structure in DNA coding sets, a repeat tandem sequence constraint is proposed. An improved DTW distance constraint is proposed to address the issue that the traditional distance constraint cannot accurately evaluate non-specific hybridization between DNA sequences. Secondly, an algorithm that combines random opposition-based learning and eddy jump strategy with Aquila Optimizer (AO) is proposed in this paper, which is called ROEAO. Finally, the ROEAO algorithm is used to construct the coding sets with traditional constraints and enhanced constraints, respectively. The quality of the two coding sets is evaluated by the test of the number of issuing card structures and the temperature stability of melting; the data show that the coding set constructed with ROEAO under enhanced constraints can obtain a larger lower bound while improving the coding quality.Traditional storage media have been gradually unable to meet the needs of data storage around the world, and one solution to this problem is DNA storage. However, it is easy to make errors in the subsequent sequencing reading process of DNA storage coding. To reduces error rates, a method to enhance the robustness of the DNA storage coding set is proposed. Firstly, to reduce the likelihood of secondary structure in DNA coding sets, a repeat tandem sequence constraint is proposed. An improved DTW distance constraint is proposed to address the issue that the traditional distance constraint cannot accurately evaluate non-specific hybridization between DNA sequences. Secondly, an algorithm that combines random opposition-based learning and eddy jump strategy with Aquila Optimizer (AO) is proposed in this paper, which is called ROEAO. Finally, the ROEAO algorithm is used to construct the coding sets with traditional constraints and enhanced constraints, respectively. The quality of the two coding sets is evaluated by the test of the number of issuing card structures and the temperature stability of melting; the data show that the coding set constructed with ROEAO under enhanced constraints can obtain a larger lower bound while improving the coding quality.
Traditional storage media have been gradually unable to meet the needs of data storage around the world, and one solution to this problem is DNA storage. However, it is easy to make errors in the subsequent sequencing reading process of DNA storage coding. To reduces error rates, a method to enhance the robustness of the DNA storage coding set is proposed. Firstly, to reduce the likelihood of secondary structure in DNA coding sets, a repeat tandem sequence constraint is proposed. An improved DTW distance constraint is proposed to address the issue that the traditional distance constraint cannot accurately evaluate non-specific hybridization between DNA sequences. Secondly, an algorithm that combines random opposition-based learning and eddy jump strategy with Aquila Optimizer (AO) is proposed in this paper, which is called ROEAO. Finally, the ROEAO algorithm is used to construct the coding sets with traditional constraints and enhanced constraints, respectively. The quality of the two coding sets is evaluated by the test of the number of issuing card structures and the temperature stability of melting; the data show that the coding set constructed with ROEAO under enhanced constraints can obtain a larger lower bound while improving the coding quality.
Audience Academic
Author Li, Xiangjun
Zou, Lewang
Zhou, Shihua
AuthorAffiliation Key Laboratory of Advanced Design and Intelligent Computing, Ministry of Education, Dalian University, Dalian 116622, China
AuthorAffiliation_xml – name: Key Laboratory of Advanced Design and Intelligent Computing, Ministry of Education, Dalian University, Dalian 116622, China
Author_xml – sequence: 1
  givenname: Xiangjun
  surname: Li
  fullname: Li, Xiangjun
– sequence: 2
  givenname: Shihua
  surname: Zhou
  fullname: Zhou, Shihua
– sequence: 3
  givenname: Lewang
  surname: Zou
  fullname: Zou, Lewang
BackLink https://www.ncbi.nlm.nih.gov/pubmed/36010815$$D View this record in MEDLINE/PubMed
BookMark eNptkstuUzEQhi1URC-w4AXQkdjAIu34Hm-QorRApQoWdG_5-HLi6MQu9gmIt8dpStRWyAtb42_-8e-ZU3SUcvIIvcVwTqmCC08YzDHm-AU6waDUjFGAo0fnY3Ra6xqAUILFK3RMBeCWwU-QuPQ1DqnLobv8tuh-TLmYwXfL7GIaut9xWnVXaWWS9a4FU52KiWmqr9HLYMbq3zzsZ-j289Xt8uvs5vuX6-XiZmYZnU8zA4LxEDj0RBnuGXacCUfmYe77OVE9cCKxJ02cQm8cccIZSimYYDmThp6h672sy2at70rcmPJHZxP1fSCXQZsyRTt67bAy1DKLnekZ7pVhmAdMpVAEAnG0aX3aa91t-4131qfmZXwi-vQmxZUe8i-tGEgOogl8eBAo-efW10lvYrV-HE3yeVs1kSAFcAW7Wu-foeu8Lan91I4SWCp5T53vqcE0AzGF3OratpzfRNtaHGKLLyTjEhQW0BLePbZwePu_djbg4x6wJddafDggGPRuVPRhVBp78Yy1cTJTzDv3cfxPxl9yfLx7
CitedBy_id crossref_primary_10_3390_e26121116
crossref_primary_10_1109_TNB_2024_3356522
crossref_primary_10_1109_TMBMC_2024_3400794
crossref_primary_10_3390_e26090778
Cites_doi 10.1109/TCBB.2021.3127271
10.1016/j.eswa.2020.113338
10.1023/A:1008202821328
10.1038/s41598-019-43105-w
10.1016/j.procs.2016.05.398
10.2144/000113218
10.1016/j.advengsoft.2016.01.008
10.1038/nbt.4079
10.1109/LCOMM.2018.2861867
10.1109/LCOMM.2018.2866566
10.1038/s41598-019-45832-6
10.1371/journal.pone.0255376
10.1016/j.engappai.2022.104805
10.1073/pnas.2004821117
10.1007/b94864
10.3390/polym10010028
10.1016/j.eswa.2020.113377
10.1073/pnas.84.14.4767
10.1145/2872362.2872397
10.1016/j.advengsoft.2013.12.007
10.1109/TCBB.2020.3011582
10.1007/978-3-030-61081-4
10.1126/science.1226355
10.1038/srep14138
10.1002/smtd.202001094
10.1016/j.future.2019.02.028
10.1038/nature11875
10.1109/TIT.2017.2700847
10.1109/LCOMM.2019.2912572
10.1109/TIT.2018.2792488
10.1109/TNB.2021.3121278
10.1002/smtd.202101335
10.1080/00043249.1996.10791743
10.1007/s13205-019-1868-4
10.1002/anie.201411378
10.1038/s41587-019-0240-x
10.1016/j.cie.2021.107250
10.1016/j.ffa.2015.10.008
10.1126/science.aaj2038
10.1016/j.swevo.2011.02.002
ContentType Journal Article
Copyright COPYRIGHT 2022 MDPI AG
2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
2022 by the authors. 2022
Copyright_xml – notice: COPYRIGHT 2022 MDPI AG
– notice: 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
– notice: 2022 by the authors. 2022
DBID AAYXX
CITATION
NPM
7TB
8FD
8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FR3
HCIFZ
KR7
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
7X8
5PM
DOA
DOI 10.3390/e24081151
DatabaseName CrossRef
PubMed
Mechanical & Transportation Engineering Abstracts
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni Edition)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central Korea
Engineering Research Database
SciTech Premium Collection
Civil Engineering Abstracts
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
MEDLINE - Academic
PubMed Central (Full Participant titles)
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
PubMed
Publicly Available Content Database
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Central Essentials
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Engineering Collection
Civil Engineering Abstracts
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
MEDLINE - Academic
DatabaseTitleList MEDLINE - Academic


CrossRef
PubMed
Publicly Available Content Database

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: NPM
  name: PubMed
  url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 3
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
EISSN 1099-4300
ExternalDocumentID oai_doaj_org_article_d19a3c4c1dab41b9a415f1376920f2d3
PMC9407506
A745709160
36010815
10_3390_e24081151
Genre Journal Article
GrantInformation_xml – fundername: Scientific Research Fund of Liaoning Provincial Education Department
  grantid: LJKZ1186
– fundername: National Key Technology R&D Program of China
  grantid: 2018YFC0910500
– fundername: Liao Ning Revitalization Talents Program
  grantid: XLYC2008017
– fundername: Innovation and Entrepreneurship Team of Dalian University
  grantid: XQN202008
– fundername: National Natural Science Foundation of China
  grantid: 61425002, 61751203, 61772100, 61972266, 61802040
– fundername: Natural Science Foundation of Liaoning Province
  grantid: 2021-MS-344, 2021-KF-11-03
– fundername: National Natural Science Foundation of China
  grantid: 61425002; 61751203; 61772100; 61972266; 61802040
– fundername: Natural Science Foundation of Liaoning Province
  grantid: 2021-MS-344; 2021-KF-11-03
– fundername: Dalian University Scientific Research Platform Program
  grantid: 202101YB02
GroupedDBID 29G
2WC
5GY
5VS
8FE
8FG
AADQD
AAFWJ
AAYXX
ABDBF
ABJCF
ACIWK
ACUHS
ADBBV
AEGXH
AENEX
AFFHD
AFKRA
AFPKN
AFZYC
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BENPR
BGLVJ
CCPQU
CITATION
CS3
DU5
E3Z
ESX
F5P
GROUPED_DOAJ
GX1
HCIFZ
HH5
IAO
ITC
J9A
KQ8
L6V
M7S
MODMG
M~E
OK1
OVT
PGMZT
PHGZM
PHGZT
PIMPY
PQGLB
PROAC
PTHSS
RNS
RPM
TR2
TUS
XSB
~8M
NPM
7TB
8FD
ABUWG
AZQEC
DWQXO
FR3
KR7
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
7X8
5PM
ID FETCH-LOGICAL-c438t-a0645ff50b29a5e41d546d28f8eb829b05271e2ced30bad2d6da3330afc547a3
IEDL.DBID M7S
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000847001800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1099-4300
IngestDate Mon Nov 10 04:29:07 EST 2025
Tue Nov 04 01:57:59 EST 2025
Sun Nov 09 11:54:50 EST 2025
Fri Jul 25 12:03:14 EDT 2025
Tue Nov 04 18:16:19 EST 2025
Thu Jan 02 22:29:59 EST 2025
Tue Nov 18 21:29:46 EST 2025
Sat Nov 29 07:13:16 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 8
Keywords coding enhancement constraint
DNA coding design
DNA storage
Aquila Optimizer
Language English
License Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c438t-a0645ff50b29a5e41d546d28f8eb829b05271e2ced30bad2d6da3330afc547a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
OpenAccessLink https://www.proquest.com/docview/2706179703?pq-origsite=%requestingapplication%
PMID 36010815
PQID 2706179703
PQPubID 2032401
ParticipantIDs doaj_primary_oai_doaj_org_article_d19a3c4c1dab41b9a415f1376920f2d3
pubmedcentral_primary_oai_pubmedcentral_nih_gov_9407506
proquest_miscellaneous_2707605903
proquest_journals_2706179703
gale_infotracacademiconefile_A745709160
pubmed_primary_36010815
crossref_primary_10_3390_e24081151
crossref_citationtrail_10_3390_e24081151
PublicationCentury 2000
PublicationDate 20220819
PublicationDateYYYYMMDD 2022-08-19
PublicationDate_xml – month: 8
  year: 2022
  text: 20220819
  day: 19
PublicationDecade 2020
PublicationPlace Switzerland
PublicationPlace_xml – name: Switzerland
– name: Basel
PublicationTitle Entropy (Basel, Switzerland)
PublicationTitleAlternate Entropy (Basel)
PublicationYear 2022
Publisher MDPI AG
MDPI
Publisher_xml – name: MDPI AG
– name: MDPI
References Yazdi (ref_14) 2018; 64
Heckel (ref_23) 2019; 9
Tabor (ref_29) 1987; 84
Hong (ref_9) 2016; 37
Mirjalili (ref_40) 2016; 95
Press (ref_24) 2020; 117
Li (ref_31) 2009; 6
Ren (ref_27) 2022; 6
ref_34
ref_11
Gabrys (ref_12) 2017; 63
ref_33
Davis (ref_3) 1996; 55
Song (ref_18) 2018; 22
Zhang (ref_20) 2019; 9
Organick (ref_26) 2021; 5
Faramarzi (ref_35) 2020; 152
Derrac (ref_43) 2011; 1
Limbachiya (ref_17) 2018; 22
Erlich (ref_13) 2017; 355
ref_16
Chen (ref_36) 2022; 111
ref_37
Heidari (ref_41) 2019; 97
Organick (ref_15) 2018; 36
Grass (ref_8) 2015; 54
Choi (ref_19) 2019; 9
Khishe (ref_42) 2020; 149
Wang (ref_22) 2019; 23
Yuan (ref_30) 2015; 5
Blawat (ref_10) 2016; 80
ref_25
Anavy (ref_21) 2019; 37
ref_44
Cao (ref_28) 2020; 19
Goldman (ref_7) 2013; 494
Mirjalili (ref_39) 2014; 69
Wu (ref_45) 2022; 21
Church (ref_6) 2012; 337
Storn (ref_38) 1997; 11
Abualigah (ref_32) 2021; 157
Ailenberg (ref_5) 2009; 47
Ganegoda (ref_1) 2016; 2016
ref_4
Neiman (ref_2) 1965; 6
References_xml – ident: ref_25
  doi: 10.1109/TCBB.2021.3127271
– volume: 149
  start-page: 113338
  year: 2020
  ident: ref_42
  article-title: Chimp optimization algorithm
  publication-title: Expert Syst. Appl.
  doi: 10.1016/j.eswa.2020.113338
– volume: 11
  start-page: 341
  year: 1997
  ident: ref_38
  article-title: Differential Evolution—A Simple and Efficient Heuristic for global Optimization over Continuous Spaces
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1008202821328
– volume: 9
  start-page: 6582
  year: 2019
  ident: ref_19
  article-title: High information capacity DNA-based data storage with augmented encoding characters using degenerate bases
  publication-title: Sci. Rep.
  doi: 10.1038/s41598-019-43105-w
– volume: 80
  start-page: 1011
  year: 2016
  ident: ref_10
  article-title: Forward Error Correction for DNA Data Storage
  publication-title: Procedia Comput. Sci.
  doi: 10.1016/j.procs.2016.05.398
– volume: 47
  start-page: 747
  year: 2009
  ident: ref_5
  article-title: An improved Huffman coding method for archiving text, images, and music characters in DNA
  publication-title: Biotechniques
  doi: 10.2144/000113218
– volume: 95
  start-page: 51
  year: 2016
  ident: ref_40
  article-title: The Whale Optimization Algorithm
  publication-title: Adv. Eng. Softw.
  doi: 10.1016/j.advengsoft.2016.01.008
– volume: 36
  start-page: 242
  year: 2018
  ident: ref_15
  article-title: Random access in large-scale DNA data storage
  publication-title: Nat. Biotechnol.
  doi: 10.1038/nbt.4079
– volume: 22
  start-page: 1972
  year: 2018
  ident: ref_17
  article-title: Family of Constrained Codes for Archival DNA Data Storage
  publication-title: IEEE Commun. Lett.
  doi: 10.1109/LCOMM.2018.2861867
– volume: 22
  start-page: 2004
  year: 2018
  ident: ref_18
  article-title: Codes With Run-Length and GC-Content Constraints for DNA-Based Data Storage
  publication-title: IEEE Commun. Lett.
  doi: 10.1109/LCOMM.2018.2866566
– volume: 9
  start-page: 9663
  year: 2019
  ident: ref_23
  article-title: A Characterization of the DNA Data Storage Channel
  publication-title: Sci. Rep.
  doi: 10.1038/s41598-019-45832-6
– ident: ref_44
  doi: 10.1371/journal.pone.0255376
– volume: 111
  start-page: 104805
  year: 2022
  ident: ref_36
  article-title: A meta-inspired termite queen algorithm for global optimization and engineering design problems
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2022.104805
– volume: 117
  start-page: 18489
  year: 2020
  ident: ref_24
  article-title: HEDGES error-correcting code for DNA storage corrects indels and allows sequence constraints
  publication-title: Proc. Natl. Acad. Sci. USA
  doi: 10.1073/pnas.2004821117
– ident: ref_4
  doi: 10.1007/b94864
– ident: ref_37
– ident: ref_16
  doi: 10.3390/polym10010028
– volume: 152
  start-page: 113377
  year: 2020
  ident: ref_35
  article-title: Marine Predators Algorithm: A Nature-inspired Metaheuristic
  publication-title: Expert Syst. Appl.
  doi: 10.1016/j.eswa.2020.113377
– volume: 84
  start-page: 4767
  year: 1987
  ident: ref_29
  article-title: DNA sequence analysis with a modified bacteriophage T7 DNA polymerase
  publication-title: Proc. Natl. Acad. Sci. USA
  doi: 10.1073/pnas.84.14.4767
– ident: ref_11
  doi: 10.1145/2872362.2872397
– volume: 69
  start-page: 46
  year: 2014
  ident: ref_39
  article-title: Grey Wolf Optimizer
  publication-title: Adv. Eng. Softw.
  doi: 10.1016/j.advengsoft.2013.12.007
– volume: 19
  start-page: 866
  year: 2020
  ident: ref_28
  article-title: Designing Uncorrelated Address Constrain for DNA Storage by DMVO Algorithm
  publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform.
  doi: 10.1109/TCBB.2020.3011582
– ident: ref_34
  doi: 10.1007/978-3-030-61081-4
– volume: 337
  start-page: 1628
  year: 2012
  ident: ref_6
  article-title: Next-Generation Digital Information Storage in DNA
  publication-title: Science
  doi: 10.1126/science.1226355
– volume: 6
  start-page: 1
  year: 1965
  ident: ref_2
  article-title: On the molecular memory systems and the directed mutations
  publication-title: Radiotekhnika
– volume: 5
  start-page: 14138
  year: 2015
  ident: ref_30
  article-title: A Rewritable, Random-Access DNA-Based Storage System
  publication-title: Sci. Rep.
  doi: 10.1038/srep14138
– volume: 5
  start-page: 2001094
  year: 2021
  ident: ref_26
  article-title: An Empirical Comparison of Preservation Methods for Synthetic DNA Data Storage
  publication-title: Small Methods
  doi: 10.1002/smtd.202001094
– volume: 97
  start-page: 849
  year: 2019
  ident: ref_41
  article-title: Harris hawks optimization: Algorithm and applications
  publication-title: Future Gener. Comput. Syst.-Int. J. Esci.
  doi: 10.1016/j.future.2019.02.028
– volume: 2016
  start-page: 8072463
  year: 2016
  ident: ref_1
  article-title: New Trends of Digital Data Storage in DNA
  publication-title: BioMed Res. Int.
– volume: 494
  start-page: 77
  year: 2013
  ident: ref_7
  article-title: Towards practical, high-capacity, low-maintenance information storage in synthesized DNA
  publication-title: Nature
  doi: 10.1038/nature11875
– ident: ref_33
– volume: 63
  start-page: 4982
  year: 2017
  ident: ref_12
  article-title: Asymmetric Lee Distance Codes for DNA-Based Storage
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2017.2700847
– volume: 23
  start-page: 963
  year: 2019
  ident: ref_22
  article-title: Construction of Bio-Constrained Code for DNA Data Storage
  publication-title: IEEE Commun. Lett.
  doi: 10.1109/LCOMM.2019.2912572
– volume: 6
  start-page: 144
  year: 2009
  ident: ref_31
  article-title: Early Abandon to Accelerate Exact Dynamic Time Warping
  publication-title: Int. Arab. J. Inf. Technol.
– volume: 64
  start-page: 6283
  year: 2018
  ident: ref_14
  article-title: Mutually Uncorrelated Primers for DNA-Based Data Storage
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2018.2792488
– volume: 21
  start-page: 184
  year: 2022
  ident: ref_45
  article-title: Enhancing Physical and Thermodynamic Properties of DNA Storage Sets With End-Constraint
  publication-title: IEEE Trans. NanoBiosci.
  doi: 10.1109/TNB.2021.3121278
– volume: 6
  start-page: 2101335
  year: 2022
  ident: ref_27
  article-title: DNA-Based Concatenated Encoding System for High-Reliability and High-Density Data Storage
  publication-title: Small Methods
  doi: 10.1002/smtd.202101335
– volume: 55
  start-page: 70
  year: 1996
  ident: ref_3
  article-title: Microvenus
  publication-title: Art J.
  doi: 10.1080/00043249.1996.10791743
– volume: 9
  start-page: 342
  year: 2019
  ident: ref_20
  article-title: A high storage density strategy for digital information based on synthetic DNA
  publication-title: 3 Biotech.
  doi: 10.1007/s13205-019-1868-4
– volume: 54
  start-page: 2552
  year: 2015
  ident: ref_8
  article-title: Robust Chemical Preservation of Digital Information on DNA in Silica with Error-Correcting Codes
  publication-title: Angew. Chem.-Int. Ed.
  doi: 10.1002/anie.201411378
– volume: 37
  start-page: 1229
  year: 2019
  ident: ref_21
  article-title: Data storage in DNA with fewer synthesis cycles using composite DNA letters
  publication-title: Nat. Biotechnol.
  doi: 10.1038/s41587-019-0240-x
– volume: 157
  start-page: 107250
  year: 2021
  ident: ref_32
  article-title: Aquila Optimizer: A novel meta-heuristic optimization algorithm
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2021.107250
– volume: 37
  start-page: 328
  year: 2016
  ident: ref_9
  article-title: Construction of DNA codes by using algebraic number theory
  publication-title: Finite Fields Appl.
  doi: 10.1016/j.ffa.2015.10.008
– volume: 355
  start-page: 950
  year: 2017
  ident: ref_13
  article-title: DNA Fountain enables a robust and efficient storage architecture
  publication-title: Science
  doi: 10.1126/science.aaj2038
– volume: 1
  start-page: 3
  year: 2011
  ident: ref_43
  article-title: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
  publication-title: Swarm Evol. Comput.
  doi: 10.1016/j.swevo.2011.02.002
SSID ssj0023216
Score 2.3097055
Snippet Traditional storage media have been gradually unable to meet the needs of data storage around the world, and one solution to this problem is DNA storage....
SourceID doaj
pubmedcentral
proquest
gale
pubmed
crossref
SourceType Open Website
Open Access Repository
Aggregation Database
Index Database
Enrichment Source
StartPage 1151
SubjectTerms Algorithms
Aquila Optimizer
Codes
coding enhancement constraint
Computer storage devices
Data storage
DNA
DNA coding design
DNA sequencing
DNA storage
Error correction & detection
Error reduction
Gene sequencing
Genetic research
Hard disks
Hybridization
Lower bounds
Machine learning
Nucleotide sequencing
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LixQxEA6yePAiiq_WXYki6KXZdJ6d4-wLT4PgHvYW8mQXpEd2Zv39VqV7mmkUvHjpQ6doKvVIVXWSrwj5xFQqIuTUJgEPMArb-qREazhLCKYChh1qswmzXvc3N_bbQasvPBM2wgOPgjtNnfUiytglH2QXrIeIUzpwC8tZ4anifDJj98XUVGoJ3ukRR0hAUX-aEcgLcp9uEX0qSP-fS_FBLFqekzwIPFfPyNMpY6SrkdPn5FEeXhB9UU9e0E2hF-sV_Q6VMywM9HyDoYjiz1V6OdzW3X2KPTlrJ4jd9iW5vrq8Pv_aTi0Q2ihFv2s9wsmVoljg1qssu6SkTrwvfQ49t4EpbrrM4WOCBZ940skLIZgvUUnjxStyNGyG_IZQLyFTSzqqPgQo4mwftS1Zshiy9jaLhnzZS8bFCR4cefvhoExAIbpZiA35OJP-HDEx_kZ0huKdCRDGur4A5bpJue5fym3IZ1SOQ2cDZqKf7gzAlBC2yq2MVAYyHs0acrzXn5u8cOu4wQTNwqLWkA_zMPgPbor4IW8eKo3ReAMXaF6P6p55Flit9p1qiFkYwmJSy5Hh7rZidFuJuZh--z-k8I484XjpAoF47TE52t0_5BPyOP7a3W3v31fD_w1Yngc1
  priority: 102
  providerName: Directory of Open Access Journals
Title Design of DNA Storage Coding with Enhanced Constraints
URI https://www.ncbi.nlm.nih.gov/pubmed/36010815
https://www.proquest.com/docview/2706179703
https://www.proquest.com/docview/2707605903
https://pubmed.ncbi.nlm.nih.gov/PMC9407506
https://doaj.org/article/d19a3c4c1dab41b9a415f1376920f2d3
Volume 24
WOSCitedRecordID wos000847001800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1099-4300
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0023216
  issn: 1099-4300
  databaseCode: DOA
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1099-4300
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0023216
  issn: 1099-4300
  databaseCode: M~E
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1099-4300
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0023216
  issn: 1099-4300
  databaseCode: M7S
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1099-4300
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0023216
  issn: 1099-4300
  databaseCode: BENPR
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1099-4300
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0023216
  issn: 1099-4300
  databaseCode: PIMPY
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9NAEF7RlgMXHuLlUiKDkOBi1fv2nlDapoIDUUR7CCdrX24rIbskaY_8dmY2jmkE4sLFB-_IGnve69lvCHlXytBwF0MROFxAKUxhg-SFZmVAMBVQbJeGTejptJrPzazfcFv2bZUbn5gcdeg87pEfMo3B1oCCfrz-UeDUKPy72o_Q2CF7iJJAU-ve2VBwcUbVGk2IQ2l_GBHOCzIguhWDElT_nw75TkTa7pa8E35OH_0v44_Jwz7xzMdrTXlC7sX2KVEnqYEj75r8ZDrOz6AAB_-SH3cY0XLco80n7WVqEshxtGcaKLFaPiPnp5Pz409FP0mh8IJXq8IiKl3TyNIxY2UUNEihAquaKrqKGVdKpmlk8DBeOhtYUMFyzkvbeCm05c_Jbtu18SXJrYCELygvK-egFjSVV6aJovQuKmsiz8iHzaetfY8yjrx9r6HaQCnUgxQy8nYgvV5Da_yN6AjlMxAgGna60S0u6t646kCN5V54GqwT1BkLWUlDwXUaVjYsAFPvUbo12iww421_9ABeCdGv6rEWUkPipMqMHGyEWPfGvKx_SzAjb4ZlMEP8t2Lb2N0kGq3wIC_QvFjry8Azx6K3ojIjekuTtl5qe6W9ukxQ30ZgSqf2_83WK_KA4akMROo1B2R3tbiJr8l9f7u6Wi5GZEfPqxHZO5pMZ19HadNhlOwErz8nsDL7_GX27ReuIBuw
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwELZKQYILD_FKKWAQCC5RE9t5-IDQ0m3VqmWF1D30ZvmVthJK2t0tiB_Ff2TGedAIxK0HLjnEo2gcf5mHM_6GkDdJ5ipuvIsdhwuAQsbaZTwuWOKQTAWAbUKziWI2K4-P5Zc18rM_C4Nllb1NDIbaNRb3yLdYgc5WAkA_nl_E2DUK_672LTRaWBz4H98hZVt-2J_C-r5lbHdnvr0Xd10FYit4uYo1MrRVVZYYJnXmReoykTtWVqU3JZMmyViRema944nRjrncaQ5Zv65sJgrN4bE3yE2IIpgMlYJHQ37HWZq35EWcy2TLI3sYBFzpyOWFzgB_2v8rDnBcnHnF2-3e-8_e031ytwur6aT9Dh6QNV8_JPk0lKfQpqLT2YQerQDuJ55uN-ivKe5A0536NJRAUGxcGtplrJaPyPw6NH1M1uum9k8J1QLCWZfbrDQGMl1Z2lxWXiTW-FxLzyPyvl9JZTsOddTtq4JcChddDYsekdeD6HlLHPI3oU8Ih0EAub7DjWZxojrToVwqNbfCpk4bkRqpIeaqUnAMkiUVc6DUOwSTQosEyljdHayAKSG3l5oUIisgLMyTiGz2mFGdqVqq34CJyKthGIwM_jnStW8ug0yR4zFlkHnSwnPQmWNKX6ZZRIoRcEeTGo_UZ6eByFwKDFjzjX-r9ZLc3pt_PlSH-7ODZ-QOw_MnyEksN8n6anHpn5Nb9tvqbLl4ET5HStQ1w_oX3AFyPg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VFCEuPMQrpYBBILhYsXfXjz0gFJpGRIUoEj2U02pfbishu01SED-Nf8eMXzQCceuBiw_ekTVrfzuP9ew3AC-jxBXceBc6jhcEhQy1S3iYscgRmQoC29TNJrL5PD86kost-NmdhaGyys4m1obaVZb2yEcsI2crEaCjoi2LWEym787OQ-ogRX9au3YaDUQO_I_vmL6t3s4m-K1fMTbdP9z7ELYdBkIreL4ONbG1FUUSGSZ14kXsEpE6lhe5NzmTJkpYFntmveOR0Y651GnOeaQLm4hMc3zsNdjGiFywAWwvZp8WX_psj7M4baiMOJfRyBOXGIZf8YYDrPsE_OkNLrnDzVLNS75vevs_fmt34FYbcAfjZoXchS1f3oN0UheuBFURTObj4PMaF8KxD_Yq8uQB7U0H--VJXRwRUEvTupHGenUfDq9C0wcwKKvSP4JACwx0XWqT3BjMgWVuU1l4EVnjUy09H8Kb7qsq27Krk25fFWZZBADVA2AIL3rRs4ZS5G9C7wkavQCxgNc3quWxao2KcrHU3AobO21EbKTGaKyI0WVIFhXMoVKvCViKbBUqY3V75AKnRKxfapyJJMOAMY2GsNvhR7VGbKV-g2cIz_thND_0T0mXvrqoZbKUDjCjzMMGqr3OnJL9PE6GkG2AeGNSmyPl6UlNcS4FhbLpzr_VegY3EM3q42x-8BhuMjqYQmTFchcG6-WFfwLX7bf16Wr5tF2bAagrxvUvk2l8dA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Design+of+DNA+Storage+Coding+with+Enhanced+Constraints&rft.jtitle=Entropy+%28Basel%2C+Switzerland%29&rft.au=Li%2C+Xiangjun&rft.au=Zhou%2C+Shihua&rft.au=Zou%2C+Lewang&rft.date=2022-08-19&rft.pub=MDPI+AG&rft.eissn=1099-4300&rft.volume=24&rft.issue=8&rft.spage=1151&rft_id=info:doi/10.3390%2Fe24081151&rft.externalDBID=HAS_PDF_LINK
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1099-4300&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1099-4300&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1099-4300&client=summon