*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
In partial fulfillment of the Requirements for the Degree of
Doctor of Philosophy in Bioinformatics
in the
School of Biology
Peter Audano
Will defend his thesis
"SCALABLE MAPPING-FREE ALGORITHMS AND
K-MER DATA STRUCTURES FOR GENOMIC ANALYSIS"
Wednesday, June 22, 2016
11:00 AM
Molecular Science & Engineering Building, room 1201A
Thesis Advisor:
Dr. Fredrik Vannberg (School of Biology)
Committee Members:
Dr. King Jordan (School of Biology)
Dr. Srinivas Aluru (School of Computational Science and Engineering)
Dr. Brian Hammer (School of Biology)
Dr. Greg Gibson (School of Biology)
Abstract:
Modern genomic experiments are taking advantage of rapid growth in sequencing technology throughput. With so much data generated by a single sequencing run, many scientists are turning to distributed and cloud computing platforms to process it. Instead of finding new ways to dedicate more resources to this problem, Peter Audano will discuss new algorithms that reduce the computational burden of analysis. Most approaches begin by aligning sequence reads to a reference, but with an emerging class of mapping-free algorithms, hours of CPU time can be saved by skipping this step. This defense will discuss the fundamental k-mer data structures that support these methods and new variant calling techniques that work efficiently even where alignments fail.
