Geometric restrictions on producible polygonal protein chains

Algorithmica (New York)

Volumn 44, Issue 2, 2006, Pages 167-181

  Demaine, Erik D ^a   Langerman, Stefan ^b   O'Rourke, Joseph ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c SMITH COLLEGE   (United States)

Author keywords

Fixed angle chains; Flattenable chains; Locked chains; Polygonal chains; Protein backbone; Protein folding

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBABILITY; PRODUCT DESIGN; PROTEINS;

FIXED-ANGLE CHAINS; FLATTENABLE CHAINS; LOCKED CHAINS; POLYGONAL CHAINS; PROTEIN BACKBONE; PROTEIN FOLDING;

COMPUTATIONAL GEOMETRY;

EID: 30744432370     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-005-1205-7     Document Type: Conference Paper

References (7)

1. +] G. Aloupis, E. Demaine, V. Dujmović, J. Erickson, S. Langerman, H. Meijer, I. Streinu, J. O'Rourke, M. Overmars, M. Soss, and G. Toussaint. Flat-state connectivity of linkages under dihedral motions. In Proc. 13th Annu. Internat. Sympos. Alg. Comput., volume 2518 of Lecture Notes in Computer Science, pages 369-380. Springer, Berlin, 2002.
2. +] G. Aloupis, E. D. Demaine, H. Meijer, J. O'Rourke, I. Streinu, and G. Toussaint. Flat-state connectedness of fixed-angle chains: special acute chains. In Proc. 14th Canad. Conf. Comput. Geom., pages 27-30, 2002.
3. +] T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides. Locked and unlocked polygonal chains in three dimensions. Discrete Comput. Geom., 26(3):269-282, 2001.
4. [CJ] J. Cantarella and H. Johnston. Nontrivial embeddings of polygonal intervals and unknots in 3-space. J. Knot Theory Ramifications, 7(8):1027-1039, 1998.
5. +] P. Nissen, J. Hansen, N. Ban, B. Moore, and T. A. Steitz. The structural basis of ribosome activity in peptide bond synthesis. Science, 289:920-930, August 2000.
6. [ST] M. Soss and G. T. Toussaint. Geometric and computational aspects of polymer reconfiguration. J. Math. Chem., 27(4):303-318, 2000.
7. [Wil] D. E. Willard. Searching unindexed and nonuniformly generated files in log log N time. SIAM J. Comput., 14:1013-1029, 1985.