view article
Figure 2
Flowchart of the indexing-ambiguity-resolving algorithm. Once (an) alternative indexing choice(s) is/are selected, the program calculates the target function (1)[link]. A cluster is selected using the k-means algorithm and the solutions are passed on to the merging step. The two steps with dashed outlines indicate additional steps if a subset of the diffraction images is used for the resolution of the indexing ambiguities, instead of the full diffraction data set. In this case, this subset is merged to form a reference data set that is used to bootstrap the determination of the indexing operator for the remaining diffraction images (see Section 2.3[link]).

Journal logoSTRUCTURAL
BIOLOGY
ISSN: 2059-7983
Volume 75| Part 2| February 2019| Pages 234-241
https://doi.org/10.1107/S2059798318013177
Follow Acta Cryst. D
Sign up for e-alerts
E-alerts
Follow Acta Cryst. on Twitter
Twitter
Follow us on facebook
Facebook
Sign up for RSS feeds
RSS