---
_id: '3882'
abstract:
- lang: eng
  text: 'We study infinite stochastic games played by two players over a finite state
    space, with objectives specified by sets of infinite traces. The games are concurrent
    (players make moves simultaneously and independently), stochastic (the next state
    is determined by a probability distribution that depends on the current state
    and chosen moves of the players) and infinite (proceed for an infinite number
    of rounds). The analysis of concurrent stochastic games can be classified into:
    quantitative analysis, analyzing the optimum value of the game and epsilon-optimal
    strategies that ensure values within epsilon of the optimum value; and qualitative
    analysis, analyzing the set of states with optimum value 1 and epsilon-optimal
    strategies for the states with optimum value 1. We consider concurrent games with
    tail objectives, i.e., objectives that are independent of the finite-prefix of
    traces, and show that the class of tail objectives is strictly richer than that
    of the omega-regular objectives. We develop new proof techniques to extend several
    properties of concurrent games with omega-regular objectives to concurrent games
    with tail objectives. We prove the positive limit-one property for tail objectives.
    The positive limit-one property states that for all concurrent games if the optimum
    value for a player is positive for a tail objective Phi at some state, then there
    is a state where the optimum value is 1 for the player for the objective Phi.
    We also show that the optimum values of zero-sum (strictly conflicting objectives)
    games with tail objectives can be related to equilibrium values of nonzerosum
    (not strictly conflicting objectives) games with simpler reachability objectives.
    A consequence of our analysis presents a polynomial time reduction of the quantitative
    analysis of tail objectives to the qualitative analysis for the subclass of one-player
    stochastic games (Markov decision processes). '
acknowledgement: A preliminary version of the paper appeared in Computer Science Logic
  (CSL) 2006.
author:
- first_name: Krishnendu
  full_name: Krishnendu Chatterjee
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
citation:
  ama: Chatterjee K. Concurrent games with tail objectives. <i>Theoretical Computer
    Science</i>. 2007;388(1-3):181-198. doi:<a href="https://doi.org/10.1016/j.tcs.2007.07.047">10.1016/j.tcs.2007.07.047</a>
  apa: Chatterjee, K. (2007). Concurrent games with tail objectives. <i>Theoretical
    Computer Science</i>. Elsevier. <a href="https://doi.org/10.1016/j.tcs.2007.07.047">https://doi.org/10.1016/j.tcs.2007.07.047</a>
  chicago: Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives.” <i>Theoretical
    Computer Science</i>. Elsevier, 2007. <a href="https://doi.org/10.1016/j.tcs.2007.07.047">https://doi.org/10.1016/j.tcs.2007.07.047</a>.
  ieee: K. Chatterjee, “Concurrent games with tail objectives,” <i>Theoretical Computer
    Science</i>, vol. 388, no. 1–3. Elsevier, pp. 181–198, 2007.
  ista: Chatterjee K. 2007. Concurrent games with tail objectives. Theoretical Computer
    Science. 388(1–3), 181–198.
  mla: Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives.” <i>Theoretical
    Computer Science</i>, vol. 388, no. 1–3, Elsevier, 2007, pp. 181–98, doi:<a href="https://doi.org/10.1016/j.tcs.2007.07.047">10.1016/j.tcs.2007.07.047</a>.
  short: K. Chatterjee, Theoretical Computer Science 388 (2007) 181–198.
date_created: 2018-12-11T12:05:41Z
date_published: 2007-12-05T00:00:00Z
date_updated: 2021-01-12T07:52:56Z
day: '05'
doi: 10.1016/j.tcs.2007.07.047
extern: 1
intvolume: '       388'
issue: 1-3
month: '12'
page: 181 - 198
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '2290'
quality_controlled: 0
status: public
title: Concurrent games with tail objectives
type: journal_article
volume: 388
year: '2007'
...
---
_id: '3883'
abstract:
- lang: eng
  text: We consider games where the winning conditions are disjunctions (or dually,
    conjunctions) of parity conditions; we call them generalized parity games. These
    winning conditions, while omega-regular, arise naturally when considering fair
    simulation between parity automata, secure equilibria for parity conditions, and
    determinization of Rabin automata. We show that these games retain the computational
    complexity of Rabin and Streett conditions; i.e., they are NP-complete and co-NP-complete,
    respectively. The (co-) NP-hardness is proved for the special case of a conjunction/disjunction
    of two parity conditions, which is the case that arises in fair simulation and
    secure equilibria. However, considering these games as Rabin or Streett games
    is not optimal. We give an exposition of Zielonka's algorithm when specialized
    to this kind of games. The complexity of solving these games for k parity objectives
    with d priorities, n states, and m edges is O(n(2kd) (.) m) (.) (k(.)d)!/ d!(k),
    as compared to O(n(2kd .) m) - (k (.) d)! when these games are solved as Rabin/Streett
    games. We also extend the subexponential algorithm for solving parity games recently
    introduced by Jurdzinski, Paterson, and Zwick to generalized parity games. The
    resulting complexity of solving generalized parity games is n(O(root n)) (.) (k(.)d)!/d!(k).
    As a corollary we obtain an improved ald!k gorithm for Rabin and Streett games
    with d pairs, with time complexity n(O(root n)) (.) d!.
acknowledgement: This research was supported in part by the Swiss National Science
  Foundation, and by the NSF grants CCR-0225610 and CCR-0234690.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
  full_name: Krishnendu Chatterjee
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Thomas A
  full_name: Thomas Henzinger
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Nir
  full_name: Piterman, Nir
  last_name: Piterman
citation:
  ama: 'Chatterjee K, Henzinger TA, Piterman N. Generalized parity games. In: Vol
    4423. Springer; 2007:153-167. doi:<a href="https://doi.org/10.1007/978-3-540-71389-0_12">10.1007/978-3-540-71389-0_12</a>'
  apa: 'Chatterjee, K., Henzinger, T. A., &#38; Piterman, N. (2007). Generalized parity
    games (Vol. 4423, pp. 153–167). Presented at the FoSSaCS: Foundations of Software
    Science and Computation Structures, Springer. <a href="https://doi.org/10.1007/978-3-540-71389-0_12">https://doi.org/10.1007/978-3-540-71389-0_12</a>'
  chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Generalized
    Parity Games,” 4423:153–67. Springer, 2007. <a href="https://doi.org/10.1007/978-3-540-71389-0_12">https://doi.org/10.1007/978-3-540-71389-0_12</a>.
  ieee: 'K. Chatterjee, T. A. Henzinger, and N. Piterman, “Generalized parity games,”
    presented at the FoSSaCS: Foundations of Software Science and Computation Structures,
    2007, vol. 4423, pp. 153–167.'
  ista: 'Chatterjee K, Henzinger TA, Piterman N. 2007. Generalized parity games. FoSSaCS:
    Foundations of Software Science and Computation Structures, LNCS, vol. 4423, 153–167.'
  mla: Chatterjee, Krishnendu, et al. <i>Generalized Parity Games</i>. Vol. 4423,
    Springer, 2007, pp. 153–67, doi:<a href="https://doi.org/10.1007/978-3-540-71389-0_12">10.1007/978-3-540-71389-0_12</a>.
  short: K. Chatterjee, T.A. Henzinger, N. Piterman, in:, Springer, 2007, pp. 153–167.
conference:
  name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
date_created: 2018-12-11T12:05:41Z
date_published: 2007-03-09T00:00:00Z
date_updated: 2021-01-12T07:52:56Z
day: '09'
doi: 10.1007/978-3-540-71389-0_12
extern: 1
intvolume: '      4423'
month: '03'
page: 153 - 167
publication_status: published
publisher: Springer
publist_id: '2287'
quality_controlled: 0
status: public
title: Generalized parity games
type: conference
volume: 4423
year: '2007'
...
---
_id: '3884'
abstract:
- lang: eng
  text: We introduce strategy logic, a logic that treats strategies in two-player
    games as explicit first-order objects. The explicit treatment of strategies allows
    us to specify properties of nonzero-sum games in a simple and natural way. We
    show that the one-alternation fragment of strategy logic is strong enough to express
    the existence of Nash equilibria and secure equilibria, and subsumes other logics
    that were introduced to reason about games, such as ATL, ATL*, and game logic.
    We show that strategy logic is decidable, by constructing tree automata that recognize
    sets of strategies. While for the general logic, our decision procedure is nonelementary,
    for the simple fragment that is used above we show that the complexity is polynomial
    in the size of the game graph and optimal in the size of the formula (ranging
    from polynomial to 2EXPTIME depending on the form of the formula).
alternative_title:
- LNCS
author:
- first_name: Krishnendu
  full_name: Krishnendu Chatterjee
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Thomas A
  full_name: Thomas Henzinger
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Nir
  full_name: Piterman, Nir
  last_name: Piterman
