19 citations · 37 across the 6 of their papers we have counts for
7 papers
Generalized Unique Reconstruction from Substrings
Yonatan Yehezkeally, Daniella Bar-Lev, Sagi Marcovich +1
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…
Covering Sequences for -Tuples
Sagi Marcovich, Tuvi Etzion, Eitan Yaakobi
de Bruijn sequences of order , i.e., sequences that contain each -tuple as a window exactly once, have found many diverse applications in information theory and most re…
Reconstruction from Substrings with Partial Overlap
Yonatan Yehezkeally, Daniella Bar-Lev, Sagi Marcovich +1
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…
Adversarial Torn-paper Codes
Daniella Bar-Lev, Sagi Marcovich, Eitan Yaakobi +1
We study the adversarial torn-paper channel. This problem is motivated by applications in DNA data storage where the DNA strands that carry information may break into smaller piece…
Multi-strand Reconstruction from Substrings
Yonatan Yehezkeally, Sagi Marcovich, Eitan Yaakobi
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 co…
The Zero Cubes Free and Cubes Unique Multidimensional Constraints
Sagi Marcovich, Eitan Yaakobi
This paper studies two families of constraints for two-dimensional and multidimensional arrays. The first family requires that a multidimensional array will not contain a cube of z…
Reconstruction of Strings from their Substrings Spectrum
Sagi Marcovich, Eitan Yaakobi
This paper studies reconstruction of strings based upon their substrings spectrum. Under this paradigm, it is assumed that all substrings of some fixed length are received and the…