BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260522T150110Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181114T083000
DTEND;TZID=America/Chicago:20181114T170000
UID:submissions.supercomputing.org_SC18_sess326_spost101@linklings.com
SUMMARY:Accelerating DNA Long Read Mapping with Emerging Technologies
DESCRIPTION:Roman Kaplan (Israel Institute of Technology)\n\nDNA sequencin
 g technologies output only short fragments of a genome, called reads. New 
 single-molecule real-time sequencing technologies can produce long reads, 
 up to tens of thousands base pairs, within minutes. However, these long re
 ads may contain up to 15% errors.\n\nTo construct a genome from DNA reads,
  a computationally expensive bioinformatics task, read mapping, is require
 d. Read mapping finds the best-fitting location for each DNA read on a lon
 g reference sequence.  The length and error rate of long reads poses a cha
 llenge for existing read mapping hardware solutions, designed for short re
 ads with low error rates. This work presents a novel DNA read mapping hard
 ware architecture, RASSA. RASSA is a Resistive Approximate Similarity Sear
 ch Accelerator that exploits charge distribution and parallel in-memory pr
 ocessing to reflect a mismatch count between DNA sequences. RASSA implemen
 tation of long read DNA mapping outperforms state-of-the-art long read map
 ping solution by 16-77x with comparable accuracy.\n\nRegistration Category
 : Tech Program Reg Pass, Exhibits Reg Pass\n\n
END:VEVENT
END:VCALENDAR