Results 131 to 140 of about 12,413 (296)

YlmG1 is localized exclusively to the chloroplast envelope membrane and is involved in preprotein translocation in Arabidopsis thaliana

open access: yesFEBS Open Bio, EarlyView.
Cytosolically synthesized chloroplast preproteins are translocated across the outer and inner envelope membranes through translocons called TOC and TIC, respectively. In green algae and plants, the TIC core is composed of essential membrane proteins, Tic12, Tic20, and Tic214.
Mengyi Li, Xueyang Zhao, Masato Nakai
wiley   +1 more source

Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types [PDF]

open access: yesComputer Science Journal of Moldova, 2003
We consider the coloring of edges in a graph in which there are vertices of three types. In a feasible edge coloring, each vertex of the first type is incident with at least two edges of the same color, and each vertex of the second type with at least ...
Zsolt Tuza, Vitaly Voloshin
doaj  

Evolutionarily divergent DUF4465 domains have a common vitamin B12‐binding function

open access: yesFEBS Open Bio, EarlyView.
We show that DUF4465 family proteins, widespread across bacteria from gut microbiomes, hydrothermal vents, and soil, share a common vitamin B12‐binding function. These augmented β‐jellyroll proteins bind vitamin B12 via extended loops. Our findings establish sequence‐diverse DUF4465 proteins as a widespread class of B12‐binding proteins, highlighting ...
Charlea Clarke   +4 more
wiley   +1 more source

Approximating the max-edge-coloring problem

open access: yes, 2009
The max-edge-coloring problem is a natural weighted generalization of the classical edge-coloring problem arising in the domain of communication systems.
Milis, Ioannis   +7 more
core   +2 more sources

Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs

open access: yesContemporary Mathematics and Applications (ConMathA)
Coloring graph is giving a color to a set of vertices and a set of edges on a graph. The condition for coloring a graph is that each color is different for each neighboring member graph.
Muhammad Usaid Hudloir   +4 more
doaj   +1 more source

Modular edge colorings of Mycielskian graphs [PDF]

open access: yesTransactions on Combinatorics, 2015
Let G be a connected graph of order 3 or more and c:E(G)→Z k ‎ ‎(k≥2 ) a k -edge coloring of G where adjacent edges may be colored the same‎. ‎The color sum s(v) of a vertex v of G is the sum in Z k of the colors of the edges incident with v.
N. Paramaguru, R. Sampathkumar
doaj  

Low-Memory Algorithms for Online Edge Coloring [PDF]

open access: yes
For edge coloring, the online and the W-streaming models seem somewhat orthogonal: the former needs edges to be assigned colors immediately after insertion, typically without any space restrictions, while the latter limits memory to be sublinear in the ...
Stoeckl, Manuel, Ghosh, Prantar
core   +1 more source

Large‐scale bidirectional arrayed genetic screens identify OXR1 and EMC4 as modifiers of αSynuclein aggregation

open access: yesFEBS Open Bio, EarlyView.
Activation of the mitochondrial protein OXR1 increases pSyn129 αSynuclein aggregation by lowering ATP levels and altering mitochondrial membrane potential, particularly in response to MSA‐derived fibrils. In contrast, ablation of the ER protein EMC4 enhances autophagic flux and lysosomal clearance, broadly reducing α‐synuclein aggregates.
Sandesh Neupane   +11 more
wiley   +1 more source

Molecular dynamics simulations of positively selected codons in FcγRI reveal novel biochemical binding properties

open access: yesFEBS Open Bio, EarlyView.
Evolutionary analysis across 32 placental mammals identified positive selection at residues H148 and W149 in the immune receptor FcγR1. Ancestral reconstruction combined with molecular dynamics simulations reveals how these mutations may influence receptor structure and dynamics, providing insight into the evolution of antibody recognition and immune ...
David A. Young   +7 more
wiley   +1 more source

Acyclic Edge Coloring Of Graphs [PDF]

open access: yes, 2010
A proper edge coloring of G =(V,E)is a map c : E → C (where C is the set of available colors ) with c(e) ≠ c(ƒ) for any adjacent edges e,f. The minimum number of colors needed to properly color the edges of G, is called the chromatic index of Gand is ...
Basavaraju, Manu
core  

Home - About - Disclaimer - Privacy