Description: For A and B are two strings. Operation to use at least the characters will be converted to string A string B. Operation of the characters mentioned here, including (1) delete a character (2) insert a character (3) will be replaced by one character to another character. Will transform the string A string B for at least the characters used in string operands as the editor of A to B distance is recorded as d (A, B). Test the design of an efficient algorithm, for any given two strings A and B, to calculate their edit distance d (A, B).
- [DNA] - Of biological DNA bases to more than two
- [similarity] - Simple treatment of the similarity of tw
- [EditDistance] - Realize the calculation of edit distance
- [med] - Minimum edit distance between two string
- [similarity] - The largest common sub-string and the ch
- [similar] - This code you can complete the similarit
File list (Check if you may need any files):
新建文件夹
..........\1.cpp
..........\1.dsp
..........\1.plg
..........\Debug
..........\.....\1.exe
..........\.....\1.ilk
..........\.....\1.obj
..........\.....\1.pch
..........\.....\1.pdb
..........\.....\vc60.idb
..........\.....\vc60.pdb
Download