Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Merz, Sarah"'
Autor:
Merz, Sarah, Breuning, Markus, Melzer, Michael Karl, Heller, Sandra, Wiedenmann, Sandra, Seufferlein, Thomas, Meier, Matthias, Krüger, Jana, Mulaw, Medhanie, Hohwieler, Meike, Kleger, Alexander
Publikováno v:
Theranostics. 13:1949-1973
Rationale: Pancreatic lineage specification follows the formation of tripotent pancreatic progenitors (PPs). Current protocols rebuilding PPs in vitro have an endocrine lineage bias and are mostly based on PDX1/NKX6-1 coexpression neglecting other ma
Autor:
Merz, Sarah, Kleger, Alexander
Publikováno v:
BioSpektrum; Nov2023, Vol. 29 Issue 7, p749-751, 3p
Autor:
Merz, Sarah, Senée, Valérie, Philippi, Anne, Oswald, Franz, Shaigan, Mina, Führer, Marita, Drewes, Cosima, Allgöwer, Chantal, Öllinger, Rupert, Heni, Martin, Boland, Anne, Deleuze, Jean-François, Birkhofer, Franziska, Gusmao, Eduardo G., Wagner, Martin, Hohwieler, Meike, Breunig, Markus, Rad, Roland, Siebert, Reiner, Messerer, David Alexander Christian, Costa, Ivan G., Alvarez, Fernando, Julier, Cécile, Kleger, Alexander, Heller, Sandra
Publikováno v:
Cell Reports; November 2024, Vol. 43 Issue: 11
Autor:
Melzer, Michael Karl, Breunig, Markus, Lopatta, Paul, Hohwieler, Meike, Merz, Sarah, Azoitei, Anca, Günes, Cagatay, Bolenz, Christian, Kleger, Alexander
Publikováno v:
In STAR Protocols 16 December 2022 3(4)
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Factor, Kim A.S., Merz, Sarah K.
Publikováno v:
Discrete Applied Mathematics. 159(2-3):100-103
Autor:
Langley, Larry, Lundgren, J. Richard, McKenna, Patricia A., Merz, Sarah K., Rasmussen, Craig W.
Competition graphs were first introduced by Joel Cohen in the study of food webs and have been since extensively studied. Graphs which are the competition graph of a strongly connected or Hamiltonian digraph are of particular interest in applications
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::162a3f28bdb2713ccb6bb33695a3d034
https://hdl.handle.net/10945/45524
https://hdl.handle.net/10945/45524
Previous work on competition graphs has emphasized characterization, not only of the competition graphs themselves but also of those graphs whose competition graphs are chordal or interval. The latter sort of characterization is of interest when a co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::76861ad7a5eca9a98be99343b555eef7
https://hdl.handle.net/10945/28696
https://hdl.handle.net/10945/28696
One of the intriguing open problems on competition graphs is determining what digraphs have interval competition graphs. In this paper we consider this problem for the class of loopless symmetric digraphs. Here we first consider forbidden subgraph ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2778::57b06c256e6c0a40c637ada34933c67d
https://hdl.handle.net/10945/28695
https://hdl.handle.net/10945/28695
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.