TY - JOUR
T1 - Designing optimally multiplexed SNP genotyping assays
AU - Aumann, Yonatan
AU - Manisterski, Efrat
AU - Yakhini, Zohar
PY - 2003
Y1 - 2003
N2 - We consider the task of SNP (Single Nucleotide Polymorphism) genotyping. In many studies, genotyping of a large number of SNP must be performed. Multiple SNPs can be genotyped together in the same assay (a process called multiplexed genotyping), provided they adhere to some constraints. We address the optimization problem of designing assays that maximize the number of SNPs genotyped, subject to the multiplexing constraints. We focus on the SNP genotyping method based on primer extension and mass-spectrometry (PEA/MS). We translate the optimization problem to a graph coloring problem, and provide an essentially optimal heuristics for solving the corresponding coloring problem. In addition, we present a method that enables a dramatic increase in the multiplexing rate by modifying primer masses. In this case, the multiplexing design problem can be modelled as a matching problem in hypergraphs. We analyze the problem from both theoretical and practical aspects, providing theoretical hardness results and practical heuristics. The heuristics are tested using simulation methods, and prove to be close to optimal in practice.
AB - We consider the task of SNP (Single Nucleotide Polymorphism) genotyping. In many studies, genotyping of a large number of SNP must be performed. Multiple SNPs can be genotyped together in the same assay (a process called multiplexed genotyping), provided they adhere to some constraints. We address the optimization problem of designing assays that maximize the number of SNPs genotyped, subject to the multiplexing constraints. We focus on the SNP genotyping method based on primer extension and mass-spectrometry (PEA/MS). We translate the optimization problem to a graph coloring problem, and provide an essentially optimal heuristics for solving the corresponding coloring problem. In addition, we present a method that enables a dramatic increase in the multiplexing rate by modifying primer masses. In this case, the multiplexing design problem can be modelled as a matching problem in hypergraphs. We analyze the problem from both theoretical and practical aspects, providing theoretical hardness results and practical heuristics. The heuristics are tested using simulation methods, and prove to be close to optimal in practice.
UR - http://www.scopus.com/inward/record.url?scp=35248901075&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-39763-2_24
DO - 10.1007/978-3-540-39763-2_24
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:35248901075
SN - 0302-9743
VL - 2812
SP - 320
EP - 338
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -