Methods for assembling panels of cancer cell lines for use in testing the efficacy of one or more pharmaceutical compositions
AssigneeAbbott Laboratories
InventorsDimitri Semizarov, Xin Lu, Ke Zhang, Rick R. Lesniewski
Life of this patent
Estimating the term…
Abstract
The present invention relates to algorithms for use in defining genomic subgroups of tumors and cancer cell lines. The present invention also relates to methods for assembling panels of tumors and cancer cell lines according to genomic subgroups for use in testing the efficacy of one or more pharmaceutical compounds in the treatment of subjects suffering from at least one cancer.
Claims8
An algorithm for use in clustering tumors and cell lines to define genomic subgroups, the method comprising the steps of:
- (a) obtaining a plurality of m samples comprising at least one tumor or cancer cell line;
- (b) acquiring a data set comprising copy number alteration information from at least one locus from each chromosome from each sample obtained in step (a);
- (c) identifying in the data set, copy number alteration information obtained from samples contaminated by normal cells and eliminating the contaminated samples from the data set, wherein the identifying and eliminating comprises:
- (1) applying a machine learning algorithm tuned to parameters that represent the differences between tumor and normal samples to the data;
- (2) assigning a probability score for normal cell contamination to each sample as determined by the machine learning algorithm;
- (3) eliminating data from the data set for each sample scoring 50% or greater probability of containing normal cells;
- (d) estimating a number of subgroups, r, in the data set by applying an unsupervised clustering algorithm using Pearson linear dissimilarity algorithm to the data set;
- (e) assigning each sample in the data set to at least one cluster using a modified genomic non-negative matrix factorization (gNMF) algorithm, wherein the modified gNMF algorithm comprises:
- (1) calculating divergence of the algorithm after every 100 steps of multiplicative updating using the formula (1):
- D
- (
- V
-
-
- WH
- )
- =
- ∑
- i
- =
- 1
- n
-
- ∑
- j
- =
- 1
- m
-
- (
- V
- ij
-
- log
-
-
- V
- ij
- (
- WH
- )
- ij
- -
- V
- ij
- +
- (
- WH
- )
- ij
- )
- (
- 1
- )
- wherein the Vij is the ith row and jth column of matrix V, (WH)ij is the ith row and jth column of matrix (W*H), i runs from 1 to n and n is the number of segments in the data set, and j runs from 1 to m and m is the number of samples in the data set.
- (2) stopping the algorithm if the divergence calculated in step (e) (1) does not decrease by more than about 0.001% when compared to the divergence calculated for the previous 100 steps of multiplicative updating of the algorithm;
- (3) randomly repeating the algorithm for a selected number of runs and calculating a Pearson correlation coefficient matrix of H for the each of run the algorithm using the formula (2):
- C
- i
- ,
- j
- =
- ρ
-
- (
- H
- ,
- i
- ,
- H
- ,
- j
- )
- =
- 1
- r
- -
- 1
-
- ∑
- k
-
- (
- H
- k
- ,
- i
- -
- H
- ,
- j
- _
- )
-
- (
- H
- k
- ,
- j
- -
- H
- ,
- j
- _
- )
- s
- H
- ,
- i
-
- s
- H
- ,
- j
- (
- 2
- )
- herein C is the correlation matrix, Ci,j is the ith row and jth column in the matrix C, H,i and H,j are the ith and jth column vector in matrix H, ρ(H,i, H,j) is the Pearson correlation coefficient between H,i and H,j, i and j run from 1 to m and m is the number of samples in the data set, k runs from 1 to r and r is the number of subgroups from step (d);
- (4) averaging the Pearson correlation coefficient matrices for each run of the algorithm obtained from step (e)(3) to arrive at an average correlation matrix;
- (5) assigning tumors and cancer cell lines in the data set into r subgroups by applying a unsupervised clustering algorithm using 1 minus the average correlation matrix determined in step (e)(4) and cutting a dendrogram into r clusters;
- (f) applying a Cophenetic correlation, Bayesian Information Criterion or a combination thereof to provide a final number of clusters from the data set, wherein each final cluster defines a genomic subgroup for each tumor or cancer cell line sample;
- and
- (g) evaluating the stability of the final number of clusters selected in step (f) using a ten-fold stability test.
A method for assembling panels of tumor and cancer cell lines according to genomic subgroups, the method comprising the steps of:
- (a) obtaining a plurality of m samples comprising at least one tumor or cancer cell line;
- (b) acquiring a data set comprising copy number alteration information from at least one locus from each chromosome from each sample obtained in step (a);
- (c) identifying in the data set, copy number alteration information obtained from samples contaminated by normal cells and eliminating the contaminated samples from the data set, wherein the identifying and eliminating comprises:
- (1) applying a machine learning algorithm tuned to parameters that represent the differences between tumor and normal samples to the data;
- (2) assigning a probability score for normal cell contamination to each sample, as determined by the machine learning algorithm;
- (3) eliminating data from the data set for each sample scoring 50% or greater probability of containing normal cells;
- (d) estimating a number of subgroups, r, in the data set by applying unsupervised clustering using Pearson linear dissimilarity algorithm to the data set;
- (e) assigning each sample in the data set to at least one cluster using a modified genomic non-negative matrix factorization (gNMF) algorithm, wherein the modified gNMF algorithm comprises:
- (1) calculating divergence of the algorithm after every 100 steps of multiplicative updating using the formula (1):
- D
- (
- V
-
-
- WH
- )
- =
- ∑
- i
- =
- 1
- n
-
- ∑
- j
- =
- 1
- m
-
- (
- V
- ij
-
- log
-
-
- V
- ij
- (
- WH
- )
- ij
- -
- V
- ij
- +
- (
- WH
- )
- ij
- )
- (
- 1
- )
- wherein the Vij is the ith row and jth column of matrix V, (WH)ij is the ith row and jth column of matrix (W*H), i runs from 1 to n and n is the number of segments in the data set, and j runs from 1 to m and m is the number of samples in the data set.
- (2) stopping the algorithm if the divergence calculated in step (e) (1) does not decrease more than about 0.001% when compared to the divergence calculated for the previous 100 steps of multiplicative updating of the algorithm;
- (3) randomly repeating the algorithm for a selected number of runs and calculating a Pearson correlation coefficient matrix of H for the each of run the algorithm using the formula (2):
- C
- i
- ,
- j
- =
- ρ
-
- (
- H
- ,
- i
- ,
- H
- ,
- j
- )
- =
- 1
- r
- -
- 1
-
- ∑
- k
-
- (
- H
- k
- ,
- i
- -
- H
- ,
- j
- _
- )
-
- (
- H
- k
- ,
- j
- -
- H
- ,
- j
- _
- )
- s
- H
- ,
- i
-
- s
- H
- ,
- j
- (
- 2
- )
- herein C is the correlation matrix, Ci,j is the ith row and jth column in the matrix C, H,i and H,j are the ith and ith column vector in matrix H, ρ(H,i, H,j) is the Pearson correlation coefficient between H,i and H,j, i and j run from 1 to m and m is the number of samples in the data set, k runs from 1 to r and r is the number of subgroups from step (d);
- (4) averaging the Pearson correlation coefficient matrices for each run of the algorithm obtained from step (e)(3) to arrive at an average correlation matrix;
- (5) assigning tumors and cancer cell lines in the data set into r subgroups by applying a unsupervised clustering algorithm using 1 minus the average correlation matrix determined in step (e)(4) and cutting a dendrogram into r clusters;
- (f) applying a Cophenetic correlation, Bayesian Information Criterion or a combination thereof to select a final number of clusters from the data set;
- (g) evaluating the stability of the final number of clusters selected in step (f) using a ten-fold stability test;
- and
- (h) selecting at least one tumor or cell line from each cluster selected in step (f) and assembling the selected cell lines into panels defined according to genomic subgroups.
Dependencies are inferred from the claim text.