Write a Python program that takes as input a distance matrix file 
and a FASTA file of unaligned sequences and outputs the UPGMA tree
in newick format with sequence name. 

Submit one .py file containing all your solution. This means the
functions that you use must also be in this file. 

Test your program on the example shown on the website. 

We will test your program on one of the simulated datasets posted
on the class website. 

HOW TO SUBMIT YOUR ASSIGNMENT:

Copy your solution to your course directory 

/afs/cad/courses/bnfo/s15/bnfo/236/002/<UCID>

Use the Unix command 

cp <yoursolution>.py /afs/cad/courses/bnfo/s15/bnfo/236/002/<UCID>/

DUE DATE: 1:00pm, April 28th, 2015

Good luck!