citation:
  ama: 'Chatterjee K, Henzinger TA, Piterman N. Strategy logic. In: Vol 4703. Schloss
    Dagstuhl - Leibniz-Zentrum für Informatik; 2007:59-73. doi:<a href="https://doi.org/10.1007/978-3-540-74407-8_5">10.1007/978-3-540-74407-8_5</a>'
  apa: 'Chatterjee, K., Henzinger, T. A., &#38; Piterman, N. (2007). Strategy logic
    (Vol. 4703, pp. 59–73). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl
    - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.1007/978-3-540-74407-8_5">https://doi.org/10.1007/978-3-540-74407-8_5</a>'
  chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy
    Logic,” 4703:59–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. <a
    href="https://doi.org/10.1007/978-3-540-74407-8_5">https://doi.org/10.1007/978-3-540-74407-8_5</a>.
  ieee: 'K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” presented
    at the CONCUR: Concurrency Theory, 2007, vol. 4703, pp. 59–73.'
  ista: 'Chatterjee K, Henzinger TA, Piterman N. 2007. Strategy logic. CONCUR: Concurrency
    Theory, LNCS, vol. 4703, 59–73.'
  mla: Chatterjee, Krishnendu, et al. <i>Strategy Logic</i>. Vol. 4703, Schloss Dagstuhl
    - Leibniz-Zentrum für Informatik, 2007, pp. 59–73, doi:<a href="https://doi.org/10.1007/978-3-540-74407-8_5">10.1007/978-3-540-74407-8_5</a>.
  short: K. Chatterjee, T.A. Henzinger, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2007, pp. 59–73.
conference:
  name: 'CONCUR: Concurrency Theory'
date_created: 2018-12-11T12:05:41Z
date_published: 2007-09-01T00:00:00Z
date_updated: 2023-02-23T11:45:56Z
day: '01'
doi: 10.1007/978-3-540-74407-8_5
extern: 1
intvolume: '      4703'
month: '09'
page: 59 - 73
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2286'
quality_controlled: 0
related_material:
  record:
  - id: '3861'
    relation: later_version
    status: public
status: public
title: Strategy logic
type: conference
volume: 4703
year: '2007'
...
---
_id: '3885'
abstract:
- lang: eng
  text: 'The theory of graph games with ω-regular winning conditions is the foundation
    for modeling and synthesizing reactive processes. In the case of stochastic reactive
    processes, the corresponding stochastic graph games have three players, two of
    them (System and Environment) behaving adversarially, and the third (Uncertainty)
    behaving probabilistically. We consider two problems for stochastic graph games:
    the qualitative problem asks for the set of states from which a player can win
    with probability 1 (almost-sure winning); and the quantitative problem asks for
    the maximal probability of winning (optimal winning) from each state. We consider
    ω-regular winning conditions formalized as Müller winning conditions. We present
    optimal memory bounds for pure almost-sure winning and optimal winning strategies
    in stochastic graph games with Müller winning conditions. We also present improved
    memory bounds for randomized almost-sure winning and optimal strategies.'
acknowledgement: This research was supported in part by the the AFOSR MURI grant F49620-00-1-
  0327, and the NSF grant CCR-0225610.
alternative_title:
- 'LNCS '
author:
- first_name: Krishnendu
  full_name: Krishnendu Chatterjee
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
citation:
  ama: 'Chatterjee K. Optimal strategy synthesis in stochastic Müller games. In: Vol
    4423. Springer; 2007:138-152. doi:<a href="https://doi.org/10.1007/978-3-540-71389-0_11">10.1007/978-3-540-71389-0_11</a>'
  apa: 'Chatterjee, K. (2007). Optimal strategy synthesis in stochastic Müller games
    (Vol. 4423, pp. 138–152). Presented at the FoSSaCS: Foundations of Software Science
    and Computation Structures, Springer. <a href="https://doi.org/10.1007/978-3-540-71389-0_11">https://doi.org/10.1007/978-3-540-71389-0_11</a>'
  chicago: Chatterjee, Krishnendu. “Optimal Strategy Synthesis in Stochastic Müller
    Games,” 4423:138–52. Springer, 2007. <a href="https://doi.org/10.1007/978-3-540-71389-0_11">https://doi.org/10.1007/978-3-540-71389-0_11</a>.
  ieee: 'K. Chatterjee, “Optimal strategy synthesis in stochastic Müller games,” presented
    at the FoSSaCS: Foundations of Software Science and Computation Structures, 2007,
    vol. 4423, pp. 138–152.'
  ista: 'Chatterjee K. 2007. Optimal strategy synthesis in stochastic Müller games.
    FoSSaCS: Foundations of Software Science and Computation Structures, LNCS , vol.
    4423, 138–152.'
  mla: Chatterjee, Krishnendu. <i>Optimal Strategy Synthesis in Stochastic Müller
    Games</i>. Vol. 4423, Springer, 2007, pp. 138–52, doi:<a href="https://doi.org/10.1007/978-3-540-71389-0_11">10.1007/978-3-540-71389-0_11</a>.
  short: K. Chatterjee, in:, Springer, 2007, pp. 138–152.
conference:
  name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
date_created: 2018-12-11T12:05:42Z
date_published: 2007-07-02T00:00:00Z
date_updated: 2021-01-12T07:52:57Z
day: '02'
doi: 10.1007/978-3-540-71389-0_11
extern: 1
intvolume: '      4423'
month: '07'
page: 138 - 152
publication_status: published
publisher: Springer
publist_id: '2284'
quality_controlled: 0
status: public
title: Optimal strategy synthesis in stochastic Müller games
type: conference
volume: 4423
year: '2007'
...
---
_id: '3886'
abstract:
- lang: eng
  text: 'The theory of graph games with ω-regular winning conditions is the foundation
    for modeling and synthesizing reactive processes. In the case of stochastic reactive
    processes, the corresponding stochastic graph games have three players, two of
    them (System and Environment) behaving adversarially, and the third (Uncertainty)
    behaving probabilistically. We consider two problems for stochastic graph games:
    the qualitative problem asks for the set of states from which a player can win
    with probability 1 (almost-sure winning); and the quantitative problem asks for
    the maximal probability of winning (optimal winning) from each state. We consider
    ω-regular winning conditions formalized as Müller winning conditions. We show
    that both the qualitative and quantitative problem for stochastic Müller games
    are PSPACE-complete. We also consider two well-known sub-classes of Müller objectives,
    namely, upward-closed and union-closed objectives, and show that both the qualitative
    and quantitative problem for these sub-classes are coNP-complete.'
acknowledgement: This research was supported in part by the the AFOSR MURI grant F49620-00-1-
  0327, and the NSF grant CCR-0225610.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
  full_name: Krishnendu Chatterjee
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
citation:
  ama: 'Chatterjee K. Stochastic Müller games are PSPACE-complete. In: Vol 4855. Schloss
    Dagstuhl - Leibniz-Zentrum für Informatik; 2007:436-448. doi:<a href="https://doi.org/10.1007/978-3-540-77050-3_36">10.1007/978-3-540-77050-3_36</a>'
  apa: 'Chatterjee, K. (2007). Stochastic Müller games are PSPACE-complete (Vol. 4855,
    pp. 436–448). Presented at the FSTTCS: Foundations of Software Technology and
    Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    <a href="https://doi.org/10.1007/978-3-540-77050-3_36">https://doi.org/10.1007/978-3-540-77050-3_36</a>'
  chicago: Chatterjee, Krishnendu. “Stochastic Müller Games Are PSPACE-Complete,”
    4855:436–48. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. <a href="https://doi.org/10.1007/978-3-540-77050-3_36">https://doi.org/10.1007/978-3-540-77050-3_36</a>.
  ieee: 'K. Chatterjee, “Stochastic Müller games are PSPACE-complete,” presented at
    the FSTTCS: Foundations of Software Technology and Theoretical Computer Science,
    2007, vol. 4855, pp. 436–448.'
  ista: 'Chatterjee K. 2007. Stochastic Müller games are PSPACE-complete. FSTTCS:
    Foundations of Software Technology and Theoretical Computer Science, LNCS, vol.
    4855, 436–448.'
  mla: Chatterjee, Krishnendu. <i>Stochastic Müller Games Are PSPACE-Complete</i>.
    Vol. 4855, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 436–48,
    doi:<a href="https://doi.org/10.1007/978-3-540-77050-3_36">10.1007/978-3-540-77050-3_36</a>.
  short: K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007,
    pp. 436–448.
conference:
  name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
date_created: 2018-12-11T12:05:42Z
date_published: 2007-12-15T00:00:00Z
date_updated: 2021-01-12T07:52:57Z
day: '15'
doi: 10.1007/978-3-540-77050-3_36
extern: 1
intvolume: '      4855'
month: '12'
page: 436 - 448
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2282'
quality_controlled: 0
status: public
title: Stochastic Müller games are PSPACE-complete
type: conference
volume: 4855
year: '2007'
...
---
_id: '3887'
abstract:
- lang: eng
  text: We consider Markov decision processes (MDPs) with multiple long-run average
    objectives. Such MDPs occur in design problems where one wishes to simultaneously
    optimize several criteria, for example, latency and power. The possible trade-offs
    between the different objectives are characterized by the Pareto curve. We show
    that every Pareto optimal point can be epsilon-approximated by a memoryless strategy,
    for all epsilon &gt; 0. In contrast to the single-objective case, the memoryless
    strategy may require randomization. We show that the Pareto curve can be approximated
    (a) in polynomial time in the size of the MDP for irreducible MDPs; and (b) in
    polynomial space in the size of the MDP for all MDPs. Additionally, we study the
    problem if a given value vector is realizable by any strategy, and show that it
    can be decided in polynomial time for irreducible MDPs and in NP for all MDPs.
    These results provide algorithms for design exploration in MDP models with multiple
    long-run average objectives.
