דלג לתוכן (מקש קיצור 's')
אירועים

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

על קודים לאחסון ב-דנא ומשפחות של קודי כיסוי
event speaker icon
אביטל בורוחובסקי (הרצאה סמינריונית לדוקטורט)
event date icon
יום ראשון, 13.12.2026, 14:30
event location icon
טאוב 601
event speaker icon
מנחה: פרופ' איתן יעקובי

Synthetic deoxyribonucleic acid (DNA) has emerged as a promising archival storage medium due to its extraordinary information density and multi-century stability. However, the biochemical processes of DNA synthesis and sequencing introduce fundamental coding-theoretic and algorithmic bottlenecks—most notably the lack of spatial ordering among stored strands, high sequencing coverage overhead, and synchronization (insertion and deletion) errors. In this talk, I will present the main contributions of my PhD research, focusing primarily on coding schemes and algorithms designed to overcome these challenges across the DNA data storage pipeline:

End-to-End Error Correction: Introducing DNA-correcting codes, which replace the traditional decoupled pipeline of clustering, trace reconstruction, and decoding with a unified coding framework that guarantees unambiguous end-to-end recovery.

Random Access Coverage Depth: Minimizing the expected number of sequencing reads needed to retrieve a single designated information strand—resolving the $k=2$ case completely and constructing recovery-complete codes that improve upon state-of-the-art bounds for general $k$.

Synchronization Errors: Developing black-box algorithmic reductions that transform off-the-shelf deletion decoders into general insertion–deletion decoders, alongside linear-time, constant-space algebraic decoders for two-dimensional Reed–Solomon codes.

I will conclude with a brief overview of the second part of my dissertation, which investigates combinatorial and extremal problems in covering codes, including binary nearly perfect $1$-covering codes, pair-covering codes, and all-symbol PIR and batch codes.