In this project you will implement two motif search algorithms. The first is branch and bound
motif search (JP, Page 111), and the second is a modified greedy motif search. The greedy motif
search method is an improved greedy algorithm over the algorithm shown on JP, Page 136. In the
book’s version, we take one pair of seed sequences by chosing the first and second sequence. In your
implementation, you should take 20 pairs of seed sequences; the pairs should be selected randomly.
The seed motif should be selected from the best pair. The remaining step of the method is identical
to the one in the book. In other word, Line 1-9 of the algorithm on Page 136 should be executed
over 20 pairs and the pair which has the best score decides the value of s1 and s2.