where (tilde N = bigcup nolimits _{k = 1}^{l} {{N_{k}}} ), and assume that ({f_{l}}left ({tilde c} right) = - infty ) if the sub-instance has no feasible solution.
Given a pair of integers l (1≤l≤r) and ({tilde c}) (left ({0 le tilde c le c} right)), consider the sub-instance of MCKP consisting of subset N 1,…,N l and capacity ({tilde c}).
Given any one instance of the knapsack problem, consider the sub-instance defined by items 1,…,j and capacity u and v (j≤n,u≤c 1,v≤c 2).
This problem requires the computation of several inside and outside properties for every sub-instance of the input.
In the case where X ≰ Y, we say that S X, Y does not correspond to a valid sub-instance.
In this case, the optimal alignment cost is obtained immediately from applying Equation 5 for this specific sub-instance, as formulated by term III in the equation.
Say that S X', Y' is a strict sub-instance of S X, Y if X ≤ X' ≤ Y' ≤ Y, and S X', Y' ≠ S X, Y.
1. Instances of the problem are strings, and the goal of the problem is to compute for every sub-instance s i, j ¯ of an input string s, a series of outside properties α i, j 1, α i, j 2, …, α i, j K. 2. Let s i, j ¯ be a sub-instance of some input string s.
Here, for the case where μ i, j k = ⊕ q ∈ [ 0, i ) β q, i k ⊗ α q, j k ′, the value μ i, j k reflects an expression which examines all possible splits of s i, j ¯ into a sub-instance of the form s q, j ¯, where q < i, and a sub-instance of the form s q, i.
As for the Inside VMT algorithm, it is simple to extend the presented algorithm to the case where the goal is to compute a series of outside properties for every sub-instance of the input.
When X ≤ Y, denote by S X, Y the sub-instance S X, Y = s i 0, j 0 0, s i 1, j 1 1, …, s i m - 1, j m - 1 m - 1 of S (see Figure 15a).
