1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
indexamajig - bulk indexing and data reduction program
------------------------------------------------------
The "indexamajig" program takes as input a list of diffraction image files,
currently in HDF5 format. For each image, it attempts to find peaks and then
index the pattern. If successful, it will measure the intensities of the peaks
at Bragg locations and produce a list in the form "h k l I", with some extra
information about the locations of the peaks.
For minimal basic use, you need to provide the list of diffraction patterns,
the method which will be used to index (currently there is only one available
method), a file describing the geometry of the detector, a PDB file which
contains the unit cell which will be used for the indexing, and that you'd like
the program to output a list of intensities for each successfully indexed
pattern. You should redirect the output (stdout, but not stderr) of the program
to a file for later analysis. Here is what the minimal use looks like on the
command line, with each argument shown on a separate line. In practice, you'd
put this all on one line:
indexamajig
-i mypatternlist.lst
--indexing=dirax
--geometry mygeometry.geom
-p mystructure.pdb
--near-bragg
> myoutputfile.txt
More typical use includes all the above, but might also include a noise or
common mode filter (--filter-noise or --filter-cm respectively) if detector
noise causes problems for the peak detection. The HDF5 files might be in some
folder a long way from the current directory, so you might want to specify a
full pathname to be added in front of each filename. You'll probably want to
run more than one indexing job at a time (-j <n>), and you might want to correct
the intensities of saturated peaks according to a list stored elsewhere in the
HDF5 file:
indexamajig
-i mypatternlist.lst
--indexing=dirax
--geometry mygeometry.geom
-p mystructure.pdb
--near-bragg
--filter-noise
--prefix=/some/horribly/long/pathname/ending/in/a/slash/
-j 16
--sat-corr
> myoutputfile.txt
The table of saturation values for --sat-corr should be located in the HDF5 file
as follows: /processing/hitfinder/peakinfo_saturated. It should be an n*3 two
dimensional array, where the first two columns contain x and y coordinates and
the third contains the value which should belong in a peak at location x,y. The
value will be divided by 5 and spread in a small cross centred on that location.
See doc/geometry for information about how to create a geometry description
file.
Cell Reduction
--------------
You can choose from various options for cell reduction with the
"--cell-reduction=" option. The choices are "none", "reduce" and "compare".
This choice is important because all autoindexing methods produce an "ab
initio" estimate of the unit cell (nine parameters), rather than just finding
the orientation of the target cell (three parameters). It's clear that this is
not optimal, and will hopefully be fixed in future versions.
With "none", the raw cell from the autoindexer will be used. The cell probably
won't match the target cell, but it'll still get used. Use this option to test
whether the patterns are basically "indexable" or not, or if you don't know the
cell parameters. In the latter case, you'll need to plot some kind of histogram
of the resulting parameters from the output stream to see which are the most
popular. If you're lucky, this will reveal the true unit cell.
With "reduce", linear combinations of the raw cell will be checked against the
target cell. If at least one candidate is found for each axis of the target
cell, the angles will be checked to correspondence. If a match is found, this
cell will be used for further processing. This option should generate the most
matches, but might produce spurious results in many cases. The "--check-sanity"
option can help with this.
The "compare" method is like "reduce", but linear combinations are not taken.
That means that the cell must either match or match after a simple permutation
of the axes. This is useful when the target cell is subject to reticular
twinning, such as if one cell axis length is close to twice another. With
"reduce", there is a possibility that the axes might be confused in this
situation. This happens for lysozyme (1VDS), so watch out.
The tolerance for matching with "reduce" and "compare" is hardcoded as 5% in
the reciprocal axis lengths and 1.5 degrees in the (reciprocal) angles. Cells
from these reduction routines are further constrained to be right-handed. The
unmatched raw cell might be left-handed: CrystFEL doesn't check this for you.
Always using a right-handed cell means that the Bijvoet pairs can be told
apart.
Unconventional Use
------------------
There are some less often used options, for example "--dump-peaks" to dump the
peak locations found by the peak search (in turn presented to the indexer).
This might be useful if you want to check the performance of the peak finder.
If you run a large dataset with bot --dump-peaks and --near-bragg enabled,
you'll generate a large amount of data. To separate the peaks from the
indexed peaks, use scripts/stream-split as follows:
scripts/stream-split myoutputfile.txt indexed.txt peaks.txt
.. to generate both indexed.txt and peaks.txt. One of the last two arguments
can be "/dev/null" if you're only interested in the other.
"Gotchas"
---------
Don't run more than one indexamajig jobs simultaneously in the same working
directory - they'll overwrite each other's DirAx files, causing subtle problems
which can't easily be detected.
|
