Answer:
The answer is explained below
Explanation:
The greedy reassembly algorithm is used to assembles the reads into the correct DNA sequence.
Solution:
The first step is to see the longest prefix that is the suffix of the other string is of length 11:-
AGCTGTTTTCGTT and CTGTTTTCGTTA
After combining these two we get:
AGCTGTTTTCGTTA
Next we take is of length 8:
TTTCGTTATACAT and AGCTGTTTTCGTTA
After combining these two we get:
AGCTGTTTTCGTTATACAT
Next we take is of length 7:
TATACAT and AGCTGTTTTCGTTATACAT
We can get :
AGCTGTTTTCGTTATACAT
Next we take is of length 7 again:
CACTCCATTTTA and CATTTTAGCTGTT
After combining these two we get:
CACTCCATTTTAGCTGTT
After, this we will only be left with 2 strings:
CACTCCATTTTAGCTGTT and AGCTGTTTTCGTTATACAT
We take the length 7 again:
The final string will be:-
CACTCCATTTTAGCTGTTTTCGTTATACAT
