Skip to main content
Figure 15 | Algorithms for Molecular Biology

Figure 15

From: Reducing the worst case running times of a family of RNA and CFG problems, using Valiant’s approach

Figure 15

Multiple String VMT. (a) An example of a Multiple String VMT instance, with three strings. A sub-instance SX, Yconsists of three substrings (where X = {i0, i1, i2} and Y = {j0, j1, j2}). (b) Here, since j1 < i1 we have that X Y, and thus SX, Ydoes not correspond to a valid sub-instance. (c) A valid split of the sub-instance is obtained by splitting each one of the corresponding substrings s i p , j p p into a prefix s i p , q p p and a suffix s q p , j p p .

Back to article page