Combinatorial problems arising in SNP and haplotype analysis

21Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It is widely anticipated that the study of variation in the human genome will provide a means of predicting risk of a variety of complex diseases. This paper presents a number of algorithmic and combinatorial problems that arise when studying a very common form of genomic variation, single nucleotide polymorphisms (SNPs). We review recent results and present challenging open problems. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Halldórsson, B. V., Bafna, V., Edwards, N., Lippert, R., Yooseph, S., & Istrail, S. (2003). Combinatorial problems arising in SNP and haplotype analysis. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2731, 26–47. https://doi.org/10.1007/3-540-45066-1_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free