PROTEIN FOLDING - COMPUTATIONAL APPROACHES TO AN EXPONENTIAL-TIME PROBLEM

被引：14
|
作者：
REEKE, GN
机构：
来源：
ANNUAL REVIEW OF COMPUTER SCIENCE | 1988年 / 3卷
关键词：
D O I：
10.1146/annurev.cs.03.060188.000423
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：59 / 84
页数：26
相关论文
共 50 条
  • [1] On exponential-time completeness of the circularity problem for attribute grammars
    Wu, PC
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2004, 26 (01): : 186 - 190
  • [2] IS CIRCULARITY PROBLEM FOR ATTRIBUTE GRAMMARS EXPONENTIAL-TIME COMPLETE
    WU, PC
    WANG, FJ
    SIGPLAN NOTICES, 1994, 29 (07): : 42 - 42
  • [3] EMPTINESS PROBLEM FOR INDEXED LANGUAGE IS EXPONENTIAL-TIME COMPLETE.
    Tanaka, Shinichi
    Kasai, Takumi
    Systems and Computers in Japan, 1986, 17 (09) : 29 - 37
  • [4] EXPONENTIAL-TIME AND SUBEXPONENTIAL-TIME SETS
    TANG, SW
    FU, B
    LIU, T
    THEORETICAL COMPUTER SCIENCE, 1993, 115 (02) : 371 - 381
  • [5] Solutions to the computational protein folding problem
    Sander, Chris
    Marks, Debora
    FASEB JOURNAL, 2018, 32 (01):
  • [6] An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem
    Binkele-Raible, Daniel
    Fernau, Henning
    JOURNAL OF DISCRETE ALGORITHMS, 2012, 15 : 43 - 55
  • [7] Exponential-time approximation of weighted set cover
    Cygan, Marek
    Kowalik, Lukasz
    Wykurz, Mateusz
    INFORMATION PROCESSING LETTERS, 2009, 109 (16) : 957 - 961
  • [8] Moderate exponential-time algorithms for scheduling problems
    T'kindt, Vincent
    Croce, Federico Della
    Liedloff, Mathieu
    ANNALS OF OPERATIONS RESEARCH, 2024, 343 (02) : 753 - 783
  • [9] A Framework of Quantum Strong Exponential-Time Hypotheses
    Buhrman, Harry
    Patro, Subhasree
    Speelman, Florian
    38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
  • [10] Improving deterministic and randomized exponential-time algorithms for the satisfiability, the colorability, and the domatic number problem
    Riege, Tobias
    Rothe, Joerg
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2006, 12 (06) : 725 - 745
12345