acknowledgement: This research was supported by the NSF grants CCR-0225610 and CCR-0234690
alternative_title:
- 'LNCS '
author:
- first_name: Krishnendu
  full_name: Krishnendu Chatterjee
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
citation:
  ama: 'Chatterjee K. Markov decision processes with multiple long-run average objectives.
    In: Vol 4855. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2007:473-484.
    doi:<a href="https://doi.org/10.1007/978-3-540-77050-3_39">10.1007/978-3-540-77050-3_39</a>'
  apa: 'Chatterjee, K. (2007). Markov decision processes with multiple long-run average
    objectives (Vol. 4855, pp. 473–484). Presented at the FSTTCS: Foundations of Software
    Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik. <a href="https://doi.org/10.1007/978-3-540-77050-3_39">https://doi.org/10.1007/978-3-540-77050-3_39</a>'
  chicago: Chatterjee, Krishnendu. “Markov Decision Processes with Multiple Long-Run
    Average Objectives,” 4855:473–84. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2007. <a href="https://doi.org/10.1007/978-3-540-77050-3_39">https://doi.org/10.1007/978-3-540-77050-3_39</a>.
  ieee: 'K. Chatterjee, “Markov decision processes with multiple long-run average
    objectives,” presented at the FSTTCS: Foundations of Software Technology and Theoretical
    Computer Science, 2007, vol. 4855, pp. 473–484.'
  ista: 'Chatterjee K. 2007. Markov decision processes with multiple long-run average
    objectives. FSTTCS: Foundations of Software Technology and Theoretical Computer
    Science, LNCS , vol. 4855, 473–484.'
  mla: Chatterjee, Krishnendu. <i>Markov Decision Processes with Multiple Long-Run
    Average Objectives</i>. Vol. 4855, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2007, pp. 473–84, doi:<a href="https://doi.org/10.1007/978-3-540-77050-3_39">10.1007/978-3-540-77050-3_39</a>.
  short: K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007,
    pp. 473–484.
conference:
  name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
date_created: 2018-12-11T12:05:42Z
date_published: 2007-11-27T00:00:00Z
date_updated: 2021-01-12T07:52:58Z
day: '27'
doi: 10.1007/978-3-540-77050-3_39
extern: 1
intvolume: '      4855'
month: '11'
page: 473 - 484
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2283'
quality_controlled: 0
status: public
title: Markov decision processes with multiple long-run average objectives
type: conference
volume: 4855
year: '2007'
...
---
_id: '3909'
abstract:
- lang: eng
  text: Social insect colonies have evolved collective immune defences against parasites.
    These ‘social immune systems’ result from the cooperation of the individual group
    members to combat the increased risk of disease transmission that arises from
    sociality and group living. In this review we illustrate the pathways that parasites
    can take to infect a social insect colony and use these pathways as a framework
    to predict colony defence mechanisms and present the existing evidence. We find
    that the collective defences can be both prophylactic and activated on demand
    and consist of behavioural, physiological and organisational adaptations of the
    colony that prevent parasite entrance, establishment and spread. We discuss the
    regulation of collective immunity, which requires complex integration of information
    about both the parasites and the internal status of the insect colony. Our review
    concludes with an examination of the evolution of social immunity, which is based
    on the consequences of selection at both the individual and the colony level.
author:
- first_name: Sylvia
  full_name: Cremer, Sylvia
  id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
  last_name: Cremer
  orcid: 0000-0002-2193-3868
- first_name: Sophie
  full_name: Armitage, Sophie
  last_name: Armitage
- first_name: Paul
  full_name: Schmid Hempel, Paul
  last_name: Schmid Hempel
citation:
  ama: Cremer S, Armitage S, Schmid Hempel P. Social immunity. <i>Current Biology</i>.
    2007;17(16):R693-R702. doi:<a href="https://doi.org/10.1016/j.cub.2007.06.008">10.1016/j.cub.2007.06.008</a>
  apa: Cremer, S., Armitage, S., &#38; Schmid Hempel, P. (2007). Social immunity.
    <i>Current Biology</i>. Cell Press. <a href="https://doi.org/10.1016/j.cub.2007.06.008">https://doi.org/10.1016/j.cub.2007.06.008</a>
  chicago: Cremer, Sylvia, Sophie Armitage, and Paul Schmid Hempel. “Social Immunity.”
    <i>Current Biology</i>. Cell Press, 2007. <a href="https://doi.org/10.1016/j.cub.2007.06.008">https://doi.org/10.1016/j.cub.2007.06.008</a>.
  ieee: S. Cremer, S. Armitage, and P. Schmid Hempel, “Social immunity,” <i>Current
    Biology</i>, vol. 17, no. 16. Cell Press, pp. R693–R702, 2007.
  ista: Cremer S, Armitage S, Schmid Hempel P. 2007. Social immunity. Current Biology.
    17(16), R693–R702.
  mla: Cremer, Sylvia, et al. “Social Immunity.” <i>Current Biology</i>, vol. 17,
    no. 16, Cell Press, 2007, pp. R693–702, doi:<a href="https://doi.org/10.1016/j.cub.2007.06.008">10.1016/j.cub.2007.06.008</a>.
  short: S. Cremer, S. Armitage, P. Schmid Hempel, Current Biology 17 (2007) R693–R702.
date_created: 2018-12-11T12:05:50Z
date_published: 2007-08-21T00:00:00Z
date_updated: 2021-01-12T07:53:07Z
day: '21'
doi: 10.1016/j.cub.2007.06.008
extern: '1'
intvolume: '        17'
issue: '16'
language:
- iso: eng
month: '08'
oa_version: None
page: R693 - R702
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '2243'
status: public
title: Social immunity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2007'
...
---
_id: '3910'
author:
- first_name: David
  full_name: Hughes, David
  last_name: Hughes
- first_name: Sylvia
  full_name: Cremer, Sylvia
  id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
  last_name: Cremer
  orcid: 0000-0002-2193-3868
citation:
  ama: Hughes D, Cremer S. Plasticity in anti-parasite behaviours and its suggested
    role in invasion biology. <i>Animal Behaviour</i>. 2007;74(5):1593-1599. doi:<a
    href="https://doi.org/10.1016/j.anbehav.2006.12.025">10.1016/j.anbehav.2006.12.025</a>
  apa: Hughes, D., &#38; Cremer, S. (2007). Plasticity in anti-parasite behaviours
    and its suggested role in invasion biology. <i>Animal Behaviour</i>. Elsevier.
    <a href="https://doi.org/10.1016/j.anbehav.2006.12.025">https://doi.org/10.1016/j.anbehav.2006.12.025</a>
  chicago: Hughes, David, and Sylvia Cremer. “Plasticity in Anti-Parasite Behaviours
    and Its Suggested Role in Invasion Biology.” <i>Animal Behaviour</i>. Elsevier,
    2007. <a href="https://doi.org/10.1016/j.anbehav.2006.12.025">https://doi.org/10.1016/j.anbehav.2006.12.025</a>.
  ieee: D. Hughes and S. Cremer, “Plasticity in anti-parasite behaviours and its suggested
    role in invasion biology,” <i>Animal Behaviour</i>, vol. 74, no. 5. Elsevier,
    pp. 1593–1599, 2007.
  ista: Hughes D, Cremer S. 2007. Plasticity in anti-parasite behaviours and its suggested
    role in invasion biology. Animal Behaviour. 74(5), 1593–1599.
  mla: Hughes, David, and Sylvia Cremer. “Plasticity in Anti-Parasite Behaviours and
    Its Suggested Role in Invasion Biology.” <i>Animal Behaviour</i>, vol. 74, no.
    5, Elsevier, 2007, pp. 1593–99, doi:<a href="https://doi.org/10.1016/j.anbehav.2006.12.025">10.1016/j.anbehav.2006.12.025</a>.
  short: D. Hughes, S. Cremer, Animal Behaviour 74 (2007) 1593–1599.
date_created: 2018-12-11T12:05:50Z
date_published: 2007-11-01T00:00:00Z
date_updated: 2021-01-12T07:53:08Z
day: '01'
doi: 10.1016/j.anbehav.2006.12.025
extern: '1'
intvolume: '        74'
issue: '5'
language:
- iso: eng
month: '11'
oa_version: None
page: 1593 - 1599
publication: Animal Behaviour
publication_status: published
publisher: Elsevier
publist_id: '2244'
status: public
title: Plasticity in anti-parasite behaviours and its suggested role in invasion biology
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 74
year: '2007'
...
---
_id: '3911'
abstract:
- lang: eng
  text: Life in a social group increases the risk of disease transmission. To counteract
    this threat, social insects have evolved manifold antiparasite defenses, ranging
    from social exclusion of infected group members to intensive care. It is generally
    assumed that individuals performing hygienic behaviors risk infecting themselves,
    suggesting a high direct cost of helping. Our work instead indicates the opposite
    for garden ants. Social contact with individual workers, which were experimentally
    exposed to a fungal parasite, provided a clear survival benefit to nontreated,
    naive group members upon later challenge with the same parasite. This first demonstration
    of contact immunity in Social Hymenoptera and complementary results from other
    animal groups and plants suggest its general importance in both antiparasite and
    antiherbivore defense. In addition to this physiological prophylaxis of adult
    ants, infection of the brood was prevented in our experiment by behavioral changes
    of treated and naive workers. Parasite-treated ants stayed away from the brood
    chamber, whereas their naive nestmates increased brood-care activities. Our findings
    reveal a direct benefit for individuals to perform hygienic behaviors toward others,
    and this might explain the widely observed maintenance of social cohesion under
    parasite attack in insect societies.
