BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv6.3.0//EN
X-ORIGINAL-URL:http://computationalgenomics.bioinformatics.ucla.edu/
X-WR-CALNAME:CGSI
X-WR-CALDESC:Computational Genomics Summer Institute
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
DTSTART;TZID=America/Los_Angeles:20190717T120000
DTEND;TZID=America/Los_Angeles:20190717T124500
DTSTAMP:20190708T191600
UID:MEC-c5c1bda1194f9423d744e0ef67df94ee@computationalgenomics.bioinformatics.ucla.edu
CREATED:20190708
LAST-MODIFIED:20190708
PRIORITY:5
TRANSP:OPAQUE
SUMMARY:Rayan Chikhi | Research | Q: Is de novo genome assembly with long reads a solved problem yet? A: No.
DESCRIPTION:Related papers:\nP Marijon, R Chikhi, JS Varré, Graph analysis of fragmented long-read bacterial genome assemblies, Bioinformatics (2019)\nM Schmid & al, Pushing the limits of de novo genome assembly for complex prokaryotic genomes harboring very long, near identical repeats, NAR (2018)\nS. Koren & al, Reply to ‘Errors in long-read assemblies can critically affect protein prediction’ Authors, Nature Biotech (2019)\nJ. Ruan, H. Li, Fast and accurate long-read assembly with wtdbg2, bioRxiv (2019)\nM. Kolmogorov & al, Assembly of long, error-prone reads using repeat graphs. Nat Biotech (2019)\n
URL:http://computationalgenomics.bioinformatics.ucla.edu/events/rayan-chikhi-research-q-is-de-novo-genome-assembly-with-long-reads-a-solved-problem-yet-a-no/
LOCATION:Mong Auditorium, Engineering VI
404 Westwood Plaza, Los Angeles, CA 90095
END:VEVENT
END:VCALENDAR