DNA storage is notable for its extraordinary data density, with the recent discovery of DNA stacks added to the method of storing memory bits in DNA. However, the exploration of dynamic DNA data structures for systematic storage and retrieval, such as trees or graphs, remains largely unexplored. These dynamic DNA data structures have the potential to enable innovative applications in information storage and retrieval. Error correction is crucial for maintaining the integrity of every DNA data structure due to the complexity of the biological processes involved. I will present various error-correcting codes relevant to data structures such as trees and graphs and those specifically designed for DNA storage.
Lev Yohanaov is a postdoctoral researcher at the University of Maryland, and Ben Gurion University. He received the B.Sc., M.Sc., and Ph.D. degrees in computer science from the Technion—Israel Institute of Technology, in 2016, 2018, and 2022, respectively, advised by Professor Eitan Yaakobi. His research interests include coding theory, information theory, algebra, and combinatorics.