author:
- first_name: Line V
  full_name: Ugelvig, Line V
  id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
  last_name: Ugelvig
  orcid: 0000-0003-1832-8883
- first_name: Sylvia
  full_name: Cremer, Sylvia
  id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
  last_name: Cremer
  orcid: 0000-0002-2193-3868
citation:
  ama: 'Ugelvig LV, Cremer S. Social prophylaxis: group interaction promotes collective
    immunity in ant colonies. <i>Current Biology</i>. 2007;17(22):1967-1971. doi:<a
    href="https://doi.org/10.1016/j.cub.2007.10.029">10.1016/j.cub.2007.10.029</a>'
  apa: 'Ugelvig, L. V., &#38; Cremer, S. (2007). Social prophylaxis: group interaction
    promotes collective immunity in ant colonies. <i>Current Biology</i>. Cell Press.
    <a href="https://doi.org/10.1016/j.cub.2007.10.029">https://doi.org/10.1016/j.cub.2007.10.029</a>'
  chicago: 'Ugelvig, Line V, and Sylvia Cremer. “Social Prophylaxis: Group Interaction
    Promotes Collective Immunity in Ant Colonies.” <i>Current Biology</i>. Cell Press,
    2007. <a href="https://doi.org/10.1016/j.cub.2007.10.029">https://doi.org/10.1016/j.cub.2007.10.029</a>.'
  ieee: 'L. V. Ugelvig and S. Cremer, “Social prophylaxis: group interaction promotes
    collective immunity in ant colonies,” <i>Current Biology</i>, vol. 17, no. 22.
    Cell Press, pp. 1967–1971, 2007.'
  ista: 'Ugelvig LV, Cremer S. 2007. Social prophylaxis: group interaction promotes
    collective immunity in ant colonies. Current Biology. 17(22), 1967–1971.'
  mla: 'Ugelvig, Line V., and Sylvia Cremer. “Social Prophylaxis: Group Interaction
    Promotes Collective Immunity in Ant Colonies.” <i>Current Biology</i>, vol. 17,
    no. 22, Cell Press, 2007, pp. 1967–71, doi:<a href="https://doi.org/10.1016/j.cub.2007.10.029">10.1016/j.cub.2007.10.029</a>.'
  short: L.V. Ugelvig, S. Cremer, Current Biology 17 (2007) 1967–1971.
date_created: 2018-12-11T12:05:51Z
date_published: 2007-11-20T00:00:00Z
date_updated: 2021-01-12T07:53:08Z
day: '20'
doi: 10.1016/j.cub.2007.10.029
extern: '1'
intvolume: '        17'
issue: '22'
language:
- iso: eng
month: '11'
oa_version: None
page: 1967 - 1971
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '2245'
status: public
title: 'Social prophylaxis: group interaction promotes collective immunity in ant
  colonies'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2007'
...
---
_id: '3937'
abstract:
- lang: eng
  text: Lymphocyte motility in lymph nodes is regulated by chemokines, but the contribution
    of integrins to this motility remains obscure. Here we examined lymphocyte migration
    over CCR7-binding chemokines that 'decorate' lymph node stroma. In a shear-free
    environment, surface-bound lymph node chemokines but not their soluble counterparts
    promoted robust and sustained T lymphocyte motility. The chemokine CCL21 induced
    compartmentalized clustering of the integrins LFA-1 and VLA-4 in motile lymphocytes,
    but both integrins remained nonadhesive to ligands on lymphocytes, dendritic cells
    and stroma. The application of shear stress to lymphocytes interacting with CCL21
    and integrin ligands promoted robust integrin-mediated adhesion. Thus, lymph node
    chemokines that promote motility and strongly activate lymphocyte integrins under
    shear forces fail to stimulate stable integrin adhesiveness in extravascular shear-free
    environments.
author:
- first_name: Eilon
  full_name: Woolf, Eilon
  last_name: Woolf
- first_name: Irina
  full_name: Grigorova, Irina
  last_name: Grigorova
- first_name: Adi
  full_name: Sagiv, Adi
  last_name: Sagiv
- first_name: Valentin
  full_name: Grabovsky, Valentin
  last_name: Grabovsky
- first_name: Sara
  full_name: Feigelson, Sara W
  last_name: Feigelson
- first_name: Ziv
  full_name: Shulman, Ziv
  last_name: Shulman
- first_name: Tanja
  full_name: Hartmann, Tanja
  last_name: Hartmann
- first_name: Michael K
  full_name: Michael Sixt
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
- first_name: Jason
  full_name: Cyster, Jason G
  last_name: Cyster
- first_name: Ronen
  full_name: Alon, Ronen
  last_name: Alon
citation:
  ama: Woolf E, Grigorova I, Sagiv A, et al. Lymph node chemokines promote sustained
    T lymphocyte motility without triggering stable integrin adhesiveness in the absence
    of shear forces. <i>Nature Immunology</i>. 2007;8(10):1076-1085. doi:<a href="https://doi.org/10.1038/ni1499">10.1038/ni1499</a>
  apa: Woolf, E., Grigorova, I., Sagiv, A., Grabovsky, V., Feigelson, S., Shulman,
    Z., … Alon, R. (2007). Lymph node chemokines promote sustained T lymphocyte motility
    without triggering stable integrin adhesiveness in the absence of shear forces.
    <i>Nature Immunology</i>. Nature Publishing Group. <a href="https://doi.org/10.1038/ni1499">https://doi.org/10.1038/ni1499</a>
  chicago: Woolf, Eilon, Irina Grigorova, Adi Sagiv, Valentin Grabovsky, Sara Feigelson,
    Ziv Shulman, Tanja Hartmann, Michael K Sixt, Jason Cyster, and Ronen Alon. “Lymph
    Node Chemokines Promote Sustained T Lymphocyte Motility without Triggering Stable
    Integrin Adhesiveness in the Absence of Shear Forces.” <i>Nature Immunology</i>.
    Nature Publishing Group, 2007. <a href="https://doi.org/10.1038/ni1499">https://doi.org/10.1038/ni1499</a>.
  ieee: E. Woolf <i>et al.</i>, “Lymph node chemokines promote sustained T lymphocyte
    motility without triggering stable integrin adhesiveness in the absence of shear
    forces,” <i>Nature Immunology</i>, vol. 8, no. 10. Nature Publishing Group, pp.
    1076–1085, 2007.
  ista: Woolf E, Grigorova I, Sagiv A, Grabovsky V, Feigelson S, Shulman Z, Hartmann
    T, Sixt MK, Cyster J, Alon R. 2007. Lymph node chemokines promote sustained T
    lymphocyte motility without triggering stable integrin adhesiveness in the absence
    of shear forces. Nature Immunology. 8(10), 1076–1085.
  mla: Woolf, Eilon, et al. “Lymph Node Chemokines Promote Sustained T Lymphocyte
    Motility without Triggering Stable Integrin Adhesiveness in the Absence of Shear
    Forces.” <i>Nature Immunology</i>, vol. 8, no. 10, Nature Publishing Group, 2007,
    pp. 1076–85, doi:<a href="https://doi.org/10.1038/ni1499">10.1038/ni1499</a>.
  short: E. Woolf, I. Grigorova, A. Sagiv, V. Grabovsky, S. Feigelson, Z. Shulman,
    T. Hartmann, M.K. Sixt, J. Cyster, R. Alon, Nature Immunology 8 (2007) 1076–1085.
date_created: 2018-12-11T12:05:59Z
date_published: 2007-08-26T00:00:00Z
date_updated: 2021-01-12T07:53:19Z
day: '26'
doi: 10.1038/ni1499
extern: 1
intvolume: '         8'
issue: '10'
month: '08'
page: 1076 - 1085
publication: Nature Immunology
publication_status: published
publisher: Nature Publishing Group
publist_id: '2189'
quality_controlled: 0
status: public
title: Lymph node chemokines promote sustained T lymphocyte motility without triggering
  stable integrin adhesiveness in the absence of shear forces
type: journal_article
volume: 8
year: '2007'
...
---
_id: '3938'
abstract:
- lang: eng
  text: RhoH is a small GTPase expressed only in the hematopoietic system. With the
    use of mice with targeted disruption of the RhoH gene, we demonstrated that RhoH
    is crucial for thymocyte maturation during DN3 to DN4 transition and during positive
    selection. Furthermore, the differentiation and expansion of DN3 and DN4 thymocytes
    in vitro were severely impaired. These defects corresponded to defective TCR signaling.
    Although RhoH is not required for TCR-induced activation of ZAP70 and ZAP70-mediated
    activation of p38, it is crucial for the tyrosine phosphorylation of LAT, PLCgamma1,
    and Vav1 and for the activation of Erk and calcium influx. These data suggest
    that RhoH is important for pre-TCR and TCR signaling because it allows the efficient
    interaction of ZAP70 with the LAT signalosome, thus regulating thymocyte development.
author:
- first_name: Tatjana
  full_name: Dorn, Tatjana
  last_name: Dorn
- first_name: Ursula
  full_name: Kuhn, Ursula
  last_name: Kuhn
- first_name: Gerd
  full_name: Bungartz, Gerd
  last_name: Bungartz
- first_name: Sebastian
  full_name: Stiller, Sebastian
  last_name: Stiller
