From 4fc17d62176b3a7a53970b3f3050244c52f2a5db Mon Sep 17 00:00:00 2001 From: Anton Oresten Date: Thu, 7 Nov 2024 12:40:39 +0100 Subject: [PATCH] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index b57e153..45ee222 100644 --- a/README.md +++ b/README.md @@ -39,4 +39,4 @@ The output is vectors of integers: ## Acknowledgements -This package was originally ported from the [PyDSSP](https://github.com/ShintaroMinami/PyDSSP) package, created by Shintaro Minami. The code has since been rewritten to look more like the 1983 paper (Kabsch W and Sander C), and to be more Julian, understandable, and efficient, at the cost of it no longer being differentiable like the PyDSSP version. The time complexity is still quadratic, so it may be slow for larger proteins. We plan on making a more efficient version with k-d trees. +This package was originally ported from the [PyDSSP](https://github.com/ShintaroMinami/PyDSSP) package, created by Shintaro Minami. The code has since been rewritten to look more like the 1983 paper (Kabsch W and Sander C), and to be more Julian, understandable, and efficient, at the cost of it no longer being differentiable like the PyDSSP version. The time complexity of assigning the secondary structure of a chain with $n$ residues is $O(n \log n)$.