Add additional edges in Dijkstra initialization round #23
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Hi Thomas and Mykola,
I would like to propose a small change to the grid search of LabelLib to avoid empty AVs due to the linker getting blocked close to the attachment point on the biomolecule.
In the initialization round of the Dijkstra algorithm, I suggest to search all grid within a radius
linkerDiameterPlusgridSize
(i.e linker width + grid spacing) instead of justessentialNeighbours
(as in all subsequent rounds).This prevents the algorithm from terminating prematurely when no grid points are within the 74 essential neighbors edges (i.e. for residues which are slightly less surface-accessible).
Since the extended neighbor list only affects the very first round of the Dijkstra algorithm, the time cost is negligible.
I believe a somewhat similar adjustment for the initialization round was originally proposed in Kalinin, Nat. Methods. (2012).
Let me know what you think.
Kind regards,
Fabio