A Study on Some Optimization Problems Related to SNPs and Haplotypes
Date Issued
2006
Date
2006
Author(s)
Huang, Yao-Ting
DOI
en-US
Abstract
This dissertation studies several optimization problems related to SNPs and haplotypes. Most problems studied in this dissertation are shown to be NP-hard. To efficiently solve these problems, we design and implement a series of approximation algorithms. Our theoretical analysis and experimental results indicate that these algorithms are
not only efficient but the solutions found by them are also quite close to the optimal solution.
In Part I of this dissertation, we show that there exists a set of SNPs called robust tag SNPs which can tolerate missing SNPs in genotyping. The problem of finding a minimum set of robust tag SNPs is shown to be NP-hard. We give two greedy algorithms and one linear programming relaxation algorithm to efficiently solve this problem. Our theoretical analysis and experimental results show that these algorithms not only run very fast but also find nearly-optimal solutions.
In Part II of this dissertation, we study the problem of selecting a minimum set of tag SNPs by multimarker haplotypes. This problem is divided into three subproblems, two of which are shown to be NP-hard. Several exact and approximation algorithms are proposed to solve these subproblems. The experimental results indicate that the program developed by integrating these algorithms finds a smaller set of tag SNPs and runs much faster than existing methods.
In Part III of this dissertation, we study the problem of haplotype inference by maximum parsimony. We formulate this problem as an integer quadratic programming problem and present an iterative semi-definite programming relaxation based approximation algorithm. Our theoretical analysis and experimental results show that the solution found is not only close to the optimal solution but the accuracy is also improved in comparison with existing methods.
In Part IV of this dissertation, we study the problem of selecting discriminative SNPs for classifying cases and controls in genome-wide association studies. We describe an efficient algorithm for identifying discriminative SNPs and compare it with several existing methods using a variety of classifiers. The experimental results indicate that our method consistently obtains better accuracies than other methods when sufficient discriminative SNPs are selected.
Subjects
單核苷
酸多型性
單體型
基因型
近似演算法
Single Nucleotide Polymorphism
Haplotype
Genotype
Appproximation Algorithm
Type
thesis