Results 71 to 80 of about 1,962,778 (284)
High-Throughput Single-Cell Labeling (Hi-SCL) for RNA-Seq Using Drop-Based Microfluidics. [PDF]
PLoS ONE, 2015 The importance of single-cell level data is increasingly appreciated, and significant advances in this direction have been made in recent years. Common to these technologies is the need to physically segregate individual cells into containers, such as ...
Assaf Rotem +8 more
doaj +1 more source
Radio numbers for generalized prism graphs
, 2010 A radio labeling is an assignment $c:V(G) \rightarrow \textbf{N}$ such that every distinct pair of vertices $u,v$ satisfies the inequality $d(u,v)+|c(u)-c(v)|\geq \diam(G)+1$. The span of a radio labeling is the maximum value.
Martinez, Paul +3 more
core +1 more source
FEBS Letters, EarlyView.Bone metastasis in prostate cancer (PCa) patients is a clinical hurdle due to the poor understanding of the supportive bone microenvironment. Here, we identify stearoyl‐CoA desaturase (SCD) as a tumor‐promoting enzyme and potential therapeutic target in bone metastatic PCa.
Alexis Wilson +7 more
wiley +1 more source
On k-edge-magic labelings of maximal outerplanar graphs
AKCE International Journal of Graphs and Combinatorics, 2015 Let G be a graph with vertex set V and edge set E such that |V|=p and |E|=q. We denote this graph by (p,q)-graph. For integers k≥0, define a one-to-one map f from E to {k,k+1,…,k+q−1} and define the vertex sum for a vertex v as the sum of the labels of ...
Gee-Choon Lau +3 more
doaj +1 more source
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Learning Residual Finite-State Automata Using Observation Tables
, 2010 We define a two-step learner for RFSAs based on an observation table by using an algorithm for minimal DFAs to build a table for the reversal of the language in question and showing that we can derive the minimal RFSA from it after some simple ...
Anna Kasprzik +2 more
core +2 more sources
, 2016 A prime labeling of a graph with $n$ vertices is a labeling of its vertices with distinct integers from $\{1, 2,\ldots , n\}$ in such a way that the labels of any two adjacent vertices are relatively prime. T. Varkey conjectured that ladder graphs have a prime labeling. We prove this conjecture.
Ghorbani, Ebrahim, Kamali, Sara
openaire +2 more sources
β‐TrCP overexpression enhances cisplatin sensitivity by depleting BRCA1
Molecular Oncology, EarlyView.Low levels of β‐TrCP (Panel A) allow the accumulation of BRCA1 and CtIP, which facilitate the repair of cisplatin‐induced DNA damage via homologous recombination (HR) and promote tumor cell survival. In contrast, high β‐TrCP expression (Panel B) leads to BRCA1 and CtIP degradation, impairing HR repair, resulting in persistent DNA damage and apoptosis ...
Rocío Jiménez‐Guerrero +8 more
wiley +1 more source
Hexagonal Difference Prime Labeling of Some Path Graphs
, 2017 Hexagonal difference prime labeling of vertices of a graph is the labeling of the vertices of the graph with hexagonal numbers and the edges with absolute value of the difference of the labels of the incident vertices.
B. Sunoj, M. Varkey
semanticscholar +1 more source
Molecular Oncology, EarlyView.AZD9291 has shown promise in targeted cancer therapy but is limited by resistance. In this study, we employed metabolic labeling and LC–MS/MS to profile time‐resolved nascent protein perturbations, allowing dynamic tracking of drug‐responsive proteins. We demonstrated that increased NNMT expression is associated with drug resistance, highlighting NNMT ...
Zhanwu Hou +5 more
wiley +1 more source