An Optimal Approach towards Sequence Analysis

Abstract Dynamic programming is a form of recursion in which intermediate results are saved in a matrix where they can be refereed to later by the program. The paper aims at presenting the calculation of the edit distance between two given strings which includes a cost factor for the different edit operations like copy, insert and delete. The method used in this paper is a form of dynamic programming which includes the formation of a recurrence relation which is then used to represent the problem in a tabular form. In the next step the table is used to trace back to get the possible combinations of edit operations and the one which involves the least cost can be considered the appropriate one