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

被引：0

作者：

Wagner, Robert A. ^{[1
]}

机构：

[1] Vanderbilt University, United States

来源：

Proceedings of the Annual ACM Symposium on Theory of Computing | 1975年

关键词：

Engineering Village;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Adjacent characters - Minimum cost - NP Complete - Polynomial-time - Polynomial-time algorithms

引用

页码：218 / 223

共 50 条

[1] STRING-TO-STRING CORRECTION PROBLEM
WAGNER, RA
FISCHER, MJ
JOURNAL OF THE ACM, 1974, 21 (01) : 168 - 173
[2] EXTENSION OF STRING-TO-STRING CORRECTION PROBLEM
LOWRANCE, R
WAGNER, RA
JOURNAL OF THE ACM, 1975, 22 (02) : 177 - 183
[3] ON A CYCLIC STRING-TO-STRING CORRECTION PROBLEM
MAES, M
INFORMATION PROCESSING LETTERS, 1990, 35 (02) : 73 - 78
[4] THE STRING-TO-STRING CORRECTION PROBLEM WITH BLOCK MOVES
TICHY, WF
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1984, 2 (04): : 309 - 321
[5] An improved algorithm for solving the banded cyclic string-to-string correction problem
Chung, KL
THEORETICAL COMPUTER SCIENCE, 1998, 201 (1-2) : 275 - 279
[6] DELTA-TECHNIQUE AND STRING-TO-STRING CORRECTION
OBST, W
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 289 : 64 - 68
[7] Charge and reduce: A fixed-parameter algorithm for String-to-String Correction
Abu-Khzam, Faisal N.
Fernau, Henning
Langston, Michael A.
Lee-Cultura, Serena
Stege, Ulrike
DISCRETE OPTIMIZATION, 2011, 8 (01) : 41 - 49
[8] Implementing string-to-string correction and longest common subsequence problems on the sequent symmetry multiprocessor
Das, SK
Datta, AK
Pothuru, S
3RD INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 1996, : 330 - 335
[9] On the complexity of the string generation problem
Okhotin, A.S.
Discrete Mathematics and Applications, 2003, 13 (05): : 467 - 482
[10] Parameterized Complexity Analysis for the Closest String with Wildcards Problem
Hermelin, Danny
Rozenberg, Liat
COMBINATORIAL PATTERN MATCHING, CPM 2014, 2014, 8486 : 140 - 149

← 1 2 3 4 5 →