Results 81 to 90 of about 179,193 (249)

Lipopolysaccharide uptake is augmented in lipopolysaccharide‐tolerant mouse macrophage‐like cells via increased CD14 expression

open access: yesFEBS Open Bio, EarlyView.
In normal (nontolerant) cells, CD14 is crucial for both LPS uptake and LPS signaling. In LPS‐tolerant cells, in which LPS‐induced TNF‐α and IFN‐β production is suppressed, there is a dramatic increase in surface CD14 expression. The overexpressed CD14 in LPS‐tolerant cells is responsible for the enhanced LPS uptake without inducing pro‐inflammatory ...
Saeka Nishihara   +3 more
wiley   +1 more source

Minutes, Bucks Harbor Packing Company, 1882-1898 [PDF]

open access: yes, 1882
Record book for the Bucks Harbor Packing Company, a sardine Packing factory in Machiasport, Maine containing regular meeting minutes. Lists the original shareholders of the company within the initial agreement to incorporate.
Bucks Harbor Packing Company
core  

Molecular characterization of covRS mutations in M1UK Streptococcus pyogenes

open access: yesFEBS Open Bio, EarlyView.
Group A Streptococcus (GAS) acquires covRS mutations driving a hypervirulent bacterial state, frequently associated with invasive disease‐like necrotizing fasciitis. We demonstrate that the newly emerged M1UK GAS lineage can also acquire these mutations.
Jarrad Pritchard   +12 more
wiley   +1 more source

Evaluating the involvement of autolysosomes in the nuclear translocation of fluorescent proteins

open access: yesFEBS Open Bio, EarlyView.
Endogenously expressed fluorescent proteins can be degraded by autophagy and transported to cell nuclei via the nuclear pore complex. But in some cell lines, for example, HeLa cells which are positive for immunoreactivity of a receptor ligand, such as UCN I, in cell nuclei, fusion of autolysosome with the nuclear envelope is involved in the nuclear ...
Keiichi Ikeda
wiley   +1 more source

On S-Packing Coloring of Subcubic Graphs [PDF]

open access: yes
Given a sequence $S = (s_1, s_2, \ldots, s_k)$ of positive integers with $s_1 \leq s_2 \leq \ldots \leq s_k$, an $S$-packing coloring of a graph $G$ is a partition of $V(G)$ into $k$ subsets $V_1, V_2, \ldots, V_k$ such that for each $1 \leq i \leq k ...
Bazzal, Hadeel Al
core   +1 more source

MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis

open access: yesFEBS Open Bio, EarlyView.
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss   +7 more
wiley   +1 more source

Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem [PDF]

open access: yes
We present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one-dimensional bin-packing algorithms.
Frenk, J.B.G., Galambos, G.
core  

Importin 7 mediates the nuclear import of HIV‐1 integrase via a specific interacting interface

open access: yesFEBS Open Bio, EarlyView.
HIV‐1 integrase enables viral DNA integration into the host genome. By binding to the core domain of the host protein Importin 7 via its C‐terminal domain, the integrase is transported across the nuclear membrane into the nucleus, where integration of the viral genome into host DNA takes place. This translocation is a critical step for subsequent viral
Juana Bana   +5 more
wiley   +1 more source

Dichotomies properties on computational complexity of S-packing coloring problems

open access: yes, 2014
International audienceThis work establishes the complexity class of several instances of the S-packing coloring problem: for a graph G, a positive integer k and a non decreasing list of integers S = (s_1 , ..., s_k ), G is S-colorable, if its vertices ...
Gastineau, Nicolas, Nicolas Gastineau
core  

(d, n)-packing coloring of generalized Sierpiński graphs [PDF]

open access: yes, 2019
V magistrski nalogi so opisani grafi Sierpińskega in njihove posplošitve, (d, n)-pakirno barvanje grafov ter računsko iskanje (d, n)-pakirnih kromatičnih števil. Razvili smo algoritem za generiranje grafov Sierpińskega z osnovo 4 ter implementirali štiri
Jeromel, Anže
core  

Home - About - Disclaimer - Privacy