Logo del repository
  1. Home
 
Opzioni

Optimal Shapes of Compact Strings

MARITAN A
•
TROVATO A
•
BANAVAR JR
•
Micheletti, Cristian
2000
  • journal article

Periodico
NATURE
Abstract
Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines(1-5). A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest packing fraction; only recently has it been proved(1,2) that the answer for infinite systems is a face-centred-cubic lattice. This simply stated problem has had a profound impact in many areas(3-5), ranging from the crystallization and melting of atomic systems, to optimal packing of objects and the sub-division of space. Here we study an analogous problem-that of determining the optimal shapes of closely packed compact strings. This problem is a mathematical idealization of situations commonly encountered in biology, chemistry and physics, involving the optimal structure of folded polymeric chains. We rnd that, in cases where boundary effects(6) are not dominant, helices with a particular pitch-radius ratio are selected. Interestingly, the same geometry is observed in helices in naturally occurring proteins.
DOI
10.1038/35018538
WOS
WOS:000088251900044
Archivio
http://hdl.handle.net/20.500.11767/14263
info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-0034691565
Diritti
closed access
Web of Science© citazioni
244
Data di acquisizione
Mar 24, 2024
google-scholar
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your nstitution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Realizzato con Software DSpace-CRIS - Estensione mantenuta e ottimizzata da 4Science

  • Impostazioni dei cookie
  • Informativa sulla privacy
  • Accordo con l'utente finale
  • Invia il tuo Feedback