Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Oligonucleotide Array Sequence Analysis”

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 1,027 records · Page 57Linked to original sources

A hill-climbing approach for automatic gridding of cDNA microarray images.

Image and statistical analysis are two important stages of cDNA microarrays. Of these, gridding is necessary to accurately identify the location of each spot while extracting spot intensities from the microarray images and automating this procedure permits high-throughput analysis. Due to the deficiencies of the equipment used to print the arrays, rotations, misalignments, high contamination with noise and artifacts, and the enormous amount of data generated, solving the gridding problem by means of an automatic system is not trivial. Existing techniques to solve the automatic grid segmentation problem cover only limited aspects of this challenging problem and require the user to specify the size of the spots, the number of rows and columns in the grid, and boundary conditions. In this paper, a hill-climbing automatic gridding and spot quantification technique is proposed which takes a microarray image (or a subgrid) as input and makes no assumptions about the size of the spots, rows, and columns in the grid. The proposed method is based on a hill-climbing approach that utilizes different objective functions. The method has been found to effectively detect the grids on microarray images drawn from databases from GEO and the Stanford genomic laboratories.

Algorithms↗

Significance of gene ranking for classification of microarray samples.

Many methods for classification and gene selection with microarray data have been developed. These methods usually give a ranking of genes. Evaluating the statistical significance of the gene ranking is important for understanding the results and for further biological investigations, but this question has not been well addressed for machine learning methods in existing works. Here, we address this problem by formulating it in the framework of hypothesis testing and propose a solution based on resampling. The proposed r-test methods convert gene ranking results into position p-values to evaluate the significance of genes. The methods are tested on three real microarray data sets and three simulation data sets with support vector machines as the method of classification and gene selection. The obtained position p-values help to determine the number of genes to be selected and enable scientists to analyze selection results by sophisticated multivariate methods under the same statistical inference paradigm as for simple hypothesis testing methods.

Algorithms↗

An insight-based methodology for evaluating bioinformatics visualizations.

High-throughput experiments, such as gene expression microarrays in the life sciences, result in very large data sets. In response, a wide variety of visualization tools have been created to facilitate data analysis. A primary purpose of these tools is to provide biologically relevant insight into the data. Typically, visualizations are evaluated in controlled studies that measure user performance on predetermined tasks or using heuristics and expert reviews. To evaluate and rank bioinformatics visualizations based on real-world data analysis scenarios, we developed a more relevant evaluation method that focuses on data insight. This paper presents several characteristics of insight that enabled us to recognize and quantify it in open-ended user tests. Using these characteristics, we evaluated five microarray visualization tools on the amount and types of insight they provide and the time it takes to acquire it. The results of the study guide biologists in selecting a visualization tool based on the type of their microarray data, visualization designers on the key role of user interaction techniques, and evaluators on a new approach for evaluating the effectiveness of visualizations for providing insight. Though we used the method to analyze bioinformatics visualizations, it can be applied to other domains.

Algorithms↗

Tight clustering: a resampling-based approach for identifying stable and tight patterns in data.

In this article, we propose a method for clustering that produces tight and stable clusters without forcing all points into clusters. The methodology is general but was initially motivated from cluster analysis of microarray experiments. Most current algorithms aim to assign all genes into clusters. For many biological studies, however, we are mainly interested in identifying the most informative, tight, and stable clusters of sizes, say, 20-60 genes for further investigation. We want to avoid the contamination of tightly regulated expression patterns of biologically relevant genes due to other genes whose expressions are only loosely compatible with these patterns. "Tight clustering" has been developed specifically to address this problem. It applies K-means clustering as an intermediate clustering engine. Early truncation of a hierarchical clustering tree is used to overcome the local minimum problem in K-means clustering. The tightest and most stable clusters are identified in a sequential manner through an analysis of the tendency of genes to be grouped together under repeated resampling. We validated this method in a simulated example and applied it to analyze a set of expression profiles in the study of embryonic stem cells.

Algorithms↗

Differential identification of Bacillus anthracis from environmental Bacillus species using microarray analysis.

