Question 2 One of the important tasks in computational biology is to find short repeating patterns from DNA sequences. These patterns help the biologists to analyze the functionality of different parts in a living being. As a computer science student, you are asked to write a program that will find all the patterns of a given length from a DNA sequence and their number of presence in that sequence. This information will help to find the dominant pattern of a given length in the sequence. You will also find the dominant pattern. Dominant pattern is the sequence which has maximum occurrence. If there are multiple dominant pattern the program will print "No Dominant Pattern found."

Question 2 One of the important tasks in computational biology is to find short repeating patterns from DNA sequences. These patterns help the biologists to analyze the functionality of different parts in a living being. As a computer science student, you are asked to write a program that will find all the patterns of a given length from a DNA sequence and their number of presence in that sequence. This information will help to find the dominant pattern of a given length in the sequence. You will also find the dominant pattern. Dominant pattern is the sequence which has maximum occurrence. If there are multiple dominant pattern the program will print "No Dominant Pattern found."

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

Create an algorithm in c# language that takes an array with colored red, white, yellow, and blue pebbles. Sorts the pebbles into order by arranging them in a random order. Then calculate the complexity of the space and the running time.
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
java A time series is represented a list of time/value pairs Write a function that takes two time series and outputs a new series of the summation of them
The same professor writes a program to analyze the chat logs from the various lectures as a partial measure of class participation. Each chat log consists of multiple lines, each of form TIME, NAME, COMMENT, in the order in which they were posted to the chat . The algorithm then sorts all that data - across all the chat logs - in order of student names, and scores each set using a metric based on the number of contributions and their length. [a] What are the various input sizes to consider when analyzing the algorithmic approaches? (One is the number of students in the class, but that is not the only factor.) [b] Which sorting algorithm do you think is best suited for the sorting portion of this algorithm and why? [c] What is the time complexity of the sorting algorithm chosen in step [b] as a function of the various input sizes identified in step [a]? [d] What is the overall time complexity of the chat analysis program as described above?
only java program, a word search puzzle, where one is presented with a grid of letters and needs to find a word by choosing adjacent letters, is the Knight-move word search puzzle, where you’re presented with a grid of letters and need to find a word in a configuration where adjacent letters in the word are reachable by moving like a knight in chess. A knight in chess moves from its current spot by either two rows and one column, or two columns and one row, in any direction. So, the knight at position "K" in the table below, can move to any of the spaces labeled "X" Write a java program that tries to find a word in a grid of letters where each letter is connected to the next by a knight move. Some specific puzzle rules: •You can never "wrap around" any edge of the grid •You can never use the same letter twice. There will be several input instances from a data file. Each input will begin with values r and c (both ≤ 8), denoting the dimensions of the grid. Values of r or c of 0 signify…
Computer Science Given a dataframe with two columns (x and y), I have found a function on Python that gives a local fit value (essentially between two set values x it gives the average of all values of y). Now the questions asks us to create 2 graphs - one that shows the average per value of x and another one that shows the difference to that average that we found. What does this mean?
Answer in python language only A very successful cinema director named "Chef" decided to solve the problem. When a customer wants to buy a ticket, the clerk at the ticket window asks the visitor if he or she needs a rest area, and if so, which one: left, right, or both. We know that in the audience they are expected to appear, their L needs a left-handed position, their R needs a right one, Z does not need a single one and B needs both. Your job is to count the number of people who can attend the show. In the theatre there are N rows with each M seat. There is only one lounge between the two adjacent seats. Seats at the beginning and end of the row have two armrests. Help him using the C++ programming language. Input 1 331209 Output: 8
Assignment for Computer Architecture You are to write a program in MIPS that computes N! using recursion. Remember N! is the product of all the numbers from 1 to N inclusive, that is 1 x 2 x 3 x (N – 1) x N. It is defined as 1 for N = 0 and is undefined for values less than 0. The programs first requests the user to input the value of N (display a prompt first so the user knows what to do). If the input value is less than 0, the program is to display “N! undefined for values less than 0” and then requests the user to input the value of N again. If the value input is non-negative, it is to compute N! using a recursive function, that is one that calls itself. You are to have your name, the assignment number, and a brief description of the program in comments at the top of your program. Since this is an assembly language program, I expect to see comments on almost every line of code in the program. Also make the code neat: line up the command fields, the register fields, and the comment…
Computer Science Write in the programming language Pythona pushdown automaton simulator (a program that simulates a pushdown automaton) where: V = {w | w ∈ {a, b}* and w starts and ends with the same symbol}.
Artificial Intelligence (Part - 2) ==================== The Towers of Hanoi is a famous problem for studying recursion incomputer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. (2) What is the size of the state space?
Computer Science Implement the Histogram Equalization according to the explanation in Wikipedia in C# Starting code: public static bool ConvertToGray(Bitmap b) { return true; }
A 2D matrix can be represented as a list and a column count value in Python. For example, the 3x3 matrix 1 2 34 5 67 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 52 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) because, ([1,2,3,4,5,6,7,8,9,10,11,12], 4) represents: 1 2 3 45 6 7 89 10 11 12 and (1,2,0,1) represents the submatrix between column indices 1 and 2 (both inclusive), and row…