which of the 16 possible 2-mers has the highest value of totalDistance(v,DNA) from the DNA sequence ?

cctgatagacgctatctggctatcc

		cc
		ac
		tt
		gc

10 points

QUESTION 2

Instead of four bases, let's assume that 6 bases are needed for constructing DNA. In this case, how many leaf nodes will be there in the tree that stores all possible 2-mers ?

64

32

36

16

QUESTION 3

Consider the pseudo code of the motif search using greedy approach discussed in class (in Book it is in section 5.5). Let's say you are interested in a motif of length 4 and each sequence in DNA is of length 100, how many times line#5 in the pseudo code will be evaluated ?

		9409
		9216
		10000
		9312