Enumeration of compact self-avoiding walks

Iwan Jensen

Research output: Contribution to journalConference articlepeer-review

6 Citations (Scopus)


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 languageEnglish
Pages (from-to)109-113
Number of pages5
JournalComputer Physics Communications
Issue number1-3
Publication statusPublished - 15 Dec 2001
Externally publishedYes
EventConference on Computational Physics (CCP'2000) - Gold Coast, Qld., Australia
Duration: 3 Dec 20008 Dec 2000


  • Computer algorithms
  • Exact enumeration
  • Lattice models
  • Polymers
  • Self-avoiding walks


Dive into the research topics of 'Enumeration of compact self-avoiding walks'. Together they form a unique fingerprint.

Cite this