2013
DOI: 10.1107/s0907444912048524
|View full text |Cite
|
Sign up to set email alerts
|

Autoindexing diffraction images withiMosflm

Abstract: An overview of autoindexing diffraction images based on one-dimensional fast Fourier transforms is presented. The implementation of the algorithm in the Mosflm/iMosflm program suite is described with a discussion of practical issues that may arise and ways of assessing the success or failure of the procedure. Recent developments allow indexing of images that show multiple lattices, and several examples demonstrate the success of this approach in real cases.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
136
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 153 publications
(136 citation statements)
references
References 17 publications
0
136
0
Order By: Relevance
“…Default processing of data sets using either XDS (Kabsch, 2010) or iMosflm (Powell et al, 2013) always gave space group C222 1 . Data sets were reprocessed in P2 1 (Table 1) with care taken to use an R free selection that meant that all pseudoequivalent reflections were in the refined or the free data set.…”
Section: Data Collection Processing and Phasingmentioning
confidence: 99%
“…Default processing of data sets using either XDS (Kabsch, 2010) or iMosflm (Powell et al, 2013) always gave space group C222 1 . Data sets were reprocessed in P2 1 (Table 1) with care taken to use an R free selection that meant that all pseudoequivalent reflections were in the refined or the free data set.…”
Section: Data Collection Processing and Phasingmentioning
confidence: 99%
“…Very narrow wedges. It is widely recognized that the robustness of current indexing algorithms can be increased by using data from images that are widely separated in reciprocal space (for example, separated by a rotation of 90 ), particularly for more problematic cases (Steller et al, 1997;Powell et al, 2013;Winter et al, 2013). Therefore, this can make the indexing of multiple lattices from narrow wedges of data (e.g.…”
Section: Resolution Of Indexing Ambiguitiesmentioning
confidence: 99%
“…(a) Histogram of the fraction of overlapping pixels for the semi-synthetic six-lattice trypsin data set; (b) as for (a) but averaged across all data sets with the same number of lattices for two (red), three (green), four (blue) and six (cyan) crystals. methods, indexing was attempted with the recent implementation of multi-lattice indexing in iMosflm (Powell et al, 2013). When provided with the first 1 of images from the sixlattice data sets, iMosflm identified five lattices (only two of which had the correct unit cell) for one of the data sets and five lattices (only one of which had the correct unit cell) for the second data set.…”
Section: Resolution Of Indexing Ambiguitiesmentioning
confidence: 99%
See 1 more Smart Citation
“…This approach has been shown to be effective to index up to six crystals when applied to wedge data (Powell et al, 2013;Gildea et al, 2014;Sauter & Poon, 2010). However, this presents a lesser challenge than the snapshot case, as the controlled rotation provides multiple views of the same group of crystals.…”
Section: Introductionmentioning
confidence: 99%