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
UID:224536
DTSTAMP:20250926T085743Z
DTSTART;TZID=America/New_York:20250930T160000
DTEND;TZID=America/New_York:20250930T170000
URL;TYPE=URI:https://wpiedudev.wpi.edu/news/calendar/events/department-math
 ematical-sciences-discrete-math-seminar-stefano-lia-department-mathematics
 -and
SUMMARY:Department of Mathematical Sciences Discrete Math Seminar: Stefano 
 Lia, Department of Mathematics and Mathematical Statistics, Umea Universit
 y, Umea, Sweden
DESCRIPTION:\n\n\n      \n\n\n\nDepartment of Mathematical Sciences\nDiscre
 te Math Seminar\nTuesday, September 30th, 2025\n4:00PM-4:50PM\nOlin Hall 1
 26\nSpeaker: Stefano Lia, Department of Mathematics and Mathematical Stati
 stics, Umea University, Umea, Sweden\nTitle: Some combinatorial and coding
  theoretic problems in DNA data storage\nAbstract: As the volume of data p
 roduced daily grows at an accelerating rate, our storage capacity struggle
 s to keep pace. DNA data storage is emerging as a promising solution for l
 ong-term, high-capacity data storage and retrieval. Among its bold claims 
 is the ability to fit “all internet data in a shoebox.” However, several c
 hallenges must be addressed before this becomes a reality. A key challenge
  in DNA data storage is the random access coverage depth problem, which se
 eks to minimize the number of sequencing reads required to retrieve specif
 ic information from the storage system. This quantity can be modelled as a
  random variable, determined by the properties of the code used for data e
 ncoding. This problem imposes novel criteria for code selection, distinct 
 from those typically studied in classical coding theory, and presents new 
 mathematical challenges. In this talk, we will briefly introduce DNA data 
 storage and the mathematical aspects of the random access coverage depth p
 roblem.\n
END:VEVENT
END:VCALENDAR