Skip to main content
Figure 12 | Algorithms for Molecular Biology

Figure 12

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

Figure 12

The pre-condition of the Outside VMT algorithm. (a) An illustration of the matrix A upon computing AI, J(dotted entries). (b) An illustration of the pre-computed matrix β. The pre-condition requires that all entries in the sub-matrix A[0,I], [J,n], excluding AI, J, are computed (dark and light gray entries). In addition, AI, Jis either the result of the matrix multiplication (β[0,I),I)T α[0,I), J(the multiplication of the transposed striped dark gray matrix in β with the striped dark gray matrix in A), or the multiplication αI,(J, n] (βJ,(J, n])T (the multiplication of the non-striped dark gray matrix in A with the transposed non-striped dark gray matrix in β).

Back to article page