BEGIN:VCALENDAR
CALSCALE:GREGORIAN
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Drupal iCal API//EN
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
DTSTART:20070311T020000
TZNAME:EDT
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
DTSTART:20071104T020000
TZNAME:EST
TZOFFSETTO:-0500
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:1
X-APPLE-TRAVEL-ADVISORY-BEHAVIOR:AUTOMATIC
224536
20250926T085743Z
DTSTART;TZID=America/New_York:20250930T160000
DTEND;TZID=America/New_York:2
 0250930T170000
URL;TYPE=URI:/news/calendar/events/depar
 tment-mathematical-sciences-discrete-math-seminar-stefano-lia-department-m
 athematics-and
Department of Mathematical Sciences Discrete Math Seminar: Stefano Lia, Dep
 artment of Mathematics and Mathematical Statistics, Umea University, Umea,
  Sweden
\n\n\n      \n      \n\n\n\nDepartment of Mathematical Sciences\nDiscrete Math Seminar\nTuesday, September 30th, 2025\n4:
 00PM-4:50PM\nOlin Hall 126\nSpeaker: Stefano Lia, Department of Mathematic
 s and Mathematical Statistics, Umea University, Umea, Sweden\nTitle: Some 
 combinatorial and coding theoretic problems in DNA data storage\nAbstract:
  As the volume of data produced daily grows at an accelerating rate, our s
 torage capacity struggles to keep pace. DNA data storage is emerging as a 
 promising solution for long-term, high-capacity data storage and retrieval
 . Among its bold claims is the ability to fit 鈥渁ll internet data in a sh
 oebox.鈥?However, several challenges must be addressed before this become
 s a reality. A key challenge in DNA data storage is the random access cove
 rage depth problem, which seeks to minimize the number of sequencing reads
  required to retrieve specific information from the storage system. This q
 uantity can be modelled as a random variable, determined by the properties
  of the code used for data encoding. This problem imposes novel criteria f
 or code selection, distinct from those typically studied in classical codi
 ng theory, and presents new mathematical challenges. In this talk, we will
  briefly introduce DNA data storage and the mathematical aspects of the ra
 ndom access coverage depth problem.\n
END:VEVENT
END:VCALENDAR