Cover Your Bases: Minimizing Sequencing Coverage in DNA Storage Systems

Explore the cutting-edge research on minimizing sequencing coverage in DNA storage systems in this 50-minute lecture by Eitan Yaakobi from Technion. Delve into the DNA coverage depth problem, which aims to reduce the number of reads required for information retrieval, ultimately lowering costs and latency in DNA storage. Examine the impact of error-correcting codes and retrieval algorithms on sequencing coverage depth. Learn about the optimal conditions for minimizing expected read numbers, including the benefits of uniform channel distribution and MDS codes. Investigate the random-access setup for retrieving specific information units from DNA storage systems. Discover explicit code constructions that achieve improved retrieval times and their performance evaluations. Gain valuable insights into reducing costs and latency in DNA storage through comprehensive analytical methods and simulations presented in this Application-Driven Coding Theory talk from the Simons Institute.