Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: AGTC
Description Let **Deletion:**a letter in*x*is missing in*y*at a corresponding position.**Insertion:**a letter in*y*is missing in*x*at a corresponding position.**Change:**letters at corresponding positions are distinct
Certainly, we would like to minimize the number of all possible operations.
This tells us that to transform
and 4 moves would be required (3 changes and 1 deletion). In this problem we would always consider strings Assign 1 as the cost of an operation performed. Otherwise, assign 0 if there is no operation performed. Write a program that would minimize the number of possible operations to transform any string Input The input consists of the strings Output An integer representing the minimum number of possible operations to transform any string Sample Input 10 AGTCTGACGC 11 AGTAAGTAGGC Sample Output 4 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator