Question: 6) (20 points) Given the sequences below, find the longest common sub sequence using the dynamic programming formulation discussed in class. Show the table and

6) (20 points) Given the sequences below, find the longest common sub sequence using the dynamic programming formulation discussed in class. Show the table and all the work. Also, show the final alignment of the two sequences (along with the gaps) Row Sequence TAAAATCTAG AGGACGGTGAA AATTTTTA Column Sequence GGGGTAACT CTTGGATC GCTTCTTTCT Student Name Uijwal Baskota Albert Boateng GTGIGGAA Nissi Campbell Samuel A. Dagne CGGCCAGGCGAT CGAGGTAAGTAG James Daniel GCTATTAT TTCIGATGTT T CAGATGTATCTG GAGACAGGAT ATAGAAATC TCGGGAT Amanuel E Gebre CTCAGGT Melrondarius Groom GATTGCACTA Yoseph Hailemariam GCTAAGO Antonie Hobson Portia Junius Justin McGuffee GTGAGGGGGA GTAGCAG AGTCCCG GCTCGATCTGCA A TACC TTTTAATCCAGCTGCAGAGAACTA GAGTAAG CCCCTATAGT AGAGOC TATCAA TOCGTGCAG TTCCGTAA GCCACG CTGACO CAATCGCAACGC TGGACTCCGCAC GGGTIC ACGOTTCCT Timothy Stewart Nebiyou Tadesse Phat Tran
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
