Description: 对生物DNA进行两条碱基的比对，找出最小编辑距离，显示出联配结果（带界面变成源码）-Of biological DNA bases to more than two right, to find the minimum edit distance, showing that the alignment results (with the interface into source) Platform: |
Size: 1024 |
Author:小猪 |
Hits:
Description: 对任给的两个字符串A，B，用动态规划算法算出他们的最小编辑距离-For any given two strings A, B, using dynamic programming algorithm to calculate the minimum edit distance Platform: |
Size: 6144 |
Author:兰天 |
Hits:
Description: 用动态规划算法思想求最小编辑距离，即近似字符串匹配问题-Thinking of using dynamic programming algorithm for the minimum edit distance, that is, approximate string matching problem Platform: |
Size: 1024 |
Author:Doreen |
Hits:
Description: 最小编辑距离，可以计算2个字符串的相似度，用于语音文档检索-Minimum edit distance between two strings can calculate the similarity for retrieval of voice files Platform: |
Size: 31744 |
Author:zhu |
Hits:
Description: 实现最小编辑距离算法，并给出完整的编辑过程，完整版源码，已调试通过-To achieve the minimum edit distance algorithm, and gives the complete editing process, full version of source code, has been debugging through the Platform: |
Size: 506880 |
Author:王贝 |
Hits:
Description: 又称Levenshtein距离（也叫做Edit Distance），是指两个字串之间，由一个转成另一个所需的最少编辑操作次数。许可的编辑操作包括将一个字符替换成另一个字符，插入一个字符，删除一个字符。 -Also known as Levenshtein distance (also known as Edit Distance), is between two strings, one by one turned into the minimum required number of editing operations. Editing operation permit include replacing one character to another character, insert a character, delete a character. Platform: |
Size: 175104 |
Author:zdl |
Hits:
Description: 编辑距离就是用来计算从原串（s）转换到目标串(t)所需要的最少的插入，删除和替换的数目。-Edit distance is used to calculate the converted from the original string (s) to the target string (t) is the minimum needed to insert, delete, and the number of substitutions. Platform: |
Size: 6144 |
Author:yi |
Hits:
Description: 编辑距离算法的python源码,编辑距离，又称Levenshtein距离（也叫做Edit Distance），是指两个字串之间由一个转成另一个所需的最少编辑操作次数。许可的编辑操作包括将一个字符替换成另一个字符，插入一个字符，删除一个字符。-Levenshtein Distance Algorithm s python version
The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character Platform: |
Size: 1024 |
Author:大林 |
Hits:
Description: c source for check spelling correction
by minimum edit distance and show correct word in dictionary. Platform: |
Size: 927744 |
Author:Panda359 |
Hits:
Description: 基于编辑距离的拼写校正算法，计算最小编辑距离并做出校正。 在txt文本中检索字符串。-Spelling correction based on edit distance algorithm to calculate the minimum edit distance and make the correction. Retrieving string txt text. Platform: |
Size: 2745344 |
Author:陈虎 |
Hits:
Description: Minimum edit distance problem implementation in c++. One of the fundamental problems in Dynamic Programming. Platform: |
Size: 1024 |
Author:Duch |
Hits:
Description: 基于编辑距离的拼写校正算法，计算最小编辑距离并做出校正。 在txt文本中检索字符串。-Spelling correction based on edit distance algorithm to calculate the minimum edit distance and make the correction. Retrieving string txt text. Platform: |
Size: 739328 |
Author:Jason |
Hits:
Description: 关于两个字符串s1,s2的差别，可以通过计算他们的最小编辑距离来决定。用C++设计动态规划算法解决此类问题(The difference between the two strings s1, s2, can be determined by calculating their minimum edit distance.Using c + + design dynamic programming algorithm to solve these problems) Platform: |
Size: 2593792 |
Author:心晴紫贝
|
Hits:
Description: 编辑距离：将字符串S通过插入、删除、替换三种编辑操作，转变为字符串T，所需最少的编辑次数。(Edit distance definition: string S by inserting, deleting, replacing three editing operations, converted to string T, the minimum number of editing required.) Platform: |
Size: 402432 |
Author:你若安好
|
Hits:
Description: 阿里巴巴面试题个人题解。
对于一个数字串，需要通过一定的操作变成另一个数字串，问最小操作次数。
总共有3钟操作：
1.某位数字加一
2.某位数字减一
3.调换任意两位数字(The Alibaba interview questions personal problem.
For a digit string, we need to turn another operation into another string and ask the minimum number of operations.
A total of 3 clock operations:
1. one digit plus one
2. one digit reduction
3. change any two digit number) Platform: |
Size: 1024 |
Author:windlbl |
Hits:
Search - minimum edit distance