- first_name: Martina
  full_name: Bauer, Martina
  last_name: Bauer
- first_name: Joachim
  full_name: Ellwart, Joachim
  last_name: Ellwart
- first_name: Thorsten
  full_name: Peters, Thorsten
  last_name: Peters
- first_name: Karin
  full_name: Scharffetter-Kochanek, Karin
  last_name: Scharffetter Kochanek
- first_name: Monika
  full_name: Semmrich, Monika
  last_name: Semmrich
- first_name: Melanie
  full_name: Laschinger, Melanie
  last_name: Laschinger
- first_name: Bernhard
  full_name: Holzmann, Bernhard
  last_name: Holzmann
- first_name: Wolfgang
  full_name: Klinkert, Wolfgang E
  last_name: Klinkert
- first_name: Per
  full_name: Straten, Per Thor
  last_name: Straten
- first_name: Tania
  full_name: Køllgaard, Tania
  last_name: Køllgaard
- first_name: Michael K
  full_name: Michael Sixt
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
- first_name: Cord
  full_name: Brakebusch, Cord
  last_name: Brakebusch
citation:
  ama: Dorn T, Kuhn U, Bungartz G, et al. RhoH is important for positive thymocyte
    selection and T-cell receptor signaling. <i>Blood</i>. 2007;109(6):2346-2355.
    doi:<a href="https://doi.org/10.1182/blood-2006-04-019034">10.1182/blood-2006-04-019034</a>
  apa: Dorn, T., Kuhn, U., Bungartz, G., Stiller, S., Bauer, M., Ellwart, J., … Brakebusch,
    C. (2007). RhoH is important for positive thymocyte selection and T-cell receptor
    signaling. <i>Blood</i>. American Society of Hematology. <a href="https://doi.org/10.1182/blood-2006-04-019034">https://doi.org/10.1182/blood-2006-04-019034</a>
  chicago: Dorn, Tatjana, Ursula Kuhn, Gerd Bungartz, Sebastian Stiller, Martina Bauer,
    Joachim Ellwart, Thorsten Peters, et al. “RhoH Is Important for Positive Thymocyte
    Selection and T-Cell Receptor Signaling.” <i>Blood</i>. American Society of Hematology,
    2007. <a href="https://doi.org/10.1182/blood-2006-04-019034">https://doi.org/10.1182/blood-2006-04-019034</a>.
  ieee: T. Dorn <i>et al.</i>, “RhoH is important for positive thymocyte selection
    and T-cell receptor signaling,” <i>Blood</i>, vol. 109, no. 6. American Society
    of Hematology, pp. 2346–2355, 2007.
  ista: Dorn T, Kuhn U, Bungartz G, Stiller S, Bauer M, Ellwart J, Peters T, Scharffetter
    Kochanek K, Semmrich M, Laschinger M, Holzmann B, Klinkert W, Straten P, Køllgaard
    T, Sixt MK, Brakebusch C. 2007. RhoH is important for positive thymocyte selection
    and T-cell receptor signaling. Blood. 109(6), 2346–2355.
  mla: Dorn, Tatjana, et al. “RhoH Is Important for Positive Thymocyte Selection and
    T-Cell Receptor Signaling.” <i>Blood</i>, vol. 109, no. 6, American Society of
    Hematology, 2007, pp. 2346–55, doi:<a href="https://doi.org/10.1182/blood-2006-04-019034">10.1182/blood-2006-04-019034</a>.
  short: T. Dorn, U. Kuhn, G. Bungartz, S. Stiller, M. Bauer, J. Ellwart, T. Peters,
    K. Scharffetter Kochanek, M. Semmrich, M. Laschinger, B. Holzmann, W. Klinkert,
    P. Straten, T. Køllgaard, M.K. Sixt, C. Brakebusch, Blood 109 (2007) 2346–2355.
date_created: 2018-12-11T12:05:59Z
date_published: 2007-03-15T00:00:00Z
date_updated: 2021-01-12T07:53:19Z
day: '15'
doi: 10.1182/blood-2006-04-019034
extern: 1
intvolume: '       109'
issue: '6'
month: '03'
page: 2346 - 2355
publication: Blood
publication_status: published
publisher: American Society of Hematology
publist_id: '2190'
quality_controlled: 0
status: public
title: RhoH is important for positive thymocyte selection and T-cell receptor signaling
type: journal_article
volume: 109
year: '2007'
...
---
_id: '3972'
abstract:
- lang: eng
  text: 'The persistence diagram of a real-valued function on a topological space
    is a multiset of points in the extended plane. We prove that under mild assumptions
    on the function, the persistence diagram is stable: small changes in the function
    imply only small changes in the diagram. We apply this result to estimating the
    homology of sets in a metric space and to comparing and classifying geometric
    shapes.'
author:
- first_name: David
  full_name: Cohen-Steiner, David
  last_name: Cohen Steiner
- first_name: Herbert
  full_name: Herbert Edelsbrunner
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: John
  full_name: Harer, John
  last_name: Harer
citation:
  ama: Cohen Steiner D, Edelsbrunner H, Harer J. Stability of persistence diagrams.
    <i>Discrete &#38; Computational Geometry</i>. 2007;37(1):103-120. doi:<a href="https://doi.org/10.1007/s00454-006-1276-5">10.1007/s00454-006-1276-5</a>
  apa: Cohen Steiner, D., Edelsbrunner, H., &#38; Harer, J. (2007). Stability of persistence
    diagrams. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href="https://doi.org/10.1007/s00454-006-1276-5">https://doi.org/10.1007/s00454-006-1276-5</a>
  chicago: Cohen Steiner, David, Herbert Edelsbrunner, and John Harer. “Stability
    of Persistence Diagrams.” <i>Discrete &#38; Computational Geometry</i>. Springer,
    2007. <a href="https://doi.org/10.1007/s00454-006-1276-5">https://doi.org/10.1007/s00454-006-1276-5</a>.
  ieee: D. Cohen Steiner, H. Edelsbrunner, and J. Harer, “Stability of persistence
    diagrams,” <i>Discrete &#38; Computational Geometry</i>, vol. 37, no. 1. Springer,
    pp. 103–120, 2007.
  ista: Cohen Steiner D, Edelsbrunner H, Harer J. 2007. Stability of persistence diagrams.
    Discrete &#38; Computational Geometry. 37(1), 103–120.
  mla: Cohen Steiner, David, et al. “Stability of Persistence Diagrams.” <i>Discrete
    &#38; Computational Geometry</i>, vol. 37, no. 1, Springer, 2007, pp. 103–20,
    doi:<a href="https://doi.org/10.1007/s00454-006-1276-5">10.1007/s00454-006-1276-5</a>.
  short: D. Cohen Steiner, H. Edelsbrunner, J. Harer, Discrete &#38; Computational
    Geometry 37 (2007) 103–120.
date_created: 2018-12-11T12:06:12Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2021-01-12T07:53:34Z
day: '01'
doi: 10.1007/s00454-006-1276-5
extern: 1
intvolume: '        37'
issue: '1'
month: '01'
page: 103 - 120
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '2153'
quality_controlled: 0
status: public
title: Stability of persistence diagrams
type: journal_article
volume: 37
year: '2007'
...
---
_id: '3973'
abstract:
- lang: eng
  text: In this paper we bound the difference between the total mean curvatures of
    two closed surfaces in R-3 in terms of their total absolute curvatures and the
    Frechet distance between the volumes they enclose. The proof relies on a combination
    of methods from algebraic topology and integral geometry. We also bound the difference
    between the lengths of two curves using the same methods.
author:
- first_name: David
  full_name: Cohen-Steiner, David
  last_name: Cohen Steiner
- first_name: Herbert
  full_name: Herbert Edelsbrunner
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
citation:
  ama: Cohen Steiner D, Edelsbrunner H. Inequalities for the curvature of curves and
    surfaces. <i>Foundations of Computational Mathematics</i>. 2007;7(4):391-404.
    doi:<a href="https://doi.org/10.1007/s10208-005-0200-3">10.1007/s10208-005-0200-3</a>
  apa: Cohen Steiner, D., &#38; Edelsbrunner, H. (2007). Inequalities for the curvature
    of curves and surfaces. <i>Foundations of Computational Mathematics</i>. Springer.
    <a href="https://doi.org/10.1007/s10208-005-0200-3">https://doi.org/10.1007/s10208-005-0200-3</a>
  chicago: Cohen Steiner, David, and Herbert Edelsbrunner. “Inequalities for the Curvature
    of Curves and Surfaces.” <i>Foundations of Computational Mathematics</i>. Springer,
    2007. <a href="https://doi.org/10.1007/s10208-005-0200-3">https://doi.org/10.1007/s10208-005-0200-3</a>.
  ieee: D. Cohen Steiner and H. Edelsbrunner, “Inequalities for the curvature of curves
    and surfaces,” <i>Foundations of Computational Mathematics</i>, vol. 7, no. 4.
    Springer, pp. 391–404, 2007.
  ista: Cohen Steiner D, Edelsbrunner H. 2007. Inequalities for the curvature of curves
    and surfaces. Foundations of Computational Mathematics. 7(4), 391–404.
  mla: Cohen Steiner, David, and Herbert Edelsbrunner. “Inequalities for the Curvature
    of Curves and Surfaces.” <i>Foundations of Computational Mathematics</i>, vol.
    7, no. 4, Springer, 2007, pp. 391–404, doi:<a href="https://doi.org/10.1007/s10208-005-0200-3">10.1007/s10208-005-0200-3</a>.
  short: D. Cohen Steiner, H. Edelsbrunner, Foundations of Computational Mathematics
    7 (2007) 391–404.
