Search PubMed⌕ Search

PubMed · 12691990

Client-server environment for high-performance gene expression data analysis.

Abstract

SUMMARY: We have developed a platform independent, flexible and scalable Java environment for high-performance large-scale gene expression data analysis, which integrates various computational intensive hierarchical and non-hierarchical clustering algorithms. The environment includes a powerful client for data preparation and results visualization, an application server for computation and an additional administration tool. The package is available free of charge for academic and non-profit institutions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander Sturn, Bernhard Mlecnik, Roland Pieler, Johannes Rainer, Thomas Truskaller, Zlatko Trajanoski. 2003-04-12. Client-server environment for high-performance gene expression data analysis.. https://doi.org/10.1093/bioinformatics%2Fbtg074

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

pp-Blast: a "pseudo-parallel" Blast.

We have developed a software called pp-Blast that uses the publicly available Blast package and PVM (parallel virtual machine) to partition a multi-sequence query across a set of nodes with replicated or shared databases. Benchmark tests show that pp-Blast running in a cluster of 14 PCs outperformed conventional Blast running in large servers. In addition, using pp-Blast and the cluster we were able to map all human cDNAs onto the draft of the human genome in less than 6 days. We propose here that the cost/benefit ratio of pp-Blast makes it appropriate for large-scale sequence analysis. The source code and configuration files for pp-Blast are available at http://www.ludwig.org.br/biocomp/tools/pp-blast.

Computing Methodologies↗

Concept-match medical data scrubbing. How pathology text can be used in research.

CONTEXT: In the normal course of activity, pathologists create and archive immense data sets of scientifically valuable information. Researchers need pathology-based data sets, annotated with clinical information and linked to archived tissues, to discover and validate new diagnostic tests and therapies. Pathology records can be used for research purposes (without obtaining informed patient consent for each use of each record), provided the data are rendered harmless. Large data sets can be made harmless through 3 computational steps: (1) deidentification, the removal or modification of data fields that can be used to identify a patient (name, social security number, etc); (2) rendering the data ambiguous, ensuring that every data record in a public data set has a nonunique set of characterizing data; and (3) data scrubbing, the removal or transformation of words in free text that can be used to identify persons or that contain information that is incriminating or otherwise private. This article addresses the problem of data scrubbing. OBJECTIVE: To design and implement a general algorithm that scrubs pathology free text, removing all identifying or private information. METHODS: The Concept-Match algorithm steps through confidential text. When a medical term matching a standard nomenclature term is encountered, the term is replaced by a nomenclature code and a synonym for the original term. When a high-frequency "stop" word, such as a, an, the, or for, is encountered, it is left in place. When any other word is encountered, it is blocked and replaced by asterisks. This produces a scrubbed text. An open-source implementation of the algorithm is freely available. RESULTS: The Concept-Match scrub method transformed pathology free text into scrubbed output that preserved the sense of the original sentences, while it blocked terms that did not match terms found in the Unified Medical Language System (UMLS). The scrubbed product is safe, in the restricted sense that the output retains only standard medical terms. The software implementation scrubbed more than half a million surgical pathology report phrases in less than an hour. CONCLUSIONS: Computerized scrubbing can render the textual portion of a pathology report harmless for research purposes. Scrubbing and deidentification methods allow pathologists to create and use large pathology databases to conduct medical research.

Computing Methodologies↗

Suitability of molecular descriptors for database mining. A comparative analysis.

Database mining methods rely on the molecular descriptors used to characterize a structural database. In the present investigation, five different types of descriptors (log P, UNITY fingerprints, ISIS keys, VolSurf, and GRIND) are applied to characterize various databases (n = 1007, 100, and 229) comprising drugs almost exclusively. The validity of the descriptors is comparatively analyzed via principal component analysis and its hierarchical variant, consensus principal component analysis. Both pharmacodynamic and pharmacokinetic aspects of database mining are treated. For pharmacodynamic aspects, clustering behavior achieved with the different descriptors is tested on the chemically homogeneous beta-blockers, benzodiazepines, and penicillins and on the chemically more diverse class I antiarrhythmics. The following ranking is observed: UNITY fingerprints > ISIS keys and GRIND > VolSurf > log P. Regarding information content, the CPCA superweight plot indicates similarity between fingerprints and ISIS keys as well as between VolSurf and log P, while GRIND differs from all the remaining descriptors. Solubility data and blood/brain barrier penetrating behavior serve as test cases for pharmacokinetic aspects. Comparison of the descriptors applied to these data reveals that VolSurf has the most realistic and consistent behavior, GRIND shows intermediate behavior, while UNITY fingerprints and ISIS keys are not well suited for pharmacokinetic profiling. From this comparative analysis, we conclude that VolSurf descriptors exhibit particular advantages in treating pharmacokinetic aspects; UNITY fingerprints, ISIS keys, and GRIND descriptors are of special value for tackling pharmacodynamic aspects of database mining. The parameter log P is of limited applicability in database mining because of rather poor reliability and lack of completeness of data.

Computing Methodologies↗