Results 91 to 100 of about 971,776 (299)
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
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
Extremal Topological Indices with Prescribed Degree Sequences
Vestnik KRAUNC: Fiziko-Matematičeskie NaukiThis paper explores the extremal properties and bounds of two significant topological indices in graph theory: the Albertson and Sigma indices, with an emphasis on trees and bipartite graphs.
Hamoud, J., Belov, A.Ya.
doaj +1 more source
Geometric randomization of real networks with prescribed degree sequence
New Journal of Physics, 2019 We introduce a model for the randomization of complex networks with geometric structure. The geometric randomization (GR) model assumes a homogeneous distribution of the nodes in a hidden similarity space and uses rewirings of the links to find ...
Michele Starnini +2 more
doaj +1 more source
Functional conservation of sequence determinants at rapidly evolving regulatory regions across mammals. [PDF]
PLoS Computational Biology, 2018 Recent advances in epigenomics have made it possible to map genome-wide regulatory regions using empirical methods. Subsequent comparative epigenomic studies have revealed that regulatory regions diverge rapidly between genome of different species, and ...
Iksoo Huh +3 more
doaj +1 more source
On a degree sequence analogue of Pósa’s conjecture [PDF]
, 2015 A famous conjecture of Pósa from 1962 asserts that every graph on n vertices and with minimum degree at least 2n/3 contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Komlós, Sárközy and Szemerédi [Komlós, J., G.
Staden, Katherine, Treglown, Andrew
core +1 more source
FEBS Letters, EarlyView.Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes +4 more
wiley +1 more source
New Bounds For Degree Sequence Of Graphs [PDF]
Computer Science Journal of Moldova, 2019 Let $G = (V, E)$ be a simple graph with $n$ vertices, $m$ edges, and vertex degrees $d_1, d_2, ..., d_n$. Let $d_1, d_n$ be the maximum and and minimum degree of vertices. In this paper, we present lower and upper bounds for $\sum_{i=1}^{n}d_i^{2}$ and
Akbar Jahanbani
doaj
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
A permutation method for network assembly.
PLoS ONE, 2020 We present a method for assembling directed networks given a prescribed bi-degree (in- and out-degree) sequence. This method utilises permutations of initial adjacency matrix assemblies that conform to the prescribed in-degree sequence, yet violate the ...
Shawn A Means +2 more
doaj +1 more source