Related Experiment Video
Updated: Oct 3, 2026

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles
Published on: May 8, 2015
Systematic generation of all nonequivalent closest-packed stacking sequences of length N using group theory
1Department of Geosciences, University of Arizona, Tucson, AZ 85721-0077, USA. thompson@geo.arizona.edu
Abstract:
An algorithm has been developed that generates all of the nonequivalent closest-packed stacking sequences of length N. There are 2(N) + 2(-1)(N) different labels for closest-packed stacking sequences of length N using the standard A, B, C notation. These labels are generated using an ordered binary tree. As different labels can describe identical structures, we have derived a generalized symmetry group, Q approximately equal to D(N) x S(3), to sort these into crystallographic equivalence classes. This problem is shown to be a constrained version of the classic three-colored necklace problem.
Related Concept Videos
Ziegler–Natta Chain-Growth Polymerization: Overview
Binomial Expansion Using Pascal's Triangle
Sequences
The Seven Crystal Systems: Overview
Generation of Straight or Branched Actin Filaments
Arp2/3 Complex
Arp2/3 complex is a seven-subunit complex consisting of two proteins similar to actin- Arp2 and Arp3, and five other subunits that help keep Arp2 and Arp3 inactive. When required, the complex is...
Next-generation Sequencing
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features.

