## Keynote Speaker

### Prof Sanguthevar Rajasekaran,University of Connecticut,USA

#### Title-The Closest Pair Problem: Algorithms and Applications

##### Given a set of n points in a metric space, the closest pair problem (CPP) is to identify the closest
pair of points. This problem has numerous applications. Examples include clustering, time series
motifs identification, and GWAS. In this talk we summarize some of the algorithms that have
been proposed for solving this problem. We also focus on the k-locus problem as an application
in GWAS.

Click here for profile