SEARCH · Search PubMed

Results for “Biomarker Profiling”

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.

SourceResearch connectionFrom yearThrough year

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

At least 1,477 records · Page 82Linked to original sources

PubMed2005

New technologies and screening strategies for hepatotoxicity: use of in vitro models.

Hepatotoxicity remains a significant cause for drug failures during clinical trials. This is due, in part, to the idiosyncratic nature of toxicity in humans and inherent physiological differences between humans and preclinical species leading to limited correct prediction of adverse responses in humans. To address this issue, robust screening assays are being developed, which have heightened predictive capacity for human hepatotoxicity, and may be utilized throughout the discovery and development phases in conjunction with traditional in vivo methods, for decision making during drug selection and risk assessment. This manuscript describes an example application of in vitro-based strategies using human hepatocyte cultures in lead optimization screening in conjunction with ADME profiling, for evaluation of compound-associated CYP450 induction potential, and the identification of potentially useful biomarkers as predictors of hepatotoxicity for use in vitro, and in preclinical species and humans.

Animals↗

PubMed2025

Experimental study on the role and biomarker potential of CX3CR1 in osteoarthritis.

BACKGROUND: Osteoarthritis (OA) is a chronic joint disorder marked by progressive degeneration of articular cartilage and the formation of secondary osteophytes. Despite extensive research, the underlying molecular mechanisms remain poorly understood. This study aimed to identify OA-associated genes and elucidate the molecular pathways implicated, with the goal of discovering reliable diagnostic biomarkers. METHODS: The microarray dataset was retrieved from the Gene Expression Omnibus (GEO) and analyzed using R software to identify the signature gene, CX3CR1. Differentially expressed genes (DEGs) correlated with CX3CR1 were subsequently subjected to Gene Ontology (GO), Kyoto Encyclopedia of Genes and Genomes (KEGG), and immune infiltration analyses. A ceRNA regulatory network was also constructed. Vali-dation of CX3CR1 expression was conducted through qRT-PCR, Western blotting, and immunohistochemistry. RESULTS: CX3CR1 emerged as a candidate gene significantly associated with OA, exhibiting regulatory roles primarily in lipid metabolism-related and extra-cellular matrix-related biological processes and signaling cascades. The infiltration levels of immune cells, particularly activated mast cells, appeared to modulate OA progression. Both in vitro and in vivo experiments demonstrated elevated CX3CR1 expression in OA tissues relative to controls, with a robust positive correlation observed between CX3CR1 and MMP13 levels. CONCLUSION: CX3CR1 represents a potential biomarker for OA diagnosis and therapeutic targeting, exerting its effects by modulating lipid metabolism, extracellular matrix dynamics, and immune cell infiltration.

CX3C Chemokine Receptor 1↗

PubMedDate not supplied

The role of proteomics in toxicology: identification of biomarkers of toxicity by protein expression analysis.

Proteomics, i.e. the high throughput separation, display and identification of proteins, has the potential to be a powerful tool in drug development. It could increase the predictability of early drug development and identify non-invasive biomarkers of toxicity or efficacy. This review provides an introduction to modern proteomics, with particular reference to applications in toxicology. A literature search was carried out to identify studies in two broad classes: screening/predictive toxicology, and mechanistic toxicology. The strengths and limitations of current methods and the likely impact of techniques in drug development are also considered. Proteomics can increase the speed and sensitivity of toxicological screening by identifying protein markers of toxicity. Proteomics studies have already provided insights into the mechanisms of action of a wide range of substances, from metals to peroxisome proliferators. Current limitations involving speed of throughput are being overcome by increasing automation and the development of new techniques. The isotope-coded affinity tag (ICAT) method appears particularly promising. The application of proteomics to drug development has given rise to the new field of pharmacoproteomics. New associations between proteins and toxicopathological effects are constantly being identified, and major progress is on the horizon as we move into the post-genomic era.

Animals↗

PubMed2026

The 21-gene recurrence score assay as a tool for predicting recurrence risk and guiding adjuvant treatment selection in early breast cancer.

INTRODUCTION: Estrogen receptor-positive (ER+), HER2-negative breast cancer is the most common breast cancer subtype. While adjuvant endocrine therapy reduces recurrence risk, identifying which patients benefit from the addition of chemotherapy remains a key clinical challenge. The Oncotype DX® 21-gene Recurrence Score assay (Exact Sciences, via Genomic Health, Inc.) was developed to address this by quantifying distant recurrence risk and informing chemotherapy decisions in early-stage ER+/HER2- disease. AREAS COVERED: This diagnostic profile reviews the development, validation, and clinical evidence for Oncotype DX, including findings from the TAILORx and RxPONDER prospective trials and the subsequent development of hybrid tools integrating genomic and clinicopathological data. Alternative multiparameter molecular tests (MammaPrint, Prosigna, EndoPredict, Breast Cancer Index) are summarized and compared. We review international guideline recommendations, decision impact studies, cost-effectiveness evidence, and ongoing trials. EXPERT OPINION: Oncotype DX has strong prognostic evidence and has meaningfully reduced chemotherapy use, though its case as a biomarker predictive of therapeutic effect from chemotherapy rests on trial designs with important limitations. Its independent prognostic contribution beyond comprehensive clinicopathological assessment requires further clarification, and cost-effectiveness varies substantially by indication and healthcare setting.

Humans↗

PubMed2006

Antibody microarrays: current status and key technological advances.

Antibody-based microarrays are among the novel classes of rapidly evolving proteomic technologies that holds great promise in biomedicine. Miniaturized microarrays (< 1 cm2) can be printed with thousands of individual antibodies carrying the desired specificities, and with biological sample (e.g., an entire proteome) added, virtually any specifically bound analytes can be detected. While consuming only minute amounts (< microL scale) of reagents, ultra- sensitive assays (zeptomol range) can readily be performed in a highly multiplexed manner. The microarray patterns generated can then be transformed into proteomic maps, or detailed molecular fingerprints, revealing the composition of the proteome. Thus, protein expression profiling and global proteome analysis using this tool will offer new opportunities for drug target and biomarker discovery, disease diagnostics, and insights into disease biology. Adopting the antibody microarray technology platform, several biomedical applications, ranging from focused assays to proteome-scale analysis will be rapidly emerging in the coming years. This review will discuss the current status of the antibody microarray technology focusing on recent technological advances and key issues in the process of evolving the methodology into a high-performing proteomic research tool.

Animals↗

PubMed2003

An unsupervised hierarchical dynamic self-organizing approach to cancer class discovery and marker gene identification in microarray data.

MOTIVATION: Current Self-Organizing Maps (SOMs) approaches to gene expression pattern clustering require the user to predefine the number of clusters likely to be expected. Hierarchical clustering methods used in this area do not provide unique partitioning of data. We describe an unsupervised dynamic hierarchical self-organizing approach, which suggests an appropriate number of clusters, to perform class discovery and marker gene identification in microarray data. In the process of class discovery, the proposed algorithm identifies corresponding sets of predictor genes that best distinguish one class from other classes. The approach integrates merits of hierarchical clustering with robustness against noise known from self-organizing approaches. RESULTS: The proposed algorithm applied to DNA microarray data sets of two types of cancers has demonstrated its ability to produce the most suitable number of clusters. Further, the corresponding marker genes identified through the unsupervised algorithm also have a strong biological relationship to the specific cancer class. The algorithm tested on leukemia microarray data, which contains three leukemia types, was able to determine three major and one minor cluster. Prediction models built for the four clusters indicate that the prediction strength for the smaller cluster is generally low, therefore labelled as uncertain cluster. Further analysis shows that the uncertain cluster can be subdivided further, and the subdivisions are related to two of the original clusters. Another test performed using colon cancer microarray data has automatically derived two clusters, which is consistent with the number of classes in data (cancerous and normal). AVAILABILITY: JAVA software of dynamic SOM tree algorithm is available upon request for academic use. SUPPLEMENTARY INFORMATION: A comparison of rectangular and hexagonal topologies for GSOM is available from http://www.mame.mu.oz.au/mechatronics/journalinfo/Hsu2003supp.pdf

Algorithms↗

PubMed2004

A statistical method for identifying differential gene-gene co-expression patterns.

MOTIVATION: To understand cancer etiology, it is important to explore molecular changes in cellular processes from normal state to cancerous state. Because genes interact with each other during cellular processes, carcinogenesis related genes may form differential co-expression patterns with other genes in different cell states. In this study, we develop a statistical method for identifying differential gene-gene co-expression patterns in different cell states. RESULTS: For efficient pattern recognition, we extend the traditional F-statistic and obtain an Expected Conditional F-statistic (ECF-statistic), which incorporates statistical information of location and correlation. We also propose a statistical method for data transformation. Our approach is applied to a microarray gene expression dataset for prostate cancer study. For a gene of interest, our method can select other genes that have differential gene-gene co-expression patterns with this gene in different cell states. The 10 most frequently selected genes, include hepsin, GSTP1 and AMACR, which have recently been proposed to be associated with prostate carcinogenesis. However, genes GSTP1 and AMACR cannot be identified by studying differential gene expression alone. By using tumor suppressor genes TP53, PTEN and RB1, we identify seven genes that also include hepsin, GSTP1 and AMACR. We show that genes associated with cancer may have differential gene-gene expression patterns with many other genes in different cell states. By discovering such patterns, we may be able to identify carcinogenesis related genes.

Algorithms↗

PubMed2004

Robust inference of groups in gene expression time-courses using mixtures of HMMs.

MOTIVATION: Genetic regulation of cellular processes is frequently investigated using large-scale gene expression experiments to observe changes in expression over time. This temporal data poses a challenge to classical distance-based clustering methods due to its horizontal dependencies along the time-axis. We propose to use hidden Markov models (HMMs) to explicitly model these time-dependencies. The HMMs are used in a mixture approach that we show to be superior over clustering. Furthermore, mixtures are a more realistic model of the biological reality, as an unambiguous partitioning of genes into clusters of unique functional assignment is impossible. Use of the mixture increases robustness with respect to noise and allows an inference of groups at varying level of assignment ambiguity. A simple approach, partially supervised learning, allows to benefit from prior biological knowledge during the training. Our method allows simultaneous analysis of cyclic and non-cyclic genes and copes well with noise and missing values. RESULTS: We demonstrate biological relevance by detection of phase-specific groupings in HeLa time-course data. A benchmark using simulated data, derived using assumptions independent of those in our method, shows very favorable results compared to the baseline supplied by k-means and two prior approaches implementing model-based clustering. The results stress the benefits of incorporating prior knowledge, whenever available. AVAILABILITY: A software package implementing our method is freely available under the GNU general public license (GPL) at http://ghmm.org/gql

Algorithms↗

PubMed2004

An empirical Bayes approach to inferring large-scale gene association networks.

MOTIVATION: Genetic networks are often described statistically using graphical models (e.g. Bayesian networks). However, inferring the network structure offers a serious challenge in microarray analysis where the sample size is small compared to the number of considered genes. This renders many standard algorithms for graphical models inapplicable, and inferring genetic networks an 'ill-posed' inverse problem. METHODS: We introduce a novel framework for small-sample inference of graphical models from gene expression data. Specifically, we focus on the so-called graphical Gaussian models (GGMs) that are now frequently used to describe gene association networks and to detect conditionally dependent genes. Our new approach is based on (1) improved (regularized) small-sample point estimates of partial correlation, (2) an exact test of edge inclusion with adaptive estimation of the degree of freedom and (3) a heuristic network search based on false discovery rate multiple testing. Steps (2) and (3) correspond to an empirical Bayes estimate of the network topology. RESULTS: Using computer simulations, we investigate the sensitivity (power) and specificity (true negative rate) of the proposed framework to estimate GGMs from microarray data. This shows that it is possible to recover the true network topology with high accuracy even for small-sample datasets. Subsequently, we analyze gene expression data from a breast cancer tumor study and illustrate our approach by inferring a corresponding large-scale gene association network for 3883 genes.

Algorithms↗

PubMed2004

Classification using partial least squares with penalized logistic regression.

MOTIVATION: One important aspect of data-mining of microarray data is to discover the molecular variation among cancers. In microarray studies, the number n of samples is relatively small compared to the number p of genes per sample (usually in thousands). It is known that standard statistical methods in classification are efficient (i.e. in the present case, yield successful classifiers) particularly when n is (far) larger than p. This naturally calls for the use of a dimension reduction procedure together with the classification one. RESULTS: In this paper, the question of classification in such a high-dimensional setting is addressed. We view the classification problem as a regression one with few observations and many predictor variables. We propose a new method combining partial least squares (PLS) and Ridge penalized logistic regression. We review the existing methods based on PLS and/or penalized likelihood techniques, outline their interest in some cases and theoretically explain their sometimes poor behavior. Our procedure is compared with these other classifiers. The predictive performance of the resulting classification rule is illustrated on three data sets: Leukemia, Colon and Prostate.

Algorithms↗

PubMed2005

Small, fuzzy and interpretable gene expression based classifiers.

MOTIVATION: Interpretation of classification models derived from gene-expression data is usually not simple, yet it is an important aspect in the analytical process. We investigate the performance of small rule-based classifiers based on fuzzy logic in five datasets that are different in size, laboratory origin and biomedical domain. RESULTS: The classifiers resulted in rules that can be readily examined by biomedical researchers. The fuzzy-logic-based classifiers compare favorably with logistic regression in all datasets. AVAILABILITY: Prototype available upon request.

Algorithms↗

PubMed2005

Empirical Bayes screening of many p-values with applications to microarray studies.

MOTIVATION: Statistical tests for the detection of differentially expressed genes lead to a large collection of p-values one for each gene comparison. Without any further adjustment, these p-values may lead to a large number of false positives, simply because the number of genes to be tested is huge, which might mean wastage of laboratory resources. To account for multiple hypotheses, these p-values are typically adjusted using a single step method or a step-down method in order to achieve an overall control of the error rate (the so-called familywise error rate). In many applications, this may lead to an overly conservative strategy leading to too few genes being flagged. RESULTS: In this paper we introduce a novel empirical Bayes screening (EBS) technique to inspect a large number of p-values in an effort to detect additional positive cases. In effect, each case borrows strength from an overall picture of the alternative hypotheses computed from all the p-values, while the entire procedure is calibrated by a step-down method so that the familywise error rate at the complete null hypothesis is still controlled. It is shown that the EBS has substantially higher sensitivity than the standard step-down approach for multiple comparison at the cost of a modest increase in the false discovery rate (FDR). The EBS procedure also compares favorably when compared with existing FDR control procedures for multiple testing. The EBS procedure is particularly useful in situations where it is important to identify all possible potentially positive cases which can be subjected to further confirmatory testing in order to eliminate the false positives. We illustrated this screening procedure using a data set on human colorectal cancer where we show that the EBS method detected additional genes related to colon cancer that were missed by other methods. This novel empirical Bayes procedure is advantageous over our earlier proposed empirical Bayes adjustments due to the following reasons: (i) it offers an automatic screening of the p-values the user may obtain from a univariate (i.e., gene by gene) analysis package making it extremely easy to use for a non-statistician, (ii) since it applies to the p-values, the tests do not have to be t-tests; in particular they could be F-tests which might arise in certain ANOVA formulations with expression data or even nonparametric tests, (iii) the empirical Bayes adjustment uses nonparametric function estimation techniques to estimate the marginal density of the transformed p-values rather than using a parametric model for the prior distribution and is therefore robust against model mis-specification. AVAILABILITY: R code for EBS is available from the authors upon request. SUPPLEMENTARY INFORMATION: http://www.stat.uga.edu/~datta/EBS/supp.htm

