Results 81 to 90 of about 48,244 (304)
A novel approach to understanding Parkinsonian cognitive decline using minimum spanning trees, edge cutting, and magnetoencephalography. [PDF]
Simon OB +5 more
europepmc +1 more source
A (2R,3R)‐butanediol dehydrogenase from Bacillus subtilis (BsBDH) is engineered for the enantioselective synthesis of 2‐hydroxycyclohexanone. A PASS computational design strategy is proposed to enhance the thermostability of BsBDH. Moreover, ESM‐1v combined with ISM is utilized for enhancing and inverting its stereoselectivity.
Haote Ding +5 more
wiley +1 more source
Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices
The minimum spanning tree (MST) problem is a fundamental problem in computer science and operations research, which has many real-life network design applications.
Zhang-Hua Fu +4 more
doaj +1 more source
Hyperbolic radial spanning tree
We define and analyze an extension to the $d$-dimensional hyperbolic space of the Radial Spanning Tree (RST) introduced by Baccelli and Bordenave in the two-dimensional Euclidean space (2007). In particular, we will focus on the description of the infinite branches of the tree.
Coupier, David +2 more
openaire +4 more sources
Bacterial α‐diversity decreases, but stochasticity and community stability increase across the 15 m‐depth vertical profiles and along the degraded gradient within the active layer. The abundance and interaction of core taxa mainly control community stability in the active and permafrost layers, respectively.
Shengyun Chen +13 more
wiley +1 more source
Heuristically Adaptive Diffusion‐Model Evolutionary Strategy
Building on the mathematical equivalence between diffusion models and evolutionary algorithms, researchers demonstrate unprecedented control over evolutionary optimization through conditional diffusion. By training diffusion models to associate parameters with specific traits, they can guide evolution toward solutions exhibiting desired behaviors ...
Benedikt Hartl +3 more
wiley +1 more source
Enumeration of spanning trees in the sequence of Dürer graphs
In this paper, we calculate the number of spanning trees in the sequence of Dürer graphs with a special feature that it has two alternate states. Using the electrically equivalent transformations, we obtain the weights of corresponding equivalent graphs ...
Li Shixing
doaj +1 more source
This study presents the first telomere‐to‐telomere genomes and population resources for Diaporthe pathogens, uncovering the largest known fungal repertoire of secondary metabolite gene clusters. Structural variations and horizontal gene transfer drive cluster diversification, while specific rapidly evolving clusters control virulence, offering novel ...
Kainan Li +9 more
wiley +1 more source
Endocytic Control of Cell‐Autonomous and Non‐Cell‐Autonomous Functions of p53
NUMB Ex3‐containing isoforms localize to the plasma membrane, where they recruit p53 through SNX9 and direct it to multivesicular bodies and exosomes. Exported p53 is taken up by neighboring cells and activates nuclear programs, revealing an intercellular, exosome‐based pathway that might help establish a tumor‐suppressive microenvironment.
Roberta Cacciatore +20 more
wiley +1 more source
Optimal Communication Spanning Tree [PDF]
Jainor Nestor Cardenas Choque
openalex +1 more source

