Detection of serine 473 phosphorylated Akt in acute myeloid leukaemia blasts by flow cytometry.

Servizio di Immunoematologia e Trasfusionale, Policlinico S. Orsola-Malpighi, via Irnerio 48, 40126 Bologna, Italy.
British Journal of Haematology (Impact Factor: 4.96). 10/2004; 126(5):675-81. DOI: 10.1111/j.1365-2141.2004.05121.x
Source: PubMed

ABSTRACT The phosphoinositide 3-kinase/Akt signalling pathway is a recently recognized important parameter in the prognosis and the response to treatment of acute myeloid leukaemia (AML). Akt kinase is activated by phosphorylation on Thr 308 and Ser 473. Active Akt promotes cell growth and survival to apoptotic insults. Thus, it seems important to evaluate Akt phosphorylation in AML blasts. This work aimed to establish whether it was possible to detect Akt phosphorylation on Ser 473 of AML blasts by means of flow cytometry. High levels of Akt activity and phosphorylation were detected in 13 of 15 cases of AML. Flow cytometric analysis revealed similar patterns of Ser 473 expression as was observed with Akt kinase activity and Western blot analysis of Thr 308 and Ser 473 phosphorylation. Double immunostaining enabled the simultaneous flow cytometric detection of an AML-associated antigen (CD33) and Ser 473 phosphorylated Akt in leukaemic blast populations. Our results indicate that flow cytometry enabled the rapid and quantitative assessment of Ser 473 phosphorylated Akt of AML blasts that, when used in combination with cell surface staining, can provide more accurate phenotyping of AML blasts.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: With emergence of biomedical informatics, Web intelligence, and E-business, new challenges are coming for knowledge discovery and data mining modeling problems. In this dissertation work, a framework named Granular Support Vector Machines (GSVM) is proposed to systematically and formally combine statistical learning theory, granular computing theory and soft computing theory to address challenging predictive data modeling problems effectively and/or efficiently, with specific focus on binary classification problems. In general, GSVM works in 3 steps. Step 1 is granulation to build a sequence of information granules from the original dataset or from the original feature space. Step 2 is modeling Support Vector Machines (SVM) in some of these information granules when necessary. Finally, step 3 is aggregation to consolidate information in these granules at suitable abstract level. A good granulation method to find suitable granules is crucial for modeling a good GSVM. Under this framework, many different granulation algorithms including the GSVM- CMW (cumulative margin width) algorithm, the GSVM-AR (association rule mining) algorithm, a family of GSVM-RFE (recursive feature elimination) algorithms, the GSVM-DC (data cleaning) algorithm and the GSVM-RU (repetitive undersampling) algorithm are designed for binary classification problems with different characteristics.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Extracting a subset of informative genes from microarray expression data is a critical data preparation step in cancer classification and other biological function analyses. Though many algorithms have been developed, the support vector machine-recursive feature elimination (SVM-RFE) algorithm is one of the best gene feature selection algorithms. It assumes that a smaller "filter-out" factor in the SVM-RFE, which results in a smaller number of gene features eliminated in each recursion, should lead to extraction of a better gene subset. Because the SVM-RFE is highly sensitive to the "filter-out" factor, our simulations have shown that this assumption is not always correct and that the SVM-RFE is an unstable algorithm. To select a set of key gene features for reliable prediction of cancer types or subtypes and other applications, a new two-stage SVM-RFE algorithm has been developed. It is designed to effectively eliminate most of the irrelevant, redundant, and noisy genes while keeping information loss small at the first stage. A fine selection for the final gene subset is then performed at the second stage. The two-stage SVM-RFE overcomes the instability problem of the SVM-RFE to achieve better algorithm utility. We have demonstrated that the two-stage SVM-RFE is significantly more accurate and more reliable than the SVM-RFE and three correlation-based methods based on our analysis of three publicly available microarray expression data sets. Furthermore, the two-stage SVM-RFE is computationally efficient because its time complexity is O(d*log2d), where d is the size of the original gene set.
    IEEE/ACM Transactions on Computational Biology and Bioinformatics 01/2007; 4(1):c2-c2. DOI:10.1109/TCBB.2007.1028 · 1.54 Impact Factor
  • Source