CSCI570-SequenceAlignment

Implementation of both the basic Dynamic Programming and the Efficient Divide and Conquer solutions to the Sequence Alignment problem.

TASKS TO DO:

1. Create github - 3 --> Marta || DONE

2. Develop input extractor - 20 --> Peter || DONE

3. Create Basic.java + Main method - 4 ---> Marta || DONE

4. Develop compute M method - 15 ---> Yen || DONE

5. Create Efficient.java + Main method - 4 ---> Yen || DONE

6. Develop compute optimal - 8 ---> Marta || DONE

   6.1. Test compute optimal

7. Develop divide method - 10 ---> Peter

8. Develop conquer method - 10 ---> Marta

9. Develop Ouput generator - 15 ---> Peter

10. Execute code + do graphs for report - 20 ---> Yen || DONE

11. Write report - 20 --> Marta

12. Create ssh file - 2 --> Peter

Sameple Instruction to run the program for now (subject to change later):

javac Basic2.java

java Basic2 ../SampleTestCases/input1.txt