Results 61 to 70 of about 115,299 (267)

On permutations and permutation polytopes [PDF]

open access: yes, 1978
An easy characterization is given of neighbors on permutation polytopes. Using this characterization it is shown that the graph of any such polytope is Hamiltonian, and that the diameter is two.
openaire   +3 more sources

Safety of Daprodustat for the Treatment of Chronic Kidney Disease Anemia: Final Analysis of a Multicenter Postmarketing Surveillance Study in Japan

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction This final analysis of a multicenter, prospective postmarketing surveillance study evaluated the safety of daprodustat in patients with chronic kidney disease anemia in routine clinical practice in Japan. Methods Patients who initiated daprodustat between September 2020 and July 2022 were registered.
Tadao Akizawa   +7 more
wiley   +1 more source

A new generation tree for permutations, preserving the number of fixed points [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
We describe a new uniform generation tree for permutations with the specific property that, for most permutations, all of their descendants in the generation tree have the same number of fixed points.
Philippe Duchon, Romaric Duvignau
doaj   +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

Relaxed Agreement Forests of Phylogenetic Trees

open access: yesJournal of Graph Algorithms and Applications
The phylogenetic inference process can produce, for multiple reasons, conflicting hypotheses of the evolutionary history of a set X of biological entities, i.e., phylogenetic trees with the same set of leaf labels X but with distinct topologies.
Virginia Ardevol Martinez   +5 more
doaj   +1 more source

On Minimal Strings Containing the Elements of S_n by Decimation [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2001
The permutations by decimation problem is thought to be applicable to computer graphics, and raises interesting theoretical questions in combinatory theory.We present the results of some theoretical and practical investigation into this problem.We show ...
Robert Erra, Nik Lygeros, Nigel Stewart
doaj   +1 more source

Quasirandom permutations

open access: yesJournal of Combinatorial Theory, Series A, 2004
Chung and Graham define quasirandom subsets of $\mathbb{Z}_n$ to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of $\mathbb{Z}_n$ $ε$-balanced if its discrepancy on each interval is bounded by $εn$.
openaire   +4 more sources

Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system

open access: yesFEBS Letters, EarlyView.
Age‐dependent shifts in microbial communities engender shifts in microbial metabolite profiles. These in turn drive shifts in barrier surface permeability of the gut and brain and induce immune activation. When paired with preexisting age‐related chronic inflammation this increases the risk of neuroinflammation and neurodegenerative diseases.
Aaron Mehl, Eran Blacher
wiley   +1 more source

An efficient crossover design for thorough QT studies / Ein effizientes Crossover-Design für klinische Studien zur Untersuchung des QT-Intervalls

open access: yesGMS Medizinische Informatik, Biometrie und Epidemiologie, 2010
Background: Thorough QT studies are typically a requirement of the clinical development program for new investigational drugs. These studies are a major cost factor in early development.
Ring, Arne   +3 more
doaj  

Polyominoes determined by involutions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
A permutomino of size n is a polyomino determined by particular pairs $(\pi_1, \pi_2)$ of permutations of length $n$, such that $\pi_1(i) \neq \pi_2(i)$, for $1 \leq i \leq n$.
Filippo Disanto, Simone Rinaldi
doaj   +1 more source

Home - About - Disclaimer - Privacy