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











Base de datos
Intervalo de año de publicación
1.
BMC Struct Biol ; 13: 25, 2013 Oct 21.
Artículo en Inglés | MEDLINE | ID: mdl-24144335

RESUMEN

BACKGROUND: Picking images of particles in cryo-electron micrographs is an important step in solving the 3D structures of large macromolecular assemblies. However, in order to achieve sub-nanometre resolution it is often necessary to capture and process many thousands or even several millions of 2D particle images. Thus, a computational bottleneck in reaching high resolution is the accurate and automatic picking of particles from raw cryo-electron micrographs. RESULTS: We have developed "gEMpicker", a highly parallel correlation-based particle picking tool. To our knowledge, gEMpicker is the first particle picking program to use multiple graphics processor units (GPUs) to accelerate the calculation. When tested on the publicly available keyhole limpet hemocyanin dataset, we find that gEMpicker gives similar results to the FindEM program. However, compared to calculating correlations on one core of a contemporary central processor unit (CPU), running gEMpicker on a modern GPU gives a speed-up of about 27 ×. To achieve even higher processing speeds, the basic correlation calculations are accelerated considerably by using a hierarchy of parallel programming techniques to distribute the calculation over multiple GPUs and CPU cores attached to multiple nodes of a computer cluster. By using a theoretically optimal reduction algorithm to collect and combine the cluster calculation results, the speed of the overall calculation scales almost linearly with the number of cluster nodes available. CONCLUSIONS: The very high picking throughput that is now possible using GPU-powered workstations or computer clusters will help experimentalists to achieve higher resolution 3D reconstructions more rapidly than before.


Asunto(s)
Microscopía por Crioelectrón/métodos , Hemocianinas/química , Procesamiento de Imagen Asistido por Computador/métodos , Programas Informáticos , Algoritmos , Imagenología Tridimensional , Reconocimiento de Normas Patrones Automatizadas
2.
J Struct Biol ; 184(2): 348-54, 2013 Nov.
Artículo en Inglés | MEDLINE | ID: mdl-24060989

RESUMEN

Fitting high resolution protein structures into low resolution cryo-electron microscopy (cryo-EM) density maps is an important technique for modeling the atomic structures of very large macromolecular assemblies. This article presents "gEMfitter", a highly parallel fast Fourier transform (FFT) EM density fitting program which can exploit the special hardware properties of modern graphics processor units (GPUs) to accelerate both the translational and rotational parts of the correlation search. In particular, by using the GPU's special texture memory hardware to rotate 3D voxel grids, the cost of rotating large 3D density maps is almost completely eliminated. Compared to performing 3D correlations on one core of a contemporary central processor unit (CPU), running gEMfitter on a modern GPU gives up to 26-fold speed-up. Furthermore, using our parallel processing framework, this speed-up increases linearly with the number of CPUs or GPUs used. Thus, it is now possible to use routinely more robust but more expensive 3D correlation techniques. When tested on low resolution experimental cryo-EM data for the GroEL-GroES complex, we demonstrate the satisfactory fitting results that may be achieved by using a locally normalised cross-correlation with a Laplacian pre-filter, while still being up to three orders of magnitude faster than the well-known COLORES program.


Asunto(s)
Imagenología Tridimensional , Programas Informáticos , Algoritmos , Chaperonina 60/química , Chaperonina 60/ultraestructura , Microscopía por Crioelectrón , Análisis de Fourier , Modelos Moleculares , Estructura Cuaternaria de Proteína , Rec A Recombinasas/química , Rec A Recombinasas/ultraestructura
3.
IEEE Trans Vis Comput Graph ; 12(5): 1299-306, 2006.
Artículo en Inglés | MEDLINE | ID: mdl-17080865

RESUMEN

We present a cluster-based volume rendering system for roaming very large volumes. This system allows to move a gigabyte-sized probe inside a total volume of several tens or hundreds of gigabytes in real-time. While the size of the probe is limited by the total amount of texture memory on the cluster, the size of the total data set has no theoretical limit. The cluster is used as a distributed graphics processing unit that both aggregates graphics power and graphics memory. A hardware-accelerated volume renderer runs in parallel on the cluster nodes and the final image compositing is implemented using a pipelined sort-last rendering algorithm. Meanwhile, volume bricking and volume paging allow efficient data caching. On each rendering node, a distributed hierarchical cache system implements a global software-based distributed shared memory on the cluster. In case of a cache miss, this system first checks page residency on the other cluster nodes instead of directly accessing local disks. Using two Gigabit Ethernet network interfaces per node, we accelerate data fetching by a factor of 4 compared to directly accessing local disks. The system also implements asynchronous disk access and texture loading, which makes it possible to overlap data loading, volume slicing and rendering for optimal volume roaming.


Asunto(s)
Gráficos por Computador , Sistemas de Administración de Bases de Datos , Bases de Datos Factuales , Interpretación de Imagen Asistida por Computador/instrumentación , Imagenología Tridimensional/instrumentación , Almacenamiento y Recuperación de la Información/métodos , Procesamiento de Señales Asistido por Computador/instrumentación , Metodologías Computacionales , Diseño de Equipo , Análisis de Falla de Equipo , Interpretación de Imagen Asistida por Computador/métodos , Imagenología Tridimensional/métodos , Interfaz Usuario-Computador
4.
J Mol Graph Model ; 23(4): 347-54, 2005 Jan.
Artículo en Inglés | MEDLINE | ID: mdl-15670955

RESUMEN

Protein docking is a fundamental biological process that links two proteins. This link is typically defined by an interaction between two large zones of the protein boundaries. Visualizing such an interface is useful to understand the process thanks to 3D protein structures, to estimate the quality of docking simulation results, and to classify interactions in order to predict docking affinity between classes of interacting zones. Since the interface may be defined by a surface that separates the two proteins, it is possible to create a map of interaction that allows comparisons to be performed in 2D. This paper presents a very fast algorithm that extracts an interface surface and creates a valid and low-distorted interaction map. Another benefit of our approach is that a pre-computed part of the algorithm enables the surface to be updated in real-time while residues are moved.


Asunto(s)
Algoritmos , Biología Computacional , Mapeo de Interacción de Proteínas , Proteínas/química , Programas Informáticos , Modelos Moleculares , Conformación Proteica
SELECCIÓN DE REFERENCIAS
DETALLE DE LA BÚSQUEDA