Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Mathematical algorithm for discovering states of expression from direct genetic comparison by microarrays.

ABSTRACT: Highly specific direct genome-scale expression discovery from two biological samples facilitates functional discovery of molecular systems. Here, expression data from cDNA arrays are ranked and curve-fitted. The algorithm uses filters based on the derivatives (slopes) of the curve fits. The rules are set to (i) filter the largest number of artifactual ratios from same-to-same datasets and (ii) maximize discovery from direct comparisons of different samples. The unsupervised discovery is optimized without lowering specificity. The false discovery rates are significantly lower than other methods. The discovered states of genetic expression facilitate functional discovery and are validated by real-time RT-PCR. Better quality improves sensitivity.

SUBMITTER: Fathallah-Shaykh HM

PROVIDER: S-EPMC506804 | biostudies-other | 2004

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Publications

Mathematical algorithm for discovering states of expression from direct genetic comparison by microarrays.

Fathallah-Shaykh Hassan M HM He Bin B Zhao Li-Juan LJ Badruddin Aamir A

Nucleic acids research 20040720 13

Highly specific direct genome-scale expression discovery from two biological samples facilitates functional discovery of molecular systems. Here, expression data from cDNA arrays are ranked and curve-fitted. The algorithm uses filters based on the derivatives (slopes) of the curve fits. The rules are set to (i) filter the largest number of artifactual ratios from same-to-same datasets and (ii) maximize discovery from direct comparisons of different samples. The unsupervised discovery is optimize ...[more]

PMID: 15266007

Similar Datasets

Discovering ligands for a microRNA precursor with peptoid microarrays.

Project description:We have screened peptoid microarrays to identify specific ligands for the RNA hairpin precursor of miR-21, a microRNA involved in cancer and heart disease. Microarrays were printed by spotting a library of 7680 N-substituted oligoglycines (peptoids) onto glass slides. Two compounds on the array specifically bind RNA having the sequence and predicted secondary structure of the miR-21 precursor hairpin and have specific affinity for the target in solution. Their binding induces a conformational change around the hairpin loop, and the most specific compound recognizes the loop sequence and a bulged uridine in the proximal duplex. Functional groups contributing affinity and specificity were identified, and by varying a critical methylpyridine group, a compound with a dissociation constant of 1.9 microM for the miR-21 precursor hairpin and a 20-fold discrimination against a closely-related hairpin was created. This work describes a systematic approach to discovery of ligands for specific pre-defined novel RNA structures. It demonstrates discovery of new ligands for an RNA for which no specific lead compounds were previously known by screening a microarray of small molecules.

| S-EPMC2760809 | biostudies-other

Mathematical design of prokaryotic clone-based microarrays.

Project description:BackgroundClone-based microarrays, on which each spot represents a random genomic fragment, are a good alternative to open reading frame-based microarrays, especially for microorganisms for which the complete genome sequence is not available. Since the generation of a genomic DNA library is a random process, it is beforehand uncertain which genes are represented. Nevertheless, the genome coverage of such an array, which depends on different variables like the insert size and the number of clones in the library, can be predicted by mathematical approaches. When applying the classical formulas that determine the probability that a certain sequence is represented in a DNA library at the nucleotide level, massive amounts of clones would be necessary to obtain a proper coverage of the genome.ResultsThis paper describes the development of two complementary equations for determining the genome coverage at the gene level. The first equation predicts the fraction of genes that is represented on the array in a detectable way and cover at least a set part (the minimal insert coverage) of the genomic fragment by which these genes are represented. The higher this minimal insert coverage, the larger the chance that changes in expression of a specific gene can be detected and attributed to that gene. The second equation predicts the fraction of genes that is represented in spots on the array that only represent genes from a single transcription unit, which information can be interpreted in a quantitative way.ConclusionValidation of these equations shows that they form reliable tools supporting optimal design of prokaryotic clone-based microarrays.

| S-EPMC1262695 | biostudies-literature

A probabilistic coevolutionary biclustering algorithm for discovering coherent patterns in gene expression dataset.

