메뉴 건너뛰기




Volumn , Issue , 2006, Pages

Run-time estimates for protein folding simulation in the H-P model

Author keywords

[No Author keywords available]

Indexed keywords

3D GRID; CHAIN TRANSITIONS; ENERGY LANDSCAPE; HARD PROBLEMS; HYDROPHOBIC-HYDROPHILIC; LOCAL MINIMUMS; MAXIMUM VALUES; MINIMUM ENERGY; NP-HARD; PROBLEM INSTANCES; PROTEIN FOLDING PROBLEM; PROTEIN FOLDING SIMULATION; PROTEIN SEQUENCES; RUNTIMES; STOCHASTIC SEARCH; UPPER BOUND;

EID: 84864554436     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (21)
  • 1
    • 0015859467 scopus 로고
    • Principles that govern the folding of protein chains
    • C.B. Anfinsen. Principles that govern the folding of protein chains. Science 181:223-230, 1973.
    • (1973) Science , vol.181 , pp. 223-230
    • Anfinsen, C.B.1
  • 2
    • 0031897962 scopus 로고    scopus 로고
    • Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete
    • B. Berger, T. Leighton. Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. J. Comput. Biol. 5(1):27-40, 1998. (Pubitemid 28153003)
    • (1998) Journal of Computational Biology , vol.5 , Issue.1 , pp. 27-40
    • Berger, B.1    Leighton, T.2
  • 3
    • 24144487043 scopus 로고    scopus 로고
    • Application of tabu search strategy for finding low energy structure of protein
    • to appear
    • J. Blazewicz, P. Lukasiak, M. Milostan. Application of tabu search strategy for finding low energy structure of protein Artif. Intell. Med. 2005; to appear.
    • (2005) Artif. Intell. Med.
    • Blazewicz, J.1    Lukasiak, P.2    Milostan, M.3
  • 4
    • 0001621836 scopus 로고
    • Rough large deviation estimates for simulated annealing: Applications to exponential schedules
    • O. Catoni. Rough large deviation estimates for simulated annealing: Applications to exponential schedules. Ann. Probab. 20:1109-1146, 1992.
    • (1992) Ann. Probab. , vol.20 , pp. 1109-1146
    • Catoni, O.1
  • 5
    • 0021819411 scopus 로고
    • Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
    • V. Černy, A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm. J. Optim. Theory Appl. 45:41-51, 1985. (Pubitemid 15462741)
    • (1985) Journal of Optimization Theory and Applications , vol.45 , Issue.1 , pp. 41-51
    • Cerny, V.1
  • 8
    • 84859456405 scopus 로고    scopus 로고
    • Study of fitness landscapes for the HP model of protein structure prediction
    • S.D. Flores, J. Smith. Study of fitness landscapes for the HP model of protein structure prediction. Proc. IEEE Congress on Evolutionary Computation, pp. 2338-2345, 2003.
    • (2003) Proc. IEEE Congress on Evolutionary Computation , pp. 2338-2345
    • Flores, S.D.1    Smith, J.2
  • 9
    • 35048887620 scopus 로고    scopus 로고
    • 1-1/d·log n) time algorithm for d-dimensional protein folding in the HP-model
    • LNCS 3142
    • 1-1/d·log n) time algorithm for d-dimensional protein folding in the HP-model. Proc. ICALP 2004, pp. 630-644, LNCS 3142, 2004.
    • (2004) Proc. ICALP 2004 , pp. 630-644
    • Fu, B.1    Wang, W.2
  • 10
    • 0142185119 scopus 로고    scopus 로고
    • Planning as propositional CSP: From walksat to local search techniques for action graphs
    • A. Gerevini, I. Serina. Planning as propositional CSP: From walksat to local search techniques for action graphs. Constraints 8(4):389-413, 2003.
    • (2003) Constraints , vol.8 , Issue.4 , pp. 389-413
    • Gerevini, A.1    Serina, I.2
  • 11
    • 4544326903 scopus 로고    scopus 로고
    • Opportunities for combinatorial optimization in computational biology
    • DOI 10.1287/ijoc.1040.0073
    • H.J. Greenberg, W.E. Hart, G. Lancia. Opportunities for combinatorial optimization in computational biology. INFORMS J. Comput. 16(3):211-231, 2004. (Pubitemid 39253165)
    • (2004) INFORMS Journal on Computing , vol.16 , Issue.3 , pp. 211-231
    • Greenberg, H.J.1    Hart, W.E.2    Lancia, G.3
  • 12
    • 0024012393 scopus 로고
    • Cooling schedules for optimal annealing
    • B. Hajek, Cooling schedules for optimal annealing. Mathem. Oper. Res. 13:311-329, 1988.
    • (1988) Mathem. Oper. Res. , vol.13 , pp. 311-329
    • Hajek, B.1
  • 13
    • 0037375005 scopus 로고    scopus 로고
    • Approximate protein folding in the HP side chain model on extended cubic lattices
    • V. Heun. Approximate protein folding in the HP side chain model on extended cubic lattices. Discrete Appl. Math. 127(1):163-177, 2003.
    • (2003) Discrete Appl. Math. , vol.127 , Issue.1 , pp. 163-177
    • Heun, V.1
  • 15
    • 0038715327 scopus 로고    scopus 로고
    • A complete and effective move set for simplified protein folding
    • N. Lesh, M. Mitzenmacher, S. Whitesides. A complete and effective move set for simplified protein folding. Proc. RECOMB 2003, pp. 188-195, 2003.
    • (2003) Proc. RECOMB 2003 , pp. 188-195
    • Lesh, N.1    Mitzenmacher, M.2    Whitesides, S.3
  • 16
    • 0032946512 scopus 로고    scopus 로고
    • Spatial codes and the hardness of string folding problems
    • A. Nayak, A. Sinclair, U. Zwick. Spatial codes and the hardness of string folding problems. J. Comput. Biol. 6(1):13-36, 1999. (Pubitemid 29166359)
    • (1999) Journal of Computational Biology , vol.6 , Issue.1 , pp. 13-36
    • Nayak, A.1    Sinclair, A.2    Zwick, U.3
  • 17
    • 0031236591 scopus 로고    scopus 로고
    • Molecular modeling of proteins and mathematical prediction of protein structure
    • PII S0036144594278060
    • A. Neumaier. Molecular modeling of proteins and mathematical prediction of protein structure. SIAM Rev. 39(3):407-460, 1997. (Pubitemid 127664847)
    • (1997) SIAM Review , vol.39 , Issue.3 , pp. 407-460
    • Neumaier, A.1
  • 18
    • 0346950252 scopus 로고    scopus 로고
    • Protein Conformation of a Lattice Model Using Tabu Search
    • P.M. Pardalos, X. Liu, G. Xue. Protein conformation of a lattice model using tabu search. J. Global Optim. 11(1):55-68, 1997. (Pubitemid 127502320)
    • (1997) Journal of Global Optimization , vol.11 , Issue.1 , pp. 55-68
    • Pardalos, P.M.1    Liu, X.2    Xue, G.L.3
  • 19
    • 26444436863 scopus 로고    scopus 로고
    • Threshold behaviour of WalkSAT and Focused Metropolis search on random 3-satisfiability
    • Theory and Applications of Satisfiability Testing: 8th International Conference, SAT 2005. Proceedings
    • S. Seitz, M. Alava, P. Orponen. Threshold behaviour of WalkSAT and Focused Metropolis search on random 3-satisfiability. Proc. 8th Int. Conf. Theory and Applications of Satisfiability Testing (SAT 2005), pp. 475-481, LNCS 3569, 2005. (Pubitemid 41425533)
    • (2005) Lecture Notes in Computer Science , vol.3569 , pp. 475-481
    • Seitz, S.1    Alava, M.2    Orponen, P.3
  • 20
    • 0041887248 scopus 로고    scopus 로고
    • An experimental analysis of local minima to improve neighbourhood search
    • DOI 10.1016/S0305-0548(02)00128-4, PII S0305054802001284
    • K. Steinhöfel, A. Albrecht, C.K. Wong. An experimental analysis of local minima to improve neighbourhood search. Comput. & Oper. Res. 30:2157-2173, 2003. (Pubitemid 37024482)
    • (2003) Computers and Operations Research , vol.30 , Issue.14 , pp. 2157-2173
    • Steinhofel, K.1    Albrecht, A.2    Wong, C.K.3
  • 21
    • 33750251763 scopus 로고    scopus 로고
    • Protein folding and optimization algorithms
    • Wiley
    • J.E. Straub. Protein folding and optimization algorithms. The Encyclopedia of Computational Chemistry, vol. 3, pp. 2184-2191, Wiley, 1998.
    • (1998) The Encyclopedia of Computational Chemistry , vol.3 , pp. 2184-2191
    • Straub, J.E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.