Figure 2

Recursion for partition function of subsequence [ i , j ] while [ k , l ] remains unpaired. Either the subsequence [i, j] is empty with recursion energy G = 0, or there exists one or more pairs with leftmost base pair k 1·k 2. There are three possibilities for the position of base pair k 1·k 2 and unpaired interval [k, l].