date_created: 2018-12-11T12:06:12Z
date_published: 2007-11-01T00:00:00Z
date_updated: 2021-01-12T07:53:34Z
day: '01'
doi: 10.1007/s10208-005-0200-3
extern: 1
intvolume: '         7'
issue: '4'
month: '11'
page: 391 - 404
publication: Foundations of Computational Mathematics
publication_status: published
publisher: Springer
publist_id: '2154'
quality_controlled: 0
status: public
title: Inequalities for the curvature of curves and surfaces
type: journal_article
volume: 7
year: '2007'
...
---
_id: '3975'
abstract:
- lang: eng
  text: We study the reconstruction of a stratified space from a possibly noisy point
    sample. Specifically, we use the vineyard of the distance function restricted
    to a I-parameter family of neighborhoods of a point to assess the local homology
    of the stratified space at that point. We prove the correctness of this assessment
    under the assumption of a sufficiently dense sample. We also give an algorithm
    that constructs the vineyard and makes the local assessment in time at most cubic
    in the size of the Delaunay triangulation of the point sample.
author:
- first_name: Paul
  full_name: Paul Bendich
  id: 43F6EC54-F248-11E8-B48F-1D18A9856A87
  last_name: Bendich
- first_name: David
  full_name: Cohen-Steiner, David
  last_name: Cohen Steiner
- first_name: Herbert
  full_name: Herbert Edelsbrunner
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: John
  full_name: Harer, John
  last_name: Harer
- first_name: Dmitriy
  full_name: Morozov, Dmitriy
  last_name: Morozov
citation:
  ama: 'Bendich P, Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. Inferring
    local homology from sampled stratified spaces. In: IEEE; 2007:536-546. doi:<a
    href="https://doi.org/10.1109/FOCS.2007.33">10.1109/FOCS.2007.33</a>'
  apa: 'Bendich, P., Cohen Steiner, D., Edelsbrunner, H., Harer, J., &#38; Morozov,
    D. (2007). Inferring local homology from sampled stratified spaces (pp. 536–546).
    Presented at the FOCS: Foundations of Computer Science, IEEE. <a href="https://doi.org/10.1109/FOCS.2007.33">https://doi.org/10.1109/FOCS.2007.33</a>'
  chicago: Bendich, Paul, David Cohen Steiner, Herbert Edelsbrunner, John Harer, and
    Dmitriy Morozov. “Inferring Local Homology from Sampled Stratified Spaces,” 536–46.
    IEEE, 2007. <a href="https://doi.org/10.1109/FOCS.2007.33">https://doi.org/10.1109/FOCS.2007.33</a>.
  ieee: 'P. Bendich, D. Cohen Steiner, H. Edelsbrunner, J. Harer, and D. Morozov,
    “Inferring local homology from sampled stratified spaces,” presented at the FOCS:
    Foundations of Computer Science, 2007, pp. 536–546.'
  ista: 'Bendich P, Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. 2007. Inferring
    local homology from sampled stratified spaces. FOCS: Foundations of Computer Science,
    536–546.'
  mla: Bendich, Paul, et al. <i>Inferring Local Homology from Sampled Stratified Spaces</i>.
    IEEE, 2007, pp. 536–46, doi:<a href="https://doi.org/10.1109/FOCS.2007.33">10.1109/FOCS.2007.33</a>.
  short: P. Bendich, D. Cohen Steiner, H. Edelsbrunner, J. Harer, D. Morozov, in:,
    IEEE, 2007, pp. 536–546.
conference:
  name: 'FOCS: Foundations of Computer Science'
date_created: 2018-12-11T12:06:13Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2021-01-12T07:53:35Z
day: '01'
doi: 10.1109/FOCS.2007.33
extern: 1
month: '01'
page: 536 - 546
publication_status: published
publisher: IEEE
publist_id: '2150'
quality_controlled: 0
status: public
title: Inferring local homology from sampled stratified spaces
type: conference
year: '2007'
...
---
_id: '3976'
abstract:
- lang: eng
  text: Herein, we study the interfaces of a set of 146 transient protein-protein
    interfaces in order to better understand the principles of their interactions.
    We define and generate the protein interface using tools from computational geometry
    and topology and then apply statistical analysis to its residue composition. In
    addition to counting individual occurrences, we evaluate pairing preferences,
    both across and as neighbors on one side of an interface. Likelihood correction
    emphasizes novel and unexpected pairs, such as the His-Cys pair found in most
    complexes of serine proteases with their diverse inhibitors and the Met-Met neighbor
    pair found in unrelated protein interfaces. We also present a visualization of
    the protein interface that allows for facile identification of residue-residue
    contacts and other biochemical properties.
author:
- first_name: Jeffrey
  full_name: Headd, Jeffrey J
  last_name: Headd
- first_name: Y E Andrew
  full_name: Ban, Y E Andrew
  last_name: Ban
- first_name: Paul
  full_name: Brown, Paul
  last_name: Brown
- first_name: Herbert
  full_name: Herbert Edelsbrunner
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Madhuwanti
  full_name: Vaidya, Madhuwanti
  last_name: Vaidya
- first_name: Johannes
  full_name: Rudolph, Johannes
  last_name: Rudolph
citation:
  ama: 'Headd J, Ban YEA, Brown P, Edelsbrunner H, Vaidya M, Rudolph J. Protein-protein
    interfaces: Properties, preferences, and projections. <i>Journal of Proteome Research</i>.
    2007;6(7):2576-2586. doi:<a href="https://doi.org/10.1021/pr070018+">10.1021/pr070018+</a>'
  apa: 'Headd, J., Ban, Y. E. A., Brown, P., Edelsbrunner, H., Vaidya, M., &#38; Rudolph,
    J. (2007). Protein-protein interfaces: Properties, preferences, and projections.
    <i>Journal of Proteome Research</i>. American Chemical Society. <a href="https://doi.org/10.1021/pr070018+">https://doi.org/10.1021/pr070018+</a>'
  chicago: 'Headd, Jeffrey, Y E Andrew Ban, Paul Brown, Herbert Edelsbrunner, Madhuwanti
    Vaidya, and Johannes Rudolph. “Protein-Protein Interfaces: Properties, Preferences,
    and Projections.” <i>Journal of Proteome Research</i>. American Chemical Society,
    2007. <a href="https://doi.org/10.1021/pr070018+">https://doi.org/10.1021/pr070018+</a>.'
  ieee: 'J. Headd, Y. E. A. Ban, P. Brown, H. Edelsbrunner, M. Vaidya, and J. Rudolph,
    “Protein-protein interfaces: Properties, preferences, and projections,” <i>Journal
    of Proteome Research</i>, vol. 6, no. 7. American Chemical Society, pp. 2576–2586,
    2007.'
  ista: 'Headd J, Ban YEA, Brown P, Edelsbrunner H, Vaidya M, Rudolph J. 2007. Protein-protein
    interfaces: Properties, preferences, and projections. Journal of Proteome Research.
    6(7), 2576–2586.'
  mla: 'Headd, Jeffrey, et al. “Protein-Protein Interfaces: Properties, Preferences,
    and Projections.” <i>Journal of Proteome Research</i>, vol. 6, no. 7, American
    Chemical Society, 2007, pp. 2576–86, doi:<a href="https://doi.org/10.1021/pr070018+">10.1021/pr070018+</a>.'
  short: J. Headd, Y.E.A. Ban, P. Brown, H. Edelsbrunner, M. Vaidya, J. Rudolph, Journal
    of Proteome Research 6 (2007) 2576–2586.
date_created: 2018-12-11T12:06:13Z
date_published: 2007-06-02T00:00:00Z
date_updated: 2021-01-12T07:53:36Z
day: '02'
doi: 10.1021/pr070018+
extern: 1
intvolume: '         6'
issue: '7'
month: '06'
page: 2576 - 2586
publication: Journal of Proteome Research
publication_status: published
publisher: American Chemical Society
publist_id: '2151'
quality_controlled: 0
status: public
title: 'Protein-protein interfaces: Properties, preferences, and projections'
type: journal_article
volume: 6
year: '2007'
...
---
_id: '3977'
abstract:
- lang: eng
  text: Using inclusion-exclusion, we can write the indicator function of a union
    of finitely many balls as an alternating sum of indicator functions of common
    intersections of balls. We exhibit abstract simplicial complexes that correspond
    to minimal inclusion-exclusion formulas. They include the dual complex, as defined
    in [3], and are characterized by the independence of their simplices and by geometric
    realizations with the same underlying space as the dual complex.
author:
- first_name: Dominique
  full_name: Attali, Dominique
  last_name: Attali
