R&D on DNA Storage: On Size Levenshtein Balls

arXiv has published an article written by Danella Bar-Lev, Tuvi Etzion, and Eitan Yaakobi, Dept. of Computer Science Technion-Israel Institute of Technology, Haifa 3200003, Israel.

Abstract: “The rapid development of DNA storage has brought the deletion and insertion channel, once again, to the front line of research. When the number of deletions is equal to the number of insertions, the Levenshtein metric is the right measure for the distance between two words of the same length. The size of a ball is one of the most fundamental parameters in any metric. In this work, the minimum, maximum, and average size of a ball with radius one, in the Levenshtein metric, is considered. The related minimum and maximum size of a maximal anticode with diameter one is also calculated.“