Results 91 to 100 of about 100,347 (247)

Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies

open access: yesFEBS Open Bio, EarlyView.
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli   +8 more
wiley   +1 more source

Super -edge antimagic total labeling of a subclass of trees

open access: yesAKCE International Journal of Graphs and Combinatorics, 2017
A graph labeling is a mapping that assigns numbers to graph elements. The domain can be the set of all vertices, the set of all edges or the set of all vertices and edges.
M. Javaid, A.A. Bhatti, M.K. Aslam
doaj   +1 more source

On Total H-Irregularity Strength of the Disjoint Union of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2020
A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha   +5 more
doaj   +1 more source

Functional Connectivity Linked to Cognitive Recovery After Minor Stroke

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri   +7 more
wiley   +1 more source

Odd harmonious labeling on the union of flower graphs

open access: yesDesimal
Applications of graph labeling in the fields of communication network addressing, database management, secret sharing schemes, and cryptology. Graphs that satisfy the odd harmonious labeling property are called odd harmonious graphs.
Fery Firmansah   +2 more
doaj   +1 more source

In‐Depth Profiling Highlights the Effect of Efgartigimod on Peripheral Innate and Adaptive Immune Cells in Myasthenia Gravis

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Myasthenia gravis (MG) is an autoimmune disorder characterized by antibody‐mediated complement activation. Efgartigimod, a neonatal Fc receptor (FcRn) antagonist, is approved for treating generalized MG (gMG). However, its modulatory effects on upstream innate and adaptive immune cells remain largely unexplored.
Lei Jin   +11 more
wiley   +1 more source

A Depolarizing Leak in Sodium Bicarbonate Cotransporter NBCe1 Causes Brain Edema

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objectives SLC4A4 encodes electrogenic sodium bicarbonate cotransporter NBCe1, prominently expressed in kidney and brain. Recessive loss‐of‐function variants in SLC4A4 cause proximal renal tubular acidosis, no brain edema. In the brain, NBCe1 is expressed by astrocytes, where it regulates pH and mediates astrocyte volume changes.
Quinty Bisseling   +16 more
wiley   +1 more source

Evaluation of the Potential of Laser Shock Peening Compared with Cold Expansion for Improving Fatigue Resistance of Riveted Lap Joints of Aerospace Grade 7175 Al Alloy

open access: yesAdvanced Engineering Materials, EarlyView.
This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar   +6 more
wiley   +1 more source

Edge Irregular Reflexive Labeling for Disjoint Union of Generalized Petersen Graph

open access: yesMathematics, 2018
A graph labeling is the task of integers, generally spoken to by whole numbers, to the edges or vertices, or both of a graph. Formally, given a graph G = ( V , E ) a vertex labeling is a capacity from V to an arrangement of integers. A graph with
Juan L. G. Guirao   +3 more
doaj   +1 more source

Prime Labelings of Snake Graphs

open access: yesThe PUMP Journal of Undergraduate Research, 2019
A prime labeling of a graph G with n vertices is a labeling of the vertices with distinct integers from the set {1, 2 ,..., n} such that the labels of any two adjacent vertices are relatively prime. In this paper, we introduce a snake graph, the fused union of identical cycles, and define a consecutive snake prime labeling for this new family of graphs.
Abigail Bigham   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy