PubMed Health⌕ Search

Biomedical subjects

Michael F Ochs

Publications and source records attributed to Michael F Ochs.

12 recordsLinked to original sources
PubMed2006

Three allele combinations associated with multiple sclerosis.

BACKGROUND: Multiple sclerosis (MS) is an immune-mediated disease of polygenic etiology. Dissection of its genetic background is a complex problem, because of the combinatorial possibilities of gene-gene interactions. As genotyping methods improve throughput, approaches that can explore multigene interactions appropriately should lead to improved understanding of MS. METHODS: 286 unrelated patients with definite MS and 362 unrelated healthy controls of Russian descent were genotyped at polymorphic loci (including SNPs, repeat polymorphisms, and an insertion/deletion) of the DRB1, TNF, LT, TGFbeta1, CCR5 and CTLA4 genes and TNFa and TNFb microsatellites. Each allele carriership in patients and controls was compared by Fisher's exact test, and disease-associated combinations of alleles in the data set were sought using a Bayesian Markov chain Monte Carlo-based method recently developed by our group. RESULTS: We identified two previously unknown MS-associated tri-allelic combinations:-509TGFbeta1*C, DRB1*18(3), CTLA4*G and -238TNF*B1,-308TNF*A2, CTLA4*G, which perfectly separate MS cases from controls, at least in the present sample. The previously described DRB1*15(2) allele, the microsatellite TNFa9 allele and the biallelic combination CCR5Delta32, DRB1*04 were also reidentified as MS-associated. CONCLUSION: These results represent an independent validation of MS association with DRB1*15(2) and TNFa9 in Russians and are the first to find the interplay of three loci in conferring susceptibility to MS. They demonstrate the efficacy of our approach for the identification of complex-disease-associated combinations of alleles.

Adult↗
PubMed2006

LS-NMF: a modified non-negative matrix factorization algorithm utilizing uncertainty estimates.

BACKGROUND: Non-negative matrix factorisation (NMF), a machine learning algorithm, has been applied to the analysis of microarray data. A key feature of NMF is the ability to identify patterns that together explain the data as a linear combination of expression signatures. Microarray data generally includes individual estimates of uncertainty for each gene in each condition, however NMF does not exploit this information. Previous work has shown that such uncertainties can be extremely valuable for pattern recognition. RESULTS: We have created a new algorithm, least squares non-negative matrix factorization, LS-NMF, which integrates uncertainty measurements of gene expression data into NMF updating rules. While the LS-NMF algorithm maintains the advantages of original NMF algorithm, such as easy implementation and a guaranteed locally optimal solution, the performance in terms of linking functionally related genes has been improved. LS-NMF exceeds NMF significantly in terms of identifying functionally related genes as determined from annotations in the MIPS database. CONCLUSION: Uncertainty measurements on gene expression data provide valuable information for data analysis, and use of this information in the LS-NMF algorithm significantly improves the power of the NMF technique.

Algorithms↗
PubMed2006

Determination of strongly overlapping signaling activity from microarray data.

BACKGROUND: As numerous diseases involve errors in signal transduction, modern therapeutics often target proteins involved in cellular signaling. Interpretation of the activity of signaling pathways during disease development or therapeutic intervention would assist in drug development, design of therapy, and target identification. Microarrays provide a global measure of cellular response, however linking these responses to signaling pathways requires an analytic approach tuned to the underlying biology. An ongoing issue in pattern recognition in microarrays has been how to determine the number of patterns (or clusters) to use for data interpretation, and this is a critical issue as measures of statistical significance in gene ontology or pathways rely on proper separation of genes into groups. RESULTS: Here we introduce a method relying on gene annotation coupled to decompositional analysis of global gene expression data that allows us to estimate specific activity on strongly coupled signaling pathways and, in some cases, activity of specific signaling proteins. We demonstrate the technique using the Rosetta yeast deletion mutant data set, decompositional analysis by Bayesian Decomposition, and annotation analysis using ClutrFree. We determined from measurements of gene persistence in patterns across multiple potential dimensionalities that 15 basis vectors provides the correct dimensionality for interpreting the data. Using gene ontology and data on gene regulation in the Saccharomyces Genome Database, we identified the transcriptional signatures of several cellular processes in yeast, including cell wall creation, ribosomal disruption, chemical blocking of protein synthesis, and, critically, individual signatures of the strongly coupled mating and filamentation pathways. CONCLUSION: This works demonstrates that microarray data can provide downstream indicators of pathway activity either through use of gene ontology or transcription factor databases. This can be used to investigate the specificity and success of targeted therapeutics as well as to elucidate signaling activity in normal and disease processes.