AIMS: To determine whether microarray analysis could be employed for the differential identification of a range of environmental Bacillus sp. from four strains of Bacillus anthracis. METHODS AND RESULTS: Oligonucleotide probes were designed that were specific to virulence factor genes of B. anthracis (pag, lef and cap), the variable number tandem repeat region of the B. anthracis vrrA gene and to the 16S-23S rRNA intergenic transcribed spacer region (ITS) and pleiotropic regulator (plcR) regions of the Bacillus cereus subgroup species. Generic probes were also designed to hybridize with conserved regions of the 16S rRNA genes of Bacillus (as a positive control), Neisseria sp., Pseudomonas sp., Streptococcus sp., Mycobacterium sp. and to all members of the Enterobacteriaceae to allow simultaneous detection of these bacteria. Identification of B. anthracis was found to rely entirely on hybridization of DNA specific to regions of the pag, lef and cap genes. Cross-reaction was observed between B. anthracis and other Bacillus species with all the other Bacillus probes tested. Results obtained using microarray hybridizations were confirmed using conventional microbiological techniques and found to have very high comparability. CONCLUSIONS: Microarray-based assays are an effective method for the identification of B. anthracis from mixed-culture environmental samples without problems of false-positivity that have been observed with conventional PCR assays. SIGNIFICANCE AND IMPACT OF THE STUDY: Identification of environmental Bacillus sp. by conventional PCR is prone to potential for reporting false-positives. This study provides a method for the exclusion of such isolates.

Bacillus↗

Evanescent-imaging-ellipsometry-based microarray reader.

We describe the development of a label-less ellipsometric imaging microarray reader. The ability of the ellipsometric microarray reader to measure binding of sample to microarray surface is verified using oligonucleotide complementary DNA (cDNA) microarrays. Polarized light illuminates the microarray surface through a glass substrate at an angle beyond the critical angle and changes in the polarization of totally internally reflected light resulting from binding events on the microarray surface are measured. This polarization change is used to measure the thickness of biomolecules bound to the microarray. A prototype ellipsometric imaging microarray reader is constructed and calibrated, and the performance is evaluated with cDNA microarrays. The microarray reader measures changes in refractive index changes as small as 0.0024 and thickness changes as small as 0.28 nm. The optimization of angle of incidence and substrate refractive index necessary to achieve high sensitivity is also described. This ellipsometric technique offers an attractive alternative to fluorescence-microarray readers in some genomic, proteomic, diagnostic, and sensing applications.

Algorithms↗

Minimum redundancy feature selection from microarray gene expression data.

How to selecting a small subset out of the thousands of genes in microarray data is important for accurate classification of phenotypes. Widely used methods typically rank genes according to their differential expressions among phenotypes and pick the top-ranked genes. We observe that feature sets so obtained have certain redundancy and study methods to minimize it. We propose a minimum redundancy - maximum relevance (MRMR) feature selection framework. Genes selected via MRMR provide a more balanced coverage of the space and capture broader characteristics of phenotypes. They lead to significantly improved class predictions in extensive experiments on 6 gene expression data sets: NCI, Lymphoma, Lung, Child Leukemia, Leukemia, and Colon. Improvements are observed consistently among 4 classification methods: Naive Bayes, Linear discriminant analysis, Logistic regression, and Support vector machines. SUPPLIMENTARY: The top 60 MRMR genes for each of the datasets are listed in http://crd.lbl.gov/~cding/MRMR/. More information related to MRMR methods can be found at http://www.hpeng.net/.

Algorithms↗

Physiological genomics of cardiac disease: quantitative relationships between gene expression and left ventricular hypertrophy.

