An MDL method for finding haplotype blocks and for estimating the strength of haplotype block boundaries.
We describe a new method for finding haplotype blocks based on the use of the minimum description length principle. We give a rigorous definition of the quality of a segmentation of a genomic region into blocks, and describe a dynamic programming algorithm for finding the optimal segmentation with respect to this measure. We also describe a method for finding the probability of a block boundary for each pair of adjacent markers: this gives a tool for evaluating the significance of each block boundary. We have applied the method to the published data of Daly et al. The results are in relatively good agreement with the published results, but also show clear differences in the predicted block boundaries and their strengths. We also give results on the block structure in population isolates.
Koivisto
M
M
Department of Computer Science and HIIT Basic Research Unit, University of Helsinki, Helsinki, Finland.
Perola
M
M
Varilo
T
T
Hennah
W
W
Ekelund
J
J
Lukk
M
M
Peltonen
L
L
Ukkonen
E
E
Mannila
H
H
D000465:Algorithms; D002878:Chromosomes, Human, Pair 1 / Q000235:genetics; D019295:Computational Biology; D030541:Databases, Genetic; D005387:Finland; D005819:Genetic Markers; D005828:Genetics, Population; D015894:Genome, Human; D006239:Haplotypes; D006801:Humans; D008957:Models, Genetic; D020641:Polymorphism, Single Nucleotide
D005819:Genetic Markers