. The input to this problem is a pair of strings A = a1   am and B = b1   bn. The goal is to convert A into B as cheaply as possible. The rules and cost are dened as follow. For a cost of 3 you can delete any letter. For a cost of 4 you can insert a letter in any position. For a cost of 5 you can replace any letter by any other letter. For example, you can convert A = abcabc to B = abacab via the following sequence: abcabc at a cost of 5 can be converted to abaabc, which at cost of 3 can be converted to ababc, which at cost of 3 can be converted to abac, which at cost of 4 can be converted to abacb, which at cost of 4 can be converted to abacab. Thus the total cost for this conversion would be 19. This is probably not the cheapest possible conversion. (Note that the Unix di command essentially solves this problem.) (a) Give a dynamic programming algorithm to solve this problem. (b) Apply your algorithm in (a) to convert A = abcabc to B = abacab with the minimum total cost. Show all your work.

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
icon
Related questions
Question

5. The input to this problem is a pair of strings A = a1   am and B = b1   bn. The goal is

to convert A into B as cheaply as possible. The rules and cost are dened as follow. For a

cost of 3 you can delete any letter. For a cost of 4 you can insert a letter in any position.

For a cost of 5 you can replace any letter by any other letter. For example, you can convert

A = abcabc to B = abacab via the following sequence: abcabc at a cost of 5 can be converted

to abaabc, which at cost of 3 can be converted to ababc, which at cost of 3 can be converted

to abac, which at cost of 4 can be converted to abacb, which at cost of 4 can be converted to

abacab. Thus the total cost for this conversion would be 19. This is probably not the cheapest

possible conversion. (Note that the Unix di command essentially solves this problem.)

(a) Give a dynamic programming algorithm to solve this problem.

(b) Apply your algorithm in (a) to convert A = abcabc to B = abacab with the minimum total

cost. Show all your work.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Problems on Dynamic Programming
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education