Computational problems for human genome single necleotide polymophism (SNP) data

Date: 
Thursday, March 9, 2006 - 9:40am

Ting Chen
Date: Wenesday, March 15, 2006
Time: 3:00pm-4:00pm
Location: Engineering I, Room 2114

Abstract:
Single nucleotide polymorphisms (SNPs) are common DNA sequence variations among individuals. They promise to significantly advance our ability to understand and treat human disease. In this talk, we will introduce some fundamental computational problems in analyzing large-scale human genome SNP data, including the structure of SNP sequences (called haplotypes) on the genome, selection of representative SNPs (called tag SNPs), inference of missing SNPs, and haplotype inference.

Biography:
currently unavailable

Host: Ambuj Singh