אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

Repeat-free codes are used to ensure unique reconstruction from fragmentation, assuming full (uniform) read-coverage of substrings, with applications to DNA-based storage systems. In this talk, we explore a generalization aimed at resilience to pre-fragmentation noise, and study existence results as well as explicit constructions. Yonatan Yehezkeally is the Carl Friedrich von Siemens post-doctoral research fellow of the Alexander von Humboldt Foundation, in the Associate Professorship of Coding and Cryptography (Prof. Wachter-Zeh), School of Computation, Information and Technology, Technical University of Munich. His research interests include coding for novel storage media, with a focus on DNA-based storage and nascent sequencing technologies, as well as combinatorial structures and finite group theory. Yonatan received the Ph.D. degree in Electrical and Computer Engineering in 2020, from Ben-Gurion University of the Negev, Beer-Sheva, Israel. Before that, he received the B.Sc. degree (cum laude) in Mathematics and the M.Sc. degree (summa cum laude) in Electrical and Computer Engineering, in 2013 and 2017 respectively, also from Ben-Gurion University of the Negev.