-
1
-
-
12844261137
-
PROuST: A comparison method of three-dimensional structures of proteins using indexing techniques
-
M. Comin, C.Guerra, and G. Zanotti. PROuST: a comparison method of three-dimensional structures of proteins using indexing techniques. Journal of Computational Biology, 11(6):1061-1072, 2004.
-
(2004)
Journal of Computational Biology
, vol.11
, Issue.6
, pp. 1061-1072
-
-
Comin, M.1
Guerra, C.2
Zanotti, G.3
-
2
-
-
0027440362
-
Protein structure comparison by alignment of distance matrices
-
L. Holm and C. Sander. Protein structure comparison by alignment of distance matrices. Journal of Molecular Biology, 233:123-138, 1993.
-
(1993)
Journal of Molecular Biology
, vol.233
, pp. 123-138
-
-
Holm, L.1
Sander, C.2
-
8
-
-
0034826884
-
101 optimal PDB structure alignments: A branch-and-cut algorithm for the maximum contact map overlap problem
-
ACM Press
-
G. Lancia, R. Carr, B. Walenz, and S. Istrail. 101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. In RECOMB 2001, pages 193-202. ACM Press, 2001.
-
(2001)
RECOMB 2001
, pp. 193-202
-
-
Lancia, G.1
Carr, R.2
Walenz, B.3
Istrail, S.4
-
9
-
-
0036374299
-
Structural alignment of largesize proteins via Lagrangian relaxation
-
ACM Press
-
A. Caprara and G. Lancia. Structural alignment of largesize proteins via Lagrangian relaxation. In RECOMB 2002, pages 100-108. ACM Press, 2002.
-
(2002)
RECOMB 2002
, pp. 100-108
-
-
Caprara, A.1
Lancia, G.2
-
10
-
-
33745769918
-
Protein structure comparison: Algorithms and applications
-
Mathematical Methods for Protein Structure Analysis and Design
-
G. Lancia and S. Istrail. Protein structure comparison: Algorithms and applications. In Mathematical Methods for Protein Structure Analysis and Design, volume 2666 of Lecture Notes in Computer Science, pages 1-33, 2003.
-
(2003)
Lecture Notes in Computer Science
, vol.2666
, pp. 1-33
-
-
Lancia, G.1
Istrail, S.2
-
12
-
-
4344656723
-
Approximate protein structural alignment in polynomial time
-
R. Kolodny and N. Linial. Approximate protein structural alignment in polynomial time. PNAS, 101(33):12201-12206, 2004.
-
(2004)
PNAS
, vol.101
, Issue.33
, pp. 12201-12206
-
-
Kolodny, R.1
Linial, N.2
-
14
-
-
0031715982
-
Protein structure alignment by incremental combinatorial extension (CE) of the optimal path
-
I.N. Shindyalov and P.E. Bourne. Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Protein Engineering, 11(9):739-747, 1998.
-
(1998)
Protein Engineering
, vol.11
, Issue.9
, pp. 739-747
-
-
Shindyalov, I.N.1
Bourne, P.E.2
-
17
-
-
16344379369
-
Non-sequential structure-based alignments reveal topology-independent core packing arrangements in proteins
-
X. Yuan and C. Bystroff. Non-sequential structure-based alignments reveal topology-independent core packing arrangements in proteins. Bioinformatics, 27:1010-1019, 2005.
-
(2005)
Bioinformatics
, vol.27
, pp. 1010-1019
-
-
Yuan, X.1
Bystroff, C.2
-
18
-
-
0142143332
-
MASS: Multiple structural alignment by secondary structures
-
O. Dror, H. Benyamini, R. Nussinov, and H. Wolfson. MASS: Multiple structural alignment by secondary structures. Bioinformatics, 19(Suppl. 1):95-104, 2003.
-
(2003)
Bioinformatics
, vol.19
, Issue.1 SUPPL.
, pp. 95-104
-
-
Dror, O.1
Benyamini, H.2
Nussinov, R.3
Wolfson, H.4
-
20
-
-
0033954256
-
The protein data bank
-
H.M. Berman, J. Westbrook, Z. Feng, G. Gilliland, T.N. Bhat, H. Weissig, I.N. Shindyalov, and P.E. Bourne. The protein data bank. Nucleic Acids Research, 28:235-242, 2000.
-
(2000)
Nucleic Acids Research
, 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
-
21
-
-
84890517975
-
Least-square fitting of two 3-d point sets
-
K.S. Arun, T.S. Huang, and S.D. Blostein. Least-square fitting of two 3-d point sets. IEEE Trans. on Pattern Analysis and Machine Intelligence, 9(5):698-700, 1987.
-
(1987)
IEEE Trans. on Pattern Analysis and Machine Intelligence
, vol.9
, Issue.5
, pp. 698-700
-
-
Arun, K.S.1
Huang, T.S.2
Blostein, S.D.3
-
22
-
-
0000673493
-
Graph minors. II. algorithmic aspects of tree-width
-
N. Robertson and P.D. Seymour. Graph minors. II. algorithmic aspects of tree-width. Journal of Algorithms, 7:309-322, 1986.
-
(1986)
Journal of Algorithms
, vol.7
, pp. 309-322
-
-
Robertson, N.1
Seymour, P.D.2
-
23
-
-
26444462147
-
Rapid side-chain packing via tree decomposition
-
RECOMB 2005, Springer, May
-
J. Xu. Rapid side-chain packing via tree decomposition. In RECOMB 2005, volume 3500 of Lecture Notes in Bioinformatics. Springer, May 2005.
-
(2005)
Lecture Notes in Bioinformatics
, vol.3500
-
-
Xu, J.1
-
24
-
-
0026716018
-
-
M.H. Hao, S. Rackovsky, A. Liwo, M.R. Pincus, and H.A. Scheraga. Proc. Natl. Acad. Sci. USA, 89:6614-6618, 1992.
-
(1992)
Proc. Natl. Acad. Sci. USA
, vol.89
, pp. 6614-6618
-
-
Hao, M.H.1
Rackovsky, S.2
Liwo, A.3
Pincus, M.R.4
Scheraga, H.A.5
-
25
-
-
1842451398
-
101 optimal PDB structure alignments: A branch-and-cut algorithm for the maximum contact map overlap problem
-
A. Caprara, R. Carr, S. Istrail, G. Lancia, and B. Walenz. 101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. Journal of Computational Biology, 11(1):27-52, 2004.
-
(2004)
Journal of Computational Biology
, vol.11
, Issue.1
, pp. 27-52
-
-
Caprara, A.1
Carr, R.2
Istrail, S.3
Lancia, G.4
Walenz, B.5
|