Design a divide-and-conquer algorithm

Assignment Help Data Structure & Algorithms
Reference no: EM1358013

1-For a pair of strings v = v1 . . . vn and w = w1 . . .wm, define M(v,w) to be the matrix whose (i, j)th entry is the score of the optimal global alignment which aligns the character vi with the character wj . Give an O(nm) algorithm which computes M(v,w).

Define an overlap alignment between two sequences v = v1 . . . vn and w = w1 . . .wm to bean alignment between a suffix of v and a prefix of w. For example, if v = TATATA and w = AAATTT, then a (not necessarily optimal) overlap alignment between v and w is ATA AAA Optimal overlap alignment is an alignment that maximizes the global alignment score between vi, . . . , vn and w1, . . .wj , where the maximum is taken over all suffixes vi, . . . , vn of v and all prefixes w1, . . .wj of w.

2-Design a greedy algorithm for the Multiple Breakpoint Distance problem and evaluate its approximation ratio.

3-Design a divide-and-conquer algorithm for the Motif Finding problem and estimate its running time. Have you improved the running time of the exhaustive search algorithm?

Reference no: EM1358013

Questions Cloud

Neurological soft signs or symptoms of a patient : What are some of the neurological soft signs or symptoms of a patient who has been diagnose as being schizophrenia?
Modern popular culture : Analyzing a role that popular culture plays in the lives of people explain how your personal taste correlates with overall societal views of popular culture.
Explain how might you make profits by purchases or sales : Explain  how might you make profits by purchases or sales of bonds now,with the intention to sell in a few months' time.
What is the cross-sectional area of the wire : An astronaut's normal weight it 600 newtons. How much would she weigh while orbiting in a satellite at 12,000 kilometers [two earth radii] above the surface of Earth.
Design a divide-and-conquer algorithm : Design a divide-and-conquer algorithm for the Motif Finding problem and estimate its running time. Have you improved the running time of the exhaustive search algorithm?
Analysis of the investment : Analysis of the Investment,  To prepare for this Individual Assignment: Review the Anthony's Orchard case study in the unit resources.
Team dysfunction : Team Dysfunction - Find a time when you saw or were a participant on a team that encountered dysfunction or the ability to accomplish a task.
Job-order costing variables : On July 1, Job 46 had a beginning balance of $1,235. During July, prime costs added to the job totaled $560. Of that amount, direct materials were three times as much as direct labor. The ending balance of the job was $1,921.
Explain sometimes organizations must go outside the firm : Explain Sometimes organizations must go outside the firm to hire talent and thus bypassing employees already working for the firm.

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Explaining adaptive playout delay algorithm

Consider adaptive playout delay algorithm. Demonstrate through simple example which adjusting playout delay at beginning of each talk spurt results in compressing

  Computing total number of keys needed in symmetric cipher

Determine the total number of keys that are needed for organization if symmetric cipher is used.

  Design algorithm to solve spectral assembly problem

Design an algorithm to solve the Spectral Assembly problem under the above conditions. Does the problem have a unique solution?

  Explaining view of header and footer areas of worksheet

In which view can you see header and footer areas of worksheet?

  Algorithm to minimize average difference between height

The problem is to assign each skier a ski to minimize the average difference between height of a skier and his/her ski. Give pseudocode and write its asymptotic running time.

  Computing time complexity of procedure

What is the time complexity of the procedure? If A[l .. r] = [24, 30, 09, 46, 15, 19, 29, 86,78], what is the output?

  Use a search tree to find the solution

Explain how will use a search tree to find the solution.

  Explain compression algorithms are often used in forensics

"Compression algorithms are often used in forensics. Suppose you are involved in a case and have been asked by the lawyer to explain, in general terms.

  Sorting arrays of name in descending order

Then sort arrays so that records are in descending order by purchase amount for month. Output lists the names of the top five customers.

  Implement an open hash table

In this programming assignment you will implement an open hash table and compare the performance of four hash functions using various prime table sizes.

  Testing item in array of member using sequential search

Look up each test item in array of member items, by using sequential search. What is the worst-case running time of it. (asymptotically, in terms of n and k)?

  Processor sharing to worse performance than fcfs

Create a second experiment answering the question "Is it possible for processor sharing to have worse performance than FCFS? "

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd