Results 51 to 60 of about 153,098 (217)
On $[1,2]$-Domination in Interval and Circle Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA subset $S$ of vertices in a graph $G=(V, E)$ is a Dominating Set if each vertex in $V(G)\setminus S$ is adjacent to at least one vertex in $S$. Chellali et al.
Mohsen Alambardar Meybodi +1 more
doaj +1 more source
CEACAM1 participation in breast cancer progression
Molecular Oncology, EarlyView.In invasive breast cancer (BC), CEACAM1 shifts from an apical to a uniform membranous/cytoplasmic pattern, or is lost, as tumors dedifferentiate, inversely tracking the Ki‐67 proliferative index. In MCF‐7 cells, only CEACAM1‐4L suppresses proliferation, repressing cell cycle and growth factor genes.
Mykola Lyndin +3 more
wiley +1 more source
On the on-line coloring of unit interval graphs with proper interval representation [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe define the problem as a two-player game between Algorithm and Builder. The game is played in rounds. Each round, Builder presents an interval that is neither contained in nor contains any previously presented interval.
Israel R. Curbelo, Hannah R. Malko
doaj +1 more source
Molecular Oncology, EarlyView.Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source
A survey on pairwise compatibility graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let T be an edge weighted tree and dmin, dmax be two non-negative real numbers where The pairwise compatibility graph (PCG) of T for dmin, dmax is a graph G such that each vertex of G corresponds to a distinct leaf of T and two vertices are adjacent in G
Md. Saidur Rahman, Shareef Ahmed
doaj +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
A Characterization of 2-Tree Probe Interval Graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs ...
Brown David E. +2 more
doaj +1 more source
FEBS Open Bio, EarlyView.A novel signature integrating genome‐wide analysis with clinical factors predicts recurrence in stage II colorectal cancer and enables a new risk stratification to guide postoperative adjuvant chemotherapy. Clinical risk stratification for postoperative recurrence in patients with pathological stage II (pStage II) colorectal cancer (CRC) is essential ...
Mayuko Otomo +7 more
wiley +1 more source
The Phylogeny Graphs of Doubly Partial Orders
Discussiones Mathematicae Graph Theory, 2013 The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced
Park Boram, Sano Yoshio
doaj +1 more source
The Steiner cycle and path cover problem on interval graphs. [PDF]
J Comb Optim, 2022 Ćustić A, Lendl S.
europepmc +1 more source