Efficient algorithms for sequence segmentation

The sequence segmentation problem asks for a partition of the sequence into k non-overlapping segments that cover all data points such that each segment is as homogeneous as possible. This problem can be solved optimally using dynamic programming in O(n 2 k) time, where n is the length of the sequen... View More