BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Computer Science - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Computer Science
X-ORIGINAL-URL:https://www.cs.jhu.edu
X-WR-CALDESC:Events for Department of Computer Science
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20261101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20270314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20271107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20260512T103000
DTEND;TZID=America/New_York:20260512T120000
DTSTAMP:20260501T025330
CREATED:20260427T142116Z
LAST-MODIFIED:20260427T142116Z
UID:1994646-1778581800-1778587200@www.cs.jhu.edu
SUMMARY:CS Seminar Series: Genome Assembly: The Long and Short of It
DESCRIPTION:Refreshments are available starting at 10:30 a.m. The seminar will begin at 10:45 a.m. \nAbstract\nGenome assembly is the process of reconstructing a complete sequence from relatively short-range data generated by sequencing instruments\, like a giant jigsaw puzzle with billions of pieces. While short-read sequencing made draft assemblies routine\, repetitive regions fragmented the results and prevented complete reconstruction. Sergey Koren’s research has focused on advancing genome assembly from fragmented drafts to complete\, haplotype-resolved\, telomere-to-telomere genomes using noisy long-read sequences. Existing tools to identify similarity between these sequences were slow; Koren’s team applied MinHash to dramatically accelerate similarity detection while preserving sensitivity\, enabling efficient assembly of mammalian-scale genomes. To resolve complex repeats where the assembly problem is under-constrained\, they first estimated edge multiplicities and transformed the graph to account for repeats. They then used a heuristic algorithm to identify the highest scoring Eulerian path. These innovations contributed directly to large-scale efforts to produce complete genome assemblies\, culminating in the Telomere-to-Telomere consortium and the first truly complete human genome sequence. Across these projects\, Koren’s work has integrated algorithm adaptation\, sequencing technology advances\, and collaborative genome science. \nSpeaker Biography\nSergey Koren received his PhD in computer science in 2012 under the supervision of Mihai Pop at the University of Maryland. He joined the National Bioforensics Analysis Center in 2011 and was appointed as an associate principal investigator in 2014. During this time\, he pioneered the use of single-molecule sequencing for the reconstruction of complete genomes. In 2015\, Koren joined the National Human Genome Research Institute as a founding member of the Genome Informatics Section. His research focuses on the efficient analysis of large-scale genomic datasets and new methods for analysis and assembly of high-noise single-molecule sequencing data. He is a key contributor to the Telomere-to-Telomere Consortium\, the Human Pangenome Reference Consortium\, and the Vertebrate Genomes Projects\, all collaborative efforts aimed at generating complete\, gapless references for vertebrate genomes. Koren is a recipient of the National Institutes of Health Director’s Award and is a Samuel J. Heyman Service to America Medal Finalist. \nZoom link »
URL:https://www.cs.jhu.edu/event/cs-seminar-series-genome-assembly-the-long-and-short-of-it/
LOCATION:228 Malone Hall
CATEGORIES:Seminars and Lectures
END:VEVENT
END:VCALENDAR