Development of effective gene selection algorithms for microarray data analysis

Issued as final reportNational Science Foundation (U.S.

Ascorbic acid increases demethylation in somatic cell nuclear transfer embryos of the pig ()

Objective Investigated the effect and mechanism of ascorbic acid on the development of porcine embryos produced by somatic cell nuclear transfer (SCNT). Methods Porcine embryos were produced by SCNT and cultured in the presence or absence of ascorbic acid. Ten-eleven translocation 3 (TET3) in oocytes was knocked down by siRNA injection. After ascorbic acid treatment, reprogramming genes were analyzed by realtime reverse transcription-polymerase chain reaction (RT-PCR). Furthermore, relative 5-methylcytosine and 5-hydroxymethylcytosine content in pronucleus were detected by realtime PCR. Results Ascorbic acid significantly increased the development of porcine embryos produced by SCNT. After SCNT, transcript levels of reprogramming genes, Pou5f1, Sox2, and Klf were significantly increased in blastocysts. Furthermore, ascorbic acid reduced 5-methylcytosine content in pronuclear embryos compared with the control group. Knock down of TET3 in porcine oocytes significantly prevents the demethylation of somatic cell nucleus after SCNT, even if in the presence of ascorbic acid. Conclusion Ascorbic acid enhanced the development of porcine SCNT embryos via the increased TET3 mediated demethylation of somatic nucleus

Post-intervention Status in Patients With Refractory Myasthenia Gravis Treated With Eculizumab During REGAIN and Its Open-Label Extension

OBJECTIVE: To evaluate whether eculizumab helps patients with anti-acetylcholine receptor-positive (AChR+) refractory generalized myasthenia gravis (gMG) achieve the Myasthenia Gravis Foundation of America (MGFA) post-intervention status of minimal manifestations (MM), we assessed patients' status throughout REGAIN (Safety and Efficacy of Eculizumab in AChR+ Refractory Generalized Myasthenia Gravis) and its open-label extension. METHODS: Patients who completed the REGAIN randomized controlled trial and continued into the open-label extension were included in this tertiary endpoint analysis. Patients were assessed for the MGFA post-intervention status of improved, unchanged, worse, MM, and pharmacologic remission at defined time points during REGAIN and through week 130 of the open-label study. RESULTS: A total of 117 patients completed REGAIN and continued into the open-label study (eculizumab/eculizumab: 56; placebo/eculizumab: 61). At week 26 of REGAIN, more eculizumab-treated patients than placebo-treated patients achieved a status of improved (60.7% vs 41.7%) or MM (25.0% vs 13.3%; common OR: 2.3; 95% CI: 1.1-4.5). After 130 weeks of eculizumab treatment, 88.0% of patients achieved improved status and 57.3% of patients achieved MM status. The safety profile of eculizumab was consistent with its known profile and no new safety signals were detected. CONCLUSION: Eculizumab led to rapid and sustained achievement of MM in patients with AChR+ refractory gMG. These findings support the use of eculizumab in this previously difficult-to-treat patient population. CLINICALTRIALSGOV IDENTIFIER: REGAIN, NCT01997229; REGAIN open-label extension, NCT02301624. CLASSIFICATION OF EVIDENCE: This study provides Class II evidence that, after 26 weeks of eculizumab treatment, 25.0% of adults with AChR+ refractory gMG achieved MM, compared with 13.3% who received placebo

Minimal Symptom Expression' in Patients With Acetylcholine Receptor Antibody-Positive Refractory Generalized Myasthenia Gravis Treated With Eculizumab

The efficacy and tolerability of eculizumab were assessed in REGAIN, a 26-week, phase 3, randomized, double-blind, placebo-controlled study in anti-acetylcholine receptor antibody-positive (AChR+) refractory generalized myasthenia gravis (gMG), and its open-label extension

Nonnegative matrix and tensor factorizations, least squares problems, and applications

Nonnegative matrix factorization (NMF) is a useful dimension reduction method that has been investigated and applied in various areas. NMF is considered for high-dimensional data in which each element has a nonnegative value, and it provides a low-rank approximation formed by factors whose elements are also nonnegative. The nonnegativity constraints imposed on the low-rank factors not only enable natural interpretation but also reveal the hidden structure of data. Extending the benefits of NMF to multidimensional arrays, nonnegative tensor factorization (NTF) has been shown to be successful in analyzing complicated data sets. Despite the success, NMF and NTF have been actively developed only in the recent decade, and algorithmic strategies for computing NMF and NTF have not been fully studied. In this thesis, computational challenges regarding NMF, NTF, and related least squares problems are addressed. First, efficient algorithms of NMF and NTF are investigated based on a connection from the NMF and the NTF problems to the nonnegativity-constrained least squares (NLS) problems. A key strategy is to observe typical structure of the NLS problems arising in the NMF and the NTF computation and design a fast algorithm utilizing the structure. We propose an accelerated block principal pivoting method to solve the NLS problems, thereby significantly speeding up the NMF and NTF computation. Implementation results with synthetic and real-world data sets validate the efficiency of the proposed method. In addition, a theoretical result on the classical active-set method for rank-deficient NLS problems is presented. Although the block principal pivoting method appears generally more efficient than the active-set method for the NLS problems, it is not applicable for rank-deficient cases. We show that the active-set method with a proper starting vector can actually solve the rank-deficient NLS problems without ever running into rank-deficient least squares problems during iterations. Going beyond the NLS problems, it is presented that a block principal pivoting strategy can also be applied to the l1-regularized linear regression. The l1-regularized linear regression, also known as the Lasso, has been very popular due to its ability to promote sparse solutions. Solving this problem is difficult because the l1-regularization term is not differentiable. A block principal pivoting method and its variant, which overcome a limitation of previous active-set methods, are proposed for this problem with successful experimental results. Finally, a group-sparsity regularization method for NMF is presented. A recent challenge in data analysis for science and engineering is that data are often represented in a structured way. In particular, many data mining tasks have to deal with group-structured prior information, where features or data items are organized into groups. Motivated by an observation that features or data items that belong to a group are expected to share the same sparsity pattern in their latent factor representations, We propose mixed-norm regularization to promote group-level sparsity. Efficient convex optimization methods for dealing with the regularization terms are presented along with computational comparisons between them. Application examples of the proposed method in factor recovery, semi-supervised clustering, and multilingual text analysis are presented.PhDCommittee Chair: Park, Haesun; Committee Member: Gray, Alexander; Committee Member: Lebanon, Guy; Committee Member: Monteiro, Renato; Committee Member: Zha, Hongyua