Results 41 to 50 of about 179,193 (249)
Packing coloring of Sierpiński-type graphs [PDF]
Aequationes mathematicae, 2018 The packing chromatic number $χ_ρ(G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set of $G$ can be partitioned into sets $V_i$, $i\in \{1,\ldots,k\}$, where each $V_i$ is an $i$-packing. In this paper, we consider the packing chromatic number of several families of Sierpiński-type graphs.
Boštjan Brešar, Jasmina Ferme
openaire +3 more sources
Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics
FEBS Letters, EarlyView.Proximity‐dependent labeling at the LAMTOR complex revealed the Rho GEF PLEKHG3 as a lysosome‐proximal protein directing the study toward the influence of lysosome positioning on actin dynamics and cell motility. We show that PLEKHG3 colocalizes with lysosomes at focal adhesion sites and observe that forced peripheral dispersion of lysosomes hinders ...
Rainer Ettelt +8 more
wiley +1 more source
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
FEBS Letters, EarlyView.EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source
FEBS Letters, EarlyView.How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley +1 more source
Efficient derandomization of the Lovász Local Lemma and applications to coloring and packing problems [PDF]
, 2003 We use algorithmic versions of Lovasz Local Lemma (LLL) to deal with the following two packing type problems: (i) a particular kind of hypergraph coloring problem, and (ii) vector packing problem.
Ahuja, Nitin
core +1 more source
FEBS Letters, EarlyView.Transient oligomers formed by intrinsically disordered proteins may be ‘invisible’ to direct detection yet remain accessible to solution NMR through equilibrium‐exchange measurements and pressure‐jump experiments. Complementary methods report on mass, stoichiometry, selected distance distributions, morphology, and internal packing.
Martin D. Gelenter, Ad Bax
wiley +1 more source
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
Molecular Oncology, EarlyView.The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
Molecular Oncology, EarlyView.Cytarabine is a key therapy for acute myeloid leukaemia (AML), but its efficacy is limited by the dNTPase SAMHD1, which hydrolyses its active metabolite. Screening nucleotide biosynthesis inhibitors revealed that IMPDH inhibitors selectively sensitise SAMHD1‐proficient AML cells to cytarabine.
Miriam Yagüe‐Capilla +9 more
wiley +1 more source
Dagstuhl Reports : Volume 1, Issue 2, February 2011 [PDF]
, 2011 Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs ...
Schloss Dagstuhl, Leibniz-Zentrum für Informatik
core
The packing coloring problem for lobsters and partner limited graphs [PDF]
, 2014 A packing k-coloring of a graph G is a k-coloring such that the distance between two vertices having color i is at least i + 1. To compute the packing chromatic number is NP-hard, even restricted to trees, and it is known to be polynomial time solvable ...
Torres, Pablo Daniel +2 more
core +1 more source