009-2015

MO640 - Multiple-choice question

Consider the following alignments on DNA sequences, where matches, mismatches, and spaces are shown by '|', '.', and '-', respectively:

First Alignment:

5' ATTACCTAGATTACTTACGGATCAGGTACTTTAGAGGCTTGCTT 3' 
             |-|||.||||||.|||||||||||||||
          5' T-ACTCACGGATGAGGTACTTTAGAGGC 3'

Second Alignment:

5' ACTTCTAGATTACTTACGGATCAGGTACTTTAGAGGCTTGCAACCT 3'
   |||||||||||----|||||||--||||||||||||||.|||||||
5' ACTTCTAGATT----ACGGATC--GTACTTTAGAGGCTAGCAACCT 3'

and the following statements:

I. The first alignment is a global alignment.
II. The second alignment is both local and global.
III. The basic dynamic programming algorithm comparing two
sequences with same length n runs in time O(n²) .


Which alternative is true?

a. statements I, II, and III are correct
b. only statements I and II are correct
c. only statements I and III are correct
d. only statements II and III are correct
e. None of the above

Original idea by: Jessica Akemi Matsuoka