Related Experiment Video
Updated: Aug 1, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
Published on: December 10, 2012
Multiple-changepoint testing for an alternating segments model of a binary sequence
1Department of Molecular Genetics and Microbiology, University of New Mexico, Albuquerque 87131, USA. aaron.halpern@celera.com
Abstract:
A binary sequence may give the appearance of being composed of alternating segments with relatively high and relatively low probability of success. Determining whether such an alternating pattern is significant is a multiple-changepoint problem where the number of segments and their success probabilities are unknown, with the added constraint of segment alternation. A dynamic programming method for determining the optimal segmentation into a given number of segments is provided. Given this, a variation on the simulation method of Venter and Steel (1996, Computational Statistics and Data Analysis 22, 481-504) may be employed to test the null hypothesis of a homogeneous sequence as well as to estimate the number and location of changepoints. A sample application, the assessment of the possibility of genetic recombination in HIV sequences, is presented.
Related Concept Videos
Test for Homogeneity
Wald-Wolfowitz Runs Test I
The test works...
Sign Test for Matched Pairs
To conduct the sign test, we first calculate the differences in value between...
Wald-Wolfowitz Runs Test II
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and 0s. In...
Per-Unit Sequence Models
Zero-sequence currents, which are identical in magnitude and phase, generate a neutral current, resulting in voltage drops across the neutral impedance and the low-voltage winding. If the...
Point and Frameshift Mutations