Algorithms↗
PubMed2006

Data standards for flow cytometry.

Flow cytometry (FCM) is an analytical tool widely used for cancer and HIV/AIDS research, and treatment, stem cell manipulation and detecting microorganisms in environmental samples. Current data standards do not capture the full scope of FCM experiments and there is a demand for software tools that can assist in the exploration and analysis of large FCM datasets. We are implementing a standardized approach to capturing, analyzing, and disseminating FCM data that will facilitate both more complex analyses and analysis of datasets that could not previously be efficiently studied. Initial work has focused on developing a community-based guideline for recording and reporting the details of FCM experiments. Open source software tools that implement this standard are being created, with an emphasis on facilitating reproducible and extensible data analyses. As well, tools for electronic collaboration will assist the integrated access and comprehension of experiments to empower users to collaborate on FCM analyses. This coordinated, joint development of bioinformatics standards and software tools for FCM data analysis has the potential to greatly facilitate both basic and clinical research--impacting a notably diverse range of medical and environmental research areas.

Cell Separation↗
PubMed2005

WaveRead: automatic measurement of relative gene expression levels from microarrays using wavelet analysis.

Gene expression microarrays monitor the expression levels of thousands of genes in an experiment simultaneously. To utilize the information generated, each of the thousands of spots on a microarray image must be properly quantified, including background correction. Most present methods require manual alignment of grids to the image data, and still often require additional minor adjustments on a spot by spot basis to correct for spotting irregularities. Such intervention is time consuming and also introduces inconsistency in the handling of data. A fully automatic, tested system would increase throughput and reliability in this field. In this paper, we describe WaveRead, a fully automated, standalone, open-source system for quantifying gene expression array images. Through the use of wavelet analysis to identify the spot locations and diameters, the system is able to automatically grid the image and quantify signal intensities and background corrections without any user intervention. The ability of WaveRead to perform proper quantification is demonstrated by analysis of both simulated images containing spots with donut shapes, elliptical shapes, and Gaussian intensity distributions, as well as of standard images from the National Cancer Institute.

Algorithms↗
PubMed2005

A Markov chain Monte Carlo technique for identification of combinations of allelic variants underlying complex diseases in humans.

In recent years, the number of studies focusing on the genetic basis of common disorders with a complex mode of inheritance, in which multiple genes of small effect are involved, has been steadily increasing. An improved methodology to identify the cumulative contribution of several polymorphous genes would accelerate our understanding of their importance in disease susceptibility and our ability to develop new treatments. A critical bottleneck is the inability of standard statistical approaches, developed for relatively modest predictor sets, to achieve power in the face of the enormous growth in our knowledge of genomics. The inability is due to the combinatorial complexity arising in searches for multiple interacting genes. Similar "curse of dimensionality" problems have arisen in other fields, and Bayesian statistical approaches coupled to Markov chain Monte Carlo (MCMC) techniques have led to significant improvements in understanding. We present here an algorithm, APSampler, for the exploration of potential combinations of allelic variations positively or negatively associated with a disease or with a phenotype. The algorithm relies on the rank comparison of phenotype for individuals with and without specific patterns (i.e., combinations of allelic variants) isolated in genetic backgrounds matched for the remaining significant patterns. It constructs a Markov chain to sample only potentially significant variants, minimizing the potential of large data sets to overwhelm the search. We tested APSampler on a simulated data set and on a case-control MS (multiple sclerosis) study for ethnic Russians. For the simulated data, the algorithm identified all the phenotype-associated allele combinations coded into the data and, for the MS data, it replicated the previously known findings.

Algorithms↗
PubMed2005

Bayesian decomposition analysis of bacterial phylogenomic profiles.

