A novel efficient dynamic programming algorithm for haplotype block partitioning.

Abstract excerpt

In this paper, a new efficient algorithm is presented for haplotype block partitioning based on haplotype diversity. In this algorithm, finding the largest meaningful block that satisfies the diversity condition is the main goal as an optimization problem. The algorithm can be performed in polynomial time complexity with regard to the number of haplotypes and SNPs. We apply our algorithm on three biological data...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Alleles
• Share to Asian People