Title:
Assembly of Big Genomic Data

No Thumbnail Available
Author(s)
Medvedev, Paul
Authors
Advisor(s)
Advisor(s)
Editor(s)
Associated Organization(s)
Series
Collections
Supplementary to
Abstract
As genome sequencing technologies continue to facilitate the generation of large datasets, developing scalable algorithms has come to the forefront as a crucial step in analyzing these datasets. In this talk, I will discuss several recent advances, with a focus on the problem of reconstructing a genome from a set of reads (genome assembly). I will describe low-memory and scalable algorithms for automatic parameter selection and de Bruijn graph compaction, recently implemented in two tools: KmerGenie and bcalm. I will also present recent advances in the theoretical foundations of genome assemblers.
Sponsor
Date Issued
2017-09-15
Extent
57:58 minutes
Resource Type
Moving Image
Resource Subtype
Lecture
Rights Statement
Rights URI