Premium
Matching selenium‐atom peak positions with a different hand or origin
Author(s) -
Smith G. David
Publication year - 2002
Publication title -
journal of applied crystallography
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.429
H-Index - 162
ISSN - 1600-5767
DOI - 10.1107/s0021889802002789
Subject(s) - polar , matching (statistics) , atom (system on chip) , group (periodic table) , substructure , space (punctuation) , displacement (psychology) , selenium , polar coordinate system , algorithm , space group , projection (relational algebra) , fortran , combinatorics , chemistry , mathematics , physics , crystallography , geometry , computer science , optics , quantum mechanics , statistics , x ray crystallography , psychotherapist , psychology , structural engineering , organic chemistry , diffraction , engineering , embedded system , operating system
An algorithm is described for matching and correlating two or more sets of peaks or atoms. The procedure is particularly useful for matching putative selenium atoms from a selenium‐atom substructure as obtained from E maps from two or more random‐atom trials. The algorithm will work for any space group except P 1. For non‐polar space groups, the procedure is relatively straightforward. For polar space groups, the calculation is performed in projection along the polar axis in order to identify potential matching peaks, and an iterative procedure is used to eliminate incorrect peaks and to calculate the displacement along the polar axis. The algorithm has been incorporated into a computer program, NANTMRF , written in Fortran 90. Less than 0.5 s are required to match 27 peaks in space group P 2 1 , and the output lists the correct origin, enantiomorph, symmetry operations, and provides the relative displacements between pairs of matching peaks.