Results 61 to 70 of about 12,413 (296)
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
On The Local Edge Antimagic Coloring of Corona Product of Path and Cycle
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2019 Let be a nontrivial and connected graph of vertex set and edge set . A bijection is called a local edge antimagic labeling if for any two adjacent edges and , where for . Thus, the local edge antimagic labeling induces a proper edge coloring of G if
Siti Aisyah +4 more
doaj +1 more source
Improved Streaming Edge Coloring [PDF]
Given a graph, an edge coloring assigns colors to edges so that no pairs of adjacent edges share the same color. We are interested in edge coloring algorithms under the W-streaming model.
Zhang, Tianyi +2 more
core +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
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
M2-Edge Colorings Of Cacti And Graph Joins
Discussiones Mathematicae Graph Theory, 2016 An edge coloring φ of a graph G is called an M2-edge coloring if |φ(v)| ≤ 2 for every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let 𝒦2(G) denote the maximum number of colors used in an M2-edge coloring of G.
Czap Július +2 more
doaj +1 more source
FEBS Letters, EarlyView.Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source
A note on compact and compact circular edge-colorings of graphs
Discrete Mathematics & Theoretical Computer Science, 2008 In the paper we study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models.
Dariusz Dereniowski, Adam Nadolski
doaj
Degenerate matchings and edge colorings [PDF]
Discrete Applied Mathematics, 2018 A matching $M$ in a graph $G$ is $r$-degenerate if the subgraph of $G$ induced by the set of vertices incident with an edge in $M$ is $r$-degenerate. Goddard, Hedetniemi, Hedetniemi, and Laskar (Generalized subgraph-restricted matchings in graphs, Discrete Mathematics 293 (2005) 129-138) introduced the notion of acyclic matchings, which coincide with ...
Baste, Julien, Rautenbach, Dieter
openaire +3 more sources
An Introduction to Fuzzy Edge Coloring [PDF]
, 2016 In this paper, a new concept of fuzzy edge coloring is introduced. The fuzzy edge coloring is an assignment of colors to edges of a fuzzy graph G. It is proper if no two strong adjacent edges of G will receive the same color.
K.S, Kanzul Fathima, Hussain R, Jahir
core +1 more source