Properties and Constructions of Constrained Codes for DNA-Based Data Storage
We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. Generating functions and approximations are presented for computing the number of sequences with maximum repetition length and AT/GC balanc...
Gespeichert in:
| Veröffentlicht in: | IEEE access 2020, Vol.8, p.49523-49531 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 49531 |
|---|---|
| container_issue | |
| container_start_page | 49523 |
| container_title | IEEE access |
| container_volume | 8 |
| creator | Immink, Kees A. Schouhamer Cai, Kui |
| description | We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. Generating functions and approximations are presented for computing the number of sequences with maximum repetition length and AT/GC balance constraint. We describe routines for translating binary runlength limited and/or balanced strings into DNA strands, and compute the efficiency of such routines. Expressions for the redundancy of codes that account for both the maximum repetition length and AT/GC balance are derived. |
| doi_str_mv | 10.1109/ACCESS.2020.2980036 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_9032172</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9032172</ieee_id><doaj_id>oai_doaj_org_article_986f2cabb18e4ff2860a44a03a1a4a9e</doaj_id><sourcerecordid>2454730957</sourcerecordid><originalsourceid>FETCH-LOGICAL-c474t-28263a8247af722e7bf6a8b0cadfc4a5250f28ea23ac67daa694193cf80fc0e3</originalsourceid><addsrcrecordid>eNpNUU1PAjEUbIwmEuQXcNnE82K_ttsecUElIWoC9-ZttyVLkGK7HPz3dl1CfJe-TGfmtW8QmhI8IwSrp3lVLTebGcUUz6iSGDNxg0aUCJWzgonbf_09msS4x6lkgopyhNafwZ9s6FobMzg2WeWPsQtn07Wpyby7ANAebX_ZJJrzIVu8z_NniAlbQAfZpvMBdvYB3Tk4RDu5nGO0fVluq7d8_fG6qubr3PCSdzmVVDCQlJfgSkptWTsBssYGGmc4FLTAjkoLlIERZQMgFCeKGSexM9iyMVoNto2HvT6F9gvCj_bQ6j_Ah52G9CNzsFpJ4aiBuibScpdcBQbOATMgwEH1Xo-D1yn477ONnd77czim12vKC14ynNaUWGxgmeBjDNZdpxKs-xD0EILuQ9CXEJJqOqhaa-1VoTCjpKTsF02RgkI</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2454730957</pqid></control><display><type>article</type><title>Properties and Constructions of Constrained Codes for DNA-Based Data Storage</title><source>IEEE Open Access Journals</source><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Immink, Kees A. Schouhamer ; Cai, Kui</creator><creatorcontrib>Immink, Kees A. Schouhamer ; Cai, Kui</creatorcontrib><description>We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. Generating functions and approximations are presented for computing the number of sequences with maximum repetition length and AT/GC balance constraint. We describe routines for translating binary runlength limited and/or balanced strings into DNA strands, and compute the efficiency of such routines. Expressions for the redundancy of codes that account for both the maximum repetition length and AT/GC balance are derived.</description><identifier>ISSN: 2169-3536</identifier><identifier>EISSN: 2169-3536</identifier><identifier>DOI: 10.1109/ACCESS.2020.2980036</identifier><identifier>CODEN: IAECCG</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>balanced words ; Constrained coding ; Constraints ; Data storage ; Deoxyribonucleic acid ; DNA ; DNA-based storage ; Encoding ; maximum runlength ; Memory ; Redundancy ; Repetition ; Routines ; Sequences ; Sequential analysis ; storage systems ; Table lookup</subject><ispartof>IEEE access, 2020, Vol.8, p.49523-49531</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c474t-28263a8247af722e7bf6a8b0cadfc4a5250f28ea23ac67daa694193cf80fc0e3</citedby><cites>FETCH-LOGICAL-c474t-28263a8247af722e7bf6a8b0cadfc4a5250f28ea23ac67daa694193cf80fc0e3</cites><orcidid>0000-0001-6747-9261 ; 0000-0003-2059-0071</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9032172$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,860,2096,4010,27610,27900,27901,27902,54908</link.rule.ids></links><search><creatorcontrib>Immink, Kees A. Schouhamer</creatorcontrib><creatorcontrib>Cai, Kui</creatorcontrib><title>Properties and Constructions of Constrained Codes for DNA-Based Data Storage</title><title>IEEE access</title><addtitle>Access</addtitle><description>We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. Generating functions and approximations are presented for computing the number of sequences with maximum repetition length and AT/GC balance constraint. We describe routines for translating binary runlength limited and/or balanced strings into DNA strands, and compute the efficiency of such routines. Expressions for the redundancy of codes that account for both the maximum repetition length and AT/GC balance are derived.</description><subject>balanced words</subject><subject>Constrained coding</subject><subject>Constraints</subject><subject>Data storage</subject><subject>Deoxyribonucleic acid</subject><subject>DNA</subject><subject>DNA-based storage</subject><subject>Encoding</subject><subject>maximum runlength</subject><subject>Memory</subject><subject>Redundancy</subject><subject>Repetition</subject><subject>Routines</subject><subject>Sequences</subject><subject>Sequential analysis</subject><subject>storage systems</subject><subject>Table lookup</subject><issn>2169-3536</issn><issn>2169-3536</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><sourceid>RIE</sourceid><sourceid>DOA</sourceid><recordid>eNpNUU1PAjEUbIwmEuQXcNnE82K_ttsecUElIWoC9-ZttyVLkGK7HPz3dl1CfJe-TGfmtW8QmhI8IwSrp3lVLTebGcUUz6iSGDNxg0aUCJWzgonbf_09msS4x6lkgopyhNafwZ9s6FobMzg2WeWPsQtn07Wpyby7ANAebX_ZJJrzIVu8z_NniAlbQAfZpvMBdvYB3Tk4RDu5nGO0fVluq7d8_fG6qubr3PCSdzmVVDCQlJfgSkptWTsBssYGGmc4FLTAjkoLlIERZQMgFCeKGSexM9iyMVoNto2HvT6F9gvCj_bQ6j_Ah52G9CNzsFpJ4aiBuibScpdcBQbOATMgwEH1Xo-D1yn477ONnd77czim12vKC14ynNaUWGxgmeBjDNZdpxKs-xD0EILuQ9CXEJJqOqhaa-1VoTCjpKTsF02RgkI</recordid><startdate>2020</startdate><enddate>2020</enddate><creator>Immink, Kees A. Schouhamer</creator><creator>Cai, Kui</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7SR</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0001-6747-9261</orcidid><orcidid>https://orcid.org/0000-0003-2059-0071</orcidid></search><sort><creationdate>2020</creationdate><title>Properties and Constructions of Constrained Codes for DNA-Based Data Storage</title><author>Immink, Kees A. Schouhamer ; Cai, Kui</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c474t-28263a8247af722e7bf6a8b0cadfc4a5250f28ea23ac67daa694193cf80fc0e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>balanced words</topic><topic>Constrained coding</topic><topic>Constraints</topic><topic>Data storage</topic><topic>Deoxyribonucleic acid</topic><topic>DNA</topic><topic>DNA-based storage</topic><topic>Encoding</topic><topic>maximum runlength</topic><topic>Memory</topic><topic>Redundancy</topic><topic>Repetition</topic><topic>Routines</topic><topic>Sequences</topic><topic>Sequential analysis</topic><topic>storage systems</topic><topic>Table lookup</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Immink, Kees A. Schouhamer</creatorcontrib><creatorcontrib>Cai, Kui</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE Open Access Journals</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>IEEE access</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Immink, Kees A. Schouhamer</au><au>Cai, Kui</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Properties and Constructions of Constrained Codes for DNA-Based Data Storage</atitle><jtitle>IEEE access</jtitle><stitle>Access</stitle><date>2020</date><risdate>2020</risdate><volume>8</volume><spage>49523</spage><epage>49531</epage><pages>49523-49531</pages><issn>2169-3536</issn><eissn>2169-3536</eissn><coden>IAECCG</coden><abstract>We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. Generating functions and approximations are presented for computing the number of sequences with maximum repetition length and AT/GC balance constraint. We describe routines for translating binary runlength limited and/or balanced strings into DNA strands, and compute the efficiency of such routines. Expressions for the redundancy of codes that account for both the maximum repetition length and AT/GC balance are derived.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/ACCESS.2020.2980036</doi><tpages>9</tpages><orcidid>https://orcid.org/0000-0001-6747-9261</orcidid><orcidid>https://orcid.org/0000-0003-2059-0071</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2169-3536 |
| ispartof | IEEE access, 2020, Vol.8, p.49523-49531 |
| issn | 2169-3536 2169-3536 |
| language | eng |
| recordid | cdi_ieee_primary_9032172 |
| source | IEEE Open Access Journals; DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | balanced words Constrained coding Constraints Data storage Deoxyribonucleic acid DNA DNA-based storage Encoding maximum runlength Memory Redundancy Repetition Routines Sequences Sequential analysis storage systems Table lookup |
| title | Properties and Constructions of Constrained Codes for DNA-Based Data Storage |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T11%3A39%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Properties%20and%20Constructions%20of%20Constrained%20Codes%20for%20DNA-Based%20Data%20Storage&rft.jtitle=IEEE%20access&rft.au=Immink,%20Kees%20A.%20Schouhamer&rft.date=2020&rft.volume=8&rft.spage=49523&rft.epage=49531&rft.pages=49523-49531&rft.issn=2169-3536&rft.eissn=2169-3536&rft.coden=IAECCG&rft_id=info:doi/10.1109/ACCESS.2020.2980036&rft_dat=%3Cproquest_ieee_%3E2454730957%3C/proquest_ieee_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2454730957&rft_id=info:pmid/&rft_ieee_id=9032172&rft_doaj_id=oai_doaj_org_article_986f2cabb18e4ff2860a44a03a1a4a9e&rfr_iscdi=true |