Results 121 to 130 of about 7,293,468 (349)

The Set of Dominance-Minimal Roots

Journal of Algebra, 1998
This article examines the set of so-called dominance-minimal, or elementary roots of a Coxeter system. An earlier paper by \textit{B. Brink} and \textit{R. B. Howlett} [Math. Ann. 296, No. 1, 179-190 (1993; Zbl 0793.20036)] showed that this set is finite, but the bound given in that paper was impractically large.
openaire   +2 more sources

Tropical Dominating Sets in Vertex-Coloured Graphs

, 2016
Given a vertex-coloured graph, a dominating set is said to be tropical if every colour of the graph appears at least once in the set. Here, we study minimum tropical dominating sets from structural and algorithmic points of view. First, we prove that the
A Li, B Baker, C Lin, E Sampathkumar, G Ausiello, M Chlebík, M Fellows, M Garey, P Alimonti, RC Brigham, S Akbari, T Haynes, Y Caro   +12 more
core   +1 more source

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

Molecular 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, Mario Ortega Duran, Solon Karapanagiotis, Alistair Martin, Meiling Gao, Riccardo Masina, Ramona Woitek, James Tanner, Fleur Tippin, Justine Kane, Jonathan Lay, Anja Brouwer, Stephen‐John Sammut, Suet‐Feung Chin, Davina Gale, Dana W. Y. Tsui, Sarah‐Jane Dawson, Nitzan Rosenfeld, Maurizio Callari, Oscar M. Rueda, Carlos Caldas   +20 more
wiley   +1 more source

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

Molecular 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, Gilgi Friedlander, Gili Perry, Nora Balint‐Lahat, Shlomit Gilad, Dana Morzaev‐Sulzbach, Anjana Shenoy, Noa Bossel Ben‐Moshe, Anya Pavlovsky, Rinat Bernstein‐Molho, Eytan Domany, Iris Barshack, Tamar Geiger, Bella Kaufman, Einav Nili Gal‐Yam   +14 more
wiley   +1 more source

A NOT ON DOMINATING SET WITH MAPLE [PDF]

Journal of Nonlinear Sciences and Applications, 2008
Let G be a n− vertex graph. In 1996, Reed conjectured that γ(G) ≤ dn/3e for every connected 3− regular G. In this paper, we introduce an algorithm in computer algebra system of MAPLE such that, by using any graph as input, we can calculate domination number γ(G) and illustrated set of all dominating sets.
M. Matinfar, S. Mirzamani
openaire   +2 more sources

MicroRNA 196a contributes to the aggressiveness of esophageal adenocarcinoma through the MYC/TERT/NFκB axis

Molecular Oncology, EarlyView.
mir‐196a promotes Esophagus Adenocarcinoma aggressiveness. On one hand, mir‐196a targets the valosin‐containing protein (VCP) mRNA, causing the accumulation of c‐MYC protein that leads to high amounts of TERT. On the other hand, mir‐196a targets the inhibitor of NFκB (NFKBIA).
Jesús García‐Castillo, Carlos M. Martínez‐Cáceres, Manuel Bernabé‐García, Vicente Munitiz, David Ruiz de Angulo, Pascual Parrilla, Ángeles Ortiz, Luisa F. Martínez de Haro, María L. Cayuela   +8 more
wiley   +1 more source

Disjoint dominating and total dominating sets in graphs

Discrete Applied Mathematics, 2010
AbstractIt has been shown [M.A. Henning, J. Southey, A note on graphs with disjoint dominating and total dominating sets, Ars Combin. 89 (2008) 159–162] that every connected graph with minimum degree at least two that is not a cycle on five vertices has a dominating set D and a total dominating set T which are disjoint.
Christian Löwenstein, Dieter Rautenbach, Justin Southey, Michael A. Henning   +3 more
openaire   +2 more sources

Bounding the Porous Exponential Domination Number of Apollonian Networks [PDF]

, 2014
Given a graph G with vertex set V, a subset S of V is a dominating set if every vertex in V is either in S or adjacent to some vertex in S. The size of a smallest dominating set is called the domination number of G.
Beverly, Joshua, Farley, Mariah, McClain, Christopher, Stover, Felicia   +3 more
core  

Genomics‐led approach to drug testing in models of undifferentiated pleomorphic sarcoma

Molecular Oncology, EarlyView.
GA text Genomic data from undifferentiated pleomorphic sarcoma patients and preclinical models were used to inform a targeted drug screen. Selected compounds were tested in 2D and 3D cultures of UPS cell lines. A combination of trametinib and infigratinib was synergistic in the majority of UPS cell lines tested, which was further confirmed in an ex ...
Piotr J. Manasterski, Molly R. Danks, John P. Thomson, Morwenna Muir, Martin Lee, John C. Dawson, Ana T. Amaral, Juan Diaz‐Martin, David S. Moura, Javier Martin‐Broto, Ali Alsaadi, Donald M. Salter, Ailsa J. Oswald, Graeme Grimes, Larry Hayward, Ted R. Hupp, Karen Sisley, Paul H. Huang, Neil O. Carragher, Valerie G. Brunton   +19 more
wiley   +1 more source

Independent set dominating sets in bipartite graphs [PDF]

Opuscula Mathematica, 2005
The paper continues the study of independent set dominating sets in graphs which was started by E. Sampathkumar. A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called a set dominating set (shortly sd-set) in \(G\), if for each set \(X ...
Bohdan Zelinka
doaj