Implementation of the Dynamic Programming Matrix - IT Computer Science Assignment Help

Assignment Task :

Implementation of the dynamic programming matrix: 1.5 point

You can use any scoring scheme. 

• The code should be written in a way that allows to easily change the score assigned to matches, mismatches or gaps 
• Be careful with the indexes used to iterate through the matrix and through the sequences 
• The user should be able to pass sequences to the software without having to edit the code (e.g. from the command line, from a file, or using interactive input). If you use the Python IDLE, try to find a way to do that 
• The traceback can be implemented in different ways; you can recompute the optimal path on the fly from the last cell, but the simplest is to create another matrix, whose cells contain symbols or labels (e.g. UP, LEFT, DIAG)
• How to test your code?
• Try to run it on two very similar sequences, then on two very different sequences. If you also implement the local alignment algorithm, use two random sequences in which you plant a similar substring near the beginning of one sequence and near the end of the other

This  IT Computer Science Assignment has been solved by our IT Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style. Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.