Consider the Longest Common Subsequence (LCS) problem. You are given two strings A and Band you areto return the longest common subsequence in A and B. A subsequence of a string is defined to be the initial string with 0 or more characters removed. For example if A="MOHAMED", B="AHMED", the length of the LCS of A and B is 4 (“HMED" or “AMED") a. Using dynamic programming, write an algorithm that finds the length of the LCS of two given strings A and B. b. What is the complexity of your algorithm? c. Show the dynamic programming table for A="MOHAMED" and B="AHMED".

Consider the Longest Common Subsequence (LCS) problem. You are given two strings A and Band you areto return the longest common subsequence in A and B. A subsequence of a string is defined to be the initial string with 0 or more characters removed. For example if A="MOHAMED", B="AHMED", the length of the LCS of A and B is 4 (“HMED" or “AMED") a. Using dynamic programming, write an algorithm that finds the length of the LCS of two given strings A and B. b. What is the complexity of your algorithm? c. Show the dynamic programming table for A="MOHAMED" and B="AHMED".

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter4: Making Decisions

Section: Chapter Questions

Problem 9RQ

See similar textbooks

Similar questions

Q: Compute the longest common subsequence by computing the table for given two strings. X = <T, A, G, T, C, A, C, G> Y = <A, G, A, C, T, G, T, C>
1. Consider strings that contain only the capital letters A, B and C. A) Find a recurrence relation for the number of such strings of length n that contain two consecutive C letters. What are the initial conditions? B) How many such strings of length six contain two consecutive C letters? C) Answer the question in point b using the Inclusion-Exclusion Principle (set A contains all strings of length six where CC occupy the first two positions, set B contains all strings of length six where CC occupy the second and third position, etc.).
Let K be the total calculated in step 4.a.i, and let LSUBS be the set of all subsets of n strings taken from L, 2 ≤ n < m. Continuing the example above for n = 2, LSUBS might be enumerated in the format { {AAAAA, AAAAC}, {AAAAA, AAAAG}, … {TTTTG, TTTTT} }. What is |LSUBS|, the cardinality of the set of subsets, as a function of K?
Given g = {(1,c),(2,a),(3,d)}, a function from X = {1,2,3} to Y = {a,b,c,d}, and f = {(a,r),(b,p),(c,δ),(d,r)}, a function from Y to Z = {p, β, r, δ}, write f o g as a set of ordered pairs.
We consider certain strings of length 6 over the alphabet S = {A,B,C}. We require that the string contains exactly two As, and exactly two B's, and exactly two C's. How many such strings are there? That is, how many strings of length 6 over the alphabet {A,B,C} contains exactly two A's, two B's and two C's?
(a)Describe a bijection from the set of binary strings of length n to the set of binary strings of length n + 1 which have an even number of 1s.(b) How many binary strings of length n + 1 have an even number of 1s?
- Consider CFG G = ({S}, {a, b, c}, R, S) where R = {S → SbbS | SacS | a}. Show how the string abbaacabba - What cause ambiguity?
The sequence of values: n, c(n), c(c(n)), c(c(c(n))), c(c(c(c(n)))),... is known as the hailstone sequence starting at n. Implement c(n) as a function. Use predicates to test the parity of each input n.
For this problem, please kindly show your work Let ?L be a set of all finite binary strings that representing a binary number divisible by 2 (or 102102). What is a REGEX of ?L? Design an FA ?a such that ?a accepts ?L, i.e., ?=?(?)
Let B be the set of strings over alphabet {0,1}. Consider the following problem: Input: A string x from B Yes/No Question: Is x, when interpreted as a binary number, a multiple of 2? Note that we ignore leading zeros when interpret the strings. For example, we consider a string like ' 001 ' as the binary number 1. For /\, the empty string, we consider it as 0. a. Give the three shortest yes input instances for this problem. b. Give the three shortest no input instances for this problem. c. Suppose that we list the strings in B in numerical order and break the ties based on the length of the strings. Which of the following strings have a fixed position on the list? /\, 00, 1, 001, 10, 0000 d. From c), we have observed that when we list the strings in numerical order, some strings do not appear in a fixed position on the list. Does this prove that B is uncountably infinite? Why or why not?
Let Σn denote the set of all binary strings with lengths less than n. For example, Σ2 = {λ, 0, 1} and Σ3 = {λ, 0, 1, 00, 01, 10, 11} where λ is the empty string, i.e. the string of length 0. For x ∈ Σ we denote the length of x by |x|. a) How many functions f : Σn → Σn are there? b) How many one-to-one functions f : Σn → Σn are there?
Project 1 dealt with single symbol Huffman Coding. Project 2 deals with Extended Huffman Codes. For instance, for a source emitting two symbols A and B, the second order extension involves coding messages AA, AB, BA and BB (22 in number). The third order extension involves messages such as AAA, AAB, etc. (23 in number). The probabilities of such strings are computed by multiplying the individual probabilities. For this project, use the Matlab code you have developed in Project 1 to perform third, fourth and fifth order extensions of a source message. 1. Choose an alphabet a set of at least six (6) symbols with assigned probabilities. 2. Compute the third, fourth and fifth order extension probabilities. 3. Using the built-in algorithm, derive the Huffman Code for each extension. 4. Compute the following quantities: (i) Average length of the codeword; (ii) The code efficiency; (iii) The Compression Ratio; (iv) Speed of computation.