|
Resolution: standard / high Figure 1.
An example for generialized branch-and-bounnd algorithm with 4 SNPs and 4 haplotypes. The htSNPs performance criterion is to distinguish all the different haplotypes. The depth-first searching starts from root, exploring nodes in the order N1, N2,..., N7. N2 is the globally optimal solution. N3,..., N7 are all pruned from further consideration.
Ding et al. BMC Bioinformatics 2005 6:38 doi:10.1186/1471-2105-6-38 |