Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics 2020
DOI: 10.1145/3388440.3414705
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Exploration of Protein Conformational Pathways using RRT* and MC

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
18
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1
1

Relationship

3
2

Authors

Journals

citations
Cited by 6 publications
(20 citation statements)
references
References 23 publications
0
18
0
Order By: Relevance
“…The Rapidly Exploring Random Tree (RRT) algorithm [27] is a robotics-based 90 method that builds a tree rooted at the start configuration by randomly exploring 91 the search space. The algorithm was presented in our previous work, extended by this 92 journal submission [28]. The algorithm is outlined here for clarity.…”
Section: Rrt Rrt* and Adaptive Sampling 89mentioning
confidence: 99%
See 4 more Smart Citations
“…The Rapidly Exploring Random Tree (RRT) algorithm [27] is a robotics-based 90 method that builds a tree rooted at the start configuration by randomly exploring 91 the search space. The algorithm was presented in our previous work, extended by this 92 journal submission [28]. The algorithm is outlined here for clarity.…”
Section: Rrt Rrt* and Adaptive Sampling 89mentioning
confidence: 99%
“…This step makes the path smoother and less jagged looking. three key methods, nearNeighbors, chooseParent, and rewire [28]. The nearNeighbors 158 method will look for a set of nearest neighbors that lie within an RMSD of at most 1Å This contribution is an extension of our conference paper described in [28].…”
mentioning
confidence: 99%
See 3 more Smart Citations