Results 41 to 50 of about 112,754 (257)

Antigen‐Detected NMR for Minimal Epitope Engineering and Structure‐Guided Selection of a NaV1.7‐Selective Nanobody

Advanced Science, EarlyView.
A minimal extracellular epitope from voltage‐gated sodium channel NaV1.7 was engineered into an isotope‐labelled antigen for antigen‐detected nuclear magnetic resonance (NMR). Together with AlphaFold2 (AF2), this enabled structure‐guided selection of R4C8, a human NaV1.7‐selective nanobody that labels fixed NaV1.7‐expressing cells and produces staining
Junyu Liu, Wanlin Chen, Ben Cristofori‐Armstrong, Theo Crawford, Kai‐En Chen, Peng Xie, Rainbow Wing Bo Chan, Yifei Zhu, Mimi Golder, Anneka Pereira Schmidt, Jennifer D. Naughton, Nicholas D. Condon, Åsa Andersson, Farhad Dehkhoda, Kirsten L. McMahon, Tabea Klasfauseweh, Ashvriya Thapa, Hue Tran, Poanna Tran, Sina Jami, Lotten Ragnarsson, Sebastian G. B. Furness, Jennifer R. Deuis, Brett M. Collins, Wai‐Hong Tham, Indira Prasadam, Irina Vetter, Mehdi Mobli   +27 more
wiley   +1 more source

Worm Colorings

Discussiones Mathematicae Graph Theory, 2015
Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a graph G and a graph F, we define an F-WORM coloring of G as
Goddard Wayne, Wash Kirsti, Xu Honghai
doaj   +1 more source

Bilangan Terhubung Titik Pelangi pada Graf Hasil Operasi Korona Graf Prisma (P_(m,2)) dan Graf Lintasan (P_3)

Jambura Journal of Mathematics, 2022
Rainbow vertex-connection number is the minimum k-coloring on the vertex graph G and is denoted by rvc(G). Besides, the rainbow-vertex connection number can be applied to some special graphs, such as prism graph and path graph.
Indrawati Lihawa, Sumarno Ismail, Isran K Hasan, Lailany Yahya, Salmun K Nasib, Nisky Imansyah Yahya   +5 more
doaj   +1 more source

Matrix Rigidity Mechanoprimes Microglia for Inflammation Through Cytoskeletal‐to‐Nuclear Signaling and 3D Spatio‐Epigenomic Remodeling

Advanced Science, EarlyView.
Pathological tissue rigidity mechanoprimes microglia by enhancing actin cytoskeleton–nucleus coupling and chromatin opening at rigidity‐responsive cis‐regulatory elements (mechanoCREs). Subsequent NF‐κB/p65 signaling converges on this permissive regulatory state to amplify inflammatory gene expression and microglial activation.
Yu Xuan Meng, Jaegeon Joo, Yu Meng Li, Cheng Ji Li, Ali Taghizadeh, Seung Jae Shin, Buuvee Bayarkhangai, Tae‐Woo Ha, Sak Lee, Jaewoo Chung, Bo‐Eun Yoon, Hye Sung Kim, Inkyung Jung, Jung‐Hwan Lee, Kam W. Leong, Hae‐Won Kim   +15 more
wiley   +1 more source

THE LOCATING RAINBOW EDGE CONNECTION NUMBERS OF SOME GENERALIZED SUN GRAPHS

Barekeng
Throughout this paper, G denotes a finite, simple, connected, and undirected graph. The concept of the locating rainbow edge connection number is motivated by the concept of the locating rainbow connection number in which the coloring is assigned to ...
Muhammad Ahnaf Yusuf, A. N. M. Salman, Mukayis Mukayis   +2 more
doaj   +1 more source

The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths

Electronic Journal of Graph Theory and Applications, 2020
An edge-colored graph G is rainbow k-connected, if there are k-internally disjoint rainbow paths connecting every pair of vertices of G. The rainbow k-connection number of G, denoted by rck(G), is the minimum number of colors needed for which there ...
Bety Hayat Susanti, A.N.M. Salman, Rinovia Simanjuntak   +2 more
doaj   +1 more source

Transposable Element Dynamics Drive the Genomic Evolution and Phenotypic Diversification of Allotetraploid Common Carp

Advanced Science, EarlyView.
By integrating 516 whole‐genome resequencing datasets and 236 transcriptomes of allotetraploid common carp, this study establishes the first population‐scale atlas of transposable element (TE) variation in teleost species. TE bursts, relaxed purifying selection, and lineage‐specific loss of ancient insertions shape genome evolution and phenotypic ...
Shuimu Hu, Zhou Jiang, Lin Chen, Gowena Ling Yi Goh, Weijing Li, Qian He, Xintong Chen, Rui Li, Yuxuan Liu, Ning Li, Tao Zhou, Peng Xu   +11 more
wiley   +1 more source

Graphs with 3-Rainbow Index n − 1 and n − 2

Discussiones Mathematicae Graph Theory, 2015
Let G = (V (G),E(G)) be a nontrivial connected graph of order n with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color.
Li Xueliang, Schiermeyer Ingo, Yang Kang, Zhao Yan   +3 more
doaj   +1 more source

Q‐LEAP: Millisecond Hyperdimensional Optimization for Full‐Spectrum Optical Metamaterials

Advanced Science, EarlyView.
Q‐LEAP integrates physics‐informed residual machine learning with factorization‐machine‐encoded quantum annealing to design full‐spectrum optical metamaterials. It explores a 2108 design space and, in a single 2.56 ms annealing step, reaches 85.83% of the theoretical FoM limit, enabling selective 5‐8 µm emission with 3–5 and 8–14 µm suppression and ∼40×
Zikang Guo, Yunwen Wu, Yuhui Guo, Shenghong Ju   +3 more
wiley   +1 more source

Analysis of Rainbow Vertex Antimagic Coloring and its Application to Cryptographic Secret Sharing with Affine Cipher Technique

JTAM (Jurnal Teori dan Aplikasi Matematika)
Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik, Iftitahul Firdausiyah, Robiatul Adawiyah, Ika Hesti Agustin, Indah Lutfiyatul Mursyidah, Marsidi Marsidi   +5 more
doaj   +1 more source