2017
DOI: 10.1021/acs.jpcb.7b04724
|View full text |Cite
|
Sign up to set email alerts
|

All-Atom MD Predicts Magnesium-Induced Hairpin in Chemically Perturbed RNA Analog of F10 Therapeutic

Abstract: Given their increasingly frequent usage, understanding the chemical and structural properties which allow therapeutic nucleic acids to promote the death of cancer cells is critical for medical advancement. One molecule of interest is a 10-mer of FdUMP (5-fluoro-2′-deoxyuridine-5′-O-monophosphate) also called F10. To investigate causes of structural stability, we have computationally restored the 2′ oxygen on each ribose sugar of the phosphodiester backbone, creating FUMP[10]. Microsecond time-scale, all-atom, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 82 publications
(161 reference statements)
0
8
0
Order By: Relevance
“…On a careful analysis of 31 scientific works (Supporting Information, Scheme S1) claiming to use QT to retrieve clusters from MD trajectories, we identify two common pitfalls (labeled as P1 and P2) that appear in the current literature. In the first group of works (P1), the authors explicitly describe the algorithm they were using as if it were QT, citing the original paper of Heyer et al Only two of them correctly described the algorithm as Daura’s clustering but still cited the incorrect reference, Heyer et al In the second group of works (P2), the authors do not thoroughly describe the algorithm used but do affirm performing QT when actually they performed Daura’s clustering.…”
Section: Resultsmentioning
confidence: 99%
“…On a careful analysis of 31 scientific works (Supporting Information, Scheme S1) claiming to use QT to retrieve clusters from MD trajectories, we identify two common pitfalls (labeled as P1 and P2) that appear in the current literature. In the first group of works (P1), the authors explicitly describe the algorithm they were using as if it were QT, citing the original paper of Heyer et al Only two of them correctly described the algorithm as Daura’s clustering but still cited the incorrect reference, Heyer et al In the second group of works (P2), the authors do not thoroughly describe the algorithm used but do affirm performing QT when actually they performed Daura’s clustering.…”
Section: Resultsmentioning
confidence: 99%
“…55 This matrix indicates how pairs of residues move in relation to each other, a critical aspect in understanding allosteric communication pathways in proteins and protein complexes. 22,23,26,[31][32][33][34][36][37][38]55 i j…”
Section: ■ Materials and Methodsmentioning
confidence: 99%
“…These simulations were executed using the GPU-accelerated ACEMD3 simulation package on NVIDIA Titan GPUs housed within Metrocubo workstations. The simulation protocols described below are standard with ACEMD and have been successfully used in previous works on thrombin and other systems. , …”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…In the case of a relatively unstructured [40] nucleic acid strand in two physiological solvation conditions, we see growth into the equal-time correlation on a time scale of nanoseconds [Figs. 2(a), 2(b), 4(a), 4(b), 5(a), 5(b), 6(a), and 6(b) of the Supplemental Material] indicating this would be a system in which many short simulations would be appropriate.…”
Section: Examplesmentioning
confidence: 99%