Results 51 to 60 of about 1,141 (244)

Asymptotic Lattice Path Enumeration Using Diagonals [PDF]

Algorithmica, 2015
22 pages, full journal version as ...
Stephen Melczer, Marni Mishna
openaire   +3 more sources

Asymptotic enumeration of sparse 2‐connected graphs [PDF]

Random Structures & Algorithms, 2012
AbstractWe determine an asymptotic formula for the number of labelled 2‐connected (simple) graphs on n vertices and m edges, provided that m ‐ n →∞ and m = O(nlog n) as n →∞. This is the entire range of m not covered by previous results. The proof involves determining properties of the core and kernel of random graphs with minimum degree at least 2 ...
Graeme Kemkes, Cristiane M. Sato, Nicholas C. Wormald   +2 more
openaire   +2 more sources

On the asymptotic enumeration and limit shapes of monotone grid classes of permutations [PDF]

Discrete Mathematics & Theoretical Computer Science
We exhibit a procedure to asymptotically enumerate monotone grid classes of permutations. This is then applied to compute the asymptotic number of permutations in any connected one-corner class.
Noura Alshammari, David Bevan
doaj   +1 more source

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

Therapeutic 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, Kyomi Kanaya, Kiyomi Aizawa, Masanori Onoki, Hirofumi Ozeki, Kazuko Suzuki, Ai Hayashi, Tomohiko Asamura   +7 more
wiley   +1 more source

Asymptotic enumeration of partially ordered sets [PDF]

Pacific Journal of Mathematics, 1980
The author define the entropy function S( ρ)=Lim n- ∞ 2n −2 lnN (n, ρ ), where N(n, ρ ) is the number of distinct partial order relations which may be defined on a set of n elements such that a fraction ρ of the possible n(n−1)/2 pairs are comparable.We derive upper bounds to S(ρ) to show that S(ρ) .699.
openaire   +3 more sources

KDM7A and KDM1A inhibition suppresses tumour promoting pathways in prostate cancer

Molecular Oncology, EarlyView.
Treatment resistance is a major challenge for patients with advanced prostate cancer. This study examined an alternative approach to target the major prostate cancer‐promoting pathway by targeting epigenetic factors, whose levels are higher in tumours.
Jennie N Jeyapalan, Veronika M Metzler, Simone de Brot, Corinne L Woodcock, Anna E Harris, Jennifer Lothion‐Roy, Emeli M Nilsson, Atara Ntekim, Michael S Toss, Jenny L Persson, Francesca Khani, Brian D Robinson, Lorraine J Gudas, Emad Rakha, David M Heery, Catrin S Rutland, Nigel P Mongan   +16 more
wiley   +1 more source

Molecular dynamics simulations of positively selected codons in FcγRI reveal novel biochemical binding properties

FEBS Open Bio, EarlyView.
Evolutionary analysis across 32 placental mammals identified positive selection at residues H148 and W149 in the immune receptor FcγR1. Ancestral reconstruction combined with molecular dynamics simulations reveals how these mutations may influence receptor structure and dynamics, providing insight into the evolution of antibody recognition and immune ...
David A. Young, Omar Arias‐Gaguancela, Fiona Gibson, Morgan Grainger, Jodie Score, Amit Nathubhai, Mauricio Cafiero, Lee Richard Machado   +7 more
wiley   +1 more source

Optimizing photoexcitation conditions for time‐resolved X‐ray solution scattering experiments

FEBS Open Bio, EarlyView.
Time‐resolved X‐ray solution scattering (TR‐XSS) is a powerful technique to visualize how proteins change their structure in real time after light activation. Selecting the right laser photoexcitation conditions—fluence, excitation geometry, and sample refresh rate—is critical to maximize the experimental signal while avoiding unwanted side effects ...
Matteo Levantino
wiley   +1 more source

Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation

Journal of Graph Algorithms and Applications, 2005
In this article we define a canonical decomposition of rooted outerplanar maps into a spanning tree and a list of edges. This decomposition, constructible in linear time in the Word-RAM model, implies the existence of bijection between rooted ...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse   +2 more
doaj   +1 more source

A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems

International Journal of Adaptive Control and Signal Processing, Volume 39, Issue 3, Page 566-581, March 2025.
A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam, Anthony Siming Chen, Guido Herrmann   +2 more
wiley   +1 more source