Results 41 to 50 of about 407,922 (313)

Predicting Chronicity in Children and Adolescents With Newly Diagnosed Immune Thrombocytopenia at the Timepoint of Diagnosis Using Machine Learning‐Based Approaches

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Objectives To identify predictors of chronic ITP (cITP) and to develop a model based on several machine learning (ML) methods to estimate the individual risk of chronicity at the timepoint of diagnosis. Methods We analyzed a longitudinal cohort of 944 children enrolled in the Intercontinental Cooperative immune thrombocytopenia (ITP) Study ...
Severin Kasser   +6 more
wiley   +1 more source

Unfair permutations

open access: yesEuropean Journal of Combinatorics, 2011
We study unfair permutations, which are generated by letting [Formula: see text] players draw numbers and assuming that player [Formula: see text] draws [Formula: see text] times from the unit interval and records her largest value. This model is natural in the context of partitions: the score of the [Formula: see text]th player corresponds to the ...
Prodinger H., Schneider C., Wagner S.
openaire   +4 more sources

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

On the sub-permutations of pattern avoiding permutations

open access: yes, 2014
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees.
Disanto, Filippo, Wiehe, Thomas
core   +1 more source

Mapping the evolution of mitochondrial complex I through structural variation

open access: yesFEBS Letters, EarlyView.
Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin   +2 more
wiley   +1 more source

Organoids in pediatric cancer research

open access: yesFEBS Letters, EarlyView.
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley   +1 more source

Restricted Permutations

open access: yesEuropean Journal of Combinatorics, 1985
Let \(S_n\) be the symmetric group on \(\{1,2,\ldots,n\}\). A permutation \(\sigma \in S_n\) is said to avoid the 3-letter word 132 iff there is no triple \(1\leq ...
Simion, Rodica, Schmidt, Frank W.
openaire   +1 more source

Ballot permutations and odd order permutations [PDF]

open access: yesDiscrete Mathematics, 2020
There was an error with an alternative formula for b(n,3) that was on page ...
openaire   +2 more sources

Reciprocal control of viral infection and phosphoinositide dynamics

open access: yesFEBS Letters, EarlyView.
Phosphoinositides, although scarce, regulate key cellular processes, including membrane dynamics and signaling. Viruses exploit these lipids to support their entry, replication, assembly, and egress. The central role of phosphoinositides in infection highlights phosphoinositide metabolism as a promising antiviral target.
Marie Déborah Bancilhon, Bruno Mesmin
wiley   +1 more source

Covering n-Permutations with (n+1)-Permutations [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2013
Let $S_n$ be the set of all permutations on $[n]:=\{1,2,\ldots,n\}$. We denote by $\kappa_n$ the smallest cardinality of a subset ${\cal A}$ of $S_{n+1}$ that "covers" $S_n$, in the sense that each $\pi\in S_n$ may be found as an order-isomorphic subsequence of some $\pi'$ in ${\cal A}$.  What are general upper bounds on $\kappa_n$?
Allison, Taylor F.   +3 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy