Consider the following hypothetical multiple alignment of sequences:1: ATTG2: ATTC3: ATGG4: GTTC5: ATTGCompute (using pen and paper) the BLOSUM90 scoring matrix. Use simple elimination if thereare sequences that are too similar.Note that here we are using DNA. Normally, a Blosum ist made only for proteins. We do this tokeep the number of symbols small.Write a program (R or Python) that takes a multiple alignment after elimination of sequences thatare too closely related and produces a BLOSUM matrix out of it.

Intro: In this question, it asked to write a program that takes multiple alignments and determine…

Answered: Write a program (R or Python) that…

Write a program (R or Python) that takes a multiple alignment after elimination of sequences that are too closely related and produces a BLOSUM matrix out of it.

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

Write in python programming language: The Longest Subsequence Problem is a well-studied problem in Computer Science, where given a sequence of distinct positive integers, the goal is to output the longest subsequence whose elements appear from smallest to largest, or from largest to smallest. For example, consider the sequence S= [9,7,4,10,6,8,2,1,3,5]. The longest increasing subsequence of S has length three ([4,6,8] or [2,3,5]), and the longest decreasing subsequence of S has length five([9,7,4,2,1] or [9,7,6,2,1]). And if we have the sequence S = [531,339,298,247,246,195,104,73,52,31], then the length of the longest increasing subsequence is 1 and the length of the longest decreasing subsequence is 10. Question: Find a sequence with nine distinct integers for which the length of the longest increasing subsequence is 3, and the length of the longest decreasing subsequence is 3. Briefly explain how youconstructed your sequence. Let S be a sequence with ten distinct integers. Prove by…
Write in C Language You can only use recursive way to do this. Description Give you a matrix. Please output the elements in clockwise spiral order. Input First line is two integers m and n, shows number of rows and number of columns. Followed m lines are content of the matrix. Output Elements of the matrix in clockwise spiral order. Sample Input 1 3 3 1 2 3 4 5 6 7 8 9 Sample Output 1 1 2 3 6 9 8 7 4 5
using c++ .. Given an array of integers. Find the Inversion Count in the array. Inversion Count: For an array, inversion count indicates how far (or close) the array is from being sorted. If array is already sorted then the inversion count is 0. If an array is sorted in the reverse order then the inversion count is the maximum. Formally, two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j.Examples:Input: N = 5, arr[] = {2, 4, 1, 3, 5}Output: 3Explanation: The sequence 2, 4, 1, 3, 5 has three inversions (2, 1), (4, 1), (4, 3).Input: N = 5arr[] = {2, 3, 4, 5, 6}Output: 0Explanation: As the sequence is already sorted so there is no inversion count.Input: N = 3, arr[] = {10, 10, 10}Output: 0Explanation: As all the elements of array are same, so there is no inversion count
A set of integers 0..MAX may be implemented using an array of boolean values. This particular implementation is called a bit-vector implementation of a Set. Since C doesn’t have the Boolean data type, then substitute TRUE with 1 and FALSE with 0, or define 1 and 0 as TRUE and FALSE, respectively.For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE. For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE.For example: if s = {3,4,6,8}, the array looks like this: Implement a programmer-defined data type called BitSet to represent a set as follows:typedef int BitSet[MAX];Implement the following functions:void initialize(BitSet s); - set all array elements to FALSEvoid add(int elem,BitSet s);- set the item indexed by elem to…
Can you ask with the python software language? A 2D matrix can be represented as a list and a column count value in Python. For example, the 3x3 matrix 1 2 3 4 5 6 7 8 9 can be row-wise represented as ([1,2,3,4,5,6,7,8,9], 3), where the number 3 represents the number of columns in the matrix. Similarly, 1 3 5 2 4 6 becomes ([1,3,5,2,4,6], 3). A submatrix can be defined as an (l,r,t,b) tuple, where l and r are left and right column indices, and t and b are top and bottom row indices (all inclusive). Write a function that takes a tuple containing the list representing a matrix, and the column count of the matrix, along with another tuple representing a specific submatrix, and returns the list representation of the submatrix along with its column count as a tuple. For example, given submatrix(([1,2,3,4,5,6,7,8,9,10,11,12], 4), (1,2,0,1)) returns: ([2,3,6,7], 2) def submatrix(matrix, indices):
Multidimensional arrays are used in image processing in C++. A gray-scale image of size m*n is represented as a m*n matrix (array). Each pixel can be shown using a double number between 0 and 1 (0 for black and 1 for white and numbers between 0 and 1 for the gray values). Let's say we scan a document and notice that we have a dark background. Can you think of a function that gets an image as a 2D array and eliminates its background? What operations are needed to make an image lighter? How about sharpening or softening? Now with this definition, what do you think of software like Photoshop? How can we write a small version of Photoshop that only works on gray images and does sharpening and softening?
Write an R program that makes a dotplot of two DNA sequences S1= ATGCTA and S2= ATTCTA by plotting a dot at every position where the two sequences share an identical letter. Use the function “makeDotPlot1()” to make a dotplot between sequences setting the argument “dotsize” to 0.1 (this determines the radius of each dot plotted). Do you find the same regions and if not, can you explain why?
Using the C Programming language, write a program that sums an array of 50 elements. Next,optimize the code using loop unrolling. Loop unrolling is a program transformation that reduces thenumber of iterations for a loop by increasing the number of elements computed on each iteration.Generate a graph of performance improvement.
I need to write a recursive program to count the number of muck-free regions in a lagoon. The Lagoon is represented by a rectangle of N x M squares. Each square contains either muck ('M') or sand ('.'). A region is defined as a connected set of one of more squares with sand in it, where a square is considered to connect to all eight of its adjacent squares. Sample input/output is shown in picture attached
1. Analyze the word finder with wild card characters scenario to form the algorithm and compute the time complexity. You are given a list of characters with size n, m. You need to read character data provided as input into this list. There is also a list of p words that you need to find in the given problem. You can only search in left, right, up and down direction from a position. There are two wild characters *' and '+' ,if there is any instance of wild card characters for example '+' appears you can match whatever character in your word that you are searching at this position (only one character). Similarly, if you got wildcard *' you can skip any number of characters ( A sequence of characters not necessary same in between the characters) but the last character should be matched in the given data. This means you are not allowed to match a first and last character with *' wildeard. Input: The first line of the input will give you two integers n and m. From the next line you will get…
Write in C Language ''Must'' use recursive way to do this Description Give you a matrix. Please output the elements in clockwise spiral order. Input First line is two integers m and n, shows number of rows and number of columns. Followed m lines are content of the matrix. Output Elements of the matrix in clockwise spiral order. Sample Input 1 3 3 1 2 3 4 5 6 7 8 9 Sample Output 1 1 2 3 6 9 8 7 4 5
Implement matrix-vector multiplication in Python using MapReduce programming style. The inputs to your program are a matrix and a vector (and user can change the matrix and the vector), and the output is multiplication result. Note that Print the results of map step and the reduce step along the way.