Results 71 to 80 of about 7,570 (298)

Implementation of quantum permutation algorithm with classical light

open access: yes, 2019
We report the experimental implementation of quantum permutation algorithm using polarization and orbital angular momentum of the classical optical beam. The easy-handling optical setup to realize all eight cyclic permutation transformations for an input
Zhang, Shihao   +4 more
core   +1 more source

Generalized triangulations, pipe dreams, and simplicial spheres [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
We exhibit a canonical connection between maximal $(0,1)$-fillings of a moon polyomino avoiding north-east chains of a given length and reduced pipe dreams of a certain permutation.
Luis Serrano, Christian Stump
doaj   +1 more source

The ubiquitin‐proteasome system and autophagy as guardians of the cellular proteome

open access: yesFEBS Letters, EarlyView.
This Perspective covers the three principles governing the crosstalk between the ubiquitin‐proteasome system and autophagy in cellular proteostasis: (1) a shared ubiquitin code routing substrates via shuttle factors or autophagy receptors; (2) spatial compartmentalization into phase‐separated degradation hubs and organelle‐specific modules (exemplified
Ivan Dikic
wiley   +1 more source

Centralizers of automorphisms permuting free generators

open access: yesOpen Mathematics, 2019
By σ ∈ Skm we denote a permutation of the cycle-type km and also the induced automorphism permuting subscripts of free generators in the free group Fkm.
Macedońska Olga, Tomaszewski Witold
doaj   +1 more source

Subtype‐specific enhancer RNAs define transcriptional regulators and prognosis in breast cancers

open access: yesMolecular Oncology, EarlyView.
This study employed machine learning methodologies to perform the subtype‐specific classification of RNA‐seq data sets, which are mapped on enhancers from TCGA‐derived breast cancer patients. Their integration with gene expression (referred to as ProxCReAM eRNAs) and chromatin accessibility profiles has the potential to identify lineage‐specific and ...
Aamena Y. Patel   +6 more
wiley   +1 more source

Gorenstein tiled orders

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2014
The aim of this article is to describe exponent matrices of Gorenstein tiled orders. The necessary and sufficient condition for possibility such to construct a Gorenstein tiled order which has given orders over some discrete valuation ring (the unique ...
V. Kiricenko   +4 more
doaj   +1 more source

Comparative analysis of methods for identifying recurrent copy number alterations in cancer. [PDF]

open access: yesPLoS ONE, 2012
Recurrent copy number alterations (CNAs) play an important role in cancer genesis. While a number of computational methods have been proposed for identifying such CNAs, their relative merits remain largely unknown in practice since very few efforts have ...
Xiguo Yuan   +4 more
doaj   +1 more source

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

open access: yesMolecular Oncology, EarlyView.
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson   +9 more
wiley   +1 more source

Modular Vector Invariants of Cyclic Permutation Representations

open access: yes, 1999
Vector invariants of finite groups (see the introduction for an explanation of the terminology) have often been used to illustrate the difficulties of invariant theory in the modular case: see, e.g., [1], [2], [4], [7], [11] and [12]. It is therefore all
Larry Smith
core   +1 more source

Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2022
We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation ...
Dilbarjot, Gosselin Shonda Dueck
doaj   +1 more source

Home - About - Disclaimer - Privacy