Abstract
Motivated by mutation processes occurring in in-vivo DNA-storage applications, a channel that mutates stored strings by duplicating substrings as well as substituting symbols is studied. Two models of such a channel are considered: one in which the substitutions occur only within the duplicated substrings, and one in which the location of substitutions is unrestricted. Both error-detecting and error-correcting codes are constructed, which can handle correctly any number of tandem duplications of a fixed length k, and at most a single substitution occurring at any time during the mutation process.
Original language | English |
---|---|
Article number | 9130733 |
Pages (from-to) | 6908-6919 |
Number of pages | 12 |
Journal | IEEE Transactions on Information Theory |
Volume | 66 |
Issue number | 11 |
DOIs | |
State | Published - 1 Nov 2020 |
Keywords
- DNA storage
- error correction
- error detection
- string-duplication systems
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences