Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

306 results about "Expression pattern" patented technology

Regular Expression Language - Quick Reference. A regular expression is a pattern that the regular expression engine attempts to match in input text. A pattern consists of one or more character literals, operators, or constructs.

Combinatorial array for nucleic acid analysis

This invention relates to an array, including a universal micro-array, for the analysis of nucleic acids, such as DNA. The devices and methods of the invention can be used for identifying gene expression patterns in any organism. More specifically, all possible oligonucleotides (n-mers) necessary for the identification of gene expression patterns are synthesized. According to the invention, n is large enough to give the specificity to uniquely identify the expression pattern of each gene in an organism of interest, and is small enough that the method and device can be easily and efficiently practiced and made. The invention provides a method of analyzing molecules, such as polynucleotides (e.g., DNA), by measuring the signal of an optically-detectable (e.g., fluorescent, ultraviolet, radioactive or color change) reporter associated with the molecules. In a polynucleotide analysis device according to the invention, levels of gene expression are correlated to a signal from an optically-detectable (e.g. fluorescent) reporter associated with a hybridized polynucleotide. The invention includes an algorithm and method to interpret data derived from a micro-array or other device, including techniques to decode or deconvolve potentially ambiguous signals into unambiguous or reliable gene expression data.
Owner:CALIFORNIA INST OF TECH

Gene expression profiles to predict relapse of prostate cancer

The present invention provides a method for preparing a reference model for cancer relapse prediction that provides higher resolution grading than Gleason score alone. The method encompasses obtaining from different individuals a plurality of prostate carcinoma tissue samples of known clinical outcome representing different Gleason scores; selecting a set of signature genes having an expression pattern that correlates positively or negatively in a statistically significant manner with the Gleason scores; independently deriving a prediction score that correlates gene expression of each individual signature gene with Gleason score for each signature gene in said plurality of prostate carcinoma tissue samples; deriving a prostate cancer gene expression (GEX) score that correlates gene expression of said set of signature genes with the Gleason score based on the combination of independently derived prediction scores in the plurality of prostate cancer tissue samples; and correlating said GEX score with the clinical outcome for each prostate carcinoma tissue sample. A set of signature genes is provided that encompasses all or a sub-combination of GI_2094528, KIP2, NRG1, NBL1, Prostein, CCNE2, CDC6, FBP1, HOXC6, MKI67, MYBL2, PTTG1, RAMP, UBE2C, Wnt5A, MEMD, AZGP1, CCK, MLCK, PPAP2B, and PROK1. Also provided a methods for predicting the probability of relapse of cancer in an individual and methods for deriving a prostate cancer gene expression (GEX) score for a prostate carcinoma tissue sample obtained from an individual.
Owner:ILLUMINA INC

Binary prediction tree modeling with many predictors and its uses in clinical and genomic applications

The statistical analysis described and claimed is a predictive statistical tree model that overcomes several problems observed in prior statistical models and regression analyses, while ensuring greater accuracy and predictive capabilities. Although the claimed use of the predictive statistical tree model described herein is directed to the prediction of a disease in individuals, the claimed model can be used for a variety of applications including the prediction of disease states, susceptibility of disease states or any other biological state of interest, as well as other applicable non-biological states of interest. This model first screens genes to reduce noise, applies k-means correlation-based clustering targeting a large number of clusters, and then uses singular value decompositions (SVD) to extract the single dominant factor (principal component) from each cluster. This generates a statistically significant number of cluster-derived singular factors, that we refer to as metagenes, that characterize multiple patterns of expression of the genes across samples. The strategy aims to extract multiple such patterns while reducing dimension and smoothing out gene-specific noise through the aggregation within clusters. Formal predictive analysis then uses these metagenes in a Bayesian classification tree analysis. This generates multiple recursive partitions of the sample into subgroups (the “leaves” of the classification tree), and associates Bayesian predictive probabilities of outcomes with each subgroup. Overall predictions for an individual sample are then generated by averaging predictions, with appropriate weights, across many such tree models. The model includes the use of iterative out-of-sample, cross-validation predictions leaving each sample out of the data set one at a time, refitting the model from the remaining samples and using it to predict the hold-out case. This rigorously tests the predictive value of a model and mirrors the real-world prognostic context where prediction of new cases as they arise is the major goal.
Owner:DUKE UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products