High Net Information Density DNA Data Storage by the MOPE Encoding Algorithm

DNA has recently been recognized as an attractive storage medium due to its high reliability, capacity, and durability. However, encoding algorithms that simply map binary data to DNA sequences have the disadvantages of low net information density and high synthesis cost. Therefore, this paper propo...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on computational biology and bioinformatics Jg. 20; H. 5; S. 2992 - 3000
Hauptverfasser:	Zheng, Yanfen, Cao, Ben, Wu, Jieqiong, Wang, Bin, Zhang, Qiang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	United States IEEE 01.09.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Binary data Convergence Data storage Density DNA DNA biosynthesis DNA sequencing DNA storage Durability Encoding Lower bounds Mating Media Memory MOPE encoding algorithm non-payload coding set Nucleotide sequence Nucleotides payload encoding algorithm Payloads Sequential analysis Synthesis Theoretical analysis
ISSN:	1545-5963, 1557-9964, 1557-9964
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	DNA has recently been recognized as an attractive storage medium due to its high reliability, capacity, and durability. However, encoding algorithms that simply map binary data to DNA sequences have the disadvantages of low net information density and high synthesis cost. Therefore, this paper proposes an efficient, feasible, and highly robust encoding algorithm called MOPE (Modified Barnacles Mating Optimizer and Payload Encoding). The Modified Barnacles Mating Optimizer (MBMO) algorithm is used to construct the non-payload coding set, and the Payload Encoding (PE) algorithm is used to encode the payload. The results show that the lower bound of the non-payload coding set constructed by the MBMO algorithm is 3%-18% higher than the optimal result of previous work, and theoretical analysis shows that the designed PE algorithm has a net information density of 1.90 bits/nt, which is close to the ideal information capacity of 2 bits per nucleotide. The proposed MOPE encoding algorithm with high net information density and satisfying constraints can not only effectively reduce the cost of DNA synthesis and sequencing but also reduce the occurrence of errors during DNA storage.
AbstractList	DNA has recently been recognized as an attractive storage medium due to its high reliability, capacity, and durability. However, encoding algorithms that simply map binary data to DNA sequences have the disadvantages of low net information density and high synthesis cost. Therefore, this paper proposes an efficient, feasible, and highly robust encoding algorithm called MOPE (Modified Barnacles Mating Optimizer and Payload Encoding). The Modified Barnacles Mating Optimizer (MBMO) algorithm is used to construct the non-payload coding set, and the Payload Encoding (PE) algorithm is used to encode the payload. The results show that the lower bound of the non-payload coding set constructed by the MBMO algorithm is 3%-18% higher than the optimal result of previous work, and theoretical analysis shows that the designed PE algorithm has a net information density of 1.90 bits/nt, which is close to the ideal information capacity of 2 bits per nucleotide. The proposed MOPE encoding algorithm with high net information density and satisfying constraints can not only effectively reduce the cost of DNA synthesis and sequencing but also reduce the occurrence of errors during DNA storage.DNA has recently been recognized as an attractive storage medium due to its high reliability, capacity, and durability. However, encoding algorithms that simply map binary data to DNA sequences have the disadvantages of low net information density and high synthesis cost. Therefore, this paper proposes an efficient, feasible, and highly robust encoding algorithm called MOPE (Modified Barnacles Mating Optimizer and Payload Encoding). The Modified Barnacles Mating Optimizer (MBMO) algorithm is used to construct the non-payload coding set, and the Payload Encoding (PE) algorithm is used to encode the payload. The results show that the lower bound of the non-payload coding set constructed by the MBMO algorithm is 3%-18% higher than the optimal result of previous work, and theoretical analysis shows that the designed PE algorithm has a net information density of 1.90 bits/nt, which is close to the ideal information capacity of 2 bits per nucleotide. The proposed MOPE encoding algorithm with high net information density and satisfying constraints can not only effectively reduce the cost of DNA synthesis and sequencing but also reduce the occurrence of errors during DNA storage. DNA has recently been recognized as an attractive storage medium due to its high reliability, capacity, and durability. However, encoding algorithms that simply map binary data to DNA sequences have the disadvantages of low net information density and high synthesis cost. Therefore, this paper proposes an efficient, feasible, and highly robust encoding algorithm called MOPE (Modified Barnacles Mating Optimizer and Payload Encoding). The Modified Barnacles Mating Optimizer (MBMO) algorithm is used to construct the non-payload coding set, and the Payload Encoding (PE) algorithm is used to encode the payload. The results show that the lower bound of the non-payload coding set constructed by the MBMO algorithm is 3%-18% higher than the optimal result of previous work, and theoretical analysis shows that the designed PE algorithm has a net information density of 1.90 bits/nt, which is close to the ideal information capacity of 2 bits per nucleotide. The proposed MOPE encoding algorithm with high net information density and satisfying constraints can not only effectively reduce the cost of DNA synthesis and sequencing but also reduce the occurrence of errors during DNA storage.
Author	Cao, Ben Wu, Jieqiong Zhang, Qiang Zheng, Yanfen Wang, Bin
Author_xml	– sequence: 1 givenname: Yanfen orcidid: 0009-0000-1471-9516 surname: Zheng fullname: Zheng, Yanfen email: zhengyanfen95@gmail.com organization: Key Laboratory of Advanced Design and Intelligent Computing, Ministry of Education, School of Software Engineering, Dalian University, Dalian, Liaoning, China – sequence: 2 givenname: Ben orcidid: 0000-0003-1503-6009 surname: Cao fullname: Cao, Ben email: bencaocs@gmail.com organization: School of Computer Science and Technology, Dalian University of Technology, Dalian, Liaoning, China – sequence: 3 givenname: Jieqiong orcidid: 0009-0003-7683-3615 surname: Wu fullname: Wu, Jieqiong email: juneqiongqiong@gmail.com organization: Key Laboratory of Advanced Design and Intelligent Computing, Ministry of Education, School of Software Engineering, Dalian University, Dalian, Liaoning, China – sequence: 4 givenname: Bin orcidid: 0000-0002-8800-000X surname: Wang fullname: Wang, Bin email: wangbin@dlu.edu.cn organization: Key Laboratory of Advanced Design and Intelligent Computing, Ministry of Education, School of Software Engineering, Dalian University, Dalian, Liaoning, China – sequence: 5 givenname: Qiang orcidid: 0000-0003-3776-9799 surname: Zhang fullname: Zhang, Qiang email: zhangq@dlu.edu.cn organization: Key Laboratory of Advanced Design and Intelligent Computing, Ministry of Education, School of Software Engineering, Dalian University, Dalian, Liaoning, China
BackLink	https://www.ncbi.nlm.nih.gov/pubmed/37015121$$D View this record in MEDLINE/PubMed
BookMark	eNp9kU1vEzEQhi1URD_gByAhZIkLlw3-WK_XxzQJtFJokShna9Y7m7jatYvXOeTfsyEBoR44eQ7PM2O97yU5CzEgIW85m3HOzKeHxfX1TDAhZ1JUUgn-glxwpXRhTFWeHeZSFcpU8pxcjuMjY6I0rHxFzqVmXHHBL8j6xm-29A4zvQ1dTANkHwNdYhh93tPl3ZwuIQP9nmOCDdJmT_MW6df7byu6Ci62PmzovN_E5PN2eE1edtCP-Ob0XpEfn1cPi5tiff_ldjFfF04qlgvXgWwaENDWDXMtd7LhSrKWG6Gd4sARa4WgWygBGu1qYNoJJaDDUjoH8op8PO59SvHnDsdsBz867HsIGHejFdpUvBKyLif0wzP0Me5SmH5nRa2VqsUUz0S9P1G7ZsDWPiU_QNrbPzlNAD8CLsVxTNj9RTizhy7soQt76MKeupgc_cxxPv_ONyfw_X_Nd0fTI-I_l1htSm3kL8PqlHY
CODEN	ITCBCY
CitedBy_id	crossref_primary_10_1093_bib_bbae463 crossref_primary_10_1093_bib_bbaf278 crossref_primary_10_1186_s12864_024_10178_5 crossref_primary_10_1016_j_csbj_2023_09_004 crossref_primary_10_1109_TNB_2024_3481504 crossref_primary_10_1109_TCBBIO_2025_3553616 crossref_primary_10_3390_e26090778 crossref_primary_10_1016_j_celrep_2024_113699
Cites_doi	10.1145/2872362.2872397 10.1109/CBD51900.2020.00012 10.1155/2016/8072463 10.1038/s41598-019-45832-6 10.1007/s00500-019-03939-y 10.3390/polym10010028 10.1109/TNB.2010.2069570 10.1016/j.jmb.2004.10.082 10.1016/j.procs.2016.05.398 10.1109/LCOMM.2018.2861867 10.1109/LCOMM.2019.2912572 10.1186/gb-2013-14-5-r51 10.1016/j.apm.2018.07.044 10.1016/j.neucom.2015.11.018 10.1016/j.ab.2019.113363 10.1093/nar/gkj454 10.1186/s13036-019-0211-2 10.1126/science.1226355 10.1038/s41598-021-97570-3 10.1109/TNB.2021.3121278 10.1016/j.ins.2010.07.016 10.1093/gigascience/giz075 10.1126/science.aaj2038 10.1016/j.compbiomed.2022.106269 10.1038/nature11875 10.1109/LCOMM.2017.2775608 10.1016/j.engappai.2019.103330 10.1016/j.asoc.2016.10.035 10.1016/j.egyr.2020.09.005 10.1016/j.ins.2019.04.022 10.1016/j.knosys.2016.07.005 10.1109/LCOMM.2020.2991461 10.1002/anie.201411378 10.3390/ijms21062191 10.1109/TCBB.2020.3011582 10.1016/j.energy.2020.118738 10.3389/fgene.2021.644945 10.1109/TNB.2021.3056351 10.1109/JRPROC.1952.273898 10.1007/s00521-015-2138-y 10.1038/nbt.4079 10.1007/s00500-019-04365-w 10.1109/TNB.2021.3102122 10.1109/TIT.2021.3066430 10.1109/LCOMM.2018.2866566 10.1016/j.ins.2017.02.026 10.1016/j.image.2021.116331 10.1109/TCBB.2021.3127271 10.1016/j.asoc.2017.10.002 10.1038/s41540-022-00233-w
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
DBID	97E RIA RIE AAYXX CITATION NPM 7QF 7QO 7QQ 7SC 7SE 7SP 7SR 7TA 7TB 7U5 8BQ 8FD F28 FR3 H8D JG9 JQ2 KR7 L7M L~C L~D P64 7X8
DOI	10.1109/TCBB.2023.3263521
DatabaseName	IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef PubMed Aluminium Industry Abstracts Biotechnology Research Abstracts Ceramic Abstracts Computer and Information Systems Abstracts Corrosion Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts Materials Business File Mechanical & Transportation Engineering Abstracts Solid State and Superconductivity Abstracts METADEX Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database Aerospace Database Materials Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Biotechnology and BioEngineering Abstracts MEDLINE - Academic
DatabaseTitle	CrossRef PubMed Materials Research Database Civil Engineering Abstracts Aluminium Industry Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Ceramic Abstracts Materials Business File METADEX Biotechnology and BioEngineering Abstracts Computer and Information Systems Abstracts Professional Aerospace Database Engineered Materials Abstracts Biotechnology Research Abstracts Solid State and Superconductivity Abstracts Engineering Research Database Corrosion Abstracts Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering MEDLINE - Academic
DatabaseTitleList	MEDLINE - Academic Materials Research Database PubMed
Database_xml	– sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Biology
EISSN	1557-9964
EndPage	3000
ExternalDocumentID	37015121 10_1109_TCBB_2023_3263521 10089479
Genre	orig-research Journal Article
GrantInformation_xml	– fundername: Postgraduate Education Reform Project of Liaoning Province grantid: LNYJG2022493 – fundername: Natural Science Foundation of Liaoning Province grantid: 2021-MS-344; 2021-KF-11-03; 2022-KF-12-14 funderid: 10.13039/501100005047 – fundername: Higher Education Discipline Innovation Project; 111 Project grantid: D22006 funderid: 10.13039/501100013314 – fundername: Liaoning Revitalization Talents Program grantid: XLYC2008017 funderid: 10.13039/501100018617 – fundername: Dalian Outstanding Young Science and Technology Talent Support Program grantid: 2022RJ08 – fundername: National Natural Science Foundation of China grantid: 62272079; 61972266 funderid: 10.13039/501100001809
GroupedDBID	0R~ 29I 4.4 53G 5GY 5VS 6IK 8US 97E AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACM ACPRK ADBCU ADL AEBYY AEFXT AEJOY AENEX AENSD AETIX AFRAH AFWIH AFWXC AGQYO AGSQL AHBIQ AIBXA AIKLT AKJIK AKQYR AKRVB ALMA_UNASSIGNED_HOLDINGS ASPBG ATWAV AVWKF BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 DU5 EBS EJD FEDTE GUFHI HGAVV HZ~ I07 IEDLZ IFIPE IPLJI JAVBF LAI LHSKQ M43 O9- OCL P1C P2P PQQKQ RIA RIE RNI RNS ROL RZB TN5 XOL AAYXX CITATION NPM 7QF 7QO 7QQ 7SC 7SE 7SP 7SR 7TA 7TB 7U5 8BQ 8FD F28 FR3 H8D JG9 JQ2 KR7 L7M L~C L~D P64 7X8
ID	FETCH-LOGICAL-c350t-cfa3bba2ad8b0cd1c3b1530d1927c51a1ee85ea7da4aab7c8a07c252afe43cca3
IEDL.DBID	RIE
ISICitedReferencesCount	17
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001084646300034&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1545-5963 1557-9964
IngestDate	Sat Sep 27 19:35:40 EDT 2025 Sun Nov 09 08:40:55 EST 2025 Mon Jul 21 05:55:49 EDT 2025 Sat Nov 29 01:52:06 EST 2025 Tue Nov 18 21:07:04 EST 2025 Wed Aug 27 02:34:38 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	5
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c350t-cfa3bba2ad8b0cd1c3b1530d1927c51a1ee85ea7da4aab7c8a07c252afe43cca3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
ORCID	0000-0002-8800-000X 0000-0003-1503-6009 0000-0003-3776-9799 0009-0003-7683-3615 0009-0000-1471-9516
PMID	37015121
PQID	2875582963
PQPubID	85499
PageCount	9
ParticipantIDs	crossref_citationtrail_10_1109_TCBB_2023_3263521 proquest_journals_2875582963 pubmed_primary_37015121 ieee_primary_10089479 proquest_miscellaneous_2796162384 crossref_primary_10_1109_TCBB_2023_3263521
PublicationCentury	2000
PublicationDate	2023-09-01
PublicationDateYYYYMMDD	2023-09-01
PublicationDate_xml	– month: 09 year: 2023 text: 2023-09-01 day: 01
PublicationDecade	2020
PublicationPlace	United States
PublicationPlace_xml	– name: United States – name: New York
PublicationTitle	IEEE/ACM transactions on computational biology and bioinformatics
PublicationTitleAbbrev	TCBB
PublicationTitleAlternate	IEEE/ACM Trans Comput Biol Bioinform
PublicationYear	2023
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 ref12 ref15 ref14 ref11 ref10 ref17 ref16 ref19 ref18 ref50 huffman (ref42) 0; 40 ref46 ref45 ref48 ref47 ref41 ref44 ref43 ref49 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 ref35 ref34 ref37 ref36 ref31 ref30 ref33 ref32 ref2 ref1 ref39 ref38 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 ref27 ref29
References_xml	– ident: ref4 doi: 10.1145/2872362.2872397 – ident: ref40 doi: 10.1109/CBD51900.2020.00012 – ident: ref3 doi: 10.1155/2016/8072463 – ident: ref34 doi: 10.1038/s41598-019-45832-6 – ident: ref20 doi: 10.1007/s00500-019-03939-y – ident: ref5 doi: 10.3390/polym10010028 – ident: ref45 doi: 10.1109/TNB.2010.2069570 – ident: ref46 doi: 10.1016/j.jmb.2004.10.082 – ident: ref10 doi: 10.1016/j.procs.2016.05.398 – ident: ref31 doi: 10.1109/LCOMM.2018.2861867 – ident: ref39 doi: 10.1109/LCOMM.2019.2912572 – ident: ref36 doi: 10.1186/gb-2013-14-5-r51 – ident: ref28 doi: 10.1016/j.apm.2018.07.044 – ident: ref29 doi: 10.1016/j.neucom.2015.11.018 – ident: ref6 doi: 10.1016/j.ab.2019.113363 – ident: ref35 doi: 10.1093/nar/gkj454 – ident: ref12 doi: 10.1186/s13036-019-0211-2 – ident: ref7 doi: 10.1126/science.1226355 – ident: ref2 doi: 10.1038/s41598-021-97570-3 – ident: ref44 doi: 10.1109/TNB.2021.3121278 – ident: ref21 doi: 10.1016/j.ins.2010.07.016 – ident: ref1 doi: 10.1093/gigascience/giz075 – ident: ref11 doi: 10.1126/science.aaj2038 – ident: ref50 doi: 10.1016/j.compbiomed.2022.106269 – ident: ref8 doi: 10.1038/nature11875 – ident: ref37 doi: 10.1109/LCOMM.2017.2775608 – ident: ref17 doi: 10.1016/j.engappai.2019.103330 – ident: ref23 doi: 10.1016/j.asoc.2016.10.035 – ident: ref18 doi: 10.1016/j.egyr.2020.09.005 – ident: ref30 doi: 10.1016/j.ins.2019.04.022 – ident: ref22 doi: 10.1016/j.knosys.2016.07.005 – ident: ref48 doi: 10.1109/LCOMM.2020.2991461 – ident: ref9 doi: 10.1002/anie.201411378 – ident: ref14 doi: 10.3390/ijms21062191 – ident: ref13 doi: 10.1109/TCBB.2020.3011582 – ident: ref19 doi: 10.1016/j.energy.2020.118738 – ident: ref32 doi: 10.3389/fgene.2021.644945 – ident: ref15 doi: 10.1109/TNB.2021.3056351 – volume: 40 start-page: 1098 year: 0 ident: ref42 article-title: A method for the construction of minimum-redundancy codes publication-title: Proc IRE doi: 10.1109/JRPROC.1952.273898 – ident: ref25 doi: 10.1007/s00521-015-2138-y – ident: ref33 doi: 10.1038/nbt.4079 – ident: ref27 doi: 10.1007/s00500-019-04365-w – ident: ref16 doi: 10.1109/TNB.2021.3102122 – ident: ref41 doi: 10.1109/TIT.2021.3066430 – ident: ref38 doi: 10.1109/LCOMM.2018.2866566 – ident: ref24 doi: 10.1016/j.ins.2017.02.026 – ident: ref47 doi: 10.1016/j.image.2021.116331 – ident: ref43 doi: 10.1109/TCBB.2021.3127271 – ident: ref26 doi: 10.1016/j.asoc.2017.10.002 – ident: ref49 doi: 10.1038/s41540-022-00233-w
SSID	ssj0024904
Score	2.4307437
Snippet	DNA has recently been recognized as an attractive storage medium due to its high reliability, capacity, and durability. However, encoding algorithms that...
SourceID	proquest pubmed crossref ieee
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	2992
SubjectTerms	Algorithms Binary data Convergence Data storage Density DNA DNA biosynthesis DNA sequencing DNA storage Durability Encoding Lower bounds Mating Media Memory MOPE encoding algorithm non-payload coding set Nucleotide sequence Nucleotides payload encoding algorithm Payloads Sequential analysis Synthesis Theoretical analysis
Title	High Net Information Density DNA Data Storage by the MOPE Encoding Algorithm
URI	https://ieeexplore.ieee.org/document/10089479 https://www.ncbi.nlm.nih.gov/pubmed/37015121 https://www.proquest.com/docview/2875582963 https://www.proquest.com/docview/2796162384
Volume	20
WOSCitedRecordID	wos001084646300034&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: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9964 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0024904 issn: 1545-5963 databaseCode: RIE dateStart: 20040101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fb9MwED6xCSRexq8BgTEZiSekdE7s1M5jt3biAcokhtS3yHauMGkkqEsn9b_nzkkLPAyJt0RxEsvf2Xdn390H8A69lwG1TUOW-VSPwzJ1nhxX9LVeoqWprupINmHmc7tYlBdDsnrMhUHEGHyGI76MZ_l1G9a8VXbChWhKbco92DNm3Cdr_S6sV0auQDYJ0oLEajjCzGR5cnl2ejpinvCR4torOdPDKCNZ2WV_6aNIsHK3rRl1zvmj_-ztYzgYjEsx6aXhCdzD5ik86OkmN8_gIwd1iDl2YkhCYlDElEPYu42Yzidi6jonvpAbTquM8BtB1qH49PliJmZNaFnLicn1t3Z11X3_cQhfz2eXZx_SgU0hDaqQXRqWTnnvcldbgqfOgvK02smaTDwTisxliLZAZ2qnnfMmWCdNyIvcLVErwlk9h_2mbfAlCB9wbFRBzqOR2nnlTUY3ulTBKi3rPAG5HdMqDKXGmfHiuoouhywrRqRiRKoBkQTe71752dfZ-FfjQx7uPxr2I53A0Ra5apiKNxW5hEVhc5KIBN7uHtMk4pMR12C7pjamHGdkCFqdwIse8d3Ht4Ly6o6fvoaH3Lc-7uwI9rvVGt_A_XDbXd2sjklSF_Y4SuovZ_zg5Q
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fb9MwED7BAI0Xfm4sY4CReEJKZ8d27Tx2a6chujCJIu0tsp0rTBrJ1KVI_e9nO2mBhyHxlihOYvk7--7su_sAPqC11KHQqWPMpmLo5qmx3nFFW4k5aj_VeRXJJlRR6IuL_LxPVo-5MIgYg89wEC7jWX7VuGXYKjsMhWhyofL78EAKkdEuXet3ab08sgUGoyCVXrD6Q0xG88PZ8dHRIDCFD3iovpIFghiuaFB37C-NFClW7rY2o9Y5efqf_X0GT3rzkow6eXgO97B-AY86wsnVS5iGsA5SYEv6NKQACxmHIPZ2RcbFiIxNa8hX74j7dYbYFfH2ITn7cj4hk9o1Qc-R0dX3ZnHZ_vi5A99OJrPj07TnU0gdl7RN3dxwa01mKu0Bqpjj1q93tPJGnnKSGYaoJRpVGWGMVU4bqlwmMzNHwT3SfBe26qbGPSDW4VBx6d1HRYWx3Crmb0TOneaCVlkCdD2mpeuLjQfOi6syOh00LwMiZUCk7BFJ4OPmleuu0sa_Gu-E4f6jYTfSCRyskSv7yXhTeqdQSp15iUjg_eaxn0bhbMTU2Cx9G5UPmTcFtUjgVYf45uNrQdm_46fvYPt0djYtp5-Kz6_hcehnF4V2AFvtYolv4KH71V7eLN5Geb0F-YHjRA
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=High+Net+Information+Density+DNA+Data+Storage+by+the+MOPE+Encoding+Algorithm&rft.jtitle=IEEE%2FACM+transactions+on+computational+biology+and+bioinformatics&rft.au=Zheng%2C+Yanfen&rft.au=Cao%2C+Ben&rft.au=Wu%2C+Jieqiong&rft.au=Wang%2C+Bin&rft.date=2023-09-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1545-5963&rft.eissn=1557-9964&rft.volume=20&rft.issue=5&rft.spage=2992&rft_id=info:doi/10.1109%2FTCBB.2023.3263521&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1545-5963&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1545-5963&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1545-5963&client=summon