Results 81 to 90 of about 476,988 (354)

FoxO1 signaling in B cell malignancies and its therapeutic targeting

open access: yesFEBS Letters, EarlyView.
FoxO1 has context‐specific tumor suppressor or oncogenic character in myeloid and B cell malignancies. This includes tumor‐promoting properties such as stemness maintenance and DNA damage tolerance in acute leukemias, or regulation of cell proliferation and survival, or migration in mature B cell malignancies.
Krystof Hlavac   +3 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

Pattern Count on Multiply Restricted Permutations [PDF]

open access: yes, 2013
Previous work has studied the pattern count on singly restricted permutations. In this work, we focus on patterns of length 3 in multiply restricted permutations, especially for double and triple pattern-avoiding permutations. We derive explicit formulae
Zhao, Alina F. Y.
core  

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

On the enumeration of column-convex permutominoes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
We study the enumeration of \emphcolumn-convex permutominoes, i.e. column-convex polyominoes defined by a pair of permutations. We provide a direct recursive construction for the column-convex permutominoes of a given size, based on the application of ...
Nicholas R. Beaton   +3 more
doaj   +1 more source

A combinatorial model for the transition matrix between the Specht and $\operatorname {SL}_2$ -web bases

open access: yesForum of Mathematics, Sigma, 2023
We introduce a new class of permutations, called web permutations. Using these permutations, we provide a combinatorial interpretation for entries of the transition matrix between the Specht and $\operatorname {SL}_2$ -web bases of the irreducible
Byung-Hak Hwang   +2 more
doaj   +1 more source

The intracellular domain of TLR2 is capable of high‐affinity Zn binding: possible outcomes for the receptor activation

open access: yesFEBS Letters, EarlyView.
Toll‐like receptors (TLRs) are important in the innate immune system. This study explores the zinc‐binding ability of the TLR2 TIR domain (TLR2TIR). We found that TLR2TIR binds zinc with nanomolar affinity through its cysteine residues. Two of them, C673 and C713, are vital for receptor activation, indicating that zinc may play a role in initiating ...
Vladislav A. Lushpa   +8 more
wiley   +1 more source

Permutations avoiding an increasing number of length-increasing forbidden subsequences [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2000
A permutation π is said to be τ -avoiding if it does not contain any subsequence having all the same pairwise comparisons as τ . This paper concerns the characterization and enumeration of permutations which avoid a set F^j of subsequences increasing ...
Elena Barcucci   +3 more
doaj   +1 more source

Transport of patterns by Burge transpose

open access: yes, 2020
We take the first steps in developing a theory of transport of patterns from Fishburn permutations to (modified) ascent sequences. Given a set of pattern avoiding Fishburn permutations, we provide an explicit construction for the basis of the ...
Cerbai, Giulio, Claesson, Anders
core  

Simple permutations and pattern restricted permutations

open access: yesDiscrete Mathematics, 2005
AbstractA simple permutation is one that does not map any non-trivial interval onto an interval. It is shown that, if the number of simple permutations in a pattern restricted class of permutations is finite, the class has an algebraic generating function and is defined by a finite set of restrictions.
Michael H. Albert, Michael M. Atkinson
openaire   +1 more source

Home - About - Disclaimer - Privacy