Search results for "Permutation"
showing 10 items of 132 documents
Restricted compositions and permutations: from old to new Gray codes
2011
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…
Statistics-preserving bijections between classical and cyclic permutations
2012
Recently, Elizalde (2011) [2] has presented a bijection between the set C"n"+"1 of cyclic permutations on {1,2,...,n+1} and the set of permutations on {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. In this paper, we construct a bijection from C"n"+"1 to S"n that preserves the weak excedance set and that transfers quasi-fixed points into fixed points and left-to-right maxima into themselves. This induces a bijection from the set D"n of derangements to the set C"n"+"1^q of cycles without quasi-fixed points that preserves the weak excedance set. Moreover, we exhibit a kind of discrete continuity between C"n"+"1 and S"n that preserves at each s…
Null models for animal social network analysis and data collected via focal sampling: Pre‐network or node network permutation?
2020
In social networks analysis, two different approaches have predominated in creating null models for hypothesis testing, namely pre‐network and node network permutation approaches. Although the pre‐network permutation approach appears more advantageous, its use has mainly been restricted to data on associations and sampling methods such as ‘group follows’. The pre‐network permutation approach has recently been adapted to data on interactions and the focal sampling method, but its performance in different scenarios has not been thoroughly explored. Here, we assessed the performance of the pre‐network and node network permutation approach in several simulated scenarios based on proneness to fa…
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.
Measuring spectrally-resolved information transfer.
2020
Information transfer, measured by transfer entropy, is a key component of distributed computation. It is therefore important to understand the pattern of information transfer in order to unravel the distributed computational algorithms of a system. Since in many natural systems distributed computation is thought to rely on rhythmic processes a frequency resolved measure of information transfer is highly desirable. Here, we present a novel algorithm, and its efficient implementation, to identify separately frequencies sending and receiving information in a network. Our approach relies on the invertible maximum overlap discrete wavelet transform (MODWT) for the creation of surrogate data in t…
Measuring the clustering effect of BWT via RLE
2017
Abstract The Burrows–Wheeler Transform (BWT) is a reversible transformation on which are based several text compressors and many other tools used in Bioinformatics and Computational Biology. The BWT is not actually a compressor, but a transformation that performs a context-dependent permutation of the letters of the input text that often create runs of equal letters (clusters) longer than the ones in the original text, usually referred to as the “clustering effect” of BWT. In particular, from a combinatorial point of view, great attention has been given to the case in which the BWT produces the fewest number of clusters (cf. [5] , [16] , [21] , [23] ). In this paper we are concerned about t…
Structure of AP205 Coat Protein Reveals Circular Permutation in ssRNA Bacteriophages.
2016
We are thankful to the MAX-lab staff for their support during our visit at the synchrotron.; International audience; AP205 is a single-stranded RNA bacteriophage that has a coat protein sequence not similar to any other known single-stranded RNA phage. Here, we report an atomic-resolution model of the AP205 virus-like particle based on a crystal structure of an unassembled coat protein dimer and a cryo-electron microscopy reconstruction of the assembled particle, together with secondary structure information from site-specific solid-state NMR data. The AP205 coat protein dimer adopts the conserved Leviviridae coat protein fold except for the N-terminal region, which forms a beta-hairpin in …
Identifying Prognostic SNPs in Clinical Cohorts: Complementing Univariate Analyses by Resampling and Multivariable Modeling
2016
Clinical cohorts with time-to-event endpoints are increasingly characterized by measurements of a number of single nucleotide polymorphisms that is by a magnitude larger than the number of measurements typically considered at the gene level. At the same time, the size of clinical cohorts often is still limited, calling for novel analysis strategies for identifying potentially prognostic SNPs that can help to better characterize disease processes. We propose such a strategy, drawing on univariate testing ideas from epidemiological case-controls studies on the one hand, and multivariable regression techniques as developed for gene expression data on the other hand. In particular, we focus on …
Magic informationally complete POVMs with permutations
2017
Eigenstates of permutation gates are either stabilizer states (for gates in the Pauli group) or magic states, thus allowing universal quantum computation [M. Planat and Rukhsan-Ul-Haq, Preprint 1701.06443]. We show in this paper that a subset of such magic states, when acting on the generalized Pauli group, define (asymmetric) informationally complete POVMs. Such IC-POVMs, investigated in dimensions $2$ to $12$, exhibit simple finite geometries in their projector products and, for dimensions $4$ and $8$ and $9$, relate to two-qubit, three-qubit and two-qutrit contextuality.
B cell immunosenescence: different features of naive and memory B cells in elderly.
2011
Elderly people show a reduced protection against new infections and a decreased response to vaccines as a consequence of impairment of both cellular and humoral immunity. In this paper we have studied memory/naive B cells in the elderly, evaluating surface immunoglobulin expression, production of the pro- and anti-inflammatory cytokines, tumor necrosis factor (TNF)-α and interleukin (IL)-10, and presence of somatic hypermutation, focusing on the IgG(+)IgD(-)CD27(-) double negative (DN) B cells that are expanded in the elderly. Our results show that naive B cells from young donors need a sufficiently strong stimulus to be activated "in vitro", while naive B cells from old subjects are able t…