Dynamic Edit Distance Table under a General Weighted Cost Function

Authors:
Heikki Hyyrö;Kazuyuki Narisawa;Shunsuke Inenaga
Affiliations:
Department of Computer Sciences, University of Tampere, Finland;Department of Informatics, Kyushu University, Japan and Japan Society for the Promotion of Science (JSPS),;Graduate School of Information Sci. and Electrical Eng., Kyushu University, Japan
Venue:
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 4
Cited 0

Incremental String Comparison

SIAM Journal on Computing
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings

SIAM Journal on Computing
A Corpus for the Evaluation of Lossless Compression Algorithms

DCC '97 Proceedings of the Conference on Data Compression
An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper)

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

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.