If anyone could provide any help with the below assignment it would be greatly a

Question

If anyone could provide any help with the below assignment it would be greatly appreciated. Keep in mind that this is in C code.

Task For this assignment, your primary tasks are 1) to write a function that receives two strings (or sequences), and 2) to return the best pairwise alignment, and the graph used to perform the alignment. The best pairwise alignment between two strings is the one that minimizes the edit distance. The edit distance is determined by the number of operations required to transform one string to another. The Levenshtein Distance is one measure of difference between two strings, and example source code can be found online at http://rosettacode.org/wiki/Levenshtein_distance. Operations on strings are performed character by character. The operations permitted are insertion of a character into the first string, the deletion of a character from the first string, or the substitution (or replacement) of a character in the first string with a character from the second string. For example, letting I denote the insert operation, D denote the delete operation, R the substitute (or replace) operation, and M the nonoperation of

Explanation / Answer

Hi, I can do a high quality guaranteed A+ solution for you. Trust me once and I will help you forever. Just follow the instruction here: http://programmingtutor3.tk

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.