Project description:BackgroundBiclustering has been utilized to find functionally important patterns in biological problem. Here a bicluster is a submatrix that consists of a subset of rows and a subset of columns in a matrix, and contains homogeneous patterns. The problem of finding biclusters is still challengeable due to computational complex trying to capture patterns from two-dimensional features.ResultsWe propose a Probabilistic COevolutionary Biclustering Algorithm (PCOBA) that can cluster the rows and columns in a matrix simultaneously by utilizing a dynamic adaptation of multiple species and adopting probabilistic learning. In biclustering problems, a coevolutionary search is suitable since it can optimize interdependent subcomponents formed of rows and columns. Furthermore, acquiring statistical information on two populations using probabilistic learning can improve the ability of search towards the optimum value. We evaluated the performance of PCOBA on synthetic dataset and yeast expression profiles. The results demonstrated that PCOBA outperformed previous evolutionary computation methods as well as other biclustering methods.ConclusionsOur approach for searching particular biological patterns could be valuable for systematically understanding functional relationships between genes and other biological components at a genome-wide level.

| S-EPMC3521386 | biostudies-literature

An improved algorithm for the detection of genomic variation using short oligonucleotide expression microarrays.

Project description:High-throughput microarray experiments often generate far more biological information than is required to test the experimental hypotheses. Many microarray analyses are considered finished after differential expression and additional analyses are typically not performed, leaving untapped biological information left undiscovered. This is especially true if the microarray experiment is from an ecological study of multiple populations. Comparisons across populations may also contain important genomic polymorphisms, and a subset of these polymorphisms may be identified with microarrays using techniques for the detection of single feature polymorphisms (SFP). SFPs are differences in microarray probe level intensities caused by genetic polymorphisms such as single-nucleotide polymorphisms and small insertions/deletions and not expression differences. In this study, we provide a new algorithm for the detection of SFPs, evaluate the algorithm using existing data from two publicly available Affymetrix Barley (Hordeum vulgare) microarray data sets and compare them to two previously published SFP detection algorithms. Results show that our algorithm provides more consistent and sensitive calling of SFPs with a lower false discovery rate. Simultaneous analysis of SFPs and differential expression is a low-cost method for the enhanced analysis of microarray data, enabling additional biological inferences to be made.

| S-EPMC3470765 | biostudies-literature

Direct calibration of PICKY-designed microarrays.

Project description:BackgroundFew microarrays have been quantitatively calibrated to identify optimal hybridization conditions because it is difficult to precisely determine the hybridization characteristics of a microarray using biologically variable cDNA samples.ResultsUsing synthesized samples with known concentrations of specific oligonucleotides, a series of microarray experiments was conducted to evaluate microarrays designed by PICKY, an oligo microarray design software tool, and to test a direct microarray calibration method based on the PICKY-predicted, thermodynamically closest nontarget information. The complete set of microarray experiment results is archived in the GEO database with series accession number GSE14717. Additional data files and Perl programs described in this paper can be obtained from the website http://www.complex.iastate.edu under the PICKY Download area.ConclusionPICKY-designed microarray probes are highly reliable over a wide range of hybridization temperatures and sample concentrations. The microarray calibration method reported here allows researchers to experimentally optimize their hybridization conditions. Because this method is straightforward, uses existing microarrays and relatively inexpensive synthesized samples, it can be used by any lab that uses microarrays designed by PICKY. In addition, other microarrays can be reanalyzed by PICKY to obtain the thermodynamically closest nontarget information for calibration.

| S-EPMC2773793 | biostudies-literature

Chipper: discovering transcription-factor targets from chromatin immunoprecipitation microarrays using variance stabilization.

Project description:Chromatin immunoprecipitation combined with microarray technology (Chip2) allows genome-wide determination of protein-DNA binding sites. The current standard method for analyzing Chip2 data requires additional control experiments that are subject to systematic error. We developed methods to assess significance using variance stabilization, learning error-model parameters without external control experiments. The method was validated experimentally, shows greater sensitivity than the current standard method, and incorporates false-discovery rate analysis. The corresponding software ('Chipper') is freely available. The method described here should help reveal an organism's transcription-regulatory 'wiring diagram'.

| S-EPMC1297652 | biostudies-literature

Comparison of small n statistical tests of differential expression applied to microarrays.

Project description:BackgroundDNA microarrays provide data for genome wide patterns of expression between observation classes. Microarray studies often have small samples sizes, however, due to cost constraints or specimen availability. This can lead to poor random error estimates and inaccurate statistical tests of differential expression. We compare the performance of the standard t-test, fold change, and four small n statistical test methods designed to circumvent these problems. We report results of various normalization methods for empirical microarray data and of various random error models for simulated data.ResultsThree Empirical Bayes methods (CyberT, BRB, and limma t-statistics) were the most effective statistical tests across simulated and both 2-colour cDNA and Affymetrix experimental data. The CyberT regularized t-statistic in particular was able to maintain expected false positive rates with simulated data showing high variances at low gene intensities, although at the cost of low true positive rates. The Local Pooled Error (LPE) test introduced a bias that lowered false positive rates below theoretically expected values and had lower power relative to the top performers. The standard two-sample t-test and fold change were also found to be sub-optimal for detecting differentially expressed genes. The generalized log transformation was shown to be beneficial in improving results with certain data sets, in particular high variance cDNA data.ConclusionPre-processing of data influences performance and the proper combination of pre-processing and statistical testing is necessary for obtaining the best results. All three Empirical Bayes methods assessed in our study are good choices for statistical tests for small n microarray studies for both Affymetrix and cDNA data. Choice of method for a particular study will depend on software and normalization preferences.

| S-EPMC2674054 | biostudies-literature

Discovering themes in biomedical literature using a projection-based algorithm.

Project description:BackgroundThe need to organize any large document collection in a manner that facilitates human comprehension has become crucial with the increasing volume of information available. Two common approaches to provide a broad overview of the information space are document clustering and topic modeling. Clustering aims to group documents or terms into meaningful clusters. Topic modeling, on the other hand, focuses on finding coherent keywords for describing topics appearing in a set of documents. In addition, there have been efforts for clustering documents and finding keywords simultaneously.ResultsWe present an algorithm to analyze document collections that is based on a notion of a theme, defined as a dual representation based on a set of documents and key terms. In this work, a novel vector space mechanism is proposed for computing themes. Starting with a single document, the theme algorithm treats terms and documents as explicit components, and iteratively uses each representation to refine the other until the theme is detected. The method heavily relies on an optimization routine that we refer to as the projection algorithm which, under specific conditions, is guaranteed to converge to the first singular vector of a data matrix. We apply our algorithm to a collection of about sixty thousand PubMed Ⓡ documents examining the subject of Single Nucleotide Polymorphism, evaluate the results and show the effectiveness and scalability of the proposed method.ConclusionsThis study presents a contribution on theoretical and algorithmic levels, as well as demonstrates the feasibility of the method for large scale applications. The evaluation of our system on benchmark datasets demonstrates that our method compares favorably with the current state-of-the-art methods in computing clusters of documents with coherent topic terms.

| S-EPMC6048865 | biostudies-literature

Measuring differential gene expression by short read sequencing: quantitative comparison to 2-channel gene expression microarrays.

Project description:High-throughput cDNA synthesis and sequencing of poly(A)-enriched RNA is rapidly emerging as a technology competing to replace microarrays as a quantitative platform for measuring gene expression.Consequently, we compared full length cDNA sequencing to 2-channel gene expression microarrays in the context of measuring differential gene expression. Because of its comparable cost to a gene expression microarray, our study focused on the data obtainable from a single lane of an Illumina 1 G sequencer. We compared sequencing data to a highly replicated microarray experiment profiling two divergent strains of S. cerevisiae.Using a large number of quantitative PCR (qPCR) assays, more than previous studies, we found that neither technology is decisively better at measuring differential gene expression. Further, we report sequencing results from a diploid hybrid of two strains of S. cerevisiae that indicate full length cDNA sequencing can discover heterozygosity and measure quantitative allele-specific expression simultaneously.

| S-EPMC2686739 | biostudies-literature

VIPR: A probabilistic algorithm for analysis of microbial detection microarrays

Project description:The development of rapid and sensitive assays capable of detecting a wide range of infectious agents is critical for the effective diagnosis of diseases that have multiple etiologies. In recent years, many microarray-based diagnostics have been developed to identify viruses present in clinical specimens in a highly parallel fashion. Unfortunately, the rate of development of algorithms to interpret data generated from such platforms has not been commensurate. In particular, none of the existing interpretive algorithms is capable of utilizing empirical training data in a Bayesian framework. We have developed an interpretive algorithm, VIPR (Viral Identification using a PRobabilistic algorithm), to capitalize on our ability to generate positive control data for analysis of microbial diagnostic arrays. To illustrate this approach, we have focused on the analysis of viruses that cause hemorrhagic fever (HF). To assess the efficacy of VIPR, we hybridized 33 viruses to 100 microarrays and applied our algorithm to this dataset. A microarray composed of nearly 15,000 oligonucleotides was designed using a custom viral taxonomy-based strategy. The performance of VIPR was assessed by performing a leave-one-out cross validation. VIPR was able to identity the infecting virus with an accuracy of 94%. VIPR outperformed previously described algorithms for the set of HF viruses tested. Bayesian interpretative algorithms such as VIPR should be considered for diagnostic microarray applications.

2011-04-19 | GSE21407 | GEO

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data