Reconstruction Codes for DNA Sequences with Uniform Tandem-Duplication Errors
DNA as a data storage medium has several advantages, including far greater data density compared to electronic media. We propose that schemes for data storage in the DNA of living organisms may benefit from studying the reconstruction problem, which is applicable whenever multiple reads of noisy dat...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2019-09 |
|---|---|
| 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 | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Yehezkeally, Yonatan Schwartz, Moshe |
| description | DNA as a data storage medium has several advantages, including far greater data density compared to electronic media. We propose that schemes for data storage in the DNA of living organisms may benefit from studying the reconstruction problem, which is applicable whenever multiple reads of noisy data are available. This strategy is uniquely suited to the medium, which inherently replicates stored data in multiple distinct ways, caused by mutations. We consider noise introduced solely by uniform tandem-duplication, and utilize the relation to constant-weight integer codes in the Manhattan metric. By bounding the intersection of the cross-polytope with hyperplanes, we prove the existence of reconstruction codes with greater capacity than known error-correcting codes, which we can determine analytically for any set of parameters. |
| doi_str_mv | 10.48550/arxiv.1801.06022 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1801_06022</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2071265840</sourcerecordid><originalsourceid>FETCH-LOGICAL-a520-884c55a50996b9ad420c68c2f0fe5a88d3fe5782f6a71aa03cb68b37703250be3</originalsourceid><addsrcrecordid>eNotj19PgzAUxRsTE5e5D-CTJD6Dt7e0lMeFTWcyNVF8JqWUyDIotuCfby8yn05y7jkn90fIFYUolpzDrXLfzWdEJdAIBCCekQUyRkMZI16QlfcHAECRIOdsQR5fjLadH9yoh8Z2QWYr44PaumDztA5ezcdoOj05X83wHrx1zXRpg1x1lWnDzdgfG63m3tY56_wlOa_V0ZvVvy5JfrfNs124f75_yNb7UHGEUMpYc644pKkoU1XFCFpIjTXUhispKzZpIrEWKqFKAdOlkCVLEmDIoTRsSa5PszNr0bumVe6n-GMuZuYpcXNK9M5OCH4oDnZ03fRTgZBQFFzGwH4B75pZGg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2071265840</pqid></control><display><type>article</type><title>Reconstruction Codes for DNA Sequences with Uniform Tandem-Duplication Errors</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Yehezkeally, Yonatan ; Schwartz, Moshe</creator><creatorcontrib>Yehezkeally, Yonatan ; Schwartz, Moshe</creatorcontrib><description>DNA as a data storage medium has several advantages, including far greater data density compared to electronic media. We propose that schemes for data storage in the DNA of living organisms may benefit from studying the reconstruction problem, which is applicable whenever multiple reads of noisy data are available. This strategy is uniquely suited to the medium, which inherently replicates stored data in multiple distinct ways, caused by mutations. We consider noise introduced solely by uniform tandem-duplication, and utilize the relation to constant-weight integer codes in the Manhattan metric. By bounding the intersection of the cross-polytope with hyperplanes, we prove the existence of reconstruction codes with greater capacity than known error-correcting codes, which we can determine analytically for any set of parameters.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1801.06022</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Computer Science - Information Theory ; Data storage ; Deoxyribonucleic acid ; DNA ; Error correcting codes ; Error correction ; Gene sequencing ; Hyperplanes ; Mathematics - Information Theory ; Mutation ; Reconstruction ; Reproduction (copying) ; Weight</subject><ispartof>arXiv.org, 2019-09</ispartof><rights>2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27924</link.rule.ids><backlink>$$Uhttps://doi.org/10.1109/TIT.2019.2940256$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.1801.06022$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Yehezkeally, Yonatan</creatorcontrib><creatorcontrib>Schwartz, Moshe</creatorcontrib><title>Reconstruction Codes for DNA Sequences with Uniform Tandem-Duplication Errors</title><title>arXiv.org</title><description>DNA as a data storage medium has several advantages, including far greater data density compared to electronic media. We propose that schemes for data storage in the DNA of living organisms may benefit from studying the reconstruction problem, which is applicable whenever multiple reads of noisy data are available. This strategy is uniquely suited to the medium, which inherently replicates stored data in multiple distinct ways, caused by mutations. We consider noise introduced solely by uniform tandem-duplication, and utilize the relation to constant-weight integer codes in the Manhattan metric. By bounding the intersection of the cross-polytope with hyperplanes, we prove the existence of reconstruction codes with greater capacity than known error-correcting codes, which we can determine analytically for any set of parameters.</description><subject>Computer Science - Information Theory</subject><subject>Data storage</subject><subject>Deoxyribonucleic acid</subject><subject>DNA</subject><subject>Error correcting codes</subject><subject>Error correction</subject><subject>Gene sequencing</subject><subject>Hyperplanes</subject><subject>Mathematics - Information Theory</subject><subject>Mutation</subject><subject>Reconstruction</subject><subject>Reproduction (copying)</subject><subject>Weight</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj19PgzAUxRsTE5e5D-CTJD6Dt7e0lMeFTWcyNVF8JqWUyDIotuCfby8yn05y7jkn90fIFYUolpzDrXLfzWdEJdAIBCCekQUyRkMZI16QlfcHAECRIOdsQR5fjLadH9yoh8Z2QWYr44PaumDztA5ezcdoOj05X83wHrx1zXRpg1x1lWnDzdgfG63m3tY56_wlOa_V0ZvVvy5JfrfNs124f75_yNb7UHGEUMpYc644pKkoU1XFCFpIjTXUhispKzZpIrEWKqFKAdOlkCVLEmDIoTRsSa5PszNr0bumVe6n-GMuZuYpcXNK9M5OCH4oDnZ03fRTgZBQFFzGwH4B75pZGg</recordid><startdate>20190905</startdate><enddate>20190905</enddate><creator>Yehezkeally, Yonatan</creator><creator>Schwartz, Moshe</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20190905</creationdate><title>Reconstruction Codes for DNA Sequences with Uniform Tandem-Duplication Errors</title><author>Yehezkeally, Yonatan ; Schwartz, Moshe</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a520-884c55a50996b9ad420c68c2f0fe5a88d3fe5782f6a71aa03cb68b37703250be3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Computer Science - Information Theory</topic><topic>Data storage</topic><topic>Deoxyribonucleic acid</topic><topic>DNA</topic><topic>Error correcting codes</topic><topic>Error correction</topic><topic>Gene sequencing</topic><topic>Hyperplanes</topic><topic>Mathematics - Information Theory</topic><topic>Mutation</topic><topic>Reconstruction</topic><topic>Reproduction (copying)</topic><topic>Weight</topic><toplevel>online_resources</toplevel><creatorcontrib>Yehezkeally, Yonatan</creatorcontrib><creatorcontrib>Schwartz, Moshe</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yehezkeally, Yonatan</au><au>Schwartz, Moshe</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Reconstruction Codes for DNA Sequences with Uniform Tandem-Duplication Errors</atitle><jtitle>arXiv.org</jtitle><date>2019-09-05</date><risdate>2019</risdate><eissn>2331-8422</eissn><abstract>DNA as a data storage medium has several advantages, including far greater data density compared to electronic media. We propose that schemes for data storage in the DNA of living organisms may benefit from studying the reconstruction problem, which is applicable whenever multiple reads of noisy data are available. This strategy is uniquely suited to the medium, which inherently replicates stored data in multiple distinct ways, caused by mutations. We consider noise introduced solely by uniform tandem-duplication, and utilize the relation to constant-weight integer codes in the Manhattan metric. By bounding the intersection of the cross-polytope with hyperplanes, we prove the existence of reconstruction codes with greater capacity than known error-correcting codes, which we can determine analytically for any set of parameters.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1801.06022</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2019-09 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1801_06022 |
| source | arXiv.org; Free E- Journals |
| subjects | Computer Science - Information Theory Data storage Deoxyribonucleic acid DNA Error correcting codes Error correction Gene sequencing Hyperplanes Mathematics - Information Theory Mutation Reconstruction Reproduction (copying) Weight |
| title | Reconstruction Codes for DNA Sequences with Uniform Tandem-Duplication Errors |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T21%3A00%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Reconstruction%20Codes%20for%20DNA%20Sequences%20with%20Uniform%20Tandem-Duplication%20Errors&rft.jtitle=arXiv.org&rft.au=Yehezkeally,%20Yonatan&rft.date=2019-09-05&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1801.06022&rft_dat=%3Cproquest_arxiv%3E2071265840%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2071265840&rft_id=info:pmid/&rfr_iscdi=true |