Results 101 to 110 of about 152,670 (312)
Molecular 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
On t-relaxed coloring of complete multi-partite graphs [PDF]
, 2021 Jun Lan, Wensong Lin
openalex +1 more source
Molecular Oncology, EarlyView.This study shows that copy number variations (CNVs) can be reliably detected in formalin‐fixed paraffin‐embedded (FFPE) solid cancer samples using ultra‐low‐pass whole‐genome sequencing, provided that key (pre)‐analytical parameters are optimized.
Hanne Goris +10 more
wiley +1 more source
Rooted Complete Minors in Line Graphs with a Kempe Coloring [PDF]
, 2019 Matthias Kriesell, Samuel Mohr
openalex +1 more source
Molecular Oncology, EarlyView.Single circulating tumor cells (sCTCs) from high‐grade serous ovarian cancer patients were enriched, imaged, and genomically profiled using WGA and NGS at different time points during treatment. sCTCs revealed enrichment of alterations in Chromosomes 2, 7, and 12 as well as persistent or emerging oncogenic CNAs, supporting sCTC identity.
Carolin Salmon +9 more
wiley +1 more source
The coloring complex and cyclic coloring complex of a complete k-uniform\n hypergraph [PDF]
, 2011 Sarah Crown Rundell
openalex +2 more sources
K3-Worm Colorings of Graphs: Lower Chromatic Number and Gaps in the Chromatic Spectrum
Discussiones Mathematicae Graph Theory, 2016 A K3-WORM coloring of a graph G is an assignment of colors to the vertices in such a way that the vertices of each K3-subgraph of G get precisely two colors. We study graphs G which admit at least one such coloring. We disprove a conjecture of Goddard et
Bujtás Csilla, Tuza Zsolt
doaj +1 more source
The complete list of Ramsey $(2K_2,K_4)$-minimal graphs
Electronic Journal of Graph Theory and Applications, 2015 Let $F, G,$ and $H$ be non-empty graphs. The notation $F \rightarrow (G,H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either the subgraph of $F$ induced by all red edges contains a graph $G$ or the subgraph of $F ...
Kristiana Wijaya +3 more
doaj +1 more source
A general model for analysis of linear and hyperbolic enzyme inhibition mechanisms
FEBS Open Bio, EarlyView.We developed a general enzyme kinetic model that integrates these six basic inhibition mechanism onto a single one. From this model, we deduced a general enzyme kinetic equation that through modulation of simple parameters, γ (the relative inhibitor affinity for two binding sites) and β (the reactivity of the enzyme–substrate–inhibitor complex), is ...
Rafael S. Chagas, Sandro R. Marana
wiley +1 more source
Homologous expression and purification of human HAX‐1 for structural studies
FEBS Open Bio, EarlyView.This research protocol provides detailed instructions for cloning, expressing, and purifying large quantities of the intrinsically disordered human HAX‐1 protein, N‐terminally fused to a cleavable superfolder GFP, from mammalian cells. HAX‐1 is predicted to undergo posttranslational modifications and to interact with membranes, various cellular ...
Mariana Grieben
wiley +1 more source