Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alberts, B., Bray, D., Lewis, J., Raff, M., Roberts, K., Watson, J.D.: Molecular Biology of the Cell, 3rd edn. Garland Publishing, New York (1994)
Berge, C.: Hypergraphes. Gauthier-Villars (1987)
Cardon, L., Bell, J.: Association study design for complex diseases. Nat. Rev. Genet. 2, 91–99 (2001)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco (1979)
Gibbons, A.: Algorithmic Graph Theory. ch. 5. Cambridge University Press, Cambridge (1985)
Gut, G.: Automation of genotyping of single nucleotide polymorphisms. Human Mutation 17, 475–492 (2001)
Holyer, I.: The np-completeness of edge colorings. SIAM J. Comput. 10, 718–720 (1981)
Kivioja, T., Arvas, M., Kataja, K., Penttila, M., Soberlund, H., Ukkonen, E.: Assigning probes into a small number of pools separable by electrophoresis. Bioinformatics 1(1), 1–8 (2002)
Manisterski, E.: Optimal multiplexing schemes for snp genotyping massspectrometry. Master’s thesis, Bar Ilan University, Department of Computer Science (2001)
Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30, 417–427 (1983)
Ott, J.: Analysis of Human Genetic Linkage. Johns Hopkins University Press, Baltimore (1991)
Pritchard, J., Przeworski, M.: Linkage disequilibrium in humans: Models and data. Am. J. Hum. Genet. (69), 1–14 (2001)
Ross, P., Hall, L., Smirnov, I., Haff, L.: High level multiplex genotyping by maldi-tof mass spectrometry. Nature Biotechnolgy 16, 1347–1351 (1998)
Wang, D.G., Fan, J.B., Siao, C.J., Berno, A., Young, P.P., et al.: Large-scale identification, mapping, and genotyping of single- nucleotide polymorphisms in the human genome. Science 280(5366), 1077–1082 (1998)
Yakhini, Z., Webb, P., Roth, R.: Partitioning of Polymorphic DNAs. US Patent 6,074,831 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aumann, Y., Manisterski, E., Yakhini, Z. (2003). Designing Optimally Multiplexed SNP Genotyping Assays. In: Benson, G., Page, R.D.M. (eds) Algorithms in Bioinformatics. WABI 2003. Lecture Notes in Computer Science(), vol 2812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39763-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-39763-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20076-5
Online ISBN: 978-3-540-39763-2
eBook Packages: Springer Book Archive