Talk: Prof. Eitan Yaakobi (October 22, 2025 at 10:00 AM, ICE library N2405)
Talks |
Extensions of the Coupon Collector’s Problem and Their Connection to DNA-based Storage Systems
Prof. Eitan Yaakobi
Technion — Israel Institute of Technology
Abstract:
The classical coupon collector’s problem describes the expected number of trials required to collect a complete set of distinct coupons. While elegant in its simplicity, real-world systems often demand more complex formulations. In this talk, I will present several extensions of the coupon collector’s problem that emerge naturally in the context of DNA-based data storage systems, where information is encoded, synthesized, and sequenced using pools of DNA molecules. These extensions capture the stochastic nature of molecular sampling, coverage redundancy, and error-prone read processes. By bridging probabilistic modeling with molecular biology, we derive insights into the efficiency, reliability, and limits of DNA storage architectures. I will discuss new analytical results and asymptotic behaviors of generalized coupon collection processes, and show how they inform the design of coding and decoding strategies that mitigate information loss and optimize resource usage in DNA storage. This synthesis of combinatorial probability and biotechnology highlights how classic mathematical models continue to evolve to meet the challenges of emerging storage paradigms.
Biography:
Eitan Yaakobi is a Professor at the Computer Science Department at the Technion --- Israel Institute of Technology. He received the B.A. degrees in computer science and mathematics, and the M.Sc. degree in computer science from the Technion --- Israel Institute of Technology, Haifa, Israel, in 2005 and 2007, respectively, and the Ph.D. degree in electrical engineering from the University of California, San Diego, in 2011. Between 2011-2013, he was a postdoctoral researcher in the department of Electrical Engineering at the California Institute of Technology and the Center of Memories and Recording Research at the University of California, San Diego. His research interests include information and coding theory with several applications to non-volatile memories, distributed storage, and private information retrieval. In particular, his work has been focused on advancing coding solutions for memories and systems and their application in state-of-the-art storage systems. He is also working on next generations memories such as racetrack memories and DNA-based storage systems. Since 2016, he is affiliated with the Center for Memory and Recording Research at the University of California, San Diego, and between 2018--2022, he was affiliated with the Institute of Advanced Studies, Technical University of Munich, where he held a four-year Hans Fischer Fellowship, funded by the German Excellence Initiative and the EU 7th Framework Program. Between August 2023 and January 2024, he was a Visiting Associate Professor at the School of Physical and Mathematical Sciences at Nanyang Technological University. Since 2024 he is a member of the Israel Young Academy. He is a recipient of several grants, including the ERC Consolidator Grant and the EIC Pathfinder Challenge.
Join on Zoom: https://tum-conf.zoom-x.de/j/66509237347?pwd=qbacK5WNyvSM6qDJrYNei9qvHd7EaX.1
Meeting ID: 665 0923 7347
Passcode: 545195