8th Edition

ISBN: 9781260521337

Author: ROSEN

Publisher: MCG

See similar textbooks

Videos

Textbook Question

Chapter 8, Problem 17SE

In Exercises 15-18 we develop a dynamic programming algorithm for finding a longest common subsequence of two sequences a 1 , a 2 , .... , a m and b 1 , b 2 , .... , b n , an important problem in the comparison of DNA of different organisms.

Use Exercise 16 to construct a dynamic programming algorithm for computing the length of a longest common subsequence of two sequences a 1 , a 2 , .... , a m and b 1 , b 2 , .... , b n , storing the values of L(I,J) as they are found.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 8, Problem 16SE

Chapter 8, Problem 18SE

Students have asked these similar questions

4. [Ocean Weather] Information about ocean weather can be extracted from radar returns with the aid of a special algorithm. A study is conducted to estimate the difference in wind speed as measured on the ground and via the Seasat satellite. To do so, wind speeds (miles per hour) are measured on the ground and via the Seasat satellite simultaneously at 12 special times. The data is shown in the following table. The table also shows the difference between the wind speed on the ground and that via the Seasat satellite at each time, as well as some summary statistics. Difference Time Ground (x) Satellite (y) d= x – y 1 4.46 4.08 0.38 3.99 3.94 0.05 3 3.73 5.00 -1.27 4 3.29 5.20 -1.91 4.82 3.92 0.90 6 6.71 6.21 0.50 7 4.61 5.95 -1.34 8. 3.87 3.07 0.80 3.17 4.76 -1.59 10 4.42 3.25 1.17 11 3.76 4.89 -1.13 12 3.30 4.80 -1.50 d = -0.41 Sd = 1.14 It is claimed that the wind speed measured on the ground is lower than that measured via the Satellite on average. Set up your hypotheses to test this…

1. A student wants to know the effect of 2 parameter settings (Number of iterations and learning rate) on the computation time of an algorithm. Experiments were carried out by trying 3 different values for each parameter, then seeing the response to computation time. If we know the experimental results as shown in the following figure, what information can we get? Boxplot of Speed (sec) Boxplot of Speed (sec) 0,8 0,8- 0,7 0,7- 0,6 0.6 0,5 0,5- 0,4 0,4- 0,3 0,3- 0,2 0,2- 0,50 learning rate 500 1000 1500 0,05 0,95 Niteration Speed (sec)

Seven colleges and universities are competing to recruit six high school football players to play for their varsity teams. Each school is only allowed to sign one more player, and each player is only allowed to commit to a single school. The table below lists the seven institutions and the students they are trying to recruit, have been admitted, and are also interested in playing for that school. The players are identified by the integers 1 through 6. Find a way of assigning the players to the schools that maximizes the number of schools who sign one of the six players. School Player numbers Boston College 1,3,4 Clemson University 1, 3, 4, 6 Georgia Institute of Technology 2,6 University of Georgia None interested University of Maryland 2, 3, 5 1, 2, 5 1, 2, 5, 6 University of North Carolina Virginia Polytechnic Institute and State University

Chapter 8 Solutions

DISCRETE MATHEMATICS+ITS APPL. (LL)-W/A

Ch. 8.1 - Use mathematical induction to verify the formula...Ch. 8.1 - a) Find a recurrence relation for the number of...Ch. 8.1 - A vending machine dispensing books of stamps...Ch. 8.1 - A country uses as currency coins with values of 1...Ch. 8.1 - How many was are there to pay a bill of 17 pesos...Ch. 8.1 - a) Find a recurrence relation for the number of...Ch. 8.1 - a) Find a recurrence relation for the number of...Ch. 8.1 - a) Find a recurrence relation for the number of...Ch. 8.1 - a) Find a recurrence relation for the number of...Ch. 8.1 - a) Find a recurrence relation for the number of...

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

Solution Summary: The author explains the dynamic programming algorithm for finding a longest common subsequence of two sequences using the values L(i,j) found by The algorithm in exercise 16.

Videos

Want to see the full answer?

Chapter 8 Solutions