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:20181221T160744Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181115T083000
DTEND;TZID=America/Chicago:20181115T170000
UID:submissions.supercomputing.org_SC18_sess341_drs102@linklings.com
SUMMARY:Scalable Methods for Genome Assembly
DESCRIPTION:Doctoral Showcase\nWorkshop Reg Pass, Tutorial Reg Pass, Tech 
 Program Reg Pass, Exhibits Reg Pass, Exhibits - Exhibit Hall Only Reg Pass
 \n\nScalable Methods for Genome Assembly\n\nGhosh, Kalyanaraman\n\nGenome 
 assembly is a fundamental problem in the field of bioinformatics wherein t
 he goal lies in the reconstruction of an unknown genome from short DNA fra
 gments obtained from it. With the advent of high-throughput sequencing tec
 hnologies, billions of reads can be generated in a few hours. My reseach d
 eals with addressing the challenges of conducting genome assembly at scale
  and developing new methods for conducting extreme-scale genome assembly s
 uited for microbial genomes, and complex eukaryotic genomes. Our approach 
 to the problem is two-fold, wherein we target fast and space-efficient ass
 emblies of moderate sized genomes on a single node with our shared-memory 
 based implementation (FastEtch). Secondly we aim to tackle the assembly of
  very large genomes with our distributed-memory based approach (PaKman), i
 n an attempt to minimize the turnaround time such that it could potentiall
 y pave the way to conducting the assembly process in real-time.
URL:https://sc18.supercomputing.org/presentation/?id=drs102&sess=sess341
END:VEVENT
END:VCALENDAR