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 条
  • [31] The string guessing problem as a method to prove lower bounds on the advice complexity
    Boeckenhauer, Hans-Joachim
    Hromkovic, Juraj
    Komm, Dennis
    Krug, Sacha
    Smula, Jasmin
    Sprock, Andreas
    THEORETICAL COMPUTER SCIENCE, 2014, 554 : 95 - 108
  • [32] STRING MANIPULATION WITH EXTENDED EULER
    PARSONS, IT
    COMPUTERS AND THE HUMANITIES, 1976, 10 (03): : 173 - 179
  • [33] PREGEOMETRY AND AN EXTENDED STRING ACTION
    AKAMA, K
    PROGRESS OF THEORETICAL PHYSICS, 1988, 79 (06): : 1299 - 1304
  • [34] A linearly computable measure of string complexity
    Becher, Veronica
    Heiber, Pablo Ariel
    THEORETICAL COMPUTER SCIENCE, 2012, 438 : 62 - 73
  • [35] Infinite string rewrite systems and complexity
    Birget, JC
    JOURNAL OF SYMBOLIC COMPUTATION, 1998, 25 (06) : 759 - 793
  • [36] On the Parameterised Complexity of String Morphism Problems
    Henning Fernau
    Markus L. Schmid
    Yngve Villanger
    Theory of Computing Systems, 2016, 59 : 24 - 51
  • [37] On the Parameterised Complexity of String Morphism Problems
    Fernau, Henning
    Schmid, Markus L.
    Villanger, Yngve
    THEORY OF COMPUTING SYSTEMS, 2016, 59 (01) : 24 - 51
  • [38] Holographic complexity in gauge/string superconductors
    Momeni, Davood
    Mansoori, Seyed Ali Hosseini
    Myrzakulov, Ratbay
    PHYSICS LETTERS B, 2016, 756 : 354 - 357
  • [39] The derivational complexity of string rewriting systems
    Kobayashi, Yuji
    THEORETICAL COMPUTER SCIENCE, 2012, 438 : 1 - 12
  • [40] STRING COMPLEXITY INCREASES PHONEMIC INTERFERENCE
    PANAGOS, JM
    PERCEPTUAL AND MOTOR SKILLS, 1974, 38 (03) : 1219 - 1222