- first_name: Herbert
  full_name: Herbert Edelsbrunner
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
citation:
  ama: Attali D, Edelsbrunner H. Inclusion-exclusion formulas from independent complexes.
    <i>Discrete &#38; Computational Geometry</i>. 2007;37(1):59-77. doi:<a href="https://doi.org/10.1007/s00454-006-1274-7">10.1007/s00454-006-1274-7</a>
  apa: Attali, D., &#38; Edelsbrunner, H. (2007). Inclusion-exclusion formulas from
    independent complexes. <i>Discrete &#38; Computational Geometry</i>. Springer.
    <a href="https://doi.org/10.1007/s00454-006-1274-7">https://doi.org/10.1007/s00454-006-1274-7</a>
  chicago: Attali, Dominique, and Herbert Edelsbrunner. “Inclusion-Exclusion Formulas
    from Independent Complexes.” <i>Discrete &#38; Computational Geometry</i>. Springer,
    2007. <a href="https://doi.org/10.1007/s00454-006-1274-7">https://doi.org/10.1007/s00454-006-1274-7</a>.
  ieee: D. Attali and H. Edelsbrunner, “Inclusion-exclusion formulas from independent
    complexes,” <i>Discrete &#38; Computational Geometry</i>, vol. 37, no. 1. Springer,
    pp. 59–77, 2007.
  ista: Attali D, Edelsbrunner H. 2007. Inclusion-exclusion formulas from independent
    complexes. Discrete &#38; Computational Geometry. 37(1), 59–77.
  mla: Attali, Dominique, and Herbert Edelsbrunner. “Inclusion-Exclusion Formulas
    from Independent Complexes.” <i>Discrete &#38; Computational Geometry</i>, vol.
    37, no. 1, Springer, 2007, pp. 59–77, doi:<a href="https://doi.org/10.1007/s00454-006-1274-7">10.1007/s00454-006-1274-7</a>.
  short: D. Attali, H. Edelsbrunner, Discrete &#38; Computational Geometry 37 (2007)
    59–77.
date_created: 2018-12-11T12:06:14Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2021-01-12T07:53:36Z
day: '01'
doi: 10.1007/s00454-006-1274-7
extern: 1
intvolume: '        37'
issue: '1'
month: '01'
page: 59 - 77
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '2152'
quality_controlled: 0
status: public
title: Inclusion-exclusion formulas from independent complexes
type: journal_article
volume: 37
year: '2007'
...
---
_id: '3981'
abstract:
- lang: eng
  text: Building on the work of Martinetz, Schulten and de Silva, Carlsson, we introduce
    a 2-parameter family of witness complexes and algorithms for constructing them.
    This family can be used to determine the gross topology of point cloud data in
    R-d or other metric spaces. The 2-parameter family is sensitive to differences
    in sampling density and thus amenable to detecting patterns within the data set.
    It also lends itself to theoretical analysis. For example, we can prove that in
    the limit, when the witnesses cover the entire domain, witness complexes in the
    family that share the first, scale parameter have the same homotopy type.
acknowledgement: Research by the authors is partially supported by DARPA under grant
  HR0011-05-1-0007, by CNRS under grant PICS-3416 and by IST Program of the EU under
  Contract IST-2002-506766.
alternative_title:
- LNCS
author:
- first_name: Dominique
  full_name: Attali, Dominique
  last_name: Attali
- first_name: Herbert
  full_name: Herbert Edelsbrunner
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: John
  full_name: Harer, John
  last_name: Harer
- first_name: Yuriy
  full_name: Mileyko, Yuriy
  last_name: Mileyko
citation:
  ama: 'Attali D, Edelsbrunner H, Harer J, Mileyko Y. Alpha-beta witness complexes.
    In: Vol 4619. Springer; 2007:386-397. doi:<a href="https://doi.org/10.1007/978-3-540-73951-7_34">10.1007/978-3-540-73951-7_34</a>'
  apa: 'Attali, D., Edelsbrunner, H., Harer, J., &#38; Mileyko, Y. (2007). Alpha-beta
    witness complexes (Vol. 4619, pp. 386–397). Presented at the WADS: International
    Workshop on Algrithms and Data Structures, Springer. <a href="https://doi.org/10.1007/978-3-540-73951-7_34">https://doi.org/10.1007/978-3-540-73951-7_34</a>'
  chicago: Attali, Dominique, Herbert Edelsbrunner, John Harer, and Yuriy Mileyko.
    “Alpha-Beta Witness Complexes,” 4619:386–97. Springer, 2007. <a href="https://doi.org/10.1007/978-3-540-73951-7_34">https://doi.org/10.1007/978-3-540-73951-7_34</a>.
  ieee: 'D. Attali, H. Edelsbrunner, J. Harer, and Y. Mileyko, “Alpha-beta witness
    complexes,” presented at the WADS: International Workshop on Algrithms and Data
    Structures, 2007, vol. 4619, pp. 386–397.'
  ista: 'Attali D, Edelsbrunner H, Harer J, Mileyko Y. 2007. Alpha-beta witness complexes.
    WADS: International Workshop on Algrithms and Data Structures, LNCS, vol. 4619,
    386–397.'
  mla: Attali, Dominique, et al. <i>Alpha-Beta Witness Complexes</i>. Vol. 4619, Springer,
    2007, pp. 386–97, doi:<a href="https://doi.org/10.1007/978-3-540-73951-7_34">10.1007/978-3-540-73951-7_34</a>.
  short: D. Attali, H. Edelsbrunner, J. Harer, Y. Mileyko, in:, Springer, 2007, pp.
    386–397.
conference:
  name: 'WADS: International Workshop on Algrithms and Data Structures'
date_created: 2018-12-11T12:06:15Z
date_published: 2007-08-21T00:00:00Z
date_updated: 2021-01-12T07:53:38Z
day: '21'
doi: 10.1007/978-3-540-73951-7_34
extern: 1
intvolume: '      4619'
month: '08'
page: 386 - 397
publication_status: published
publisher: Springer
publist_id: '2149'
quality_controlled: 0
status: public
title: Alpha-beta witness complexes
type: conference
volume: 4619
year: '2007'
...
---
_id: '4152'
abstract:
- lang: eng
  text: 'Gastrulation is a morphogenetic process that results in the formation of
    the embryonic germ layers. Here we detail the major cell movements that occur
    during zebrafish gastrulation: epiboly, internalization, and convergent extension.
    Although gastrulation is known to be regulated by signaling pathways such as the
    Wnt/planar cell polarity pathway, many questions remain about the underlying molecular
    and cellular mechanisms. Key factors that may play a role in gastrulation cell
    movements are cell adhesion and cytoskeletal rearrangement. In addition, some
    of the driving force for gastrulation may derive from tissue interactions such
    as those described between the enveloping layer and the yolk syncytial layer.
    Future exploration of gastrulation mechanisms relies on the development of sensitive
    and quantitative techniques to characterize embryonic germ-layer properties.'
author:
- first_name: Laurel
  full_name: Rohde, Laurel
  last_name: Rohde
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
citation:
  ama: 'Rohde L, Heisenberg C-PJ. Zebrafish gastrulation: Cell movements, signals,
    and mechanisms. <i>International Review of Cytology - A Survey of Cell Biology</i>.
    2007;261:159-192. doi:<a href="https://doi.org/10.1016/S0074-7696(07)61004-3">10.1016/S0074-7696(07)61004-3</a>'
  apa: 'Rohde, L., &#38; Heisenberg, C.-P. J. (2007). Zebrafish gastrulation: Cell
    movements, signals, and mechanisms. <i>International Review of Cytology - A Survey
    of Cell Biology</i>. Academic Press. <a href="https://doi.org/10.1016/S0074-7696(07)61004-3">https://doi.org/10.1016/S0074-7696(07)61004-3</a>'
  chicago: 'Rohde, Laurel, and Carl-Philipp J Heisenberg. “Zebrafish Gastrulation:
    Cell Movements, Signals, and Mechanisms.” <i>International Review of Cytology
    - A Survey of Cell Biology</i>. Academic Press, 2007. <a href="https://doi.org/10.1016/S0074-7696(07)61004-3">https://doi.org/10.1016/S0074-7696(07)61004-3</a>.'
  ieee: 'L. Rohde and C.-P. J. Heisenberg, “Zebrafish gastrulation: Cell movements,
    signals, and mechanisms,” <i>International Review of Cytology - A Survey of Cell
    Biology</i>, vol. 261. Academic Press, pp. 159–192, 2007.'
  ista: 'Rohde L, Heisenberg C-PJ. 2007. Zebrafish gastrulation: Cell movements, signals,
    and mechanisms. International Review of Cytology - A Survey of Cell Biology. 261,
    159–192.'
  mla: 'Rohde, Laurel, and Carl-Philipp J. Heisenberg. “Zebrafish Gastrulation: Cell
    Movements, Signals, and Mechanisms.” <i>International Review of Cytology - A Survey
    of Cell Biology</i>, vol. 261, Academic Press, 2007, pp. 159–92, doi:<a href="https://doi.org/10.1016/S0074-7696(07)61004-3">10.1016/S0074-7696(07)61004-3</a>.'
  short: L. Rohde, C.-P.J. Heisenberg, International Review of Cytology - A Survey
    of Cell Biology 261 (2007) 159–192.