BACKGROUND: The past two decades have seen the appearance of new infectious diseases and the reemergence of old diseases previously thought to be under control. At the same time, the effectiveness of the existing antibacterials is rapidly decreasing due to the spread of multidrug-resistant pathogens. AIM: The aim of this study was to the identify candidate molecular targets (e.g. enzymes) within essential metabolic pathways specific to a significant subset of bacterial pathogens as the first step in the rational design of new antibacterial drugs. METHODS: We constructed a dataset of phylogenomic profiles (vectors that encode the similarity, measured by BLAST scores, of a gene across many species) for a series of 31 pathogenic bacteria of interest with 1073 genes taken from the reference organisms Escherichia coli and Mycobacterium tuberculosis. We applied Bayesian Decomposition, a matrix decomposition algorithm, to identify functional metabolic units comprising overlapping sets of genes in this dataset. RESULTS: Although no information on phylogeny was provided to the system, Bayesian Decomposition retrieved the known bacteria phylogenic relationships on the basis of the proteins necessary for survival. In addition, a set of genes required by all bacteria was identified, as well as components and enzymes specific to subsets of bacteria. CONCLUSION: The use of phylogenomic profiles and Bayesian Decomposition provide important insights for the design of new antibacterial therapeutics.

Algorithms↗
PubMed2004

ClutrFree: cluster tree visualization and interpretation.

UNLABELLED: ClutrFree facilitates the visualization and interpretation of clusters or patterns computed from microarray data through a graphical user interface that displays patterns, membership information of the genes and annotation statistics simultaneously. ClutrFree creates a tree linking the patterns based on similarity, permitting the navigation among patterns identified by different algorithms or by the same algorithm with different parameters, and aids the inferring of conclusions from a microarray experiment. AVAILABILITY: The ClutrFree Java source code and compiled bytecode are available as a package under the GNU General Public License at http://bioinformatics.fccc.edu

Algorithms↗
PubMed2004

FGDP: functional genomics data pipeline for automated, multiple microarray data analyses.

UNLABELLED: Gene expression microarrays and oligonucleotide GeneChips have provided biologists with a means of measuring, in a single experiment, the expression levels of entire genomes under a variety of conditions. As with any nascent field, there is no single accepted method for analyzing the new data types, with new methods appearing monthly. Investigators using the new technology must constantly seek access to the latest tools and explore their data in multiple ways. The functional genomics data pipeline provides an integrated, extendable analysis environment permitting multiple, simultaneous analyses to be automatically performed and provides a web server and interface for presenting results. AVAILABILITY: Source code and executables are available under the GNU public license at http://bioinformatics.fccc.edu/

Computing Methodologies↗
PubMed2004

Bayesian decomposition: analyzing microarray data within a biological context.

The detection and correct identification of cancer, especially at an early stage, are vitally important for patient survival and quality of life. Since signaling pathways play critical roles in cancer development and metastasis, methods that reliably assess the activity of these pathways are critical to understand cancer and the response to therapy. Bayesian Decomposition (BD) identifies signatures of expression that can be linked directly to signaling pathway activity, allowing the changes in mRNA levels to be used as downstream indicators of pathway activity. Here, we demonstrate this ability by identifying the downstream expression signal associated with the mating response in Saccharomyces cerevisiae and showing that this signal disappears in deletion mutants of genes critical to the MAPK signaling cascade used to trigger the response. We also show the use of BD in the context of supervised learning, by analyzing the Mus musculus tissue-specific data set provided by Project Normal. The algorithm correctly removes routine metabolic processes, allowing tissue-specific signatures of expression to be identified. Gene ontology is used to interpret these signatures. Since a number of modern therapeutics specifically target signaling proteins, it is important to be able to identify changes in signaling pathways in order to use microarray data to interpret cancer response. By removing routine metabolic signatures and linking specific signatures to signaling pathway activity, BD makes it possible to link changes in microarray results to signaling pathways.

Algorithms↗
PubMed2003

ASAP: automated sequence annotation pipeline for web-based updating of sequence information with a local dynamic database.

The automated sequence annotation pipeline (ASAP) is designed to ease routine investigation of new functional annotations on unknown sequences, such as expressed sequence tags (ESTs), through querying of web-accessible resources and maintenance of a local database. The system allows easy use of the output from one search as the input for a new search, as well as the filtering of results. The database is used to store formats and parameters and information for parsing data from web sites. The database permits easy updating of format information should a site modify the format of a query or of a returned web page.

Database Management Systems↗