-
1
-
-
14544303007
-
NP-hardness results for protein side-chain packing
-
Akutsu T, NP-hardness results for protein side-chain packing, Genome Inform 8:180-186, 1997.
-
(1997)
Genome Inform.
, vol.8
, pp. 180-186
-
-
Akutsu, T.1
-
2
-
-
0141963801
-
The side-chain positioning-problem: A semidifinite programming formulation with new rounding schemes
-
Chazelle B, Kingsford K, Singh M, The side-chain positioning-problem: A semidifinite programming formulation with new rounding schemes, Proc ACM FCRC'2003, Principles of Computing and Knowledge: Paris Kanellakis Memorial Workshop 2003, pp. 86-94, 2003.
-
(2003)
Proc. ACM FCRC'2003, Principles of Computing and Knowledge: Paris Kanellakis Memorial Workshop 2003
, pp. 86-94
-
-
Chazelle, B.1
Kingsford, K.2
Singh, M.3
-
3
-
-
0037412183
-
Protein design is NP-hard
-
Niles Pierce A, Winfree E, Protein design is NP-hard, Protein Eng 15(10):779-782, 2002.
-
(2002)
Protein Eng.
, vol.15
, Issue.10
, pp. 779-782
-
-
Niles Pierce, A.1
Winfree, E.2
-
4
-
-
0027160197
-
Backbone-dependent rotamer library for proteins: Application to side-chain prediction
-
Dunbrack RL, Karplus M, Backbone-dependent rotamer library for proteins: Application to side-chain prediction, J Mol Biol 230 543-574, 1993.
-
(1993)
J. Mol. Biol.
, vol.230
, pp. 543-574
-
-
Dunbrack, R.L.1
Karplus, M.2
-
5
-
-
0026589733
-
The dead-end elimination theorem and its use in protein side-chain packing
-
Desmet J, De Maeyer M, Lasters I, The dead-end elimination theorem and its use in protein side-chain packing, Nature 356:539-542, 1992.
-
(1992)
Nature
, vol.356
, pp. 539-542
-
-
Desmet, J.1
De Maeyer, M.2
Lasters, I.3
-
6
-
-
0034740229
-
Modeling protein side-chain conformations using constraint logic programming
-
Swain MT, Kemp GJL, Modeling protein side-chain conformations using constraint logic programming, Comput Chem 26:85-95, 2001.
-
(2001)
Comput. Chem.
, vol.26
, pp. 85-95
-
-
Swain, M.T.1
Kemp, G.J.L.2
-
7
-
-
0026019108
-
Prediction of protein side-chain conformation by packing optimization
-
Lee C, Subbiah S, Prediction of protein side-chain conformation by packing optimization, J Mol Biol 217:373-388, 1991.
-
(1991)
J. Mol. Biol.
, vol.217
, pp. 373-388
-
-
Lee, C.1
Subbiah, S.2
-
8
-
-
0026675799
-
Fast and simple Monte Carlo algorithm for side-chain optimization in proteins: Application to model building by homology
-
Holm L, Sander C, Fast and simple Monte Carlo algorithm for side-chain optimization in proteins: Application to model building by homology, Proteins: Struct Funct Genet 14:213-223, 1992.
-
(1992)
Proteins: Struct. Funct. Genet.
, vol.14
, pp. 213-223
-
-
Holm, L.1
Sander, C.2
-
9
-
-
0033550206
-
De novo protein design: In search of stability and specificity
-
Koehl P, Levitt M, De novo protein design: In search of stability and specificity, J Mol Biol 293:1161-1181, 1999.
-
(1999)
J. Mol. Biol.
, vol.293
, pp. 1161-1181
-
-
Koehl, P.1
Levitt, M.2
-
10
-
-
0029058162
-
Side-chain prediction by neural networks and simulated annealing
-
Hwang JK, Liao WF, Side-chain prediction by neural networks and simulated annealing, Protein Eng 8:363-370, 1995.
-
(1995)
Protein Eng.
, vol.8
, pp. 363-370
-
-
Hwang, J.K.1
Liao, W.F.2
-
11
-
-
0034625322
-
Trading accuracy for speed: A qualitative comparison of search algorithm in protein sequence design
-
Voigt CA, Gordon DB, Mayo SL, Trading accuracy for speed: A qualitative comparison of search algorithm in protein sequence design, J Mol Biol 229:789-803, 2002.
-
(2002)
J. Mol. Biol.
, vol.229
, pp. 789-803
-
-
Voigt, C.A.1
Gordon, D.B.2
Mayo, S.L.3
-
12
-
-
0029015770
-
An evaluation of discrete and continuum search techniques for conformational analysis of side-chains in proteins
-
Vasquez M, An evaluation of discrete and continuum search techniques for conformational analysis of side-chains in proteins, Biopolymers 36:53-70, 1995.
-
(1995)
Biopolymers
, vol.36
, pp. 53-70
-
-
Vasquez, M.1
-
13
-
-
0026589733
-
The dead-end elimination theorem and its use in protein side-chain packing
-
Desmet J, De Maeyer M, Lasters I, The dead-end elimination theorem and its use in protein side-chain packing, Nature 356:539-542, 1992.
-
(1992)
Nature
, vol.356
, pp. 539-542
-
-
Desmet, J.1
De Maeyer, M.2
Lasters, I.3
-
14
-
-
0031717560
-
Exploring the conformational space of protein side-chains using Dead-end elimination and the A* algorithm
-
Leach AR, Lemon RP, Exploring the conformational space of protein side-chains using Dead-end elimination and the A* algorithm, Prot Struct Funct Genet 33:227-239, 1998.
-
(1998)
Prot. Struct. Funct. Genet.
, vol.33
, pp. 227-239
-
-
Leach, A.R.1
Lemon, R.P.2
-
15
-
-
35248814346
-
An efficient branch-and-bound algorithm for finding a maximum clique
-
Tomita E, Seki T, An efficient branch-and-bound algorithm for finding a maximum clique, DMTCS 2003, LNCS 2731:278-289, 2003.
-
(2003)
DMTCS 2003, LNCS
, vol.2731
, pp. 278-289
-
-
Tomita, E.1
Seki, T.2
-
16
-
-
0001296418
-
Algorithm 457: Finding all cliques of an undirected graph
-
Bron C, Kerbosch J, Algorithm 457: Finding all cliques of an undirected graph, In Comm ACM 8:180-186, 1973.
-
(1973)
Comm. ACM
, vol.8
, pp. 180-186
-
-
Bron, C.1
Kerbosch, J.2
-
17
-
-
0032488962
-
An all-atom distance-dependent conditional probability discriminatory function for protein structure prediction
-
Samudrala R, Moult J, An all-atom distance-dependent conditional probability discriminatory function for protein structure prediction, J Mol Biol 275:893-914, 1998.
-
(1998)
J. Mol. Biol.
, vol.275
, pp. 893-914
-
-
Samudrala, R.1
Moult, J.2
-
18
-
-
4544305126
-
An algorithm for finding a maximum clique with maximum edge-weight and computational experiments
-
technical report, MPS, The Information Processing Society of Japan
-
Suzuki J, Tomita E, Seki T, An algorithm for finding a maximum clique with maximum edge-weight and computational experiments, in technical report, MPS, The Information Processing Society of Japan, 2002.
-
(2002)
-
-
Suzuki, J.1
Tomita, E.2
Seki, T.3
-
19
-
-
0033954256
-
The protein data bank
-
Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, Weissig H, Shindyalov IN, Bourne P.E, The protein data bank, Nucleic Acids Res 28:235-242, 2000.
-
(2000)
Nucleic Acids Res.
, vol.28
, pp. 235-242
-
-
Berman, H.M.1
Westbrook, J.2
Feng, Z.3
Gilliland, G.4
Bhat, T.N.5
Weissig, H.6
Shindyalov, I.N.7
Bourne, P.E.8
-
20
-
-
0035882533
-
A distance-dependent atomic knowledge-based potential for improved protein structure selection
-
Lu H, Skolnick J, A distance-dependent atomic knowledge-based potential for improved protein structure selection, Proteins: Struct Funct Genet 44:223-232, 2001.
-
(2001)
Proteins: Struct. Funct. Genet.
, vol.44
, pp. 223-232
-
-
Lu, H.1
Skolnick, J.2
-
21
-
-
0036145846
-
Statistical potentials for fold assessment
-
Melo F, Sanchez R, Sali A, Statistical potentials for fold assessment, Protein Sci 11:430-448, 2002.
-
(2002)
Protein Sci.
, vol.11
, pp. 430-448
-
-
Melo, F.1
Sanchez, R.2
Sali, A.3
-
22
-
-
0032577270
-
A graph-theoretic algorithm for comparative modeling of protein structure
-
Samudrala R, Moult J, A graph-theoretic algorithm for comparative modeling of protein structure, J Mol Biol 279:287-302, 1998.
-
(1998)
J. Mol. Biol.
, vol.279
, pp. 287-302
-
-
Samudrala, R.1
Moult, J.2
|