An algorithm has been developed that generates all of the nonequivalent closest-packed stacking sequences of length N. There are 2N + 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 ≃ DN × S3, to sort these into crystallographic equivalence classes. This problem is shown to be a constrained version of the classic three-colored necklace problem.
|Original language||English (US)|
|Number of pages||6|
|Journal||Acta Crystallographica Section B: Structural Science|
|State||Published - Dec 1 2001|
ASJC Scopus subject areas
- Biochemistry, Genetics and Molecular Biology(all)