TY - GEN
T1 - Dynamic edit distance table under a general weighted cost function
AU - Hyyrö, Heikki
AU - Narisawa, Kazuyuki
AU - Inenaga, Shunsuke
PY - 2010/3/1
Y1 - 2010/3/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77249095413&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77249095413&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-11266-9_43
DO - 10.1007/978-3-642-11266-9_43
M3 - Conference contribution
AN - SCOPUS:77249095413
SN - 3642050050
SN - 9783642050053
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 515
EP - 527
BT - SOFSEM 2010
T2 - 36th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2010
Y2 - 23 January 2010 through 29 January 2010
ER -