Multi-strand Reconstruction from Substrings

Yonatan Yehezkeally, Sagi Marcovich, Eitan Yaakobi

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

2 Scopus citations


The problem of string reconstruction based on its substrings spectrum has received significant attention recently due to its applicability to DNA data storage and sequencing. In contrast to previous works, we consider in this paper a setup of this problem where multiple strings are reconstructed together. Given a multiset S of strings, all their substrings of some fixed length ℓ, defined as the ℓ-profile of S, are received and the goal is to reconstruct all strings in S. A multi-strand ℓ-reconstruction code is a set of multisets such that every element S can be reconstructed from its ℓ-profile. Given the number of strings k and their length n, we first find a lower bound on the value of ℓ necessary for existence of multi-strand ℓ-reconstruction codes with non-vanishing asymptotic rate. We then present two constructions of such codes and show that their rates approach 1 for values of ℓ that asymptotically behave like the lower bound.

Original languageEnglish
Title of host publication2021 IEEE Information Theory Workshop, ITW 2021 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers
ISBN (Electronic)9781665403122
StatePublished - 1 Jan 2021
Externally publishedYes
Event2021 IEEE Information Theory Workshop, ITW 2021 - Virtual, Online, Japan
Duration: 17 Oct 202121 Oct 2021

Publication series

Name2021 IEEE Information Theory Workshop, ITW 2021 - Proceedings


Conference2021 IEEE Information Theory Workshop, ITW 2021
CityVirtual, Online

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Information Systems
  • Software


Dive into the research topics of 'Multi-strand Reconstruction from Substrings'. Together they form a unique fingerprint.

Cite this