Question 1. Compute global alignment between the following DNA sequences using dynamic programming and the scoring scheme given below. DNA sequences: (1) ATCAGAGTA, (2) TTCAGTA Scoring function: Match = +2, Mismatch = -1, Gap = -1 a) Provide the bidimensional array obtained for computing the optimal alignment. b) Is there more than one possibility of optimally aligning the given sequences? c) If yes, show all the optimal alignments with their scores. If no, provide the best alignment obtained with its corresponding score.

Question 1. Compute global alignment between the following DNA sequences using dynamic programming and the scoring scheme given below. DNA sequences: (1) ATCAGAGTA, (2) TTCAGTA Scoring function: Match = +2, Mismatch = -1, Gap = -1 a) Provide the bidimensional array obtained for computing the optimal alignment. b) Is there more than one possibility of optimally aligning the given sequences? c) If yes, show all the optimal alignments with their scores. If no, provide the best alignment obtained with its corresponding score.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Successive elements are inserted into a dynamically expandable field. After j insertions becomes, if j is a power of two (ie for j = 1, 2, 4, 8, 16 etc.), a restructuring carried out, in which new memory is requested and the field is copied if necessary, what a causes a maximum time requirement of j. Find the average cost of an insertion after inserting n elements . Amortization costs cj are to be introduced for this purpose. Which account balances (or potentials) emerge from the analysis? This is a practice task wich could be relevant for my exam. How do i solve this? Cant find anything for Amortization costs in my skript.
3. Knapsack problem (4’)a. (1’) Show the dynamic programming table when applying the bottom-up dynamicprogramming algorithm to the instance of the knapsack problem? (Capacity W=6)b. (1’) Show the dynamic programming table when applying MemoryKnapsack(i, j)dynamic programming algorithm to the instance of the knapsack problem? (CapacityW=6)c. (1’) What is the optimal subset?d. (1’) What is the maximal value of a feasible subset?
Consider the following snapshot of a system in which five resources A, B, C, D and E are available. The system contains a total of 2 instances of A, 1 of resource B, 1 of resource C, 2 resource D and 1 of resource E. Do the following problems:• Convert this matrix representation to a resource allocation graph.• Use the deadlock detection algorithm to determine whether the system contains a deadlock. Which processes are involved in the deadlock?• While you are use the deadlock detection algorithm, add and remove directed edges of the resource allocation graph.
Suppose that the data mining task is to cluster the following eight points (with (x, y)representing location) into three clusters:(3, 10), (2, 15), (8, 10), (5, 8), (4, 5), (6, 4), (3, 2), (4, 12)The distance function is Euclidean distance. Suppose initially we assign A1, B1, and C1 as the center of each cluster, respectively. Use the k-means algorithm to show onlya. The three cluster centers after the first round execution.b. The three clusters after the first round execution.
Think of a vector space model and TF*IDF weights in the context of an information retrieval system. A simplistic solution would have to go through every page in the collection to compute the similarity between the query and each item. Give a quick outline of how an inverted index may be used to enhance the IR system's performance.
In our practise task there is a taks regarding the "Amortization method of cost analysis". I tried to do it bu couldnt really find anything in the script that would me hlep solve it. "Successive elements are inserted into a dynamically expandable field. After j insertions becomes, if j is a power of two (ie for j = 1; 2; 4; 8; 16 etc.), a restructuring carried out, in which new memory is requested and the field is copied if necessary, what a causes a maximum time requirement of j. Find the average cost of an insertion after inserting n elements . Amortization costs ^cj are to be introduced for this purpose. Which account balances (or potentials) emerge from the analysis?" How do i do this?
Please show written work with answer!! Briefly describe the cases that search operations in imbalanced BST work more efficient than the balanced BST. Give an example and show the cost
Apply the (1) FIFO, (2) LRU, and (3) optimal (OPT) replacement algorithms for the following page-reference strings • 2, 6, 9, 2, 4, 2, 1, 7, 3, 0, 5, 2, 1, 2, 9, 5, 7, 3, 8, 5 • 0, 6, 3, 0, 2, 6, 3, 5, 2, 4, 1, 3, 0, 6, 1, 4, 2, 3, 5, 7 • 3, 1, 4, 2, 5, 4, 1, 3, 5, 2, 0, 1, 1, 0, 2, 3, 4, 5, 0, 1 • 4, 2, 1, 7, 9, 8, 3, 5, 2, 6, 8, 1, 0, 7, 2, 4, 1, 3, 5, 8 • 0, 1, 2, 3, 4, 4, 3, 2, 1, 0, 0, 1, 2, 3, 4, 4, 3, 2, 1, 0 Indicate the number of page faults for each algorithm assuming demand paging with three frames.
Apply the (1) FIFO, (2) LRU, and (3) optimal (OPT) replacement algorithms for the following page-reference strings: 2, 6, 9, 2, 4, 2, 1, 7, 3, 0, 5, 2, 1, 2, 9, 5, 7, 3, 8, 5 0, 6, 3, 0, 2, 6, 3, 5, 2, 4, 1, 3, 0, 6, 1, 4, 2, 3, 5, 7 4, 1, 4, 2, 5, 4, 1, 3, 5, 2, 0, 1, 1, 0, 2, 3, 4, 5, 0, 1 3, 2, 1, 7, 9, 8, 3, 5, 2, 6, 8, 1, 0, 7, 2, 4, 1, 3, 5, 8 2, 1, 2, 3, 4, 4, 3, 2, 1, 0, 0, 1, 2, 3, 4, 4, 3, 2, 1, 0 Indicate the number of page faults for each algorithm assuming demand paging with three frames, as shown in your textbook and in class. Show your work
In a corpus of size 3,00,000 documents we have the following term frequencies for some of the terms: ShivKera RuskinBond ChetanBhagat VikramSeth RabindranathTagore KiranDesai 24,000 1,000 10,000 4,000 13,000 7,000 Propose an evaluation plan for the following query: (ShivKera AND RuskinBond) AND (ChetanBhagat AND VikramSeth) OR (RabindranathTagore AND KiranDesai) in order to minimize the list processing time.
Apply the (1) FIFO, (2) LRU, and (3) optimal (OPT) replacement algorithms for the following page-reference strings. • 5, 8, 3, 7, 5, 9, 2, 1, 2, 5, 0, 3, 7, 1, 2, 4, 2, 9, 6, 2 • 8, 5, 3, 1, 4, 2, 7, 0, 1, 8, 6, 2, 5, 3, 8, 9, 7, 1, 2, 4 Solve on a page!
provide a similar excel file for EA/GA execution of the traveling salesman problem. The following should be taken care of while making the file. Random initialization of 6 chromosomes in the initial population. A parent selection mechanism among (BT, FPS, RBS) Crossover and mutation with a crossover probability of 1.0 and a mutation probability of 0.5 Survival selection based on (mu + lambda) using (BT, FPS, RBS), but different from the one implemented in point 2 above All random numbers utilized throughout operation must be recorded