Skip to main content
. 2005 Feb 15;6:31. doi: 10.1186/1471-2105-6-31

Figure 3.

Figure 3

A toy example of bounded sparse dynamic programming. In this example the bounds indicate that if the overall alignment threshold is greater than 280, no sub-alignment DP is required. Otherwise, the region between A and B is confirmed first, and the bounds obviate DP between A and C. For clarity, terminal bounds are not included in this example.