Figure 4From: Reducing the worst case running times of a family of RNA and CFG problems, using Valiant’s approachThe table B maintained by the DP algorithm. In order to compute Bi, j, the algorithm needs to examine only values in entries of B that correspond to strict substrings of si, j(depicted as light and dark grayed entries).Back to article page