Results 101 to 110 of about 254,850 (275)
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
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
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
, 2019 We study two parameters that arise from the dichromatic number and the vertex-arboricity in the same way that the achromatic number comes from the chromatic number.
Felsner, Stefan +3 more
core
Two new Probability inequalities and Concentration Results [PDF]
, 2010 Concentration results and probabilistic analysis for combinatorial problems like the TSP, MWST, graph coloring have received much attention, but generally, for i.i.d. samples (i.i.d. points in the unit square for the TSP, for example). Here, we prove two
Kannan, Ravindran
core
S-Packing Colorings of Cubic Graphs [PDF]
, 2014 Nicolas Gastineau, Olivier Togni
openalex +1 more source
Narrow sieves for parameterized paths and packings
, 2010 We present randomized algorithms for some well-studied, hard combinatorial problems: the k-path problem, the p-packing of q-sets problem, and the q-dimensional p-matching problem.
Björklund, Andreas +3 more
core
Polynomial instances of the Packing Coloring Problem
Electronic Notes in Discrete Mathematics, 2011 Abstract 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 . The packing chromatic number of G, χ ρ ( G ) , is the minimum k such that G has a packing k-coloring. To compute the packing chromatic number is NP-hard, even restricted to trees.
G. Argiroffo, G. Nasini, P. Torres
openaire +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