Results 61 to 70 of about 496,846 (263)
Mapping the evolution of mitochondrial complex I through structural variation
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
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]
There was an error with an alternative formula for b(n,3) that was on page ...
openaire +2 more sources
Harmonic analysis on a finite homogeneous space
In this paper, we study harmonic analysis on finite homogeneous spaces whose associated permutation representation decomposes with multiplicity. After a careful look at Frobenius reciprocity and transitivity of induction, and the introduction of three ...
Scarabotti, Fabio, Tolli, Filippo
core +1 more source
Organoids in pediatric cancer research
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
Counting king permutations on the cylinder [PDF]
Eli Bagno +3 more
doaj +1 more source
In recent years, many researchers have leveraged various memristors to design many novel memristive chaotic systems with complex dynamics. Compared with other chaotic systems, applying these memristive chaotic systems to image encryption is expected to ...
Kun Qian +6 more
doaj +1 more source
Covering n-Permutations with (n+1)-Permutations [PDF]
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
Permutation-invariant codes encoding more than one qubit
A permutation-invariant code on m qubits is a subspace of the symmetric subspace of the m qubits. We derive permutation-invariant codes that can encode an increasing amount of quantum information while suppressing leading order spontaneous decay errors ...
Fitzsimons, Joseph, Ouyang, Yingkai
core +1 more source
Reciprocal control of viral infection and phosphoinositide dynamics
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