Algorithms↗

PubMed2005

Biomarker discovery in microarray gene expression data with Gaussian processes.

MOTIVATION: In clinical practice, pathological phenotypes are often labelled with ordinal scales rather than binary, e.g. the Gleason grading system for tumour cell differentiation. However, in the literature of microarray analysis, these ordinal labels have been rarely treated in a principled way. This paper describes a gene selection algorithm based on Gaussian processes to discover consistent gene expression patterns associated with ordinal clinical phenotypes. The technique of automatic relevance determination is applied to represent the significance level of the genes in a Bayesian inference framework. RESULTS: The usefulness of the proposed algorithm for ordinal labels is demonstrated by the gene expression signature associated with the Gleason score for prostate cancer data. Our results demonstrate how multi-gene markers that may be initially developed with a diagnostic or prognostic application in mind are also useful as an investigative tool to reveal associations between specific molecular and cellular events and features of tumour physiology. Our algorithm can also be applied to microarray data with binary labels with results comparable to other methods in the literature.

Algorithms↗

PubMed2005

Use of extreme patient samples for outcome prediction from gene expression data.

MOTIVATION: Patient outcome prediction using microarray technologies is an important application in bioinformatics. Based on patients' genotypic microarray data, predictions are made to estimate patients' survival time and their risk of tumor metastasis or recurrence. So, accurate prediction can potentially help to provide better treatment for patients. RESULTS: We present a new computational method for patient outcome prediction. In the training phase of this method, we make use of two types of extreme patient samples: short-term survivors who got an unfavorable outcome within a short period and long-term survivors who were maintaining a favorable outcome after a long follow-up time. These extreme training samples yield a clear platform for us to identify relevant genes whose expression is closely related to the outcome. The selected extreme samples and the relevant genes are then integrated by a support vector machine to build a prediction model, by which each validation sample is assigned a risk score that falls into one of the special pre-defined risk groups. We apply this method to several public datasets. In most cases, patients in high and low risk groups stratified by our method have clearly distinguishable outcome status as seen in their Kaplan-Meier curves. We also show that the idea of selecting only extreme patient samples for training is effective for improving the prediction accuracy when different gene selection methods are used.

Biomarkers, Tumor↗

PubMed2006

Gene selection in cancer classification using sparse logistic regression with Bayesian regularization.

MOTIVATION: Gene selection algorithms for cancer classification, based on the expression of a small number of biomarker genes, have been the subject of considerable research in recent years. Shevade and Keerthi propose a gene selection algorithm based on sparse logistic regression (SLogReg) incorporating a Laplace prior to promote sparsity in the model parameters, and provide a simple but efficient training procedure. The degree of sparsity obtained is determined by the value of a regularization parameter, which must be carefully tuned in order to optimize performance. This normally involves a model selection stage, based on a computationally intensive search for the minimizer of the cross-validation error. In this paper, we demonstrate that a simple Bayesian approach can be taken to eliminate this regularization parameter entirely, by integrating it out analytically using an uninformative Jeffrey's prior. The improved algorithm (BLogReg) is then typically two or three orders of magnitude faster than the original algorithm, as there is no longer a need for a model selection step. The BLogReg algorithm is also free from selection bias in performance estimation, a common pitfall in the application of machine learning algorithms in cancer classification. RESULTS: The SLogReg, BLogReg and Relevance Vector Machine (RVM) gene selection algorithms are evaluated over the well-studied colon cancer and leukaemia benchmark datasets. The leave-one-out estimates of the probability of test error and cross-entropy of the BLogReg and SLogReg algorithms are very similar, however the BlogReg algorithm is found to be considerably faster than the original SLogReg algorithm. Using nested cross-validation to avoid selection bias, performance estimation for SLogReg on the leukaemia dataset takes almost 48 h, whereas the corresponding result for BLogReg is obtained in only 1 min 24 s, making BLogReg by far the more practical algorithm. BLogReg also demonstrates better estimates of conditional probability than the RVM, which are of great importance in medical applications, with similar computational expense. AVAILABILITY: A MATLAB implementation of the sparse logistic regression algorithm with Bayesian regularization (BLogReg) is available from http://theoval.cmp.uea.ac.uk/~gcc/cbl/blogreg/

Algorithms↗

PubMed2006

Reliable gene signatures for microarray classification: assessment of stability and performance.

MOTIVATION: Two important questions for the analysis of gene expression measurements from different sample classes are (1) how to classify samples and (2) how to identify meaningful gene signatures (ranked gene lists) exhibiting the differences between classes and sample subsets. Solutions to both questions have immediate biological and biomedical applications. To achieve optimal classification performance, a suitable combination of classifier and gene selection method needs to be specifically selected for a given dataset. The selected gene signatures can be unstable and the resulting classification accuracy unreliable, particularly when considering different subsets of samples. Both unstable gene signatures and overestimated classification accuracy can impair biological conclusions. METHODS: We address these two issues by repeatedly evaluating the classification performance of all models, i.e. pairwise combinations of various gene selection and classification methods, for random subsets of arrays (sampling). A model score is used to select the most appropriate model for the given dataset. Consensus gene signatures are constructed by extracting those genes frequently selected over many samplings. Sampling additionally permits measurement of the stability of the classification performance for each model, which serves as a measure of model reliability. RESULTS: We analyzed a large gene expression dataset with 78 measurements of four different cartilage sample classes. Classifiers trained on subsets of measurements frequently produce models with highly variable performance. Our approach provides reliable classification performance estimates via sampling. In addition to reliable classification performance, we determined stable consensus signatures (i.e. gene lists) for sample classes. Manual literature screening showed that these genes are highly relevant to our gene expression experiment with osteoarthritic cartilage. We compared our approach to others based on a publicly available dataset on breast cancer. AVAILABILITY: R package at http://www.bio.ifi.lmu.de/~davis/edaprakt

Algorithms↗

PubMed2006

Kalman filtering for disease-state estimation from microarray data.

MOTIVATION: In this paper, we propose using the Kalman filter (KF) as a pre-processing step in microarray-based molecular diagnosis. Incorporating the expression covariance between genes is important in such classification problems, since this represents the functional relationships that govern tissue state. Failing to fulfil such requirements may result in biologically implausible class prediction models. Here, we show that employing the KF to remove noise (while retaining meaningful covariance and thus being able to estimate the underlying biological state from microarray measurements) yields linearly separable data suitable for most classification algorithms. RESULTS: We demonstrate the utility and performance of the KF as a robust disease-state estimator on publicly available binary and multi-class microarray datasets in combination with the most widely used classification methods to date. Moreover, using popular graphical representation schemes we show that our filtered datasets also have an improved visualization capability.

Algorithms↗

PubMed2006

Integrating transcription factor binding site information with gene expression datasets.

MOTIVATION: Microarrays are widely used to measure gene expression differences between sets of biological samples. Many of these differences will be due to differences in the activities of transcription factors. In principle, these differences can be detected by associating motifs in promoters with differences in gene expression levels between the groups. In practice, this is hard to do. RESULTS: We combine correspondence analysis, between group analysis and co-inertia analysis to determine which motifs, from a database of promoter motifs, are strongly associated with differences in gene expression levels. Given a database of motifs and gene expression levels from a set of arrays, the method produces a ranked list of motifs associated with any specified split in the arrays. We give an example using the Gene Atlas compendium of gene expression levels for human tissues where we search for motifs that are associated with expression in central nervous system (CNS) or muscle tissues. Most of the motifs that we find are known from previous work to be strongly associated with expression in CNS or muscle. We give a second example using a published prostate cancer dataset where we can simply and clearly find which transcriptional pathways are associated with differences between benign and metastatic samples. AVAILABILITY: The source code is freely available upon request from the authors.

Algorithms↗