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

被引：0

作者：

Wagner, Robert A. ^{[1
]}

机构：

[1] Vanderbilt University, United States

来源：

关键词：

Engineering Village;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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

引用

页码：218 / 223

共 50 条

[21] On the Kernelization Complexity of String Problems
Basavaraju, Manu
Panolan, Fahad
Rai, Ashutosh
Ramanujan, M. S.
Saurabh, Saket
COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 141 - 153
[22] On the Complexity of String Matching for Graphs
Equi, Massimo
Makinen, Veli
Tomescu, Alexandru I.
Grossi, Roberto
ACM TRANSACTIONS ON ALGORITHMS, 2023, 19 (03)
[23] On the kernelization complexity of string problems
Basavaraju, Manu
Panolan, Fahad
Rai, Ashutosh
Ramanujan, M. S.
Saurabh, Saket
THEORETICAL COMPUTER SCIENCE, 2018, 730 : 21 - 31
[24] On the complexity of determining the period of a string
Czumaj, A
Gasieniec, L
COMBINATORIAL PATTERN MATCHING, 2000, 1848 : 412 - 422
[25] A Three-String Approach to the Closest String Problem
Chen, Zhi-Zhong
Ma, Bin
Wang, Lusheng
COMPUTING AND COMBINATORICS, 2010, 6196 : 449 - +
[26] PROBLEM OF THROWN STRING
BASS, L
BRACKEN, AJ
NATURE, 1978, 275 (5677) : 205 - 206
[27] THE INVARIANT PROBLEM FOR BINARY STRING STRUCTURES AND THE PARALLEL COMPLEXITY THEORY OF QUERIES
LINDELL, S
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1992, 44 (03) : 385 - 410
[28] THE STRING MERGING PROBLEM
ITOGA, SY
BIT, 1981, 21 (01): : 20 - 30
[29] PROBLEM OF THROWN STRING
SPREVAK, D
ROBERTS, AP
NATURE, 1979, 277 (5692) : 153 - 154
[30] PROBLEM OF THROWN STRING
ROBERTS, AP
SPREVAK, D
NATURE, 1979, 280 (5719) : 256 - 256