/* * process_hkl.c * * Assemble and process FEL Bragg intensities * * (c) 2006-2010 Thomas White * * Part of CrystFEL - crystallography with a FEL * */ #ifdef HAVE_CONFIG_H #include #endif #include #include #include #include #include #include #include "utils.h" #include "statistics.h" #include "sfac.h" #include "reflections.h" #include "likelihood.h" #include "symmetry.h" /* Number of divisions for R vs |q| graphs */ #define RVQDV (20) static void show_help(const char *s) { printf("Syntax: %s [options]\n\n", s); printf( "Assemble and process FEL Bragg intensities.\n" "\n" " -h, --help Display this help message.\n" " -i, --input= Specify input filename (\"-\" for stdin).\n" " -o, --output= Specify output filename for merged intensities\n" " (don't specify for no output).\n" " -p, --pdb= PDB file to use (default: molecule.pdb).\n" "\n" " --max-only Take the integrated intensity to be equal to the\n" " maximum intensity measured for that reflection.\n" " The default is to use the mean value from all\n" " measurements.\n" " --sum Sum (rather than average) the intensities for the\n" " final output list. This is useful for comparing\n" " results to radially summed powder patterns, but\n" " will break R-factor analysis.\n" " --stop-after= Stop after processing n patterns. Zero means\n" " keep going until the end of the input, and is\n" " the default.\n" "\n" " --scale Scale each pattern for best fit with the current\n" " model.\n" " -y, --symmetry= Merge according to point group .\n" ); } /* Note "holo" needn't actually be a holohedral point group, if you want to try * something strange like resolving from a low-symmetry group into an even * lower symmetry one. */ static ReflItemList *get_twin_possibilities(const char *holo, const char *mero) { ReflItemList *test_items; ReflItemList *twins; int np; np = num_general_equivs(holo) / num_general_equivs(mero); test_items = new_items(); /* Some arbitrarily chosen reflections which can't be special * reflections in any point group, i.e. lots of odd numbers, * prime numbers and so on. There's probably an analytical * way of working these out, but this will do. */ add_item(test_items, 1, 2, 3); add_item(test_items, 3, 7, 13); add_item(test_items, 5, 2, 1); twins = get_twins(test_items, holo, mero); delete_items(test_items); /* Idiot check. Wouldn't be necessary if I could prove that the above * set of arbitrarily chosen reflections were always general. */ if ( num_items(twins) != np ) { ERROR("Whoops! Couldn't find all the twinning possiblities.\n"); abort(); } return twins; } static int resolve_twin(const double *model, ReflItemList *observed, const double *patt, ReflItemList *items, ReflItemList *twins, const char *holo, const char *mero) { int n, i; double best_fom = 0.0; int best_op = 0; n = num_items(twins); for ( i=0; iop; for ( j=0; jh, r->k, r->l, &h, &k, &l, holo, op); get_asymm(h, k, l, &h, &k, &l, mero); set_intensity(trial_ints, h, k, l, lookup_intensity(patt, r->h, r->k, r->l)); set_count(trial_counts, h, k, l, 1); } intersection = intersection_items(observed, items); fom = stat_pearson(trial_ints, model, intersection); delete_items(intersection); free(trial_ints); free(trial_counts); //printf(" %f", fom); if ( fom > best_fom ) { best_fom = fom; best_op = op; } } //printf("\n"); return best_op; } static void merge_pattern(double *model, ReflItemList *observed, const double *new, ReflItemList *items, unsigned int *model_counts, int mo, ReflItemList *twins, const char *holo, const char *mero) { int i; int twin; ReflItemList *sym_items = new_items(); if ( twins != NULL ) { twin = resolve_twin(model, observed, new, items, twins, holo, mero); } else { twin = 0; } for ( i=0; ih; ks = item->k; ls = item->l; /* Transform into correct side of the twin law. * "twin" is always zero if no de-twinning is performed. */ get_general_equiv(hs, ks, ls, &h, &k, &l, holo, twin); /* Put into the asymmetric cell for the target group */ get_asymm(h, k, l, &h, &k, &l, mero); intensity = lookup_intensity(new, h, k, l); /* User asked for max only? */ if ( !mo ) { integrate_intensity(model, h, k, l, intensity); } else { if ( intensity > lookup_intensity(model, h, k, l) ) { set_intensity(model, h, k, l, intensity); } } /* Already seen this reflection in this pattern? Complain. */ if ( !find_item(sym_items, h, k, l) ) { /* Add the asymmetric version of this reflection to our * temporary list. One reflection (in the asymmetric * unit) may appear more than once per pattern if * symmetrically related reflections are present. * That's fine... */ } add_item(sym_items, h, k, l); /* Increase count count */ integrate_count(model_counts, h, k, l, 1); } /* Dump the reflections in this pattern into the overall list */ union_items(observed, sym_items); delete_items(sym_items); } static void merge_all(FILE *fh, double **pmodel, ReflItemList **pobserved, unsigned int **pcounts, int config_maxonly, int config_scale, int config_sum, int config_stopafter, ReflItemList *twins, const char *holo, const char *mero, int n_total_patterns) { char *rval; float f0; int n_nof0 = 0; int f0_valid = 0; int n_patterns = 0; double *new_pattern = new_list_intensity(); ReflItemList *items = new_items(); ReflItemList *observed = new_items(); double *model = new_list_intensity(); unsigned int *counts = new_list_count(); int i; do { char line[1024]; signed int h, k, l; float intensity; int r; rval = fgets(line, 1023, fh); if ( (strncmp(line, "Reflections from indexing", 25) == 0) || (strncmp(line, "New pattern", 11) == 0) ) { /* Start of first pattern? */ if ( n_patterns == 0 ) { n_patterns++; continue; } /* Assume a default I0 if we don't have one by now */ if ( config_scale && !f0_valid ) { n_nof0++; f0 = 1.0; } /* Scale if requested */ if ( config_scale ) { scale_intensities(model, observed, new_pattern, items, f0, f0_valid); } /* Start of second or later pattern */ merge_pattern(model, observed, new_pattern, items, counts, config_maxonly, twins, holo, mero); if ( n_patterns == config_stopafter ) break; /* Reset for the next pattern */ n_patterns++; clear_items(items); progress_bar(n_patterns, n_total_patterns, "Merging"); f0_valid = 0; } if ( strncmp(line, "f0 = ", 5) == 0 ) { r = sscanf(line, "f0 = %f", &f0); if ( r != 1 ) { f0 = 1.0; f0_valid = 0; continue; } f0_valid = 1; } r = sscanf(line, "%i %i %i %f", &h, &k, &l, &intensity); if ( r != 4 ) continue; /* Not interested in the central beam */ if ( (h==0) && (k==0) && (l==0) ) continue; /* The same raw indices (before mapping into the asymmetric * unit should not turn up twice in one pattern. */ if ( find_item(items, h, k, l) != 0 ) { ERROR("More than one measurement for %i %i %i in" " pattern number %i\n", h, k, l, n_patterns); } set_intensity(new_pattern, h, k, l, intensity); /* NB: This list contains raw indices, before working out * where they belong in the asymmetric unit. */ add_item(items, h, k, l); } while ( rval != NULL ); delete_items(items); free(new_pattern); /* Calculate mean intensity if necessary */ if ( !config_sum && !config_maxonly ) { for ( i=0; i 0 ) { model[i] /= (double)counts[i]; } } } *pmodel = model; *pcounts = counts; *pobserved = observed; STATUS("%i patterns had no f0 valid value.\n", n_nof0); } static int count_patterns(FILE *fh) { char *rval; int n_total_patterns = 0; do { char line[1024]; rval = fgets(line, 1023, fh); if ( (strncmp(line, "Reflections from indexing", 25) == 0) || (strncmp(line, "New pattern", 11) == 0) ) { n_total_patterns++; } } while ( rval != NULL ); return n_total_patterns; } int main(int argc, char *argv[]) { int c; char *filename = NULL; char *output = NULL; FILE *fh; double *model; unsigned int *counts; UnitCell *cell; int config_maxonly = 0; int config_stopafter = 0; int config_sum = 0; int config_scale = 0; unsigned int n_total_patterns; char *sym = NULL; char *pdb = NULL; ReflItemList *twins; ReflItemList *observed; int i; const char *holo = NULL; /* Long options */ const struct option longopts[] = { {"help", 0, NULL, 'h'}, {"input", 1, NULL, 'i'}, {"output", 1, NULL, 'o'}, {"max-only", 0, &config_maxonly, 1}, {"output-every", 1, NULL, 'e'}, {"stop-after", 1, NULL, 's'}, {"sum", 0, &config_sum, 1}, {"scale", 0, &config_scale, 1}, {"symmetry", 1, NULL, 'y'}, {"pdb", 1, NULL, 'p'}, {0, 0, NULL, 0} }; /* Short options */ while ((c = getopt_long(argc, argv, "hi:e:ro:p:y:", longopts, NULL)) != -1) { switch (c) { case 'h' : show_help(argv[0]); return 0; case 'i' : filename = strdup(optarg); break; case 'o' : output = strdup(optarg); break; case 's' : config_stopafter = atoi(optarg); break; case 'p' : pdb = strdup(optarg); break; case 'y' : sym = strdup(optarg); break; case 0 : break; default : return 1; } } if ( filename == NULL ) { ERROR("Please specify filename using the -i option\n"); return 1; } if ( pdb == NULL ) { pdb = strdup("molecule.pdb"); } cell = load_cell_from_pdb(pdb); free(pdb); /* Show useful symmetry information */ if ( sym != NULL ) { holo = get_holohedral(sym); int np = num_general_equivs(holo) / num_general_equivs(sym); if ( np > 1 ) { STATUS("Resolving point group %s into %s " "(%i possibilities)\n", holo, sym, np); /* Get the list of twin/Bijvoet possibilities */ twins = get_twin_possibilities(holo, sym); STATUS("Twin/inversion operation indices from %s are:", holo); for ( i=0; iop); } STATUS("\n"); } else { STATUS("No twin/inversion resolution necessary.\n"); twins = NULL; } } else { STATUS("Not performing any twin/inversion resolution.\n"); twins = NULL; sym = strdup("1"); holo = strdup("1"); } /* Open the data stream */ if ( strcmp(filename, "-") == 0 ) { fh = stdin; } else { fh = fopen(filename, "r"); } free(filename); if ( fh == NULL ) { ERROR("Failed to open input file\n"); return 1; } /* Count the number of patterns in the file */ n_total_patterns = count_patterns(fh); STATUS("There are %i patterns to process\n", n_total_patterns); rewind(fh); merge_all(fh, &model, &observed, &counts, config_maxonly, config_scale, config_sum, config_stopafter, twins, holo, sym, n_total_patterns); rewind(fh); fclose(fh); if ( output != NULL ) { write_reflections(output, observed, model, NULL, counts, cell); } free(sym); free(model); free(counts); free(output); free(cell); return 0; }