CTLA4 expression profiles and their association with clinical outcomes of breast cancer: a systemic review.

Purpose: The cytotoxic T-lymphocyte-associated protein 4 (CTLA4) is involved in the progression of various cancers, but its biological roles in breast cancer (BRCA) remain unclear. Therefore, we performed a systematic multiomic analysis to expound on the prognostic value and underlying mechanism of CTLA4 in BRCA. Methods: We assessed the effect of CTLA4 expression on BRCA using a variety of bioinformatics platforms, including Oncomine, GEPIA, UALCAN, PrognoScan database, Kaplan-Meier plotter, and R2: Kaplan-Meier scanner. Results: CTLA4 was highly expressed in BRCA tumor tissue compared to normal tissue (P < 0.01). The CTLA4 messenger RNA levels in BRCA based on BRCA subtypes of Luminal, human epidermal growth factor receptor 2, and triple-negative BRCA were considerably higher than in normal tissues (P < 0.001). However, the overexpression of CTLA4 was associated with a better prognosis in BRCA (P < 0.001) and was correlated with clinicopathological characteristics including age, T stage, estrogen receptors, progesterone receptors, and prediction analysis of microarray 50 (P < 0.01). The infiltration of multiple immune cells was associated with increased CTLA4 expression in BRCA (P < 0.001). CTLA4 was highly enriched in antigen binding, immunoglobulin complexes, lymphocyte-mediated immunity, and cytokine-cytokine receptor interaction. Conclusion: This study provides suggestive evidence of the prognostic role of CTLA4 in BRCA, which may be a therapeutic target for BRCA. Furthermore, CTLA4 may influence BRCA prognosis through antigen binding, immunoglobulin complexes, lymphocyte-mediated immunity, and cytokine-cytokine receptor interaction. These findings help us understand how CTLA4 plays a role in BRCA and set the stage for more research.

Using Apache Spark on genome assembly for scalable overlap-graph reduction.

BACKGROUND: De novo genome assembly is a technique that builds the genome of a specimen using overlaps of genomic fragments without additional work with reference sequence. Sequence fragments (called reads) are assembled as contigs and scaffolds by the overlaps. The quality of the de novo assembly depends on the length and continuity of the assembly. To enable faster and more accurate assembly of species, existing sequencing techniques have been proposed, for example, high-throughput next-generation sequencing and long-reads-producing third-generation sequencing. However, these techniques require a large amounts of computer memory when very huge-size overlap graphs are resolved. Also, it is challenging for parallel computation. RESULTS: To address the limitations, we propose an innovative algorithmic approach, called Scalable Overlap-graph Reduction Algorithms (SORA). SORA is an algorithm package that performs string graph reduction algorithms by Apache Spark. The SORA's implementations are designed to execute de novo genome assembly on either a single machine or a distributed computing platform. SORA efficiently compacts the number of edges on enormous graphing paths by adapting scalable features of graph processing libraries provided by Apache Spark, GraphX and GraphFrames. CONCLUSIONS: We shared the algorithms and the experimental results at our project website, https://github.com/BioHPC/SORA . We evaluated SORA with the human genome samples. First, it processed a nearly one billion edge graph on a distributed cloud cluster. Second, it processed mid-to-small size graphs on a single workstation within a short time frame. Overall, SORA achieved the linear-scaling simulations for the increased computing instances.