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

In this talk, we will present error-correcting codes for the storage of data in synthetic deoxyribonucleic acid (DNA). We investigate a storage model where a data set is represented by an unordered set of M sequences, where each sequence is a vector of length L over Z_q. Errors within that model are losses of whole sequences and point errors inside the sequences, such as insertions, deletions and substitutions. We derive lower bounds on the minimum redundancy that is needed to correct errors in such a storage system. We further propose code constructions for the storage channel and compare them to our bounds, which shows that many of our codes are close to optimal.