A simple test case for the motif finding problem

Since the output of the algorithm SIMPLE_CONSENSUS depends on the order of the sequences that you use to process them and we haven't specified the order in the homework, it is hard to come up with a good test case; two correct implementations may produce different results.

However, you may test your code on the following 8 random sequences to see if you can discover the planted motif "TCACGTTG" at offset 10. Since the expected number of occurrences of the motif in these sequences is 1/200, there is a good chance that a SIMPLE_CONSENSUS program finds it.

For your convenience, the fasta file for these 8 sequences is also available here.


>random0
AGGCCTGTCTCACGTTGTTCGCAGAACACAAAAATGGCTC
>random1
GCGCCGCTCTCACGTTGTAGTGGCGAGGAGCAGCAGCTAG
>random2
TTTTGGCACTCACGTTGCCCTATTGATTCGCACTTTACAT
>random3
TGACGCTAGTCACGTTGCAGTAATAAGGGACAATTTATTA
>random4
TATAATTGTTCACGTTGGGAAATGTCAACTCGTCTCGTAC
>random5
CGGGCTTTATCACGTTGTCAAGTTCAGCTTTAGAACCCGT
>random6
GCCTGCTCTTCACGTTGTCGTTACATGCGAAGCTCTATAA
>random7
TGGCACTGCTCACGTTGCTGGCGACCGAGGGTGCGCTCTG