High-throughput crystal structure solution using prototypes

被引:26
|
作者
Griesemer, Sean D. [1 ]
Ward, Logan [2 ]
Wolverton, Chris [1 ]
机构
[1] Northwestern Univ, Dept Mat Sci & Engn, Evanston, IL 60208 USA
[2] Argonne Natl Lab, Data Sci & Learning Div, Lemont, IL 60439 USA
基金
美国国家科学基金会;
关键词
TOTAL-ENERGY CALCULATIONS; AFLOW LIBRARY; DIFFRACTION; HYDRIDES;
D O I
10.1103/PhysRevMaterials.5.105003
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Databases of density functional theory (DFT) calculations, such as the Open Quantum Materials Database (OQMD), have paved the way for accelerated materials discovery. DFT calculations require crystal structure information as input; however, due to inherent challenges in solving a compound's structure from powder diffraction data alone, there are thousands of experimentally synthesized compounds whose structures remain unsolved. We present a rapid DFT-based structure solution method capable of resolving numerous outstanding structure solution problems at low computational cost. The method involves (1) searching inorganic compound databases for all prototypes that match known structural characteristics of the compound, such as stoichiometry, space group, and number of atoms per cell, (2) performing DFT calculations of the target composition in each of the structural prototypes, and (3) evaluating these prototypes as candidates using a combination of DFT energy and match between calculated and experimental diffraction pattern. As this approach is straightforward and inexpensive, we employ it to solve 521 previously unsolved compounds from the Powder Diffraction File, resulting in a 1.4% expansion of the set of all experimental compounds in the OQMD. DFT calculations of these compounds could yield valuable properties.
引用
收藏
页数:15
相关论文
共 50 条
  • [1] 24 hours - High-Throughput Crystal Structure Production
    Wagner, T.
    Kroemer, M.
    Grunwald, B.
    ACTA CRYSTALLOGRAPHICA A-FOUNDATION AND ADVANCES, 2014, 70 : C695 - C695
  • [2] A high-throughput solution for proteomics
    Hancock, WS
    Choudhary, G
    Wu, SL
    Shieh, P
    AMERICAN LABORATORY, 2002, 34 (05) : 13 - +
  • [3] A HIGH-THROUGHPUT INTERCONNECTION STRUCTURE
    HERNANDEZ, JA
    HORLAIT, E
    JOLY, R
    PUJOLLE, G
    AFIPS CONFERENCE PROCEEDINGS, 1983, 52 : 729 - &
  • [4] Data Mining Approaches to High-Throughput Crystal Structure and Compound Prediction
    Hautier, Geoffroy
    PREDICTION AND CALCULATION OF CRYSTAL STRUCTURES: METHODS AND APPLICATIONS, 2014, 345 : 139 - 179
  • [5] Confronting high-throughput protein refolding using high pressure and solution screens
    Qoronfleh, M. Walid
    Hesterberg, Lyndal K.
    Seefeldt, Matthew B.
    PROTEIN EXPRESSION AND PURIFICATION, 2007, 55 (02) : 209 - 224
  • [6] High dielectric ternary oxides from crystal structure prediction and high-throughput screening
    Qu, Jingyu
    Zagaceta, David
    Zhang, Weiwei
    Zhu, Qiang
    SCIENTIFIC DATA, 2020, 7 (01)
  • [7] High dielectric ternary oxides from crystal structure prediction and high-throughput screening
    Jingyu Qu
    David Zagaceta
    Weiwei Zhang
    Qiang Zhu
    Scientific Data, 7
  • [8] Design, expression, and purification of a Flaviviridae polymerase using a high-throughput approach to facilitate crystal structure determination
    Choi, KH
    Groarke, JM
    Young, DC
    Rossmann, MG
    Pevear, DC
    Kuhn, RJ
    Smith, JL
    PROTEIN SCIENCE, 2004, 13 (10) : 2685 - 2692
  • [9] RNA Secondary Structure Prediction Using High-throughput SHAPE
    Lusvarghi, Sabrina
    Sztuba-Solinska, Joanna
    Purzycka, Katarzyna J.
    Rausch, Jason W.
    Le Grice, Stuart F. J.
    JOVE-JOURNAL OF VISUALIZED EXPERIMENTS, 2013, (75):
  • [10] High-throughput protein structure determination using grid computing
    Schmidberger, Jason W.
    Bethwaite, Blair
    Enticott, Colin
    Bate, Mark A.
    Androulakis, Steve G.
    Faux, Noel
    Reboul, Cyril F.
    Phan, Jennifer M. N.
    Whisstock, James C.
    Goscinski, Wojtek J.
    Garic, Slavisa
    Abramson, David
    Buckle, Ashley M.
    2009 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-5, 2009, : 1616 - +