Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 3 de 3
Filtrar
Más filtros













Base de datos
Intervalo de año de publicación
1.
Nat Commun ; 13(1): 5884, 2022 10 06.
Artículo en Inglés | MEDLINE | ID: mdl-36202813

RESUMEN

Targeted protein degradation (TPD) is a promising approach in drug discovery for degrading proteins implicated in diseases. A key step in this process is the formation of a ternary complex where a heterobifunctional molecule induces proximity of an E3 ligase to a protein of interest (POI), thus facilitating ubiquitin transfer to the POI. In this work, we characterize 3 steps in the TPD process. (1) We simulate the ternary complex formation of SMARCA2 bromodomain and VHL E3 ligase by combining hydrogen-deuterium exchange mass spectrometry with weighted ensemble molecular dynamics (MD). (2) We characterize the conformational heterogeneity of the ternary complex using Hamiltonian replica exchange simulations and small-angle X-ray scattering. (3) We assess the ubiquitination of the POI in the context of the full Cullin-RING Ligase, confirming experimental ubiquitinomics results. Differences in degradation efficiency can be explained by the proximity of lysine residues on the POI relative to ubiquitin.


Asunto(s)
Proteínas Cullin , Simulación de Dinámica Molecular , Proteínas Cullin/metabolismo , Deuterio , Lisina/metabolismo , Espectrometría de Masas , Proteolisis , Ubiquitina/metabolismo , Ubiquitina-Proteína Ligasas/metabolismo , Ubiquitinación
2.
BMC Bioinformatics ; 18(1): 467, 2017 Nov 03.
Artículo en Inglés | MEDLINE | ID: mdl-29100493

RESUMEN

BACKGROUND: De novo transcriptome assembly is an important technique for understanding gene expression in non-model organisms. Many de novo assemblers using the de Bruijn graph of a set of the RNA sequences rely on in-memory representation of this graph. However, current methods analyse the complete set of read-derived k-mer sequence at once, resulting in the need for computer hardware with large shared memory. RESULTS: We introduce a novel approach that clusters k-mers as the first step. The clusters correspond to small sets of gene products, which can be processed quickly to give candidate transcripts. We implement the clustering step using the MapReduce approach for parallelising the analysis of large datasets, which enables the use of compute clusters. The computational task is distributed across the compute system using the industry-standard MPI protocol, and no specialised hardware is required. Using this approach, we have re-implemented the Inchworm module from the widely used Trinity pipeline, and tested the method in the context of the full Trinity pipeline. Validation tests on a range of real datasets show large reductions in the runtime and per-node memory requirements, when making use of a compute cluster. CONCLUSIONS: Our study shows that MapReduce-based clustering has great potential for distributing challenging sequencing problems, without loss of accuracy. Although we have focussed on the Trinity package, we propose that such clustering is a useful initial step for other assembly pipelines.


Asunto(s)
Algoritmos , Análisis por Conglomerados , Secuenciación de Nucleótidos de Alto Rendimiento , ARN/química , ARN/genética , Análisis de Secuencia de ARN , Transcriptoma
3.
Biophys J ; 112(10): 2030-2037, 2017 May 23.
Artículo en Inglés | MEDLINE | ID: mdl-28538143

RESUMEN

We present OpenRBC, a coarse-grained molecular dynamics code, which is capable of performing an unprecedented in silico experiment-simulating an entire mammal red blood cell lipid bilayer and cytoskeleton as modeled by multiple millions of mesoscopic particles-using a single shared memory commodity workstation. To achieve this, we invented an adaptive spatial-searching algorithm to accelerate the computation of short-range pairwise interactions in an extremely sparse three-dimensional space. The algorithm is based on a Voronoi partitioning of the point cloud of coarse-grained particles, and is continuously updated over the course of the simulation. The algorithm enables the construction of the key spatial searching data structure in our code, i.e., a lattice-free cell list, with a time and space cost linearly proportional to the number of particles in the system. The position and the shape of the cells also adapt automatically to the local density and curvature. The code implements OpenMP parallelization and scales to hundreds of hardware threads. It outperforms a legacy simulator by almost an order of magnitude in time-to-solution and >40 times in problem size, thus providing, to our knowledge, a new platform for probing the biomechanics of red blood cells.


Asunto(s)
Eritrocitos/metabolismo , Simulación de Dinámica Molecular , Programas Informáticos , Algoritmos , Animales , Membrana Celular/metabolismo , Análisis por Conglomerados , Citoesqueleto/metabolismo , Eritrocitos/citología , Modelos Cardiovasculares
SELECCIÓN DE REFERENCIAS
DETALLE DE LA BÚSQUEDA