Skip to main content
. 2013 May 7;8(5):e62974. doi: 10.1371/journal.pone.0062974

Figure 3. Algorithm 1 - Optimal number of segments.

Figure 3

It presents the algorithm for computing the optimal segmentation based on the longest path in a directed acyclic graph.