Results 41 to 50 of about 115,299 (267)
General Diffusion Analysis: How to Find Optimal Permutations for Generalized Type-II Feistel Schemes
IACR Transactions on Symmetric Cryptology, 2019 Type-II Generalized Feistel Schemes are one of the most popular versions of Generalized Feistel Schemes. Their round function consists in applying a classical Feistel transformation to p sub-blocks of two consecutive words and then shifting the k = 2p ...
Victor Cauchois +2 more
doaj +1 more source
Permutation Statistics of Indexed Permutations
European Journal of Combinatorics, 1994 The definitions of descent, exceedance, major index, inversion index and Denert's statistic for the elements of the symmetric group \({\mathcal S}_ d\) are generalized to indexed permutations, i.e. the elements of the group \(S^ n_ d:=\mathbb{Z}_ n\wr{\mathcal S}_ d\), where \(\wr\) is the wreath product with respect to usual action of \({\mathcal S}_ ...
openaire +2 more sources
Permutation Reconstruction [PDF]
The Electronic Journal of Combinatorics, 2006 In this paper, we consider the problem of permutation reconstruction. This problem is an analogue of graph reconstruction, a famous question in graph theory. In the case of permutations, the problem can be stated as follows: In all possible ways, delete $k$ entries of the permutation $p=p_1p_2p_3...p_n$ and renumber accordingly, creating $n \choose k$
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Adolescents with high‐risk cancer face complex developmental, psychosocial, and ethical challenges that extend beyond disease‐directed treatment. Although international recommendations exist for communication, psychosocial care, pediatric palliative care, survivorship, and shared decision‐making, these have largely evolved within ...
Johanna M. C. Blom +15 more
wiley +1 more source
Covering n-Permutations with (n+1)-Permutations [PDF]
The 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$?
Taylor F. Allison +3 more
openaire +5 more sources
Comparative Drug Response Profiling in Neuroblastoma Cell Lines and Patient‐Derived Tumor Organoids
Pediatric Blood &Cancer, EarlyView.ABSTRACT High‐risk neuroblastoma remains a leading cause of pediatric cancer mortality, and improved preclinical models are needed to guide therapeutic developments. We screened seven high‐risk neuroblastoma cell lines and three patient‐derived tumor organoids with 528 compounds alongside bone marrow controls, and compared them with external datasets ...
Krzysztof Wierbiłowicz +12 more
wiley +1 more source
Parse Journal, 2023 The greedy and unstoppable bulldozer of runaway globalisation has led to unprecedented economic growth in the world since the 1990s, but at a cost. Local realities, practices and knowledges are being smothered, and ecosystems worldwide are becoming more ...
Thomas Hylland Eriksen
doaj
European 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 ...
Rodica Simion, Frank W. Schmidt
openaire +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Rates of cancer among adolescents and young adults (AYA), age 15–39 years, are increasing. Consequently, radiation oncologists are treating more AYAs who have diagnoses spanning both pediatric and adult practices. Compared to pediatric and older adult patients, AYAs face a unique set of challenges.
Hesham Elhalawani +7 more
wiley +1 more source
Sorting by Multi-Cut Rearrangements
Algorithms, 2021 A multi-cut rearrangement of a string S is a string S′ obtained from S by an operation called k-cut rearrangement, that consists of (1) cutting S at a given number k of places in S, making S the concatenated string X1·X2·X3·…·Xk·Xk+1, where X1 and Xk+1 ...
Laurent Bulteau +3 more
doaj +1 more source