| http://dbpedia.org/ontology/abstract
|
The Kabsch algorithm, named after , is a m … The Kabsch algorithm, named after , is a method for calculating the optimal rotation matrix that minimizes the RMSD (root mean squared deviation) between two paired sets of points. It is useful in graphics, cheminformatics to compare molecular structures, and also bioinformatics for comparing protein structures (in particular, see root-mean-square deviation (bioinformatics)). The algorithm only computes the rotation matrix, but it also requires the computation of a translation vector. When both the translation and rotation are actually performed, the algorithm is sometimes called partial Procrustes superimposition (see also orthogonal Procrustes problem). (see also orthogonal Procrustes problem).
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://www.pymolwiki.org/index.php/Kabsch +
, http://www.mathworks.com/matlabcentral/fileexchange/25746-kabsch-algorithm +
, https://docs.scipy.org/doc/scipy/reference/generated/scipy.spatial.transform.Rotation.align_vectors.html +
, http://cnx.org/content/m11608/latest/ +
, https://wiki.pymol.org/index.php/Cealign +
, https://github.com/oleg-alexandrov/projects/blob/master/eigen/Kabsch.cpp +
, https://github.com/charnley/rmsd. +
|
| http://dbpedia.org/ontology/wikiPageID
|
12254238
|
| http://dbpedia.org/ontology/wikiPageLength
|
7991
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1124796194
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/RMSD +
, http://dbpedia.org/resource/Molecular_dynamics +
, http://dbpedia.org/resource/Design_matrix +
, http://dbpedia.org/resource/Matlab +
, http://dbpedia.org/resource/Procrustes_superimposition +
, http://dbpedia.org/resource/Quaternion +
, http://dbpedia.org/resource/Root_mean_square +
, http://dbpedia.org/resource/Matrix_%28mathematics%29 +
, http://dbpedia.org/resource/PyMol +
, http://dbpedia.org/resource/Python_%28programming_language%29 +
, http://dbpedia.org/resource/Visual_Molecular_Dynamics +
, http://dbpedia.org/resource/Cross-covariance +
, http://dbpedia.org/resource/Rotation_matrix +
, http://dbpedia.org/resource/Singular_value_decomposition +
, http://dbpedia.org/resource/Coordinate_system +
, http://dbpedia.org/resource/Orthogonal_Procrustes_problem +
, http://dbpedia.org/resource/Wolfgang_Kabsch +
, http://dbpedia.org/resource/Centroid +
, http://dbpedia.org/resource/Cheminformatics +
, http://dbpedia.org/resource/Wahba%27s_problem +
, http://dbpedia.org/resource/Eigen_%28C%2B%2B_library%29 +
, http://dbpedia.org/resource/Category:Bioinformatics_algorithms +
, http://dbpedia.org/resource/Bioinformatics +
, http://dbpedia.org/resource/Root-mean-square_deviation_%28bioinformatics%29 +
, http://dbpedia.org/resource/FoldX +
, http://dbpedia.org/resource/Protein +
, http://dbpedia.org/resource/Cross-entropy_method +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Mvar +
, http://dbpedia.org/resource/Template:Math +
, http://dbpedia.org/resource/Template:Cite_conference +
, http://dbpedia.org/resource/Template:Cite_journal +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Bioinformatics_algorithms +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Method +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Kabsch_algorithm?oldid=1124796194&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Kabsch_algorithm +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q6344361 +
, http://yago-knowledge.org/resource/Kabsch_algorithm +
, http://rdf.freebase.com/ns/m.02vxsk5 +
, https://global.dbpedia.org/id/4pKwm +
, http://dbpedia.org/resource/Kabsch_algorithm +
|
| rdf:type |
http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/Act100030358 +
, http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity +
, http://dbpedia.org/class/yago/Procedure101023820 +
, http://dbpedia.org/class/yago/Algorithm105847438 +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/Rule105846932 +
, http://dbpedia.org/class/yago/Activity100407535 +
, http://dbpedia.org/class/yago/Event100029378 +
, http://dbpedia.org/ontology/Software +
, http://dbpedia.org/class/yago/WikicatBioinformaticsAlgorithms +
|
| rdfs:comment |
The Kabsch algorithm, named after , is a m … The Kabsch algorithm, named after , is a method for calculating the optimal rotation matrix that minimizes the RMSD (root mean squared deviation) between two paired sets of points. It is useful in graphics, cheminformatics to compare molecular structures, and also bioinformatics for comparing protein structures (in particular, see root-mean-square deviation (bioinformatics)).t-mean-square deviation (bioinformatics)).
|
| rdfs:label |
Kabsch algorithm
|
