Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Computing Methodologies”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 505 records · Page 28Linked to original sources
PubMed2005

Parallel statistical image reconstruction for cone-beam x-ray CT on a shared memory computation platform.

Statistical reconstruction methods offer possibilities of improving image quality as compared to analytical methods, but current reconstruction times prohibit routine clinical applications. To reduce reconstruction times we have parallelized a statistical reconstruction algorithm for cone-beam x-ray CT, the ordered subset convex algorithm (OSC), and evaluated it on a shared memory computer. Two different parallelization strategies were developed: one that employs parallelism by computing the work for all projections within a subset in parallel, and one that divides the total volume into parts and processes the work for each sub-volume in parallel. Both methods are used to reconstruct a three-dimensional mathematical phantom on two different grid densities. The reconstructed images are binary identical to the result of the serial (non-parallelized) algorithm. The speed-up factor equals approximately 30 when using 32 to 40 processors, and scales almost linearly with the number of cpus for both methods. The huge reduction in computation time allows us to apply statistical reconstruction to clinically relevant studies for the first time.

Algorithms↗
PubMed2004

SVM based method for predicting HLA-DRB1*0401 binding peptides in an antigen sequence.

Prediction of peptides binding with MHC class II allele HLA-DRB1(*)0401 can effectively reduce the number of experiments required for identifying helper T cell epitopes. This paper describes support vector machine (SVM) based method developed for identifying HLA-DRB1(*)0401 binding peptides in an antigenic sequence. SVM was trained and tested on large and clean data set consisting of 567 binders and equal number of non-binders. The accuracy of the method was 86% when evaluated through 5-fold cross-validation technique.

Algorithms↗
PubMed2002

Computational techniques for solving the bidomain equations in three dimensions.

The bidomain equations are the most complete description of cardiac electrical activity. Their numerical solution is, however, computationally demanding, especially in three dimensions, because of the fine temporal and spatial sampling required. This paper methodically examines computational performance when solving the bidomain equations. Several techniques to speed up this computation are examined in this paper. The first step was to recast the equations into a parabolic part and an elliptic part. The parabolic part was solved by either the finite-element method (FEM) or the interconnected cable model model (ICCM). The elliptic equation was solved by FEM on a coarser grid than the parabolic problem and at a reduced frequency. The performance of iterative and direct linear equation system solvers was analyzed as well as the scalability and parallelizability of each method. Results indicate that the ICCM was twice as fast as the FEM for solving the parabolic problem, but when the total problem was considered, this resulted in only a 20% decrease in computation time. The elliptic problem could be solved on a coarser grid at one-quarter of the frequency at which the parabolic problem was solved and still maintain reasonable accuracy. Direct methods were faster than iterative methods by at least 50% when a good estimate of the extracellular potential was required. Parallelization over four processors was efficient only when the model comprised at least 500,000 nodes. Thus, it was possible to speed up solution of the bidomain equations by an order of magnitude with a slight decrease in accuracy.

Algorithms↗
PubMed2004

High-performance computing service over the internet for intraoperative image processing.

This paper presents a framework for a cluster system that is suited for high-resolution image processing over the Internet during surgery. The system realizes high-performance computing (HPC) assisted surgery, which allows surgeons to utilize HPC resources remote from the operating room. One application available in the system is an intraoperative estimator for the range of motion (ROM) adjustment in total hip replacement (THR) surgery. In order to perform this computation-intensive estimation during surgery, we parallelize the ROM estimator on a cluster of 64 PCs, each with two CPUs. Acceleration techniques such as dynamic load balancing and data compression methods are incorporated into the system. The system also provides a remote-access service over the Internet with a secure execution environment. We applied the system to an actual THR surgery performed at Osaka University Hospital and confirmed that it realizes intraoperative ROM estimation without degrading the resolution of images and limiting the area for estimations.

Arthroplasty, Replacement, Hip↗
PubMed2002

BioDataServer: a SQL-based service for the online integration of life science data.

Regarding molecular biology, we see an exponential growth of data and knowledge. Among others, this fact is reflected in more than 300 molecular databases which are readily available on the Internet. The usage of these data requires integration tools capable of complex information fusion processes. This paper will present a novel concept for user specific integration of life science data. Our approach is based on a mediator architecture in conjunction with freely adjustable data schemes. The implemented prototype is called BioDataServer and can be accessed on the Internet: http://integration.genophen.de. To realize a comfortable usage of the resulted data sets of the integration process, a SQL-based query language and a XML data format were developed and implemented.

Computational Biology↗
PubMed2004

A framework for a distributed, hybrid, multiple-ontology clinical-guideline library, and automated guideline-support tools.

