Robert A. Wagner
- 1 WAGNER, R. A., AND FISCHER, M. J. The string-to-string correction problem. J. ACM 21, 1 (Jan. 1974), 168-173 Google Scholar
Index Terms
- An Extension of the String-to-String Correction Problem
Recommendations
On the complexity of the Extended String-to-String Correction Problem
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computingThe Extended String-to-String Correction Problem [ESSCP] is defined as the problem of determining, for given strings A and B over alphabet V, a minimum-cost sequence S of edit operations such that S(A) = B. The sequence S may make use of the operations: ...
ECC string: Flexible ECC management for low-cost error protection of L2 caches
ICCD '12: Proceedings of the 2012 IEEE 30th International Conference on Computer Design (ICCD 2012)Conventional error correcting codes (ECC) scheme for caches is based on fixed mapping between cache words and ECC check bits, and fixed ECC word granularity, which leads to inefficient usage of ECC check bits. In contrast, we propose to use the ECC ...
A fixed-parameter algorithm for string-to-string correction
CATS '10: Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109In the String-to-String Correction problem we are given two strings x and y and a positive integer k, and are asked whether it is possible to transform y into x with at most k single character deletions and adjacent character exchanges. We present a ...
Comments