@inproceedings{e80b23aa754048279cb8d236581130aa,
title = "Codes in the damerau distance for DNA storage",
abstract = "We introduce the new problem of code design in the Damerau metric. The Damerau metric is a generalization of the Levenshtein distance which also allows for adjacent transposition edits. We first provide constructions for codes that may correct either a single deletion or a single adjacent transposition and then proceed to extend these results to codes that can simultaneously correct a single deletion and multiple adjacent transpositions. Bounds on the size of the codes and accompanying decoding algorithms are presented as well.",
author = "Ryan Gabrys and Eitan Yaakobi and Olgica Milenkovic",
note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",
year = "2016",
month = aug,
day = "10",
doi = "10.1109/ISIT.2016.7541778",
language = "الإنجليزيّة",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "2644--2648",
booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",
}