Clinical guidelines are a major tool in improving the quality of medical care. However, most guidelines are in free text, not in a formal, executable format, and are not easily accessible to clinicians at the point of care. We introduce a Web-based, modular, distributed architecture, the Digital Electronic Guideline Library (DeGeL), which facilitates gradual conversion of clinical guidelines from text to a formal representation in chosen target guideline ontology. The architecture supports guideline classification, semantic markup, context-sensitive search, browsing, run-time application, and retrospective quality assessment. The DeGeL hybrid meta-ontology includes elements common to all guideline ontologies, such as semantic classification and domain knowledge; it also includes four content-representation formats: free text, semi-structured text, semi-formal representation, and a formal representation. These formats support increasingly sophisticated computational tasks. The DeGeL tools for support of guideline-based care operate, at some level, on all guideline ontologies. We have demonstrated the feasibility of the architecture and the tools for several guideline ontologies, including Asbru and GEM.

Computer Communication Networks↗
PubMed2004

Multibody dynamic simulation of knee contact mechanics.

Multibody dynamic musculoskeletal models capable of predicting muscle forces and joint contact pressures simultaneously would be valuable for studying clinical issues related to knee joint degeneration and restoration. Current three-dimensional multibody knee models are either quasi-static with deformable contact or dynamic with rigid contact. This study proposes a computationally efficient methodology for combining multibody dynamic simulation methods with a deformable contact knee model. The methodology requires preparation of the articular surface geometry, development of efficient methods to calculate distances between contact surfaces, implementation of an efficient contact solver that accounts for the unique characteristics of human joints, and specification of an application programming interface for integration with any multibody dynamic simulation environment. The current implementation accommodates natural or artificial tibiofemoral joint models, small or large strain contact models, and linear or nonlinear material models. Applications are presented for static analysis (via dynamic simulation) of a natural knee model created from MRI and CT data and dynamic simulation of an artificial knee model produced from manufacturer's CAD data. Small and large strain natural knee static analyses required 1 min of CPU time and predicted similar contact conditions except for peak pressure, which was higher for the large strain model. Linear and nonlinear artificial knee dynamic simulations required 10 min of CPU time and predicted similar contact force and torque but different contact pressures, which were lower for the nonlinear model due to increased contact area. This methodology provides an important step toward the realization of dynamic musculoskeletal models that can predict in vivo knee joint motion and loading simultaneously.

Computer Simulation↗
PubMed2002

HeinzelCluster: accelerated reconstruction for FORE and OSEM3D.

Using iterative three-dimensional (3D) reconstruction techniques for reconstruction of positron emission tomography (PET) is not feasible on most single-processor machines due to the excessive computing time needed, especially so for the large sinogram sizes of our high-resolution research tomograph (HRRT). In our first approach to speed up reconstruction time we transform the 3D scan into the format of a two-dimensional (2D) scan with sinograms that can be reconstructed independently using Fourier rebinning (FORE) and a fast 2D reconstruction method. On our dedicated reconstruction cluster (seven four-processor systems, Intel PIII@700 MHz, switched fast ethernet and Myrinet, Windows NT Server), we process these 2D sinograms in parallel. We have achieved a speedup > 23 using 26 processors and also compared results for different communication methods (RPC, Syngo, Myrinet GM). The other approach is to parallelize OSEM3D (implementation of C Michel), which has produced the best results for HRRT data so far and is more suitable for an adequate treatment of the sinogram gaps that result from the detector geometry of the HRRT. We have implemented two levels of parallelization for four dedicated cluster (a shared memory fine-grain level on each node utilizing all four processors and a coarse-grain level allowing for 15 nodes) reducing the time for one core iteration from over 7 h to about 35 min.

Algorithms↗
PubMed2004

VARAN: a web server for variability analysis of DNA microarray experiments.

UNLABELLED: Here, we describe a tool for VARiability Analysis of DNA microarrays experiments (VARAN), a freely available Web server that performs a signal intensity based analysis of the log2 expression ratio variability deduced from DNA microarray data (one or two channels). Two modules are proposed: VARAN generator to compute a sliding windows analysis of the experimental variability (mean and SD) and VARAN analyzer to compare experimental data with an asymptotic variability model previously built with the generator module from control experiments. Both modules provide normalized intensity signals with five possible methods, log ratio values and a list of genes showing significant variations between conditions. AVAILABILITY: http://www.bionet.espci.fr/varan/ SUPPLEMENTARY INFORMATION: http://www.bionet.espci.fr/varan/help.html

Algorithms↗
PubMed2004

Analysis and prediction of leucine-rich nuclear export signals.

We present a thorough analysis of nuclear export signals and a prediction server, which we have made publicly available. The machine learning prediction method is a significant improvement over the generally used consensus patterns. Nuclear export signals (NESs) are extremely important regulators of the subcellular location of proteins. This regulation has an impact on transcription and other nuclear processes, which are fundamental to the viability of the cell. NESs are studied in relation to cancer, the cell cycle, cell differentiation and other important aspects of molecular biology. Our conclusion from this analysis is that the most important properties of NESs are accessibility and flexibility allowing relevant proteins to interact with the signal. Furthermore, we show that not only the known hydrophobic residues are important in defining a nuclear export signals. We employ both neural networks and hidden Markov models in the prediction algorithm and verify the method on the most recently discovered NESs. The NES predictor (NetNES) is made available for general use at http://www.cbs.dtu.dk/.

