Results 101 to 110 of about 60,505 (275)
Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis
FEBS Letters, EarlyView.Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee +7 more
wiley +1 more source
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
Molecular Oncology, EarlyView.This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley +1 more source
New results on metric-locating-dominating sets of graphs [PDF]
, 2016 A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distanc es from the elements of S , and the minimum cardinality of such a set is called the metri c-location- domination number.
Hernando Martín, María del Carmen +2 more
core +1 more source
IEEE Access, 2018 The classical rough set theory was presented by Pawlak, which is mainly concerned with the approximation of sets described by a single binary relation on the universe.
Noor Rehman +3 more
doaj +1 more source
Minimal resolving sets for the hypercube
CoRR, 2011 For a given undirected graph $G$, an \emph{ordered} subset $S = {s_1,s_2,...,s_k} \subseteq V$ of vertices is a resolving set for the graph if the vertices of the graph are distinguishable by their vector of distances to the vertices in $S$. While a superset of any resolving set is always a resolving set, a proper subset of a resolving set is not ...
openaire +2 more sources
Overlarge sets of Mendelsohn triple systems with resolvability
Discrete Mathematics, 2013 Abstract An OLRMTS ( v ) ( OLARMTS ( v ) ) over a ( v + 1 ) -set X is a collection { ( X ∖ { x } , B x ) : x ∈ X } of v + 1 pairwise disjoint resolvable (almost resolvable) Mendelsohn triple systems of order v . In this paper several direct construction methods for
Junling Zhou, Yanxun Chang
openaire +1 more source
Subtype‐specific enhancer RNAs define transcriptional regulators and prognosis in breast cancers
Molecular Oncology, EarlyView.This study employed machine learning methodologies to perform the subtype‐specific classification of RNA‐seq data sets, which are mapped on enhancers from TCGA‐derived breast cancer patients. Their integration with gene expression (referred to as ProxCReAM eRNAs) and chromatin accessibility profiles has the potential to identify lineage‐specific and ...
Aamena Y. Patel +6 more
wiley +1 more source
Metric Dimension and Exchange Property for Resolving Sets in Rotationally-Symmetric Graphs [PDF]
, 2014 : Metric dimension or location number is a generalization of affine dimension to arbitrary metric spaces (provided a resolving set exists). Let F be a family of connected graphs Gn: F = (Gn)n≥1 depending on n as follows: the order |V(G) | = ϕ(n) and lim
Imran, Muhammad +3 more
core +1 more source
Large sets of oriented triple systems with resolvability
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qingde Kang, Zihong Tian
openaire +1 more source
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source