|
|
|
|
LEADER |
01000naa a22002652 4500 |
001 |
NLM279785283 |
003 |
DE-627 |
005 |
20231225023820.0 |
007 |
cr uuu---uuuuu |
008 |
231225s2018 xx |||||o 00| ||eng c |
024 |
7 |
|
|a 10.1002/jcc.25132
|2 doi
|
028 |
5 |
2 |
|a pubmed24n0932.xml
|
035 |
|
|
|a (DE-627)NLM279785283
|
035 |
|
|
|a (NLM)29315658
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Nguyen, Minh Khoa
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a ART-RRT
|b As-Rigid-As-Possible exploration of ligand unbinding pathways
|
264 |
|
1 |
|c 2018
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
500 |
|
|
|a Date Completed 09.09.2019
|
500 |
|
|
|a Date Revised 09.09.2019
|
500 |
|
|
|a published: Print-Electronic
|
500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
520 |
|
|
|a © 2018 Wiley Periodicals, Inc.
|
520 |
|
|
|a This article proposes a method to efficiently generate approximate ligand unbinding pathways. It combines an efficient tree-based exploration method with a morphing technique from Computer Graphics for dimensionality reduction. This method is computationally cheap and, unlike many existing approaches, does not require a reaction coordinate to guide the search. It can be used for finding pathways with known or unknown directions beforehand. The approach is evaluated on several benchmarks and the obtained solutions are compared with the results from other state-of-the-art approaches. We show that the method is time-efficient and produces pathways in good agreement with other state-of-the-art solutions. These paths can serve as first approximations that can be used, analyzed, or improved with more specialized methods. © 2018 Wiley Periodicals, Inc
|
650 |
|
4 |
|a Journal Article
|
650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
650 |
|
4 |
|a ART-RRT
|
650 |
|
4 |
|a dimension reduction
|
650 |
|
4 |
|a ligand unbinding pathway
|
650 |
|
4 |
|a morphing
|
650 |
|
4 |
|a motion planning
|
700 |
1 |
|
|a Jaillet, Léonard
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Redon, Stéphane
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t Journal of computational chemistry
|d 1984
|g 39(2018), 11 vom: 30. Apr., Seite 665-678
|w (DE-627)NLM098138448
|x 1096-987X
|7 nnns
|
773 |
1 |
8 |
|g volume:39
|g year:2018
|g number:11
|g day:30
|g month:04
|g pages:665-678
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1002/jcc.25132
|3 Volltext
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 39
|j 2018
|e 11
|b 30
|c 04
|h 665-678
|