Active Transport, Cell Nucleus↗
PubMed2004

SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters.

BACKGROUND: Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a useful source of functional and structural information about these sequences. Using software such as the basic local alignment search tool (BLAST) or HMMPFAM to identify statistically significant matches between newly sequenced segments of genetic material and those in databases is an important task for most molecular biologists. Searching algorithms are intrinsically slow and data-intensive, especially in light of the rapid growth of biological sequence databases due to the emergence of high throughput DNA sequencing techniques. Thus, traditional bioinformatics tools are impractical on PCs and even on dedicated UNIX servers. To take advantage of larger databases and more reliable methods, high performance computation becomes necessary. RESULTS: We describe the implementation of SS-Wrapper (Similarity Search Wrapper), a package of wrapper applications that can parallelize similarity search applications on a Linux cluster. Our wrapper utilizes a query segmentation-search (QS-search) approach to parallelize sequence database search applications. It takes into consideration load balancing between each node on the cluster to maximize resource usage. QS-search is designed to wrap many different search tools, such as BLAST and HMMPFAM using the same interface. This implementation does not alter the original program, so newly obtained programs and program updates should be accommodated easily. Benchmark experiments using QS-search to optimize BLAST and HMMPFAM showed that QS-search accelerated the performance of these programs almost linearly in proportion to the number of CPUs used. We have also implemented a wrapper that utilizes a database segmentation approach (DS-BLAST) that provides a complementary solution for BLAST searches when the database is too large to fit into the memory of a single node. CONCLUSIONS: Used together, QS-search and DS-BLAST provide a flexible solution to adapt sequential similarity searching applications in high performance computing environments. Their ease of use and their ability to wrap a variety of database search programs provide an analytical architecture to assist both the seasoned bioinformaticist and the wet-bench biologist.

Algorithms↗
PubMed2004

Exploring protein fold space by secondary structure prediction using data distribution method on Grid platform.

MOTIVATION: Since the newly developed Grid platform has been considered as a powerful tool to share resources in the Internet environment, it is of interest to demonstrate an efficient methodology to process massive biological data on the Grid environments at a low cost. This paper presents an efficient and economical method based on a Grid platform to predict secondary structures of all proteins in a given organism, which normally requires a long computation time through sequential execution, by means of processing a large amount of protein sequence data simultaneously. From the prediction results, a genome scale protein fold space can be pursued. RESULTS: Using the improved Grid platform, the secondary structure prediction on genomic scale and protein topology derived from the new scoring scheme for four different model proteomes was presented. This protein fold space was compared with structures from the Protein Data Bank, database and it showed similarly aligned distribution. Therefore, the fold space approach based on this new scoring scheme could be a guideline for predicting a folding family in a given organism.

Computing Methodologies↗
PubMed2006

Hadamard NMR spectroscopy for two-dimensional quantum information processing and parallel search algorithms.

Hadamard spectroscopy has earlier been used to speed-up multi-dimensional NMR experiments. In this work, we speed-up the two-dimensional quantum computing scheme, by using Hadamard spectroscopy in the indirect dimension, resulting in a scheme which is faster and requires the Fourier transformation only in the direct dimension. Two and three qubit quantum gates are implemented with an extra observer qubit. We also use one-dimensional Hadamard spectroscopy for binary information storage by spatial encoding and implementation of a parallel search algorithm.

Algorithms↗
PubMed2003

Batch mode generation of residue-based diagrams of proteins.

SUMMARY: Residue-based diagrams of proteins are graphical representations that can be used in protein information systems. These diagrams make it possible to visually integrate different types of biological information. The approach has been used successfully for membrane proteins. We developed the Residue-based diagram generator to (i) make it possible to generate residue-based diagrams of proteins in a batch mode that is compatible with the needs of information system curators, (ii) allow the generation of residue-based diagrams for families of soluble proteins or domains. AVAILABILITY: Licensed. Royalty free licenses are granted to non-profit institutions for educational and research purposes. http://icb.mssm.edu/crt/RbDg/index.xml

Amino Acid Sequence↗
PubMedDate not supplied

A multi-nano-dot circuit and structure using thermal-noise-assisted tunneling for stochastic associative processing.

The single-electron circuit and nanostructure described in this paper are designed for stochastic associative processing, which is an expanded version of ordinary associative memory processing. In stochastic associative processing, the association probability of each stored pattern depends on the similarity between the stored pattern and the input pattern. Such unique processing is useful for sequential stochastic association and for clustering for vector quantization. Conventional single-electron circuits operate only at very low temperature for practical junction capacitance (i.e., 30 K for 0.1 aF) because the charging energy in these circuits is directly related to the tunnel junction capacitance. Our multi-nano-dot circuit and structure operate at room temperature with a junction capacitance around 0.1 aF through tunneling processes assisted by thermal noise. We analyze the operation of this circuit in detail and propose for it a stochastic associative processing operation, where the detection timing of the electron position controls the association probability distribution.

Computer Simulation↗