Results 31 to 40 of about 396,980 (268)

Insights into PI3K/AKT signaling in B cell development and chronic lymphocytic leukemia

open access: yesFEBS Letters, EarlyView.
This Review explores how the phosphoinositide 3‐kinase and protein kinase B pathway shapes B cell development and drives chronic lymphocytic leukemia, a common blood cancer. It examines how signaling levels affect disease progression, addresses treatment challenges, and introduces novel experimental strategies to improve therapies and patient outcomes.
Maike Buchner
wiley   +1 more source

The cytoskeletal control of B cell receptor and integrin signaling in normal B cells and chronic lymphocytic leukemia

open access: yesFEBS Letters, EarlyView.
In lymphoid organs, antigen recognition and B cell receptor signaling rely on integrins and the cytoskeleton. Integrins act as mechanoreceptors, couple B cell receptor activation to cytoskeletal remodeling, and support immune synapse formation as well as antigen extraction.
Abhishek Pethe, Tanja Nicole Hartmann
wiley   +1 more source

A new generation tree for permutations, preserving the number of fixed points [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
We describe a new uniform generation tree for permutations with the specific property that, for most permutations, all of their descendants in the generation tree have the same number of fixed points.
Philippe Duchon, Romaric Duvignau
doaj   +1 more source

Alternating, pattern-avoiding permutations [PDF]

open access: yes, 2008
We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set S_n(132) of 132-avoiding permutations and the set A_{2n + 1}(132) of alternating, 132-avoiding ...
Lewis, Joel Brewster
core   +1 more source

Interlocked permutations

open access: yes, 2018
The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We solve the problem for three particular channels.
Cohen, Gerard   +2 more
core   +1 more source

B cell mechanobiology in health and disease: emerging techniques and insights into therapeutic responses

open access: yesFEBS Letters, EarlyView.
B cells sense external mechanical forces and convert them into biochemical signals through mechanotransduction. Understanding how malignant B cells respond to physical stimuli represents a groundbreaking area of research. This review examines the key mechano‐related molecules and pathways in B lymphocytes, highlights the most relevant techniques to ...
Marta Sampietro   +2 more
wiley   +1 more source

On Minimal Strings Containing the Elements of S_n by Decimation [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2001
The permutations by decimation problem is thought to be applicable to computer graphics, and raises interesting theoretical questions in combinatory theory.We present the results of some theoretical and practical investigation into this problem.We show ...
Robert Erra, Nik Lygeros, Nigel Stewart
doaj   +1 more source

Evolutionary interplay between viruses and R‐loops

open access: yesFEBS Letters, EarlyView.
Viruses interact with specialized nucleic acid structures called R‐loops to influence host transcription, epigenetic states, latency, and immune evasion. This Perspective examines the roles of R‐loops in viral replication, integration, and silencing, and how viruses co‐opt or avoid these structures.
Zsolt Karányi   +4 more
wiley   +1 more source

Polyominoes determined by involutions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
A permutomino of size n is a polyomino determined by particular pairs $(\pi_1, \pi_2)$ of permutations of length $n$, such that $\pi_1(i) \neq \pi_2(i)$, for $1 \leq i \leq n$.
Filippo Disanto, Simone Rinaldi
doaj   +1 more source

Longest Common Separable Pattern between Permutations [PDF]

open access: yes, 2007
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input permutations is fixed and show that the problem is NP-hard for an arbitrary ...
Bouvel, Mathilde   +2 more
core   +5 more sources

Home - About - Disclaimer - Privacy