Results 71 to 80 of about 2,972 (249)
Advanced Science, EarlyView.SKALE 2.0 maps disease‐associated protein aggregation as a phase‐resolved structural process, linking mutation‐induced geometric perturbations to nucleation, elongation, and suppressor design. Across neurodegenerative proteins, the framework reveals cryptic aggregation vulnerabilities, separates phase‐concordant and phase‐switching mutations, and ...
Jia Shen Sio +6 more
wiley +1 more source
Some results on Hamming graphs and an extended Hamming graphs
12 ...
Zafari, Ali, Alikhani, Saeid
openaire +2 more sources
Isometric embeddings in Hamming graphs
Journal of Combinatorial Theory, Series B, 1990 An \(O(n^ 3)\)-algorithm is established which embeds a given graph isometrically into a Hamming graph (i.e., a Cartesian product of complete graphs) whenever possible, and recognizes non-embeddable graphs. From the algorithm several characterizations of the embeddable graphs are derived.
openaire +2 more sources
Advanced Science, EarlyView.LRRK2‐mutant induced pluripotent stem cells (iPSCs) were derived from a patient with Parkinson's disease (PD). Using CRISPR/Cas9–mediated gene editing, the pathogenic LRRK2 mutations were precisely corrected, and isogenic dopaminergic neural progenitor cells (DA‐NPCs) were subsequently generated.
Qing Yan +29 more
wiley +1 more source
On a Conjecture Regarding Identification in Hamming Graphs
The Electronic Journal of Combinatorics, 2019 In 2013, Goddard and Wash studied identifying codes in the Hamming graphs $K_q^n$. They stated, for instance, that $\gamma^{ID}(K_q^n)\leqslant q^{n-1}$ for any $q$ and $n\geqslant 3$. Moreover, they conjectured that $\gamma^{ID}(K_q^3)=q^2$. In this article, we show that $\gamma^{ID}(K_q^3)\leqslant q^2-q/4$ when $q$ is a power of four, which ...
Ville Junnila +2 more
openaire +4 more sources
Advanced Science, EarlyView.In bladder cancer, LRG1 binds to ANXA2 to trigger mitochondrial ROS‐dependent NETosis. This pathogenic cascade actively uncouples endothelial‐mural cell interactions, driving profound vascular destabilization. Consequently, targeting the LRG1‐ANXA2 axis attenuates the neutrophil burden and induces structural vascular normalization, offering a powerful ...
Dongshan Chen +8 more
wiley +1 more source
Graphs and CombinatoricsThe Hamming graph $H(n,q)$ is defined on the vertex set $[q]^n$ and two vertices are adjacent if and only if they differ in precisely one coordinate. Alon \cite{Alon} proved that the burning number of $H(n,2)$ is $\lceil\frac n2\rceil+1$. In this note we give a short proof of a fact that the burning number of $H(n,q)$ is $(1-\frac 1q)n+O(\sqrt{n\log n})
openaire +3 more sources
On an isoperimetric problem for Hamming graphs
Discrete Applied Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Completely Transitive Codes in Hamming Graphs
European Journal of Combinatorics, 1999 A code \(C\) in the graph \(\Gamma\) is a non-empty subset of the vertex set \(V\) of \(\Gamma\). Completely transitive codes are a special class of completely regular codes. A code in the graph \(\Gamma\) is called a completely transitive code if there exists a subgroup \(G\) of the group of automorphisms of \(\Gamma\), such that each cell \(C_i\) in ...
Michael Giudici, Cheryl E. Praeger
openaire +2 more sources
Advanced Science, EarlyView.Primary cultures of neuroblasts isolated from the nucleus basalis of Meynert of 12‐weeks‐old human foetuses were prepared. Whole‐cell patch‐clamp recordings were performed by injecting a depolarizing stimulus current (+500 pA; 500 ms), and the membrane voltage recorded; this stimulus current evoked periodic‐like oscillations in membrane voltage ...
Elisabetta Coppi +9 more
wiley +1 more source