Results 61 to 70 of about 157,845 (305)

A four-sweep LBFS recognition algorithm for interval graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
Graph ...
Peng Li, Yaokun Wu
doaj   +1 more source

Differential expression of cancer‐related genes supports prediction of poor response to first‐line treatments in T‐ALL pediatric patients with high minimal residual disease

open access: yesMolecular Oncology, EarlyView.
In the present work, we have identified a transcriptional signature based on the differential expression of six genes (BCL2&MAST4, HSH2D&LAT2, METRN&PITPNM2) that would facilitate the early detection of T‐cell acute lymphoblastic leukemia (T‐ALL) patients prone to a poor treatment response and could be implemented at diagnosis, along with other risk ...
Antonio Lahera   +11 more
wiley   +1 more source

An evolution of interval graphs

open access: yesDiscrete Mathematics, 1990
A random interval is defined as \([x-e,x+e]\) with x chosen uniformly in [0,1] and e chosen uniformly in [0,r] where r is a parameter. The interval graph of n such intervals has n points, any pair of which is connected if the two interval overlap. The evolution of an interval graph gives an idea of how the expected properties of the graph change with ...
openaire   +1 more source

3D-interval-filament graphs

open access: yes, 2007
Gavril [F. Gavril, Maximum weight independent sets and cliques in intersection graphs of filaments, Inform. Process. Lett. 73 (2000) 181–188] defined two new families of intersection graphs: the interval-filament graphs and the subtree-filament graphs ...
Gavril, Fanica
core   +1 more source

Longitudinal circulating tumor DNA profiling in patients with advanced endometrial cancer using an off‐the‐shelf targeted NGS panel

open access: yesMolecular Oncology, EarlyView.
Intratumour heterogeneity complicates precision management of advanced endometrial cancer. Circulating tumor DNA (ctDNA) offers a minimally invasive strategy to capture tumor evolution and therapeutic resistance. Here, we compare tumor‐agnostic NGS with tumor‐informed ddPCR, outlining their relative sensitivity, concordance, and clinical implications ...
Carlos Casas‐Arozamena   +15 more
wiley   +1 more source

Interaction of HS1BP3 with cortactin modulates TKS5 localisation, cell secretion and cancer malignancy

open access: yesMolecular Oncology, EarlyView.
Here, we demonstrate that HS1BP3 interacts with Cortactin through a proline‐rich region (PRR3.1) and show that this interaction, and HS1BP3 itself, promote cancer cell proliferation and invasion. Inhibition of this interaction leads to build‐up of TKS5 in multivesicular endosomes and altered secretion of CD63 and CD9, providing an explanation for the ...
Arja Arnesen Løchen   +9 more
wiley   +1 more source

Weakly toll convexity and proper interval graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
A walk $u_0u_1 \ldots u_{k-1}u_k$ is a \textit{weakly toll walk} if $u_0u_i \in E(G)$ implies $u_i = u_1$ and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. A set $S$ of vertices of $G$ is {\it weakly toll convex} if for any two non-adjacent vertices $x,y \in S$
Mitre C. Dourado   +3 more
doaj   +1 more source

Steiner intervals in graphs

open access: yesDiscrete Applied Mathematics, 1998
If \(S\) is a subset of the vertex set of a connected graph \(G\), then the Steiner distance \(d(S)\) of \(S\) is the minimum number of edges of a connected subgraph of \(G\) that contains \(S\); this subgraph is always a tree and is called a Steiner tree for \(S\). The Steiner interval \(I(S)\) of \(S\) is the set of all vertices of \(G\) which lie in
Ewa M. Kubicka   +2 more
openaire   +2 more sources

Interpreting the effects of DNA polymerase variants at the structural level

open access: yesMolecular Oncology, EarlyView.
Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi   +7 more
wiley   +1 more source

Interval matroids and graphs

open access: yesDiscrete Mathematics, 1979
AbstractA base of the cycle space of a binary matroid M on E is said to be convex if its elements can be totally ordered in such a way that for every e ε E the set of elements of the base containing e is an interval. We show that a binary matroid is cographic iff it has a convex base of cycles; equivalently, graphic matroids can be represented as ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy