Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Find a longest common subsequence (LCS) of two DNA sequences and fill the following table using the method described in the course. S1= CGATAG S2=GCATA G A T A G G A A Remember: When you fill in a cell, you consider: 1. The cell directly to the left of it 2. The cell directly above it The cell to the above-left of it. The three values below correspond, respectively, to the values returned by the three recursive subproblems I listed earlier. 3. 4. V1 = the value in the cell to the left 5. V2 = the value in the cell above 6. V3 = the value in the cell to the above-left You fill in the empty cell with the maximum of these three numbers: V1, V2, V3 + 1 if C1 equals C2, or V3 if C1 is not equal to C2, where C1 is the character above the current cell and C2 is the character to the left of the current cell Note that, add arrows that point back to which of those three cells that been used to get the value for the current cell. In the case of equal numbers, where the new number could have come from more than one cell, pick an arbitrary one: the one to the above- left, say have more priority than the one comes from left than the one comes from above.

Find a longest common subsequence (LCS) of two DNA sequences and fill the following table using the method described in the course. S1= CGATAG S2=GCATA G A T A G G A A Remember: When you fill in a cell, you consider: 1. The cell directly to the left of it 2. The cell directly above it The cell to the above-left of it. The three values below correspond, respectively, to the values returned by the three recursive subproblems I listed earlier. 3. 4. V1 = the value in the cell to the left 5. V2 = the value in the cell above 6. V3 = the value in the cell to the above-left You fill in the empty cell with the maximum of these three numbers: V1, V2, V3 + 1 if C1 equals C2, or V3 if C1 is not equal to C2, where C1 is the character above the current cell and C2 is the character to the left of the current cell Note that, add arrows that point back to which of those three cells that been used to get the value for the current cell. In the case of equal numbers, where the new number could have come from more than one cell, pick an arbitrary one: the one to the above- left, say have more priority than the one comes from left than the one comes from above.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Find a longest common subsequence (LCS) of two DNA sequences and fill the following table using the method described in the course. S1= CGATAG S2=GCATA G A T A G C A A Remember: When you fill in a cell, you consider: 1. The cell directly to the left of it 2. The cell directly above it The cell to the above-left of it. The three values below correspond, respectively, to the values returned by the three recursive subproblems I listed earlier. 3. 4. V1 = the value in the cell to the left 5. V2 = the value in the cell above 6. V3 = the value in the cell to the above-left You fill in the empty cell with the maximum of these three numbers: V1, V2, V3 + 1 if C1 equals C2, or V3 if C1 is not equal to C2, where C1 is the character above the current cell and C2 is the character to the left of the current cell Note that, add arrows that point back to which of those three cells that been used to get the value for the current cell. In the case of equal numbers, where the new number could have come from more than one cell, pick an arbitrary one: the one to the above- left, say have more priority than the one comes from left than the one comes from above.
Transcribed Image Text:Find a longest common subsequence (LCS) of two DNA sequences and fill the following table using the method described in the course. S1= CGATAG S2=GCATA G A T A G C A A Remember: When you fill in a cell, you consider: 1. The cell directly to the left of it 2. The cell directly above it The cell to the above-left of it. The three values below correspond, respectively, to the values returned by the three recursive subproblems I listed earlier. 3. 4. V1 = the value in the cell to the left 5. V2 = the value in the cell above 6. V3 = the value in the cell to the above-left You fill in the empty cell with the maximum of these three numbers: V1, V2, V3 + 1 if C1 equals C2, or V3 if C1 is not equal to C2, where C1 is the character above the current cell and C2 is the character to the left of the current cell Note that, add arrows that point back to which of those three cells that been used to get the value for the current cell. In the case of equal numbers, where the new number could have come from more than one cell, pick an arbitrary one: the one to the above- left, say have more priority than the one comes from left than the one comes from above.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS