On the maximum span of fixed-angle chains

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006

Volumn , Issue , 2006, Pages 93-96

  Benbernou, Nadia ^a   O’Rourke, Joseph ^a  

^a SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; PROTEINS;

CONSTANT TIME; FIXED ANGLES; MAXIMUM SPANS; PLANAR EMBEDDING; POLYGONAL CHAINS; POLYNOMIAL-TIME; PROTEIN BACKBONE; PROTEIN MODELING;

COMPUTATIONAL GEOMETRY;

EID: 85072850334     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Nadia Benbernou. Fixed-angle polygonal chains: Locked chains and the maximum span. Undergraduate thesis, Smith College, 2006.
2. E. D. Demaine, S. Langerman, and J. O’Rourke. Geometric restrictions on polygonal protein chain production. Algorithmica, 44(2):167–181, February 2006.
3. Sheung-Hung Poon. On straightening low-diameter unit trees. Manuscript, 2005.
4. Michael Soss. Geometric and computational aspects of molecular reconfiguration. Ph.D. thesis, School Comput. Sci., McGill University, 2001.
5. M. Soss and G. T. Toussaint. Geometric and computational aspects of polymer reconfiguration. J. Math. Chemistry, 27(4):303–318, 2000.