Crystal engineering using a "turtlebug" algorithm: A de novo approach to the design of binodal metal-organic frameworks

Gregory L. McColm, W. Edwin Clark, Mohamed Eddaoudi, Łukasz Wojtas, Michael J. Zaworotko

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

A new series of computer programs that enumerate three-dimensional periodic embedded nets (i.e., representing crystals) is based on an algorithm that can theoretically enumerate all possible structures for all possible periodic topologies. Unlike extant programs, this algorithm employs algebraic and combinatorial machinery developed during the 1980s in combinatorial and geometric group theory and ancillary fields. This algorithm was validated by a demonstration program that found all strictly binodal periodic edge-transitive 3,4-, 3,6-, 4,4-, and 4,6-coordinated nets listed in the RCSR database. These programs could be used in two ways: to suggest new ways for targeting known nets, and to provide blueprints for new chemically feasible nets. They rely on a discrete version of "turtle geometry" adapted for these nets. © 2011 American Chemical Society.
Original languageEnglish (US)
Pages (from-to)3686-3693
Number of pages8
JournalCrystal Growth & Design
Volume11
Issue number9
DOIs
StatePublished - Sep 7 2011

ASJC Scopus subject areas

  • Materials Science(all)
  • Chemistry(all)
  • Condensed Matter Physics

Fingerprint

Dive into the research topics of 'Crystal engineering using a "turtlebug" algorithm: A de novo approach to the design of binodal metal-organic frameworks'. Together they form a unique fingerprint.

Cite this