Related Experiment Video
Updated: Jun 10, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
Published on: December 10, 2012
A novel efficient dynamic programming algorithm for haplotype block partitioning
J Zahiri1, G Mahdevar, A Nowzari-Dalini
1Department of Bioinformatics, Institute of Biochemistry and Biophysics, University of Tehran, Tehran, Iran.
Abstract:
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 sets from chromosome 21 in three different population data sets from HapMap data bulk; the obtained results show the efficiency and better performance of our algorithm in comparison with three other well known methods.
Related Concept Videos
Extraction: Partition and Distribution Coefficients
For extracting a solute from an aqueous phase into an organic...
Genome-wide Association Studies-GWAS
GWAS does not require the identification of the target gene involved in...
Conservative Site-specific Recombination and Phase Variation
The recognition sites for Cre recombinase called LoxP...