date_created: 2018-12-11T12:07:15Z
date_published: 2007-06-06T00:00:00Z
date_updated: 2021-01-12T07:54:53Z
day: '06'
doi: 10.1016/S0074-7696(07)61004-3
extern: '1'
intvolume: '       261'
language:
- iso: eng
month: '06'
oa_version: None
page: 159 - 192
publication: International Review of Cytology - A Survey of Cell Biology
publication_status: published
publisher: Academic Press
publist_id: '1967'
status: public
title: 'Zebrafish gastrulation: Cell movements, signals, and mechanisms'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 261
year: '2007'
...
---
_id: '4182'
abstract:
- lang: eng
  text: We are interested in the cellular and molecular mechanisms underlying tissue
    morphogenesis during zebrafish gastrulation. Both differential cell adhesion and
    contractility have been proposed to be key mechanisms by which tissues form and
    rearrange in development. To obtain insight into the potential roles of differential
    cell adhesion and contraction for germ layer morphogenesis during gastrulation,
    we are analyzing cell adhesion and contraction of germ layer progenitor cells
    using atomic force microscopy, primary tissue culture and transplantation assays.
    I will present and discuss data about the differential adhesiveness and contractility
    of germ layer progenitor cells in the context of germ layer formation during vertebrate
    gastrulation.
acknowledgement: Abstract for the Annual Meeting of the German Societey for Cell Biology.
article_processing_charge: No
author:
- first_name: Michael
  full_name: Krieg, Michael
  last_name: Krieg
- first_name: Yohanna
  full_name: Arboleda, Yohanna
  last_name: Arboleda
- first_name: Daniel
  full_name: Müller, Daniel
  last_name: Müller
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
citation:
  ama: Krieg M, Arboleda Y, Müller D, Heisenberg C-PJ. The role of cell adhesion and
    contractility for germ layer morphogenesis during zebrafish gastrulation. <i>European
    Journal of Cell Biology</i>. 2007;86(Supplement 1):39-39. doi:<a href="https://doi.org/10.1016/j.ejcb.2007.02.002">10.1016/j.ejcb.2007.02.002</a>
  apa: Krieg, M., Arboleda, Y., Müller, D., &#38; Heisenberg, C.-P. J. (2007). The
    role of cell adhesion and contractility for germ layer morphogenesis during zebrafish
    gastrulation. <i>European Journal of Cell Biology</i>. Elsevier. <a href="https://doi.org/10.1016/j.ejcb.2007.02.002">https://doi.org/10.1016/j.ejcb.2007.02.002</a>
  chicago: Krieg, Michael, Yohanna Arboleda, Daniel Müller, and Carl-Philipp J Heisenberg.
    “The Role of Cell Adhesion and Contractility for Germ Layer Morphogenesis during
    Zebrafish Gastrulation.” <i>European Journal of Cell Biology</i>. Elsevier, 2007.
    <a href="https://doi.org/10.1016/j.ejcb.2007.02.002">https://doi.org/10.1016/j.ejcb.2007.02.002</a>.
  ieee: M. Krieg, Y. Arboleda, D. Müller, and C.-P. J. Heisenberg, “The role of cell
    adhesion and contractility for germ layer morphogenesis during zebrafish gastrulation,”
    <i>European Journal of Cell Biology</i>, vol. 86, no. Supplement 1. Elsevier,
    pp. 39–39, 2007.
  ista: Krieg M, Arboleda Y, Müller D, Heisenberg C-PJ. 2007. The role of cell adhesion
    and contractility for germ layer morphogenesis during zebrafish gastrulation.
    European Journal of Cell Biology. 86(Supplement 1), 39–39.
  mla: Krieg, Michael, et al. “The Role of Cell Adhesion and Contractility for Germ
    Layer Morphogenesis during Zebrafish Gastrulation.” <i>European Journal of Cell
    Biology</i>, vol. 86, no. Supplement 1, Elsevier, 2007, pp. 39–39, doi:<a href="https://doi.org/10.1016/j.ejcb.2007.02.002">10.1016/j.ejcb.2007.02.002</a>.
  short: M. Krieg, Y. Arboleda, D. Müller, C.-P.J. Heisenberg, European Journal of
    Cell Biology 86 (2007) 39–39.
date_created: 2018-12-11T12:07:26Z
date_published: 2007-03-22T00:00:00Z
date_updated: 2021-01-12T07:55:07Z
day: '22'
doi: 10.1016/j.ejcb.2007.02.002
extern: '1'
intvolume: '        86'
issue: Supplement 1
language:
- iso: eng
month: '03'
oa_version: None
page: 39 - 39
publication: European Journal of Cell Biology
publication_status: published
publisher: Elsevier
publist_id: '1937'
status: public
title: The role of cell adhesion and contractility for germ layer morphogenesis during
  zebrafish gastrulation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 86
year: '2007'
...
---
_id: '4205'
abstract:
- lang: eng
  text: 'Background: Bone morphogenetic proteins (Bmps) are required for the specification
    of ventrolateral cell fates during embryonic dorsoventral patterning and for proper
    convergence and extension gastrulation movements, but the mechanisms underlying
    the latter role remained elusive. Results: Via bead implantations, we show that
    the Bmp gradient determines the direction of lateral mesodermal cell migration
    during dorsal convergence in the zebrafish gastrula. This effect is independent
    of its role during dorsoventral patterning and of noncanonical Wnt signaling.
    However, it requires Bmp signal transduction through AIk8 and Smad5 to negatively
    regulate Ca2+/Cadherin-dependent cell-cell adhesiveness. In vivo, converging mesodermal
    cells form lamellipodia that attach to adjacent cells. Bmp signaling diminishes
    the Cadherin-dependent stability of such contact points, thereby abrogating subsequent
    cell displacement during lamellipodial retraction. Conclusions: We propose that
    the ventral-to-dorsal Bmp gradient has an instructive role to establish a reverse
    gradient of cell-cell adhesiveness, thereby defining different migratory zones
    and directing lamellipodia-driven cell migrations during dorsal convergence in
    lateral regions of the zebrafish gastrula.'
article_processing_charge: No
author:
- first_name: Sophia
  full_name: Von Der Hardt, Sophia
  last_name: Von Der Hardt
- first_name: Jeroen
  full_name: Bakkers, Jeroen
  last_name: Bakkers
- first_name: Adi
  full_name: Inbal, Adi
  last_name: Inbal
- first_name: Lara
  full_name: Carvalho, Lara
  last_name: Carvalho
- first_name: Lilianna
  full_name: Solnica Krezel, Lilianna
  last_name: Solnica Krezel
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
- first_name: Matthias
  full_name: Hammerschmidt, Matthias
  last_name: Hammerschmidt
citation:
  ama: Von Der Hardt S, Bakkers J, Inbal A, et al. The Bmp gradient of the zebrafish
    gastrula guides migrating lateral cells by regulating cell-cell adhesion. <i>Current
    Biology</i>. 2007;17(6):475-487. doi:<a href="https://doi.org/10.1016/j.cub.2007.02.013">10.1016/j.cub.2007.02.013</a>
  apa: Von Der Hardt, S., Bakkers, J., Inbal, A., Carvalho, L., Solnica Krezel, L.,
    Heisenberg, C.-P. J., &#38; Hammerschmidt, M. (2007). The Bmp gradient of the
    zebrafish gastrula guides migrating lateral cells by regulating cell-cell adhesion.
    <i>Current Biology</i>. Cell Press. <a href="https://doi.org/10.1016/j.cub.2007.02.013">https://doi.org/10.1016/j.cub.2007.02.013</a>
  chicago: Von Der Hardt, Sophia, Jeroen Bakkers, Adi Inbal, Lara Carvalho, Lilianna
    Solnica Krezel, Carl-Philipp J Heisenberg, and Matthias Hammerschmidt. “The Bmp
    Gradient of the Zebrafish Gastrula Guides Migrating Lateral Cells by Regulating
    Cell-Cell Adhesion.” <i>Current Biology</i>. Cell Press, 2007. <a href="https://doi.org/10.1016/j.cub.2007.02.013">https://doi.org/10.1016/j.cub.2007.02.013</a>.
  ieee: S. Von Der Hardt <i>et al.</i>, “The Bmp gradient of the zebrafish gastrula
    guides migrating lateral cells by regulating cell-cell adhesion,” <i>Current Biology</i>,
    vol. 17, no. 6. Cell Press, pp. 475–487, 2007.
  ista: Von Der Hardt S, Bakkers J, Inbal A, Carvalho L, Solnica Krezel L, Heisenberg
    C-PJ, Hammerschmidt M. 2007. The Bmp gradient of the zebrafish gastrula guides
    migrating lateral cells by regulating cell-cell adhesion. Current Biology. 17(6),
    475–487.
  mla: Von Der Hardt, Sophia, et al. “The Bmp Gradient of the Zebrafish Gastrula Guides
    Migrating Lateral Cells by Regulating Cell-Cell Adhesion.” <i>Current Biology</i>,
    vol. 17, no. 6, Cell Press, 2007, pp. 475–87, doi:<a href="https://doi.org/10.1016/j.cub.2007.02.013">10.1016/j.cub.2007.02.013</a>.
  short: S. Von Der Hardt, J. Bakkers, A. Inbal, L. Carvalho, L. Solnica Krezel, C.-P.J.
    Heisenberg, M. Hammerschmidt, Current Biology 17 (2007) 475–487.
date_created: 2018-12-11T12:07:34Z
date_published: 2007-03-20T00:00:00Z
date_updated: 2021-01-12T07:55:17Z
day: '20'
doi: 10.1016/j.cub.2007.02.013
extern: '1'
intvolume: '        17'
issue: '6'
language:
- iso: eng
month: '03'
oa_version: None
page: 475 - 487
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '1910'
status: public
title: The Bmp gradient of the zebrafish gastrula guides migrating lateral cells by
  regulating cell-cell adhesion
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2007'
...