DNA models and algorithms for NP-complete problems

被引:26
|
作者
Bach, E [1 ]
Condon, A [1 ]
Glaser, E [1 ]
Tanguay, C [1 ]
机构
[1] UNIV WISCONSIN,DEPT COMP SCI,MADISON,WI 53706
关键词
D O I
10.1109/CCC.1996.507691
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:290 / 300
页数:11
相关论文
共 50 条
  • [1] DNA models and algorithms for NP-complete problems
    Bach, E
    Condon, A
    Glaser, E
    Tanguay, C
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 57 (02) : 172 - 186
  • [2] DNA models and algorithms for NP-complete problems
    Univ of Wisconsin, Madison, United States
    J Comput Syst Sci, 2 (172-186):
  • [3] Scheduling algorithms and NP-complete problems
    Kiselyov, O
    DR DOBBS JOURNAL, 1997, 22 (02): : 107 - 109
  • [4] Efficient DNA sticker algorithms for NP-complete graph problems
    Zimmermann, KH
    COMPUTER PHYSICS COMMUNICATIONS, 2002, 144 (03) : 297 - 309
  • [5] LINEAR-TIME ALGORITHMS AND NP-COMPLETE PROBLEMS
    GRANDJEAN, E
    SIAM JOURNAL ON COMPUTING, 1994, 23 (03) : 573 - 597
  • [6] APPROXIMATION ALGORITHMS FOR NP-COMPLETE PROBLEMS ON PLANAR GRAPHS
    BAKER, BS
    JOURNAL OF THE ACM, 1994, 41 (01) : 153 - 180
  • [7] POLYNOMIAL TIME ALGORITHMS FOR SOLVING NP-COMPLETE PROBLEMS
    Sinchev, B.
    Sinchev, A. B.
    Akzhanova, Zh.
    Issekeshev, Y.
    Mukhanova, A. M.
    NEWS OF THE NATIONAL ACADEMY OF SCIENCES OF THE REPUBLIC OF KAZAKHSTAN-SERIES OF GEOLOGY AND TECHNICAL SCIENCES, 2020, (03): : 97 - 101
  • [8] Solving NP-Complete Problems Using Genetic Algorithms
    Arabi, Bander Hassan
    2016 UKSIM-AMSS 18TH INTERNATIONAL CONFERENCE ON COMPUTER MODELLING AND SIMULATION (UKSIM), 2016, : 43 - 48
  • [9] USING GENETIC ALGORITHMS TO SOLVE NP-COMPLETE PROBLEMS
    DEJONG, KA
    SPEARS, WM
    PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, 1989, : 124 - 132
  • [10] Approximation algorithms for NP-complete problems on planar graphs
    Baker, Brenda S., 1600, Publ by ACM, New York, NY, United States (41):