Reconstruction from Substrings with Partial Overlap

Yonatan Yehezkeally, Daniella Bar-Lev, Sagi Marcovich, Eitan Yaakobi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by reading some subset of their substrings. While previous works considered two extreme cases in which all substrings of some fixed length are read or substrings are read with no overlap, this work considers the setup in which consecutive substrings are read with some given minimum overlap. First, an upper bound is provided on the attainable rates of codes that guarantee unique reconstruction. Then, we present efficient constructions of asymptotically optimal codes that meet that upper bound.

Original languageAmerican English
Title of host publicationProceedings of 2022 International Symposium on Information Theory and Its Applications, ISITA 2022
Pages104-108
Number of pages5
ISBN (Electronic)9784885523410
StatePublished - 1 Jan 2022
Event17th International Symposium on Information Theory and Its Applications, ISITA 2022 - Tsukuba, Ibaraki, Japan
Duration: 17 Oct 202219 Oct 2022

Publication series

NameProceedings of 2022 International Symposium on Information Theory and Its Applications, ISITA 2022

Conference

Conference17th International Symposium on Information Theory and Its Applications, ISITA 2022
Country/TerritoryJapan
CityTsukuba, Ibaraki
Period17/10/2219/10/22

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Information Systems
  • Signal Processing

Fingerprint

Dive into the research topics of 'Reconstruction from Substrings with Partial Overlap'. Together they form a unique fingerprint.

Cite this