Abstract
We have developed a transfer matrix algorithm for the enumeration of compact self-avoiding walks on rectangular strips of the square lattice. The algorithm is easily adapted to other shapes or generalized to problems such as interacting walks. These models are relevant in the study of globular proteins.
| Original language | English |
|---|---|
| Pages (from-to) | 109-113 |
| Number of pages | 5 |
| Journal | Computer Physics Communications |
| Volume | 142 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 15 Dec 2001 |
| Externally published | Yes |
| Event | Conference on Computational Physics (CCP'2000) - Gold Coast, Qld., Australia Duration: 3 Dec 2000 → 8 Dec 2000 |
Keywords
- Computer algorithms
- Exact enumeration
- Lattice models
- Polymers
- Self-avoiding walks
Fingerprint Dive into the research topics of 'Enumeration of compact self-avoiding walks'. Together they form a unique fingerprint.
Cite this
Jensen, I. (2001). Enumeration of compact self-avoiding walks. Computer Physics Communications, 142(1-3), 109-113. https://doi.org/10.1016/S0010-4655(01)00340-X