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 条
  • [31] Block interpolation: A framework for tight exponential-time counting complexity
    Curticapean, Radu
    INFORMATION AND COMPUTATION, 2018, 261 : 265 - 280
  • [32] Capturing Bisimulation-Invariant Exponential-Time Complexity Classes
    Bruse, Florian
    Kronenberger, David
    Lange, Martin
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2022, (370): : 17 - 33
  • [33] Faster exponential-time algorithms in graphs of bounded average degree
    Cygan, Marek
    Pilipczuk, Marcin
    INFORMATION AND COMPUTATION, 2015, 243 : 75 - 85
  • [34] Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity
    Curticapean, Radu
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 380 - 392
  • [35] Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis
    Aghighi, Meysam
    Backstrom, Christer
    Jonsson, Peter
    Stahlberg, Simon
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 184 - 192
  • [36] Separating classes in the exponential-time hierarchy from classes in PH
    Mocas, SE
    THEORETICAL COMPUTER SCIENCE, 1996, 158 (1-2) : 221 - 231
  • [37] Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree
    Cygan, Marek
    Pilipczuk, Marcin
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 364 - 375
  • [38] A note on convex characters, Fibonacci numbers and exponential-time algorithms
    Kelk, Steven
    Stamoulis, Georgios
    ADVANCES IN APPLIED MATHEMATICS, 2017, 84 : 34 - 46
  • [39] Improved exponential-time algorithms for treewidth and minimum fill-in
    Villanger, Y
    LATIN 2006: THEORETICAL INFORMATICS, 2006, 3887 : 800 - 811
  • [40] Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations
    Esmer, Baris Can
    Kulik, Ariel
    Marx, Daniel
    Neuen, Daniel
    Sharma, Roohani
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 314 - 345
12345