On the complexity of the extended string-to-string correction problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1975, Pages 218-223

  Wagner, Robert A ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

ADJACENT CHARACTERS; MINIMUM COST; NP COMPLETE; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS;

POLYNOMIAL APPROXIMATION;

EID: 84976666835     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800116.803771     Document Type: Conference Paper

References (6)

1. Wagner, R. A. & Fischer, M. J., "The string-to-string correction problem", Journal of the ACM, Vol. 21, no. l(January 1974), pp.168-173.
2. Lowrance, R. & Wagner, R. A., "An extension of the string-to-string correction problem" to be published in the Journal of the ACM.
3. Wagner, R. A. & Brown, T. P., "Swap-extended minimum edit distance correction for regular languages", Technical Report, Systems and Information Science Program, Vanderbilt University (January 1975).
4. Karp, R. M., "Reducibility among combinatorial problems" in Complexity of Computer Computations, Miller, R. E. & Thatcher, J. W. (ed.), Plenum Press (1972), pp. 85-104.
5. Wagner, R. A., "Generalized correction of context-free languages", Technical Report, Systems and Information Science Program, Vanderbilt Univeristy (1973).
6. Gaver, G. P. & Thompson, G. L., Mathematical Models: Programming and Probability (1966).