Skip to content
Snippets Groups Projects
Commit 3ce55778 authored by Valerio Mariani's avatar Valerio Mariani
Browse files

Added check for chain names for lddt, updated documetation

parent 7a451c63
No related branches found
No related tags found
No related merge requests found
...@@ -115,9 +115,10 @@ ...@@ -115,9 +115,10 @@
Both functions process only standard residues present in the first chain of the reference structures. Both functions process only standard residues present in the first chain of the reference structures.
The only difference between the two functions is that one takes a single reference structure and the other The only difference between the two functions is that one takes a single reference structure and the other
a list of reference structures. The structures in the list have to be properly aligned before being passed a list of reference structures. The structures in the list have to be properly prepared before being passed
to the function. Gaps in the alignment are allowed and automatically dealt with, but corresponding residues to the function. Corresponding residues in the structures must have the same residue number, the same chain name,
in the structures must have the same residue number. etc. Gaps are allowed and automatically dealt with: if information about a distance is present in at least one of
the structures, it will be considered.
If a distance between two atoms is shorter than the inclusion radius in all structures in which the two atoms are If a distance between two atoms is shorter than the inclusion radius in all structures in which the two atoms are
present, it is included in the list. However, if the distance is longer than the inclusion radius in at least present, it is included in the list. However, if the distance is longer than the inclusion radius in at least
......
...@@ -238,6 +238,12 @@ int main (int argc, char **argv) ...@@ -238,6 +238,12 @@ int main (int argc, char **argv)
if (!ref) { if (!ref) {
exit(-1); exit(-1);
} }
if (ref_list.size()>0) {
if (ref_list[0].GetChainList()[0].GetName()!=ref.GetChainList()[0].GetName()) {
std::cout << "ERROR: First chains in the reference structures have different names" << std::endl;
exit(-1);
}
}
ref_list.push_back(ref.CreateFullView()); ref_list.push_back(ref.CreateFullView());
} }
glob_dist_list = CreateDistanceListFromMultipleReferences (ref_list,cutoffs,sequence_separation,radius); glob_dist_list = CreateDistanceListFromMultipleReferences (ref_list,cutoffs,sequence_separation,radius);
......
...@@ -161,10 +161,17 @@ GlobalRDMap CreateDistanceList(const EntityView& ref,Real max_dist); ...@@ -161,10 +161,17 @@ GlobalRDMap CreateDistanceList(const EntityView& ref,Real max_dist);
/// \brief Creates a list of distances to check during a Local Difference Distance Test starting from multiple reference structures /// \brief Creates a list of distances to check during a Local Difference Distance Test starting from multiple reference structures
/// ///
/// Requires a list of reference structure and an inclusion radius (max_dist). If a distance between two atoms is shorter /// Requires a list of reference structure and an inclusion radius (max_dist).
/// than the inclusion radius in all structures in which the two atoms are present, it is included in the list ///
/// However, if the distance is longer than the inclusion radius in at least one of the structures, it /// The structures in the list have to be properly prepared before being passed
/// is not be considered a local interaction and is exluded from the list /// to the function. Corresponding residues in the structures must have the same residue number, the same chain name,
/// etc. Gaps are allowed and automatically dealt with: if information about a distance is present in at least one of
/// the structures, it will be considered.
///
///
/// If a distance between two atoms is shorter than the inclusion radius in all structures in which the two atoms are
/// present, it is included in the list. However, if the distance is longer than the inclusion radius in at least one
/// of the structures, it is not be considered a local interaction and is exluded from the list
/// ///
/// The function takes care of residues with ambigous symmetric sidechains. To decide which naming convention to use, the functions /// The function takes care of residues with ambigous symmetric sidechains. To decide which naming convention to use, the functions
/// computes a local distance score of each reference structure with the first reference structure in the list, using only non ambigously-named atoms. /// computes a local distance score of each reference structure with the first reference structure in the list, using only non ambigously-named atoms.
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment