Results 51 to 60 of about 24,121 (267)

Generalizations of the Tree Packing Conjecture

open access: yes, 2011
The Gy\'arf\'as tree packing conjecture asserts that any set of trees with $2,3, ..., k$ vertices has an (edge-disjoint) packing into the complete graph on $k$ vertices. Gy\'arf\'as and Lehel proved that the conjecture holds in some special cases.
Gerbner, Dániel   +2 more
core   +1 more source

The neural crest‐associated gene ERRFI1 is involved in melanoma progression and resistance toward targeted therapy

open access: yesMolecular Oncology, EarlyView.
ERRFI1, a neural crest (NC)‐associated gene, was upregulated in melanoma and negatively correlated with the expression of melanocytic differentiation markers and the susceptibility of melanoma cells toward BRAF inhibitors (BRAFi). Knocking down ERRFI1 significantly increased the sensitivity of melanoma cells to BRAFi.
Nina Wang   +8 more
wiley   +1 more source

Transcriptional network analysis of PTEN‐protein‐deficient prostate tumors reveals robust stromal reprogramming and signs of senescent paracrine communication

open access: yesMolecular Oncology, EarlyView.
Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice   +16 more
wiley   +1 more source

Online Bin Packing with Advice [PDF]

open access: yes, 2013
We consider the online bin packing problem under the advice complexity model where the 'online constraint' is relaxed and an algorithm receives partial information about the future requests.
Boyar, Joan   +3 more
core   +2 more sources

Packing problems in edge-colored graphs

open access: yesDiscrete Applied Mathematics, 1994
Let \(F\) be a graph edge-colored with \(k\) colors. A partition (family of disjoint subsets, respectively) \(\{V_ 1,\dots,V_ m\}\) of the vertex set of a complete graph edge-colored with \(k\) colors is an \(F\)-partition (\(F\)-packing, respectively) if each \(V_ i\) contains a spanning copy of \(F\) (with the same color pattern as \(F\)).
Hell, P., Manoussakis, Y., Tuza, Zs.
openaire   +2 more sources

Plecstatin inhibits hepatocellular carcinoma tumorigenesis and invasion through cytolinker plectin

open access: yesMolecular Oncology, EarlyView.
The ruthenium‐based metallodrug plecstatin exerts its anticancer effect in hepatocellular carcinoma (HCC) primarily through selective targeting of plectin. By disrupting plectin‐mediated cytoskeletal organization, plecstatin inhibits anchorage‐dependent growth, cell polarization, and tumor cell dissemination.
Zuzana Outla   +10 more
wiley   +1 more source

A Landscape Analysis of Constraint Satisfaction Problems

open access: yes, 2007
We discuss an analysis of Constraint Satisfaction problems, such as Sphere Packing, K-SAT and Graph Coloring, in terms of an effective energy landscape.
A. J. Liu   +11 more
core   +1 more source

Two-colorings with many monochromatic cliques in both colors [PDF]

open access: yes, 2013
Color the edges of the n-vertex complete graph in red and blue, and suppose that red k-cliques are fewer than blue k-cliques. We show that the number of red k-cliques is always less than cknk, where ck∈(0, 1) is the unique root of the equation zk=(1-z)k ...
Frankl, Péter   +3 more
core   +1 more source

Infrared laser sampling of low volumes combined with shotgun lipidomics reveals lipid markers in palatine tonsil carcinoma

open access: yesMolecular Oncology, EarlyView.
Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff   +11 more
wiley   +1 more source

How many matchings cover the nodes of a graph?

open access: yes, 2018
Given an undirected graph, are there $k$ matchings whose union covers all of its nodes, that is, a matching-$k$-cover? A first, easy polynomial solution from matroid union is possible, as already observed by Wang, Song and Yuan (Mathematical Programming,
Ferhat, Dehia Ait   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy