A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Geometric Restrictions on Producible Polygonal Protein Chains
[chapter]
2003
Lecture Notes in Computer Science
Fixed-angle polygonal chains in 3D serve as an interesting model of protein backbones. Here we consider such chains produced inside a "machine" modeled crudely as a cone, and examine the constraints this model places on the producible chains. We call this notion α-producible, and prove as our main result that a chain is α-producible if and only if it is flattenable, that is, it can be reconfigured without self-intersection to lie flat in a plane. This result establishes that two seemingly
doi:10.1007/978-3-540-24587-2_41
fatcat:qttr6pjssnh6pgbei36klvupjy