Explore BrainMass
Share

Explore BrainMass

    Needleman-Wuncsh Dynamic Programming Method

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    Using the document attached, use the Needleman-Wunsch dynamic programming method to align the following pair of sequences.
    (see attached)

    Use the unitary scoring method to score the initial alignment matrix. Write the appropriate score into each square in the matrix below.
    (see attached)

    Use the Needleman-Wunsch dynamic programming based scoring algorithm to calculate the new sore for the alignment matrix. Write the appropriate score into each square in the matrix below.
    (see attached)

    Determine the alignment of these two sequences by retracing the path (traceback) and write the alignment and its score below.

    © BrainMass Inc. brainmass.com October 10, 2019, 6:05 am ad1c9bdddf
    https://brainmass.com/biology/cell-and-molecular-biology/needleman-wuncsh-dynamic-programming-method-528082

    Attachments

    Solution Preview

    Hi,

    I have posted the detailed response to the question of the Needleman-Wuncsh dynammic programming as an excel file attachment as well as below.

    Please open the excel file attachment to view it.

    Use the Needleman-Wunsch dynamic programming method to align the following pair of sequences. (1)

    S1: ATGGAT

    S2: AGGCAT

    Use a Scoring method: exact match = 1
    ...

    Solution Summary

    The Needleman-Wunsch dynamic programming is based on scoring algorithm to calculate the new score for the alignment matrix.

    $2.19