The pathogenesis of cardiac left ventricular hypertrophy and failure is poorly defined due to the complexity of the disease phenotype. To gain a better understanding of the relationship between gene expression and left ventricular hypertrophy, we employed a quantitative approach to identify genes with expression patterns that correlate in a numerically continuous manner with parameters of cardiac structure and function in a mouse model of left ventricular hypertrophy due to transverse aortic constriction. Several genes showed expression patterns that were significantly correlated (Pearson's correlation coefficient) with measurements of left ventricular weight, left ventricular wall thickness, and diastolic dimension. We validated our findings in two independent data sets and in a small subset of genes by real-time RT-PCR. Of genes with significant correlations to numerically continuous measurements of hypertrophy, we found enrichment for genes encoding extracellular matrix, growth-related and secreted proteins in the directly correlated subset, and for genes encoding mitochondria and metabolic/fatty acid oxidation proteins in the inversely correlated subset. The results of this filtering strategy suggest that this subset of transcripts with quantitative relationships between gene expression and left ventricular hypertrophy represents potentially important pathways that contribute to the progression to heart failure and are thus candidates for follow-up and functional analysis.

Animals↗

Bladder cancer stage and outcome by array-based comparative genomic hybridization.

PURPOSE: Bladder carcinogenesis is believed to follow alternative pathways of disease progression driven by an accumulation of genetic alterations. The purpose of this study was to evaluate associations between measures of genomic instability and bladder cancer clinical phenotype. EXPERIMENTAL DESIGN: Genome-wide copy number profiles were obtained for 98 bladder tumors of diverse stages (29 pT(a), 14 pT1, 55 pT(2-4)) and grades (21 low-grade and 8 high-grade superficial tumors) by array-based comparative genomic hybridization (CGH). Each array contained 2,464 bacterial artificial chromosome and P1 clones, providing an average resolution of 1.5 Mb across the genome. A total of 54 muscle-invasive cases had follow-up information available. Overall outcome analysis was done for patients with muscle-invasive tumors having "good" (alive >2 years) versus "bad" (dead in <2 years) prognosis. RESULTS: Array CGH analysis showed significant increases in copy number alterations and genomic instability with increasing stage and with outcome. The fraction of genome altered (FGA) was significantly different between tumors of different stages (pT(a) versus pT1, P = 0.0003; pT(a) versus pT(2-4), P = 0.02; and pT1 versus pT(2-4), P = 0.03). Individual clones that differed significantly between different tumor stages were identified after adjustment for multiple comparisons (false discovery rate < 0.05). For muscle-invasive tumors, the FGA was associated with patient outcome (bad versus good prognosis patients, P = 0.002) and was identified as the only independent predictor of overall outcome based on a multivariate Cox proportional hazards method. Unsupervised hierarchical clustering separated "good" and "bad" prognosis muscle-invasive tumors into clusters that showed significant association with FGA and survival (Kaplan-Meier, P = 0.019). Supervised tumor classification (prediction analysis for microarrays) had a 71% classification success rate based on 102 unique clones. CONCLUSIONS: Array-based CGH identified quantitative and qualitative differences in DNA copy number alterations at high resolution according to tumor stage and grade. Fraction genome altered was associated with worse outcome in muscle-invasive tumors, independent of other clinicopathologic parameters. Measures of genomic instability add independent power to outcome prediction of bladder tumors.

Chromosome Mapping↗

DNA microarray data and contextual analysis of correlation graphs.

BACKGROUND: DNA microarrays are used to produce large sets of expression measurements from which specific biological information is sought. Their analysis requires efficient and reliable algorithms for dimensional reduction, classification and annotation. RESULTS: We study networks of co-expressed genes obtained from DNA microarray experiments. The mathematical concept of curvature on graphs is used to group genes or samples into clusters to which relevant gene or sample annotations are automatically assigned. Application to publicly available yeast and human lymphoma data demonstrates the reliability of the method in spite of its simplicity, especially with respect to the small number of parameters involved. CONCLUSIONS: We provide a method for automatically determining relevant gene clusters among the many genes monitored with microarrays. The automatic annotations and the graphical interface improve the readability of the data. A C++ implementation, called Trixy, is available from http://tagc.univ-mrs.fr/bioinformatics/trixy.html.

Algorithms↗

A novel Mixture Model Method for identification of differentially expressed genes from DNA microarray data.

BACKGROUND: The main goal in analyzing microarray data is to determine the genes that are differentially expressed across two types of tissue samples or samples obtained under two experimental conditions. Mixture model method (MMM hereafter) is a nonparametric statistical method often used for microarray processing applications, but is known to over-fit the data if the number of replicates is small. In addition, the results of the MMM may not be repeatable when dealing with a small number of replicates. In this paper, we propose a new version of MMM to ensure the repeatability of the results in different runs, and reduce the sensitivity of the results on the parameters. RESULTS: The proposed technique is applied to the two different data sets: Leukaemia data set and a data set that examines the effects of low phosphate diet on regular and Hyp mice. In each study, the proposed algorithm successfully selects genes closely related to the disease state that are verified by biological information. CONCLUSION: The results indicate 100% repeatability in all runs, and exhibit very little sensitivity on the choice of parameters. In addition, the evaluation of the applied method on the Leukaemia data set shows 12% improvement compared to the MMM in detecting the biologically-identified 50 expressed genes by Thomas et al. The results witness to the successful performance of the proposed algorithm in quantitative pathogenesis of diseases and comparative evaluation of treatment methods.

Algorithms↗

Feature selection and classification for microarray data analysis: evolutionary methods for identifying predictive genes.

BACKGROUND: In the clinical context, samples assayed by microarray are often classified by cell line or tumour type and it is of interest to discover a set of genes that can be used as class predictors. The leukemia dataset of Golub et al. 1 and the NCI60 dataset of Ross et al. 2 present multiclass classification problems where three tumour types and nine cell lines respectively must be identified. We apply an evolutionary algorithm to identify the near-optimal set of predictive genes that classify the data. We also examine the initial gene selection step whereby the most informative genes are selected from the genes assayed. RESULTS: In the absence of feature selection, classification accuracy on the training data is typically good, but not replicated on the testing data. Gene selection using the RankGene software 3 is shown to significantly improve performance on the testing data. Further, we show that the choice of feature selection criteria can have a significant effect on accuracy. The evolutionary algorithm is shown to perform stably across the space of possible parameter settings - indicating the robustness of the approach. We assess performance using a low variance estimation technique, and present an analysis of the genes most often selected as predictors. CONCLUSION: The computational methods we have developed perform robustly and accurately, and yield results in accord with clinical knowledge: A Z-score analysis of the genes most frequently selected identifies genes known to discriminate AML and Pre-T ALL leukemia. This study also confirms that significantly different sets of genes are found to be most discriminatory as the sample classes are refined.

Algorithms↗

In silico microdissection of microarray data from heterogeneous cell populations.

BACKGROUND: Very few analytical approaches have been reported to resolve the variability in microarray measurements stemming from sample heterogeneity. For example, tissue samples used in cancer studies are usually contaminated with the surrounding or infiltrating cell types. This heterogeneity in the sample preparation hinders further statistical analysis, significantly so if different samples contain different proportions of these cell types. Thus, sample heterogeneity can result in the identification of differentially expressed genes that may be unrelated to the biological question being studied. Similarly, irrelevant gene combinations can be discovered in the case of gene expression based classification. RESULTS: We propose a computational framework for removing the effects of sample heterogeneity by "microdissecting" microarray data in silico. The computational method provides estimates of the expression values of the pure (non-heterogeneous) cell samples. The inversion of the sample heterogeneity can be facilitated by providing accurate estimates of the mixing percentages of different cell types in each measurement. For those cases where no such information is available, we develop an optimization-based method for joint estimation of the mixing percentages and the expression values of the pure cell samples. We also consider the problem of selecting the correct number of cell types. CONCLUSION: The efficiency of the proposed methods is illustrated by applying them to a carefully controlled cDNA microarray data obtained from heterogeneous samples. The results demonstrate that the methods are capable of reconstructing both the sample and cell type specific expression values from heterogeneous mixtures and that the mixing percentages of different cell types can also be estimated. Furthermore, a general purpose model selection method can be used to select the correct number of cell types.

Algorithms↗

"Harshlighting" small blemishes on microarrays.

BACKGROUND: Microscopists are familiar with many blemishes that fluorescence images can have due to dust and debris, glass flaws, uneven distribution of fluids or surface coatings, etc. Microarray scans show similar artefacts, which affect the analysis, particularly when one tries to detect subtle changes. However, most blemishes are hard to find by the unaided eye, particularly in high-density oligonucleotide arrays (HDONAs). RESULTS: We present a method that harnesses the statistical power provided by having several HDONAs available, which are obtained under similar conditions except for the experimental factor. This method "harshlights" blemishes and renders them evident. We find empirically that about 25% of our chips are blemished, and we analyze the impact of masking them on screening for differentially expressed genes. CONCLUSION: Experiments attempting to assess subtle expression changes should be carefully screened for blemishes on the chips. The proposed method provides investigators with a novel robust approach to improve the sensitivity of microarray analyses. By utilizing topological information to identify and mask blemishes prior to model based analyses, the method prevents artefacts from confounding the process of background correction, normalization, and summarization.

Algorithms↗

An entropy-based gene selection method for cancer classification using microarray data.

BACKGROUND: Accurate diagnosis of cancer subtypes remains a challenging problem. Building classifiers based on gene expression data is a promising approach; yet the selection of non-redundant but relevant genes is difficult. The selected gene set should be small enough to allow diagnosis even in regular clinical laboratories and ideally identify genes involved in cancer-specific regulatory pathways. Here an entropy-based method is proposed that selects genes related to the different cancer classes while at the same time reducing the redundancy among the genes. RESULTS: The present study identifies a subset of features by maximizing the relevance and minimizing the redundancy of the selected genes. A merit called normalized mutual information is employed to measure the relevance and the redundancy of the genes. In order to find a more representative subset of features, an iterative procedure is adopted that incorporates an initial clustering followed by data partitioning and the application of the algorithm to each of the partitions. A leave-one-out approach then selects the most commonly selected genes across all the different runs and the gene selection algorithm is applied again to pare down the list of selected genes until a minimal subset is obtained that gives a satisfactory accuracy of classification. The algorithm was applied to three different data sets and the results obtained were compared to work done by others using the same data sets. CONCLUSION: This study presents an entropy-based iterative algorithm for selecting genes from microarray data that are able to classify various cancer sub-types with high accuracy. In addition, the feature set obtained is very compact, that is, the redundancy between genes is reduced to a large extent. This implies that classifiers can be built with a smaller subset of genes.

Algorithms↗

Ensemble attribute profile clustering: discovering and characterizing groups of genes with similar patterns of biological features.

BACKGROUND: Ensemble attribute profile clustering is a novel, text-based strategy for analyzing a user-defined list of genes and/or proteins. The strategy exploits annotation data present in gene-centered corpora and utilizes ideas from statistical information retrieval to discover and characterize properties shared by subsets of the list. The practical utility of this method is demonstrated by employing it in a retrospective study of two non-overlapping sets of genes defined by a published investigation as markers for normal human breast luminal epithelial cells and myoepithelial cells. RESULTS: Each genetic locus was characterized using a finite set of biological properties and represented as a vector of features indicating attributes associated with the locus (a gene attribute profile). In this study, the vector space models for a pre-defined list of genes were constructed from the Gene Ontology (GO) terms and the Conserved Domain Database (CDD) protein domain terms assigned to the loci by the gene-centered corpus LocusLink. This data set of GO- and CDD-based gene attribute profiles, vectors of binary random variables, was used to estimate multiple finite mixture models and each ensuing model utilized to partition the profiles into clusters. The resultant partitionings were combined using a unanimous voting scheme to produce consensus clusters, sets of profiles that co-occurred consistently in the same cluster. Attributes that were important in defining the genes assigned to a consensus cluster were identified. The clusters and their attributes were inspected to ascertain the GO and CDD terms most associated with subsets of genes and in conjunction with external knowledge such as chromosomal location, used to gain functional insights into human breast biology. The 52 luminal epithelial cell markers and 89 myoepithelial cell markers are disjoint sets of genes. Ensemble attribute profile clustering-based analysis indicated that both lists contained groups of genes with the functional properties of membrane receptor biology/signal transduction and nucleic acid binding/transcription. A subset of the luminal markers was associated with metabolic and oxidoreductase activities, whereas a subset of myoepithelial markers was associated with protein hydrolase activity. CONCLUSION: Given a set of genes and/or proteins associated with a phenomenon, process or system of interest, ensemble attribute profile clustering provides a simple method for collating and sythesizing the annotation data pertaining to them that are present in text-based, gene-centered corpora. The results provide information about properties common and unique to subsets of the list and hence insights into the biology of the problem under investigation.

Algorithms↗

On the statistical assessment of classifiers using DNA microarray data.

BACKGROUND: In this paper we present a method for the statistical assessment of cancer predictors which make use of gene expression profiles. The methodology is applied to a new data set of microarray gene expression data collected in Casa Sollievo della Sofferenza Hospital, Foggia--Italy. The data set is made up of normal (22) and tumor (25) specimens extracted from 25 patients affected by colon cancer. We propose to give answers to some questions which are relevant for the automatic diagnosis of cancer such as: Is the size of the available data set sufficient to build accurate classifiers? What is the statistical significance of the associated error rates? In what ways can accuracy be considered dependant on the adopted classification scheme? How many genes are correlated with the pathology and how many are sufficient for an accurate colon cancer classification? The method we propose answers these questions whilst avoiding the potential pitfalls hidden in the analysis and interpretation of microarray data. RESULTS: We estimate the generalization error, evaluated through the Leave-K-Out Cross Validation error, for three different classification schemes by varying the number of training examples and the number of the genes used. The statistical significance of the error rate is measured by using a permutation test. We provide a statistical analysis in terms of the frequencies of the genes involved in the classification. Using the whole set of genes, we found that the Weighted Voting Algorithm (WVA) classifier learns the distinction between normal and tumor specimens with 25 training examples, providing e = 21% (p = 0.045) as an error rate. This remains constant even when the number of examples increases. Moreover, Regularized Least Squares (RLS) and Support Vector Machines (SVM) classifiers can learn with only 15 training examples, with an error rate of e = 19% (p = 0.035) and e = 18% (p = 0.037) respectively. Moreover, the error rate decreases as the training set size increases, reaching its best performances with 35 training examples. In this case, RLS and SVM have error rates of e = 14% (p = 0.027) and e = 11% (p = 0.019). Concerning the number of genes, we found about 6000 genes (p < 0.05) correlated with the pathology, resulting from the signal-to-noise statistic. Moreover the performances of RLS and SVM classifiers do not change when 74% of genes is used. They progressively reduce up to e = 16% (p < 0.05) when only 2 genes are employed. The biological relevance of a set of genes determined by our statistical analysis and the major roles they play in colorectal tumorigenesis is discussed. CONCLUSIONS: The method proposed provides statistically significant answers to precise questions relevant for the diagnosis and prognosis of cancer. We found that, with as few as 15 examples, it is possible to train statistically significant classifiers for colon cancer diagnosis. As for the definition of the number of genes sufficient for a reliable classification of colon cancer, our results suggest that it depends on the accuracy required.

Aged↗

Analysis with respect to instrumental variables for the exploration of microarray data structures.

BACKGROUND: Evaluating the importance of the different sources of variations is essential in microarray data experiments. Complex experimental designs generally include various factors structuring the data which should be taken into account. The objective of these experiments is the exploration of some given factors while controlling other factors. RESULTS: We present here a family of methods, the analyses with respect to instrumental variables, which can be easily applied to the particular case of microarray data. An illustrative example of analysis with instrumental variables is given in the case of microarray data investigating the effect of beverage intake on peripheral blood gene expression. This approach is compared to an ANOVA-based gene-by-gene statistical method. CONCLUSION: Instrumental variables analyses provide a simple way to control several sources of variation in a multivariate analysis of microarray data. Due to their flexibility, these methods can be associated with a large range of ordination techniques combined with one or several qualitative and/or quantitative descriptive variables.

Algorithms↗