Abstract
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 disparate classes of chains are in fact identical. Along the way, we discover that all α-producible configurations of a chain can be moved to a canonical configuration resembling a helix. One consequence is an algorithm that reconfigures between any two flat states of a nonacute chain in O(n) “moves,” improving the O(n 2)-move algorithm in [ADD + 02].
Finally, we prove that the α-producible chains are rare in the following technical sense. A random chain of n links is defined by drawing the lengths and angles from any “regular” (e.g., uniform) distribution on any subset of the possible values. A random configuration of a chain embeds into ℝ3 by in addition drawing the dihedral angles from any regular distribution. If a class of chains has a locked configuration (and we know of no nontrivial class that avoids locked configurations), then the probability that a random configuration of a random chain is α-producible approaches zero geometrically as n → ∞.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aloupis, G., Demaine, E., Dujmović, V., Erickson, J., Langerman, S., Meijer, H., Streinu, I., O’Rourke, J., Overmars, M., Soss, M., Toussaint, G.: Flat-state connectivity of linkages under dihedral motions. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 369–380. Springer, Heidelberg (2002)
Aloupis, G., Demaine, E.D., Meijer, H., O’Rourke, J., Streinu, I., Toussaint, G.: Flat-state connectedness of fixed-angle chains: Special acute chains. In: Proc. 14th Canad. Conf. Comp. Geom., pp. 27–30 (2002)
Biedl, T., Demaine, E., Demaine, M., Lubiw, A., O’Rourke, J., Overmars, M., Robbins, S., Streinu, I., Toussaint, G.T., Whitesides, S.: On reconfiguring tree linkages: Trees can lock. Discrete Mathematics 117, 293–297 (2002)
Soss, M., Toussaint, G.T.: Geometric and computational aspects of polymer reconfiguration. J. Math. Chemistry 27(4), 303–318 (2000)
Willard, D.E.: Searching unindexed and nonuniformly generated files in log log N time. SIAM J. Comput. 14, 1013–1029 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demaine, E.D., Langerman, S., O’Rourke, J. (2003). Geometric Restrictions on Producible Polygonal Protein Chains. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-24587-2_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20695-8
Online ISBN: 978-3-540-24587-2
eBook Packages: Springer Book Archive