# Difference between revisions of "Xds nonisomorphism"

(Created page with "[ftp://turn5.biologie.uni-konstanz.de/pub/xds_nonisomorphism.rhel6.bz2 xds_nonisomorphism] is a program that clusters datasets as stored in their unmerged reflection file (typ...") |
(fix links) |
||

Line 1: | Line 1: | ||

− | [ftp://turn5.biologie.uni-konstanz.de/pub/xds_nonisomorphism. | + | [ftp://turn5.biologie.uni-konstanz.de/pub/linux_bin/xds_nonisomorphism xds_nonisomorphism][ftp://turn5.biologie.uni-konstanz.de/pub/sources/xds_nonisomorphism.f90] is a program that clusters datasets as stored in their unmerged reflection file (typically called XDS_ASCII.HKL) as written by [[XDS]]. It implements the method of [https://doi.org/10.1107/S1399004713025431 Brehm and Diederichs (2014)] and theory of [https://doi.org/10.1107/S2059798317000699 Diederichs (2017)]. |

This program determines the lengths of the vectors from the [[CC1/2]] of the data sets, and the angles between vectors from the correlation coefficients between data sets. It requires data sets with internal multiplicity, and mutual overlap. Angles are expressed in degrees. Less than 10° should be considered good isomorphism, 90° means completely unrelated (i.e. non-isomorphous) datasets (theoretically, higher angles are also possible if data sets are anti-correlated). After the analysis, it produces a 3D representation of the arrangement of data sets such that the distances in 3D try to reproduce the angles - please note that this is a completely different representation from that of [[xscale_isocluster]]! xds_nonisomorphism prints a short help text if the -h option is used. | This program determines the lengths of the vectors from the [[CC1/2]] of the data sets, and the angles between vectors from the correlation coefficients between data sets. It requires data sets with internal multiplicity, and mutual overlap. Angles are expressed in degrees. Less than 10° should be considered good isomorphism, 90° means completely unrelated (i.e. non-isomorphous) datasets (theoretically, higher angles are also possible if data sets are anti-correlated). After the analysis, it produces a 3D representation of the arrangement of data sets such that the distances in 3D try to reproduce the angles - please note that this is a completely different representation from that of [[xscale_isocluster]]! xds_nonisomorphism prints a short help text if the -h option is used. |

## Revision as of 13:20, 22 March 2018

xds_nonisomorphism[1] is a program that clusters datasets as stored in their unmerged reflection file (typically called XDS_ASCII.HKL) as written by XDS. It implements the method of Brehm and Diederichs (2014) and theory of Diederichs (2017).

This program determines the lengths of the vectors from the CC1/2 of the data sets, and the angles between vectors from the correlation coefficients between data sets. It requires data sets with internal multiplicity, and mutual overlap. Angles are expressed in degrees. Less than 10° should be considered good isomorphism, 90° means completely unrelated (i.e. non-isomorphous) datasets (theoretically, higher angles are also possible if data sets are anti-correlated). After the analysis, it produces a 3D representation of the arrangement of data sets such that the distances in 3D try to reproduce the angles - please note that this is a completely different representation from that of xscale_isocluster! xds_nonisomorphism prints a short help text if the -h option is used.