Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
From MaRDI portal
Publication:5369849
DOI10.1109/TIT.2017.2688361zbMath1372.94471arXiv1606.00397WikidataQ59902627 ScholiaQ59902627MaRDI QIDQ5369849
Siddharth Jain, Moshe Schwartz, Jehoshua Bruck, Farzad Farnoud (Hassanzadeh)
Publication date: 19 October 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.00397
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Burst-correcting codes (94B20)
Related Items (9)
Insdel codes from subspace and rank-metric codes ⋮ On the maximum number of non-confusable strings evolving under short tandem duplications ⋮ Construction of single-deletion-correcting DNA codes using CIS codes ⋮ Designing DNA codes from reversible self-dual codes over \(\mathrm{GF}(4)\) ⋮ Duplication-correcting codes ⋮ On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability ⋮ On conflict free DNA codes ⋮ Deciding the Confusability of Words under Tandem Repeats in Linear Time ⋮ The tandem duplication distance problem is hard over bounded alphabets
This page was built for publication: Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
