Haplotypes and informative SNP selection algorithms: Don't block out information

Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB

Volumn , Issue , 2003, Pages 19-27

  Bafna, Vineet ^a   Halldórsson, Bjarni V ^b   Schwartz, Russell ^c   Clark, Andrew G ^d   Istrail, Sorin ^b  

^a Ctr for the Advancement of Genomics   (United States)

^b Informatics Research   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

^d Department of Obstetrics Gynecology   (United States)

Author keywords

Haplotype blocks; Haplotype tagging; SNPs

Indexed keywords

DISEASES; DNA; GENES;

HAPLOTYPE TAGGING;

ALGORITHMS;

EID: 0038039701     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Gonçalo R. Abecasis, Stacey S. Cherny. William O. Cookson, and Lon R. Cardon. Merlin - rapid analysis of dense genetic maps using sparse gene flow trees. Nature Genetics, 30:97-101, 2002.
2. Hadar I. Avi-Itzhak, Xiaoping Su, and Francisco M. De La Vega. Selection of minimum subsets of single nucleotide polymorphism to capture haplotype block diversity. In Proceedings of Pacific Symposium on Biocomputing, pages 466-477, 2003.
3. V. Bafna, D. Gusfield, G. Lancia, and S. Yooseph. Haplotyping as a perfect phylogeny. a direct approach. Journal of Computational Biology, 2003. To appear.
4. K.M.J. De Bontridder, B.V. Halldórsson. M.M. Halldorsson, C.A.J. Hurkens, J.K. Lenstra, R. Ravi, and L. Stougie. Approximation algorithms for the minimum test cover problem. Mathematical Programrning-B, 2003. To Appear.
5. K.M.J. De Bontridder, B.J. Lageweg, J.K. Lenstra, J.B. Orlin, and L. Stougie. Branch and bound algorithms for the test cover problem. In Proceedings of the 10th Annual European Symposium on Algorithms (ESA), pages 223-233, 2002.
6. D. Clayton. Choosing a set of haplotype tagging SNPs from a larger set of diallelic loci. www.nature.com/ng/journal/v29/n2/extref/ngl001-233-S10.pdf, 2001.
7. Gusfield D. Algorithms on Strings, Trees, and Sequences. Cambridge University Press. 1997.
8. M.J. Daly, J.D. Rioux, S.F. Schaffner, T.J. Hudson, and E. S. Lander. High-resolution haplotype structure in the human genome. Nature Genetics, 29:229-232, 2001.
9. B. Devlin and N. Risch. A comparison of linkage disequilibrium measures for fine-scale mapping. Genomics, 29:311-322, 1995.
10. D. E. Reich et al. Linkage disequiblirium in the human genome. Nature, 2001.
11. S.B. Gabriel, S.F. Schaffner, H. Nguyen, J.M. Moore, J. Roy, B. Blumenstiel, J. Higgins, M. DeFelice, A. Lochner, M. Faggart, S.N. Liu-Cordero, C. Rotimi, A. Adeyemo, R. Cooper, R. Ward, E.S. Lander, M.J. Daly, and D. Altschuler. The structure of haplotype blocks in the human genome. Science, 296:2225-2229, 2002.
12. B.V. Halldorsson, M.M. Halldórsson, and R. Ravi. On the approximability of the test collection problem. In Proceedings of the 9th Annual European Symposium, on Algorithms (ESA), pages 158-169, 2001.
13. D. S. Hirschberg. A linear space algorithm for computing maximal common subsequence. Communications of the ACM, 18:341-343, 1975.
14. R.R. Hudson and N.L. Kaplan. Statistical properties of the number of recombination events in the history of a sample of DNA sequences. Genetics, 111:147-164, 1985.
15. A.J. Jeffreys, L. Kauppi, and R. Neumann. Intensely punctute meiotic recombination in the class IT region of the major histocompatibility complex. Nature Genetics, 29:217-222, 2001.
16. R. Judson, B. Salisbury, J. Schneider, A. Windemuth, and J. C. Stephens. How many SNPs does a genome-wide haplotype map require? Pharmacogenomics, 3:379-391, 2002.
17. L. Kruglyak. Prospects for whole-genome linkage mapping of common disease genes. Nature Genetics. 22:139-144, 1999.
18. G. Lancia, V. Bafna, S. Istrail, R. Lippert, and R. Schwartz. SNPs problems, complexity and algorithms. In Proceedings of the 9th Annual European Symposium on Algorithms (ESA), pages 182-193, 2001.
19. R. Lippert, R. Schwartz, G. Lancia, and S. Istrail. Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem. Briefings in Bioinformatics, 3(1):23-31, 2002.
20. D. A. Nickerson, S. L. Taylor, S. M. Fullerton, K. M. Weiss, A. G. Clark, J. H. Stengaard, V. Salomaa, E. Boerwinkle, and C. F. Sing. Sequence diversity and large-scale typing of SNPs in the human apolipoprotein E gene. Genome Research, 10:1532-1545, 2000.
21. N. Patil et al. Blocks of limited haplotype diversity revealed by high resolution scanning of human chromosome 21. Science, 294:1719-1722, 2001.
22. R. Rizzi, V. Bafna, S. Istrail, and G. Lancia, Practical algorithms for the single individual SNP haplotyping problem. In Workshop on Algorithms in Bioinformalics, pages 29-43, 2002.
23. F. M. De La Vega, X. Su, H. Avi-Itzhak, B. V. Halldórsson, D. Gordon, A. Collins, R. A. Lippert, R. Schwartz, C. Scafe, Y. Wang, M. Laig-Webster, R. T. Koehler, J. Ziegle, L. Wogan, J.F. Stevens, K.M. Leinen, S.J. Olson, K.J. Guegler, X. You, L. Xu., H.G. Hemken, F. Kalush, A. G. Clark, S. Istrail, M. W. Hunkapiller, E. G. Spier, and D. A. Gilbert. The profile of linkage disequilibrium across human chromosomes 6, 21, and 22 in African-American and Caucasian populations. In preparation, 2003.
24. K. Weiss and A. Clark. Linkage diseuilibrium and ehe mapping of comples human traits. Trends in Genetics, 18(1):19-24, 2002.
25. K. Zhang, M. Deng, T. Chen, M.S. Waterman, and F. Sun. A dynamic programming algorithm for haplotype block partitioning. Proceedings of the National Academy of Sciences. 99(11).7335-7339, 2002.