Question

In: Statistics and Probability

Align two sequences shown below using Needelman Wunsch algorithm. Use match score of 3, mismatch score...

Align two sequences shown below using Needelman Wunsch algorithm. Use match score of 3, mismatch score of -3 and gap penalty score of 2 (note, you should subtract this from the scoring function).

Show:

a) dynamic programming matrix with scores

b) trace back pointers

c) alignment score sequences:

sequence 1: AGAGCTCACAA

sequence 2: AGTAGCTTCCAAA

Expert Solution

A.

D		A	G	T	A	G	C	T	T	C	C	A	A	A
	0	-2	-4	-6	-8	-10	-12	-14	-16	-18	-20	-22	-24	-26
A	-2	3	1	-1	-3	-5	-7	-9	-11	-13	-15	-17	-19	-21
G	-4	1	6	4	2	0	-2	-4	-6	-8	-10	-12	-14	-16
A	-6	-1	4	3	7	5	3	1	-1	-3	-5	-7	-9	-11
G	-8	-3	2	1	5	10	8	6	4	2	0	-2	-4	-6
C	-10	-5	0	-1	3	8	13	11	9	7	5	3	1	-1
T	-12	-7	-2	3	1	6	11	16	14	12	10	8	6	4
C	-14	-9	-4	1	0	4	9	14	13	17	15	13	11	9
A	-16	-11	-6	-1	4	2	7	12	11	15	14	18	16	14
C	-18	-13	-8	-3	2	1	5	10	9	14	18	16	15	13
A	-20	-15	-10	-5	0	-1	3	8	7	12	16	21	19	18
A	-22	-17	-12	-7	-2	-3	1	6	5	10	14	19	24	22

B.

3.

A

G

T

A

G

C

T

C

-

C

A

G

-

A

G

C

T

-

C

A

C

A

-

Score = 22

orchestra answered 1 year ago

Match the descriptions below with the correct answer, using the letter codes shown in the table...

Match the descriptions below with the correct answer, using the letter codes shown in the table below. (8 points) A. Realizable value B. Percentage of receivables method C. 1/10, n/60 D. Bad debt Expense E. Aging of receivables F. Direct write-off method G. Operating cycle H. Specific identification method I. FOB shipping point J. Time period assumption K. n/10 EOM L. Percentage of sales method M. Permanent accounts N. 2/10, EOM O. 2/10, n/30 P. FOB destination The economic life...

SHOW WORK . Using the Boyer-Moore algorithm, find the Bad Match table for the below patterns.

SHOW WORK . Using the Boyer-Moore algorithm, find the Bad Match table for the below patterns. (8 points) i) Pattern1: AABCACCCA ii) Pattern 2: CCCAAABBD iii) Pattern3: ABCABCBAD iv) Pattern4: BSDGSBAA SHOW WORK

Use Quicksort algorithm to sort the following sequences: a.10, 80, 3, 19, 14, 7, 5, 12...

Use Quicksort algorithm to sort the following sequences: a.10, 80, 3, 19, 14, 7, 5, 12 b.Choose your sequence with 100different(random)integer numbers c.Choose your sequence with 1000different(random)integer numbers Please include your pseudocode, input sequence, and output in the report. Also, you need to analyze the computational time for different partition methods(e.g., best/worst/average cases)for sequences b and c. Will rate! design analysis and algorithms

Using the Boyer-Moore algorithm, find the Bad Match table for the below patterns. i) Pattern1: AABCACCCA...

Using the Boyer-Moore algorithm, find the Bad Match table for the below patterns. i) Pattern1: AABCACCCA ii) Pattern 2: CCCAAABBD iii) Pattern3: ABCABCBAD iv) Pattern4: BSDGSBAA

Using the Boyer-Moore algorithm, find the Bad Match table for the below patterns. Pattern1: AABCACCCA Pattern...

Using the Boyer-Moore algorithm, find the Bad Match table for the below patterns. Pattern1: AABCACCCA Pattern 2: CCCAAABBD Pattern3: ABCABCBAD Pattern4: BSDGSBAA

We would like to align two DNA sequences: (v) C G A T A C T,...

We would like to align two DNA sequences: (v) C G A T A C T, and (w) G A T T C G T : i) s(i, j) = 1.5 if vi = wj (matches); ii) s(i, j) = -1.0 if vi != wj (mismatches); iii) d = 0.25 (indels: insertions or deletions). What would be the maximum alignment score? Explain how you get the result.

Use the algorithm below to evaluate the following infix expression: a) a + 3 * 4...

Use the algorithm below to evaluate the following infix expression: a) a + 3 * 4 – 9 b) ( 2 + 6 ) / ( 3 – 5 ) . Algorithm WRITE STEP BY STEP Scan the characters in the infix expression. While there are characters left in the infix expression: Check the next character in the expression. 1. If the next character is operand, remove it from the expression and push it onto the operand stack. 2. If...

This question concerns the case of two input sequences. Prove that every algorithm that outputs all...

This question concerns the case of two input sequences. Prove that every algorithm that outputs all longest common subsequences of two input sequences has a worst-case running time that is exponential. To do so, show how to define, for every positive integer n, two length-n sequences Xn, Yn with lower bound (c^n) different longest common subsequences, where c>1 is a constant. You are allowed to use an alphabet of size n, i.e., the symbols in Xn, Yn can come from...

Build a Dynamic Programming algorithm in Python for the following problem. Given two sequences of vowels,...

Build a Dynamic Programming algorithm in Python for the following problem. Given two sequences of vowels, find the length of longest subsequence present in both of them. NOTE: A subsequence is a sequence that appears in the same order, but not necessarily contiguous. For example, “aei”, “aeo”, “eio”, “aiu”, ... are subsequences of “aeiou”. Sample Input 1: aeiou aiu Sample Output 1: 3 Sample Input 2: aeaiueoiuaeeoeooaauoi aeuioauuuoaeieeaueuiouaiieuiuuuaoueueauaeiauuo Sample Output 2: 16 Sample Input 3: iioioieiaiauaoeoiioiiue iuuueauiaieooaoaaouaaaae Sample Output 3:...

Question 1: Using Python 3 Create an algorithm The goal is to create an algorithm that...

Question 1: Using Python 3 Create an algorithm The goal is to create an algorithm that can sort a singly-linked-list with Merge-sort. The program should read integers from file (hw-extra.txt) and create an unsorted singly-linked list. Then, the list should be sorted using merge sort algorithm. The merge-sort function should take the head of a linked list, and the size of the linked list as parameters. hw-extra.txt provided: 37 32 96 2 25 71 432 132 76 243 6 32...