Name
Abstract | ||
|---|---|---|
String comparison is a fundamental task in theoretical computer science, with applications in e.g., spelling correction and computational biology. Edit distance is a classic similarity measure between two given strings A and B. It is the minimum total cost for transforming A into B, or vice versa, using three types of edit operations: single-character insertions, deletions, and/or substitutions. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.jda.2015.05.007 | conference on current trends in theory and practice of informatics |
Keywords | Field | DocType |
theoretical computer science,fundamental task,classic similarity measure,minimum total cost,single-character insertion,dynamic edit distance table,computational biology,general weighted cost,string comparison,edit distance,dynamic programming | Edit distance,String-to-string correction problem,Discrete mathematics,Dynamic programming,Combinatorics,Wagner–Fischer algorithm,Unit cost,Jaro–Winkler distance,Damerau–Levenshtein distance,Mathematics,Computation | Conference |
Volume | Issue | ISSN |
34 | C | 1570-8667 |
Citations | PageRank | References |
3 | 0.46 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heikki Hyyrö | 1 | 143 | 15.04 |
| Kazuyuki Narisawa | 2 | 33 | 6.82 |
| Shunsuke Inenaga | 3 | 595 | 79.02 |