Results 71 to 80 of about 886,685 (323)
Golgi enzymes are retrieved from the plasma membrane to the trans‐Golgi network
Golgi enzymes are traditionally considered resident proteins retained within the Golgi apparatus. Here, we demonstrate that a subset transiently reaches the cell surface and is subsequently retrieved to the trans‐Golgi network via retrograde transport. Using a nanobody‐based toolkit, we uncover a dynamic trafficking cycle of several Golgi enzymes.
Dominik P. Buser, Tina Junne
wiley +1 more source
Encapsulins are protein nanocompartments that play an important role in iron storage. In the Myxococcus xanthus encapsulin system, two cargo proteins called EncB and EncC contribute to iron mineralization. Here, we show that EncB and EncC generate iron‐containing minerals with distinct chemical compositions, suggesting that the composition of stored ...
Harry B. McDowell +2 more
wiley +1 more source
Graph weights arising from Mayer and Ree-Hoover theories of virial expansions [PDF]
We study graph weights (i.e., graph invariants) which arise naturally in Mayer's theory and Ree-Hoover's theory of virial expansions in the context of a non-ideal gas.
Amel Kaouche, Pierre Leroux
doaj +1 more source
Embeddings of infinite graphs in surfaces (not necessarily compact) without boundary are considered. Cellular embeddings are studied in details. Each rotation system of a locally finite graph G gives rise to a cellular embedding of G into some surface, and every cellular embedding with all 2-cells of finite size can be obtained in this way.
openaire +2 more sources
Prospecting the protein design landscape
This review outlines the current state of various protein design approaches. We discuss the current possibilities enabled by recently released tools, highlight future avenues to pursue in protein design, and underscore the crucial role of key databases and resources for successful protein design workflows.
Jakob R. Riccabona +4 more
wiley +1 more source
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
A drawing of a graph in the plane is pseudolinear if the edges of the drawing can be extended to doubly-infinite curves that form an arrangement of pseudolines, that is, any pair of these curves crosses precisely once.
Oswin Aichholzer +4 more
doaj +1 more source
Reconstruction of infinite graphs
The paper surveys results concerning reconstruction and edge- reconstructon of infinite graphs and draws attention to several interesting unsolved problems.
openaire +2 more sources
On Graphs with Ramsey-Infinite Blocks
We write \(F\to (G,H)\) if when the edges of the graph F are colored red and blue either the red subgraph contains a copy of the graph G or the blue subgraph contains a copy of H. Then F is (G,H)-minimal if \(F\to (G,H)\) but for every subgraph F' of F we have \(F'\nrightarrow (G,H)\).
Stefan A. Burr +2 more
openaire +3 more sources
In the present work, we have identified a transcriptional signature based on the differential expression of six genes (BCL2&MAST4, HSH2D&LAT2, METRN&PITPNM2) that would facilitate the early detection of T‐cell acute lymphoblastic leukemia (T‐ALL) patients prone to a poor treatment response and could be implemented at diagnosis, along with other risk ...
Antonio Lahera +11 more
wiley +1 more source
We study the problem of designing layout facilities for the navigation of an "infinite" graph, i.e. a graph that is so large that its visualization is unfeasible, even by gluing together all the screen snapshots that a user can take during the ...
Maurizio Pizzonia +15 more
core +1 more source

