Results 61 to 70 of about 629,769 (266)
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Image reconstruction algorithm based on variable atomic number matching pursuit
Journal of Algorithms & Computational Technology, 2017 As the most critical part of compressive sensing theory, reconstruction algorithm has an impact on the quality and speed of image reconstruction. After studying some existing convex optimization algorithms and greedy algorithms, we find that convex ...
Hongtu Zhao, Chong Chen, Chenxu Shi
doaj +1 more source
FEBS Letters, EarlyView.We identified a systemic, progressive loss of protein S‐glutathionylation—detected by nonreducing western blotting—alongside dysregulation of glutathione‐cycle enzymes in both neuronal and peripheral tissues of Taiwanese SMA mice. These alterations were partially rescued by SMN antisense oligonucleotide therapy, revealing persistent redox imbalance as ...
Sofia Vrettou, Brunhilde Wirth
wiley +1 more source
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
New Results on Graph Matching from Degree-Preserving Growth
MathematicsThe recently introduced model in S. R. Kharel et al.’s study [Degree-preserving network growth. Nature Physics 2022, 18, 100–106] uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence.
Péter L. Erdős +3 more
doaj +1 more source
The Maximum Number of Dominating Induced Matchings
Journal of Graph Theory, 2014 AbstractA matching M of a graph G is a dominating induced matching (DIM) of G if every edge of G is either in M or adjacent with exactly one edge in M. We prove sharp upper bounds on the number of DIMs of a graph G and characterize all extremal graphs.
Lin, Min Chih +3 more
openaire +3 more sources
Calpain small subunit homodimerization is robust and calcium‐independent
FEBS Letters, EarlyView.Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
Dominating induced matchings and other graph parameters
AKCE International Journal of Graphs and CombinatoricsA matching M in a graph G is an induced matching if the largest degree of the subgraph of G induced by M is equal to one. A dominating induced matching (DIM) of G is an induced matching that dominates every edge of G. It is well known that, if they exist,
A. Mahmoodi +3 more
doaj +1 more source
Molecular Oncology, EarlyView.A comprehensive genomic and proteomic analysis of cervical cancer revealed STK11 and STX3 as a potential biomarkers of chemoradiation resistance. Our study demonstrated EGFR as a therapeutic target, paving the way for precision strategies to overcome treatment failure and the DNA repair pathway as a critical mechanism of resistance.
Janani Sambath +13 more
wiley +1 more source
Extremal hypergraphs for matching number and domination number
Discrete Applied Mathematics, 2018 A matching in a hypergraph $\mathcal{H}$ is a set of pairwise disjoint hyperedges. The matching number $ (\mathcal{H})$ of $\mathcal{H}$ is the size of a maximum matching in $\mathcal{H}$. A subset $D$ of vertices of $\mathcal{H}$ is a dominating set of $\mathcal{H}$ if for every $v\in V\setminus D$ there exists $u\in D$ such that $u$ and $v$ lie in ...
Erfang Shan +3 more
openaire +3 more sources