Zobrazeno 1 - 10
of 2 585
pro vyhledávání: '"Hoppen A"'
Autor:
Dominik Dluhosch, Lisa Sophie Kersten, Stephan Schott-Verdugo, Claudia Hoppen, Melanie Schwarten, Dieter Willbold, Holger Gohlke, Georg Groth
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-17 (2024)
Abstract Copper chaperones of the ATX1 family are found in a wide range of organisms where these essential soluble carriers strictly control the transport of monovalent copper across the cytoplasm to various targets in diverse cellular compartments t
Externí odkaz:
https://doaj.org/article/2ea017596ca742f9997a535d79d6ed67
Autor:
Allem, Luiz Emilio, Braga, Rodrigo Orsini, Hoppen, Carlos, Oliveira, Elismar da Rosa, Sibemberg, Lucas Siviero, Trevisan, Vilmar
Given a tree $T$, let $q(T)$ be the minimum number of distinct eigenvalues in a symmetric matrix whose underlying graph is $T$. It is well known that $q(T)\geq d(T)+1$, where $d(T)$ is the diameter of $T$, and a tree $T$ is said to be diminimal if $q
Externí odkaz:
http://arxiv.org/abs/2302.00835
Autor:
Frederike A. Straeten, Jan-Kolja Strecker, Anna-Lena Börsch, Bastian Maus, Maike Hoppen, Birgit Schmeddes, Lucia Härtel, Ann-Katrin Fleck, Stephanie van Zyl, Tabea Straeten, Carolin Beuker, Mailin Koecke, Louisa Mueller-Miny, Cornelius Faber, Gerd Meyer zu Hörste, Luisa Klotz, Jens Minnerup, Antje Schmidt-Pogoda
Publikováno v:
Frontiers in Neurology, Vol 15 (2024)
BackgroundA dietary supplementation with conjugated linoleic acid (CLA) was shown to attenuate inflammation and increase the proportions of circulating regulatory T cells (Tregs) and M2-type macrophages in disease models such as autoimmune encephalit
Externí odkaz:
https://doaj.org/article/2305f50d3f624403be9dc53471fd871e
For positive integers $n$ and $r$, we consider $n$-vertex graphs with the maximum number of $r$-edge-colorings with no copy of a triangle where exactly two colors appear. We prove that, if $2 \leq r \leq 26$ and $n$ is sufficiently large, the maximum
Externí odkaz:
http://arxiv.org/abs/2209.06991
Monolithic applications are being decomposed to a microservices architecture, aiming to improve maintainability, performance and modularization. Although such decompositions have now been widely carried out in the industry, little is reported in the
Externí odkaz:
http://arxiv.org/abs/2203.13878
Autor:
Magdalena Kremer, Sabrina Schulze, Nadja Eisenbruch, Felix Nagel, Robert Vogt, Leona Berndt, Babett Dörre, Gottfried J. Palm, Jens Hoppen, Britta Girbardt, Dirk Albrecht, Susanne Sievers, Mihaela Delcea, Ulrich Baumann, Karin Schnetz, Michael Lammers
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-25 (2024)
Abstract The Escherichia coli TetR-related transcriptional regulator RutR is involved in the coordination of pyrimidine and purine metabolism. Here we report that lysine acetylation modulates RutR function. Applying the genetic code expansion concept
Externí odkaz:
https://doaj.org/article/23d1a0b42fe14e67aa42c7c445204f48
Let $M=(m_{ij})$ be a symmetric matrix of order $n$ whose elements lie in an arbitrary field $\mathbb{F}$, and let $G$ be the graph with vertex set $\{1,\ldots,n\}$ such that distinct vertices $i$ and $j$ are adjacent if and only if $m_{ij} \neq 0$.
Externí odkaz:
http://arxiv.org/abs/2109.02515
Publikováno v:
In Discrete Mathematics April 2024 347(4)
Given integers $r \geq 2$, $k \geq 3$ and $2 \leq s \leq \binom{k}{2}$, and a graph $G$, we consider $r$-edge-colorings of $G$ with no copy of a complete graph $K_k$ on $k$ vertices where $s$ or more colors appear, which are called $\mathcal{P}_{k,s}
Externí odkaz:
http://arxiv.org/abs/2103.11892
Let $S_k(n)$ be the maximum number of orientations of an $n$-vertex graph $G$ in which no copy of $K_k$ is strongly connected. For all integers $n$, $k\geq 4$ where $n\geq 5$ or $k\geq 5$, we prove that $S_k(n) = 2^{t_{k-1}(n)}$, where $t_{k-1}(n)$ i
Externí odkaz:
http://arxiv.org/abs/2101.12327