English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Genarris: Random generation of molecular crystal structures and fast screening with a Harris approximation

MPS-Authors
There are no MPG-Authors in the publication available
External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

1.5014038.pdf
(Publisher version), 7MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Li, X., Curtis, F. S., Rose, T., Schober, C., Vazquez-Mayagoitia, A., Reuter, K., et al. (2018). Genarris: Random generation of molecular crystal structures and fast screening with a Harris approximation. The Journal of Chemical Physics, 148(24): 241701. doi:10.1063/1.5014038.


Cite as: https://hdl.handle.net/21.11116/0000-000A-AB25-C
Abstract
We present Genarris, a Python package that performs configuration space screening for molecular crystals of rigid molecules by random sampling with physical constraints. For fast energy evaluations, Genarris employs a Harris approximation, whereby the total density of a molecular crystal is constructed via superposition of single molecule densities. Dispersion-inclusive density functional theory is then used for the Harris density without performing a self-consistency cycle. Genarris uses machine learning for clustering, based on a relative coordinate descriptor developed specifically for molecular crystals, which is shown to be robust in identifying packing motif similarity. In addition to random structure generation, Genarris offers three workflows based on different sequences of successive clustering and selection steps: the “Rigorous” workflow is an exhaustive exploration of the potential energy landscape, the “Energy” workflow produces a set of low energy structures, and the “Diverse” workflow produces a maximally diverse set of structures. The latter is recommended for generating initial populations for genetic algorithms. Here, the implementation of Genarris is reported and its application is demonstrated for three test cases.