Results 121 to 130 of about 1,286,422 (323)

Comparing self‐reported race and genetic ancestry for identifying potential differentially methylated sites in endometrial cancer: insights from African ancestry proportions using machine learning models

open access: yesMolecular Oncology, EarlyView.
Integrating ancestry, differential methylation analysis, and machine learning, we identified robust epigenetic signature genes (ESGs) and Core‐ESGs in Black and White women with endometrial cancer. Core‐ESGs (namely APOBEC1 and PLEKHG5) methylation levels were significantly associated with survival, with tumors from high African ancestry (THA) showing ...
Huma Asif, J. Julie Kim
wiley   +1 more source

Hardness of Approximation for Crossing Number [PDF]

open access: yesDiscrete & Computational Geometry, 2012
We show that, if P\not=NP, there is a constant c > 1 such that there is no c-approximation algorithm for the crossing number, even when restricted to 3-regular graphs.
openaire   +3 more sources

A large‐scale retrospective study in metastatic breast cancer patients using circulating tumour DNA and machine learning to predict treatment outcome and progression‐free survival

open access: yesMolecular Oncology, EarlyView.
There is an unmet need in metastatic breast cancer patients to monitor therapy response in real time. In this study, we show how a noninvasive and affordable strategy based on sequencing of plasma samples with longitudinal tracking of tumour fraction paired with a statistical model provides valuable information on treatment response in advance of the ...
Emma J. Beddowes   +20 more
wiley   +1 more source

Various heuristic algorithms to minimise the two-page crossing numbers of graphs

open access: yesOpen Computer Science, 2015
We propose several new heuristics for the twopage book crossing problem, which are based on recent algorithms for the corresponding one-page problem. Especially, the neural network model for edge allocation is combined for the first time with various one-
He Hongmei   +3 more
doaj   +1 more source

Book crossing numbers of the complete graph and small local convex crossing numbers

open access: yes, 2017
A $ k $-page book drawing of a graph $ G $ is a drawing of $ G $ on $ k $ halfplanes with common boundary $ l $, a line, where the vertices are on $ l $ and the edges cannot cross $ l $. The $ k $-page book crossing number of the graph $ G $, denoted by $
Dandurand, Julia   +4 more
core  

Chemoresistome mapping in individual breast cancer patients unravels diversity in dynamic transcriptional adaptation

open access: yesMolecular Oncology, EarlyView.
This study used longitudinal transcriptomics and gene‐pattern classification to uncover patient‐specific mechanisms of chemotherapy resistance in breast cancer. Findings reveal preexisting drug‐tolerant states in primary tumors and diverse gene rewiring patterns across patients, converging on a few dysregulated functional modules. Despite receiving the
Maya Dadiani   +14 more
wiley   +1 more source

Tonic signaling of the B‐cell antigen‐specific receptor is a common functional hallmark in chronic lymphocytic leukemia cell phosphoproteomes at early disease stages

open access: yesMolecular Oncology, EarlyView.
B‐cell chronic lymphocytic leukemia (B‐CLL) and monoclonal B‐cell lymphocytosis (MBL) show altered proteomes and phosphoproteomes, analyzed using mass spectrometry, protein microarrays, and western blotting. Identifying 2970 proteins and 316 phosphoproteins, including 55 novel phosphopeptides, we reveal BCR and NF‐kβ/STAT3 signaling in disease ...
Paula Díez   +17 more
wiley   +1 more source

Bound for the 2-Page Fixed Linear Crossing Number of Hypercube Graph via SDP Relaxation

open access: yesJournal of Applied Mathematics, 2017
The crossing number of graph G is the minimum number of edges crossing in any drawing of G in a plane. In this paper we describe a method of finding the bound of 2-page fixed linear crossing number of G. We consider a conflict graph G′ of G.
A. Suebsriwichai, T. Mouktonglang
doaj   +1 more source

The crossing number of composite knots [PDF]

open access: yesJournal of Topology, 2009
It is a very old conjecture that the crossing number of knots is additive under connected sum. In other words, if K#K' is the connected sum of knots K and K', then does the equality c(K#K') = c(K) + c(K') hold? We prove that c(K#K') is at most c(K) + c(K') and at least (c(K) + c(K'))/152.
openaire   +3 more sources

Detecting homologous recombination deficiency for breast cancer through integrative analysis of genomic data

open access: yesMolecular Oncology, EarlyView.
This study develops a semi‐supervised classifier integrating multi‐genomic data (1404 training/5893 validation samples) to improve homologous recombination deficiency (HRD) detection in breast cancer. Our method demonstrates prognostic value and predicts chemotherapy/PARP inhibitor sensitivity in HRD+ tumours.
Rong Zhu   +12 more
wiley   +1 more source

Home - About - Disclaimer - Privacy