Efficient Algorithms for SNP Haplotype Block Selection Problems
Global patterns of human DNA sequence variation (haplotypes) defined by common single nucleotide polymorphisms (SNPs) have important implications for identifying disease associations and human traits. Recent genetics research reveals that SNPs within certain haplotype blocks induce only a few distinct common haplotypes in the majority of the population. The existence of haplotype block structure has serious implications for association-based methods for the mapping of disease genes. Our ultimate goal is to select haplotype block designations that best capture the structure within the data.
Here in this paper we propose several efficient combinatorial algorithms related to selecting interesting haplotype blocks under different diversity functions that generalizes many previous results in the literatures. In particular, given an m×n haplotype matrix A, we show linear time algorithms for finding all interval diversities, farthest sites, and the longest block within A. For selecting the multiple long blocks with diversity constraint, we show that selecting k blocks with longest total length can be be found in O(nk) time. We also propose linear time algorithms in calculating the all intra-longest-blocks and all intra-k-longest-blocks.
KeywordsDiversity Function Haplotype Block Linear Time Algorithm Diversity Constraint Output Size
Unable to display preview. Download preview PDF.
- 6.Greenspan, G., Geiger, D.: Model-Based Inference of Haplotype Block Variation. In: Seventh Annual International Conference on Computational Molecular Biology (2003)Google Scholar
- 8.International HapMap Project, http://www.hapmap.org/index.html.en
- 10.Hudson, R.R., Kaplan, N.L.: Statistical Properties of the Number of Recombination Events in the History of a Sample of DNA Sequences. Genetics 111, 147–164 (1985)Google Scholar
- 11.Li, W.H., Graur, D.: Fundamentals of Molecular Evolution. Sinauer Associates, Inc. (1991)Google Scholar