Results 161 to 170 of about 1,660,013 (253)
CDegSR, a new tool for imaging RNA at single molecule level in living cells was developed by researchers. Background noise was eliminated by protein engineering and making it degrade when not bound to its target. This allowed individual RNA molecules to be clearly imaged and tracked.
Shipeng Shao, Hongchen Zhang
wiley +1 more source
TECTB Variants Reveal Tectorial Membrane Vulnerability in Dominant Non‐Syndromic Hearing Loss
TECTB is a non‐collagenous protein of the tectorial membrane – an extracellular matrix of the cochlea. This study identifies dominant missense variants in TECTB linked to human hereditary deafness in two unrelated families. Genetically engineered mice homozygous for one of the variants are profoundly deaf, whereas heterozygous mice have normal hearing ...
Evan B. Hale +23 more
wiley +1 more source
Generated graph instances for vertex cover kernelization
This research data includes 519 random graphs generated with the Erdos-Renyi, Rmat and Barabasi-Albert generator of the python package NetworKit. These graph instances were generated during the work on my master's thesis "On Matching Theory and practice ...
Dörr, Lisa-Madeleine Maren
core +1 more source
A new class of lysosome‐directed molecular glue degraders selectively enhance CAPRIN1–APP interactions, driving APP degradation and reducing amyloid‐β production in human neurons and Alzheimer's disease mouse models. This CAPRIN1‐dependent targeted protein degradation strategy reveals a previously unrecognized therapeutic approach for disrupting the ...
Sunghan Jung +15 more
wiley +1 more source
Based on genome size‐functional breadth theory, we introduce and validate a framework that adjudicates conflicting average genome size (AGS) estimates by testing which estimate yields a gap between scaled functional diversity and scaled taxonomic diversity that is consistent with the expected positive association between genome size and gene functional
Huanhuan Zhu +8 more
wiley +1 more source
Vertex cover approximations on random graphs
The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2 − o(1). In this paper, we use a collection of simple graph transformations, each of which guarantees an approximation ratio of 3 2 , to ...
Cliff Stein, Eyjolfur Asgeirsson
core
A novel geometry‐resolved membrane platform provides a seamlessly integrated pipeline for studying curvature‐sensing proteins. By linking shotgun proteomics with quantitative imaging, this approach enables both the unbiased discovery and rigorous validation of novel sensors across the entire curvature range—positive, negative, and zero.
Takumi Komikawa +6 more
wiley +1 more source
Engineering Borophene Band Structure Through Thickness
Borophene grown on W(110) shows a thickness‐dependent evolution of its structural and electronic properties. Surface microscopy, diffraction, XPS, and ARPES reveal distinct monolayer and bilayer phases. The formation of the second layer is accompanied by structural reconstruction, changes in chemical properties, and new ARPES features, demonstrating ...
Matteo Jugovac +4 more
wiley +1 more source
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 +15 more
wiley +1 more source
Vertex cover number in diverse graph architectures
Finding a minimum-sized set of vertices in a graph such that each edge in the graph is incident to at least one vertex in the set is the objective of the study of vertex cover problem. Mathematically, a vertex cover of a graph G is a set S of vertices in
R. Sundara Rajan +3 more
core +1 more source

