Results 41 to 50 of about 7,928 (143)

Inosine triphosphate pyrophosphatase activity as a potential predictor of methotrexate remission in juvenile idiopathic arthritis

Arthritis &Rheumatology, Accepted Article.
Background Methotrexate (MTX) is the first‐line therapy for juvenile idiopathic arthritis (JIA), but up to 40% of patients don't respond. Low inosine‐triphosphate‐pyrophosphatase (ITPA) activity has been associated with reduced clinical remission. We investigated ITPA role and the underlying mechanisms in vitro.
Sofia Sindici Forgiarini, Marianna Lucafò, Debora Curci, Davide Selvestrel, Valentina Moressa, Sofia Pagarin, Barbara Bellich, Martina Franzin, Alberto Tommasini, Mara L. Becker, Laura B. Ramsey, Susan D. Thompson, Carl D. Langefeld, Federica Corba, Edoardo Marrani, Gabriele Simonini, Gabriele Stocco, Giuliana Decorti, Andrea Taddio, Serena Pastore   +19 more
wiley   +1 more source

On an anti‐Ramsey property of Ramanujan graphs [PDF]

Random Structures & Algorithms, 1995
AbstractIf G and H are graphs, we write G→ H (respectively, G→ TH) if for any proper edge‐coloring γ of G there is a subgraph H' ⊂ G of G isomorphic to H (respectively, isomorphic to a subdivision of H) such that γ is injective on E(H'). Let us write Cl for the cycle of length l. Spencer (cf.
Haxell, P. E., Kohayakawa, Y.
openaire   +1 more source

Multi‐omic profiling reveals immune cell priming signature linked to lupus prognosis

Arthritis &Rheumatology, Accepted Article.
Objective Systemic lupus erythematosus (SLE) is a multi‐organ disease with widespread immune dysregulation and significant unmet clinical need. Blood‐based gene expression studies have advanced our understanding of SLE pathogenesis but may overlook critical tissue‐specific mechanisms that drive disease heterogeneity and progression.
Michael A. Smith, Dominic Sinibaldi, Saifur Rahman, Chia‐Chien Chiang, Anna M. Hansen, Jill Henault, Carlos P. Roca, Shu Wang, Kamelia Zerrouki, Rebecca Filippi, Christopher Groves, Zerai Manna, Jun Chu, Michael Davis, Sarthak Gupta, Christopher Morehouse, Melissa de los Reyes, Rachel Ettinger, Roland Kolbeck, Mariana J. Kaplan, Miguel A. Sanjuan, Richard M. Siegel, Sarfaraz A. Hasni, Kerry A. Casey   +23 more
wiley   +1 more source

Large rainbow matchings in large graphs [PDF]

, 2011
A \textit{rainbow subgraph} of an edge-colored graph is a subgraph whose edges have distinct colors. The \textit{color degree} of a vertex $v$ is the number of different colors on edges incident to $v$. We show that if $n$ is large enough (namely, $n\geq
Kostochka, Alexandr, Pfender, Florian, Yancey, Matthew   +2 more
core   +1 more source

Sentience in cephalopod molluscs: an updated assessment

Biological Reviews, EarlyView.
ABSTRACT This article evaluates the evidence for sentience – the capacity to have feelings – in cephalopod molluscs: octopus, cuttlefish, squid, and nautilus. Our framework includes eight criteria, covering both whether the animal's nervous system could support sentience and whether their behaviour indicates sentience.
Alexandra K. Schnell, Heather Browning, Andrew Crump, Charlotte C. Burn, Jonathan Birch   +4 more
wiley   +1 more source

Medicare Part D and Hospital Admissions due to Antimicrobial Resistance

Health Economics, EarlyView.
ABSTRACT Antimicrobial resistance (AMR) has been increasing rapidly in the United States despite government efforts to contain its spread. Both under‐utilization and overuse of prescribed antimicrobials contribute to rising resistance. The introduction of Medicare Part D in 2006 expanded prescription drug coverage for the elderly, including coverage ...
Ricardo B. Ang III
wiley   +1 more source

Anti-Ramsey properties of random graphs

Journal of Combinatorial Theory, Series B, 2010
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a different color. A graph has property A(b,H) if every b-bounded coloring of its edges has a rainbow copy of H .
Bohman, Tom, Frieze, Alan, Pikhurko, Oleg, Smyth, Cliff   +3 more
openaire   +1 more source

Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees [PDF]

SIAM Journal on Discrete Mathematics, 2020
An edge-colored graph $G$ is called rainbow if every edge of $G$ receives a different color. The anti-Ramsey number of $t$ edge-disjoint rainbow spanning trees, denoted by $r(n,t)$, is defined as the maximum number of colors in an edge-coloring of $K_n$ containing no $t$ edge-disjoint rainbow spanning trees. Jahanbekam and West [J.
Linyuan Lu, Zhiyu Wang
openaire   +3 more sources

Monochromatic Graph Decompositions Inspired by Anti-Ramsey Theory and Parity Constraints

Mathematics
We open here many new tracks of research in anti-Ramsey Theory, considering edge-coloring problems inspired by rainbow coloring and further by odd colorings and conflict-free colorings. Let G be a graph and F any given family of graphs. For every integer
Yair Caro, Zsolt Tuza
doaj   +1 more source

Faraday–Ramsey Rotation in Ultrathin Alkali Vapor Cells as an Analogy to Atomic‐Beam Systems

Laser &Photonics Reviews, EarlyView.
This work demonstrates that ultrathin rubidium vapor cells can emulate atomic‐beam behavior through geometry‐dependent velocity filtering. Employing a spatially separated pump–probe scheme and Faraday–Ramsey rotation, the study reveals coherent atomic dynamics without buffer gas or anti‐relaxation coatings. This approach offers a compact pathway toward
Mark Dikopoltsev, Eliran Talker, Yefim Barash, Noa Mazurski, Uriel Levy   +4 more
wiley   +1 more source