Fig. 3
From: Complexity and algorithms for copy-number evolution problems
Illustration of an item in the DP table for solving CN3. Given that the 4th position of \(\mathbf {m}\) is 2, one of the combinations considered is 1 deletion and 2 amplifications on the path to \(\mathbf {u}\), and 3 amplifications on the path to \(\mathbf {v}\). The best cost of that combination is computed by DP-Alg1 based on the L entries for position 3.