. For I = GTATCGGCGC and J = CGGTTCGTATCGTCG, make a 2-word list for J. Then execute the FASTA algorithm (Example 7.1) beginning with Sl = 0. Compute Si as you go through I, beginning at i = 1 and the...

.
For I = GTATCGGCGC and J = CGGTTCGTATCGTCG, make a 2-word

list for J. Then execute the FASTA algorithm (Example 7.1) beginning with

Sl = 0. Compute Si as you go through I, beginning at i = 1 and the 2-word

GT, and ending at i = 9.

.
To search J = CGGTTCGTATCGTCG for matches to TTCG within

one mismatch, first make a list of all possible matches. How many matches

are there within a single mismatch neighborhood of TTCG? [Hint: There is one

exact pattern, and there are 3 × 4 = 12 single-mismatch patterns.]