Cancer is in general not a result of an abnormality of a single gene but a consequence of changes in many genes, it is therefore of great importance to understand the roles of different oncogenic and tumor suppressor pathways in tumorigenesis. In recent years, there have been many computational models developed to study the genetic alterations of different pathways in the evolutionary process of cancer. However, most of the methods are knowledge-based enrichment analyses and inflexible to analyze user-defined pathways or gene sets. In this paper, we develop a nonparametric and data-driven approach to testing for the dynamic changes of pathways over the cancer progression. Our method is based on an expansion and refinement of the pathway being studied, followed by a graph-based multivariate test, which is very easy to implement in practice. The new test is applied to the rich Cancer Genome Atlas data to study the (epi)genetic alterations of 186 KEGG pathways in the development of serous ovarian cancer. To make use of the comprehensive data, we incorporate three data types in the analysis representing gene expression level, copy number and DNA methylation level. Our analysis suggests a list of nine pathways that are closely associated with serous ovarian cancer progression, including cell cycle, ERBB, JAK-STAT signaling and p53 signaling pathways. By pairwise tests, we found that most of the identified pathways contribute only to a particular transition step. For instance, the cell cycle and ERBB pathways play key roles in the early-stage transition, while the ECM receptor and apoptosis pathways contribute to the progression from stage III to stage IV. The proposed computational pipeline is powerful in detecting important pathways and gene sets that drive cancers at certain stage(s). It offers new insights into the understanding of molecular mechanism of cancer initiation and progression. © 2020 Elsevier Ltd
Far infrared photoconductive detectors based on multi-wall carbon nanotubes (MWCNTs) were fabricated and their characteristics were tested. MWCNTs films deposited on porous silicon (PSi) nanosurface by dip and drop coating techniques. Two types of deposited methods were used; dip coating sand drop –by-drop methods. As well as two types of detector were fabricated one with aluminum mask and the other without, and their figures of merits were studied. The detectors were illuminated by 2.2 and 2.5 Watt from CO2 of 10.6 m and tested. The surface morphology for the films is studied using AFM and SEM micrographs. The films show homogeneous distributed for CNTs on the PSi layer. The root mean square (r.m.s.) of the films surface roughness in
... Show MoreIn this study, we set up and analyze a cancer growth model that integrates a chemotherapy drug with the impact of vitamins in boosting and strengthening the immune system. The aim of this study is to determine the minimal amount of treatment required to eliminate cancer, which will help to reduce harm to patients. It is assumed that vitamins come from organic foods and beverages. The chemotherapy drug is added to delay and eliminate tumor cell growth and division. To that end, we suggest the tumor-immune model, composed of the interaction of tumor and immune cells, which is composed of two ordinary differential equations. The model’s fundamental mathematical properties, such as positivity, boundedness, and equilibrium existence, are exami
... Show MoreIdentification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed
... Show MoreBackground: The aim of this study was to evaluate and compare the apical microleakage around retrograde cavities prepared with ultrasonic technique and filled with (Biodentineâ„¢) Materials and methods: 40 extracted single rooted human permanent maxillary teeth with mature apices were selected. The roots were prepared chemo-mechanically using k-files with crown-down technique and then obturated with lateral condensation gutta-percha technique. Teeth were divided into four main groups according to the cavity preparation method either manual or ultrasonic technique: Group A (n=10): A class I retrograde cavity at root end was prepared with traditional handpeice equipped and placement of Biodentine with manual condensation. Group B (n=10):
... Show MoreBackground: The aim of this study was to evaluate and compare the apical microleakage around retrograde cavities prepared with ultrasonic technique and filled with (Biodentineâ„¢) Materials and methods: 40 extracted single rooted human permanent maxillary teeth with mature apices were selected. The roots were prepared chemo-mechanically using k-files with crown-down technique and then obturated with lateral condensation gutta-percha technique. Teeth were divided into four main groups according to the cavity preparation method either manual or ultrasonic technique: Group A (n=10): A class I retrograde cavity at root end was prepared with traditional handpeice equipped and placement of Biodentine with manual condensation. Group B (n=10):
... Show MoreIn regression testing, Test case prioritization (TCP) is a technique to arrange all the available test cases. TCP techniques can improve fault detection performance which is measured by the average percentage of fault detection (APFD). History-based TCP is one of the TCP techniques that consider the history of past data to prioritize test cases. The issue of equal priority allocation to test cases is a common problem for most TCP techniques. However, this problem has not been explored in history-based TCP techniques. To solve this problem in regression testing, most of the researchers resort to random sorting of test cases. This study aims to investigate equal priority in history-based TCP techniques. The first objective is to implement
... Show MoreIn this work, the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt
... Show More