Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Speed up RMSD comparison #1

Open
Gabriella439 opened this issue Oct 23, 2013 · 1 comment
Open

Speed up RMSD comparison #1

Gabriella439 opened this issue Oct 23, 2013 · 1 comment

Comments

@Gabriella439
Copy link
Owner

This potential performance improvement was brought to my attention by Andrew Gallant. He noted that I could improve the performance of the Kabsch algorithm by replacing it with a more specialized method developed by Liu and Theobald. He provided links to the original implementation and on in Go, too:

http://theobald.brandeis.edu/qcp/

https://github.com/TuftsBCB/structure/blob/master/qc.go

@godotgildor
Copy link
Collaborator

Cool. The code looks pretty easy to implement. The nice thing is that it separates the RMSD and the rotation matrix, so we can do the uber fast RMSD calc, and only if it meets the threshold set by the user then do the more in-depth rotation matrix calculation.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants