Table 2
|
Precomputed expressions used in the proof of Lemma 4.7 |
|||
| Case |
 |
dS(x1, xr) |
 |
|
|
|||
| (i) |
1 |
1 |
n - j |
| (ii) |
0 |
0 |
n - j |
| (iii) |
2 |
0 |
j - i + 1 |
| (iv) |
1 |
1 |
j - i + 1 |
| (v) |
0 |
0 |
j - i + 1 |
|
|
|||
| Case |
 |
 |
|
|
|
|||
| (i) |
(j - 1)(n - j) + (r - j - 1)j |
j |
|
| (ii) |
(r - 2)(n - j) |
n - j |
|
| (iii) |
(j - i + 1)(n - 2j + 2i + r - 4) |
j - i + 1 |
|
| (iv) |
(i - 2)(j - i + 1) + (r - i)(i - 1 + n - j) |
i - 1 + n - j |
|
| (v) |
(r - 2)(j - i + 1) |
j - i + 1 |
|
Bryant et al. Algorithms for Molecular Biology 2007 2:8 doi:10.1186/1748-7188-2-8 |
|||