---
_id: '552'
abstract:
- lang: eng
text: 'Graph games provide the foundation for modeling and synthesis of reactive
processes. Such games are played over graphs where the vertices are controlled
by two adversarial players. We consider graph games where the objective of the
first player is the conjunction of a qualitative objective (specified as a parity
condition) and a quantitative objective (specified as a meanpayoff condition).
There are two variants of the problem, namely, the threshold problem where the
quantitative goal is to ensure that the mean-payoff value is above a threshold,
and the value problem where the quantitative goal is to ensure the optimal mean-payoff
value; in both cases ensuring the qualitative parity objective. The previous best-known
algorithms for game graphs with n vertices, m edges, parity objectives with d
priorities, and maximal absolute reward value W for mean-payoff objectives, are
as follows: O(nd+1 . m . w) for the threshold problem, and O(nd+2 · m · W) for
the value problem. Our main contributions are faster algorithms, and the running
times of our algorithms are as follows: O(nd-1 · m ·W) for the threshold problem,
and O(nd · m · W · log(n · W)) for the value problem. For mean-payoff parity objectives
with two priorities, our algorithms match the best-known bounds of the algorithms
for mean-payoff games (without conjunction with parity objectives). Our results
are relevant in synthesis of reactive systems with both functional requirement
(given as a qualitative objective) and performance requirement (given as a quantitative
objective).'
alternative_title:
- LIPIcs
article_number: '39'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity
games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.39'
apa: 'Chatterjee, K., Henzinger, M. H., & Svozil, A. (2017). Faster algorithms
for mean-payoff parity games. In Leibniz International Proceedings in Informatics
(Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.MFCS.2017.39'
chicago: Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster
Algorithms for Mean-Payoff Parity Games.” In Leibniz International Proceedings
in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.
ieee: K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff
parity games,” in Leibniz International Proceedings in Informatics, Aalborg,
Denmark, 2017, vol. 83.
ista: 'Chatterjee K, Henzinger MH, Svozil A. 2017. Faster algorithms for mean-payoff
parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical
Foundations of Computer Science (SG), LIPIcs, vol. 83, 39.'
mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean-Payoff Parity Games.”
Leibniz International Proceedings in Informatics, vol. 83, 39, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.39.
short: K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings
in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
conference:
end_date: 2017-08-25
location: Aalborg, Denmark
name: 'MFCS: Mathematical Foundations of Computer Science (SG)'
start_date: 2017-08-21
date_created: 2018-12-11T11:47:08Z
date_published: 2017-11-01T00:00:00Z
date_updated: 2023-02-14T10:06:46Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2017.39
ec_funded: 1
file:
- access_level: open_access
checksum: c67f4866ddbfd555afef1f63ae9a8fc7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:57Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5248'
file_name: IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf
file_size: 610339
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
intvolume: ' 83'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Leibniz International Proceedings in Informatics
publication_identifier:
isbn:
- 978-395977046-0
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7262'
pubrep_id: '923'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster algorithms for mean-payoff parity games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 83
year: '2017'
...
---
_id: '553'
abstract:
- lang: eng
text: 'We consider two player, zero-sum, finite-state concurrent reachability games,
played for an infinite number of rounds, where in every round, each player simultaneously
and independently of the other players chooses an action, whereafter the successor
state is determined by a probability distribution given by the current state and
the chosen actions. Player 1 wins iff a designated goal state is eventually visited.
We are interested in the complexity of stationary strategies measured by their
patience, which is defined as the inverse of the smallest non-zero probability
employed. Our main results are as follows: We show that: (i) the optimal bound
on the patience of optimal and -optimal strategies, for both players is doubly
exponential; and (ii) even in games with a single non-absorbing state exponential
(in the number of actions) patience is necessary. '
alternative_title:
- LIPIcs
article_number: '55'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Kristofer
full_name: Hansen, Kristofer
last_name: Hansen
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: 'Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent
safety games. In: Leibniz International Proceedings in Informatics. Vol
83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.55'
apa: 'Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity
of concurrent safety games. In Leibniz International Proceedings in Informatics
(Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.MFCS.2017.55'
chicago: Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy
Complexity of Concurrent Safety Games.” In Leibniz International Proceedings
in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.
ieee: K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent
safety games,” in Leibniz International Proceedings in Informatics, Aalborg,
Denmark, 2017, vol. 83.
ista: 'Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent
safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical
Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.'
mla: Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.”
Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55.
short: K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings
in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
conference:
end_date: 2017-08-25
location: Aalborg, Denmark
name: 'MFCS: Mathematical Foundations of Computer Science (SG)'
start_date: 2017-08-21
date_created: 2018-12-11T11:47:08Z
date_published: 2017-11-01T00:00:00Z
date_updated: 2021-01-12T08:02:35Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2017.55
file:
- access_level: open_access
checksum: 7101facb56ade363205c695d72dbd173
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:29Z
date_updated: 2020-07-14T12:47:00Z
file_id: '4753'
file_name: IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf
file_size: 549967
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
intvolume: ' 83'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1506.02434
month: '11'
oa: 1
oa_version: Published Version
publication: Leibniz International Proceedings in Informatics
publication_identifier:
isbn:
- 978-395977046-0
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7261'
pubrep_id: '922'
quality_controlled: '1'
scopus_import: 1
status: public
title: Strategy complexity of concurrent safety games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 83
year: '2017'
...
---
_id: '560'
abstract:
- lang: eng
text: In a recent article (Jentzen et al. 2016 Commun. Math. Sci. 14, 1477–1500
(doi:10.4310/CMS.2016.v14. n6.a1)), it has been established that, for every arbitrarily
slow convergence speed and every natural number d ? {4, 5, . . .}, there exist
d-dimensional stochastic differential equations with infinitely often differentiable
and globally bounded coefficients such that no approximation method based on finitely
many observations of the driving Brownian motion can converge in absolute mean
to the solution faster than the given speed of convergence. In this paper, we
strengthen the above result by proving that this slow convergence phenomenon also
arises in two (d = 2) and three (d = 3) space dimensions.
article_number: '0104'
author:
- first_name: Mate
full_name: Gerencser, Mate
id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87
last_name: Gerencser
- first_name: Arnulf
full_name: Jentzen, Arnulf
last_name: Jentzen
- first_name: Diyora
full_name: Salimova, Diyora
last_name: Salimova
citation:
ama: 'Gerencser M, Jentzen A, Salimova D. On stochastic differential equations with
arbitrarily slow convergence rates for strong approximation in two space dimensions.
Proceedings of the Royal Society A: Mathematical, Physical and Engineering
Sciences. 2017;473(2207). doi:10.1098/rspa.2017.0104'
apa: 'Gerencser, M., Jentzen, A., & Salimova, D. (2017). On stochastic differential
equations with arbitrarily slow convergence rates for strong approximation in
two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical
and Engineering Sciences. Royal Society of London. https://doi.org/10.1098/rspa.2017.0104'
chicago: 'Gerencser, Mate, Arnulf Jentzen, and Diyora Salimova. “On Stochastic Differential
Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in
Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical
and Engineering Sciences. Royal Society of London, 2017. https://doi.org/10.1098/rspa.2017.0104.'
ieee: 'M. Gerencser, A. Jentzen, and D. Salimova, “On stochastic differential equations
with arbitrarily slow convergence rates for strong approximation in two space
dimensions,” Proceedings of the Royal Society A: Mathematical, Physical and
Engineering Sciences, vol. 473, no. 2207. Royal Society of London, 2017.'
ista: 'Gerencser M, Jentzen A, Salimova D. 2017. On stochastic differential equations
with arbitrarily slow convergence rates for strong approximation in two space
dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering
Sciences. 473(2207), 0104.'
mla: 'Gerencser, Mate, et al. “On Stochastic Differential Equations with Arbitrarily
Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings
of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.
473, no. 2207, 0104, Royal Society of London, 2017, doi:10.1098/rspa.2017.0104.'
short: 'M. Gerencser, A. Jentzen, D. Salimova, Proceedings of the Royal Society
A: Mathematical, Physical and Engineering Sciences 473 (2017).'
date_created: 2018-12-11T11:47:11Z
date_published: 2017-11-01T00:00:00Z
date_updated: 2021-01-12T08:03:04Z
day: '01'
department:
- _id: JaMa
doi: 10.1098/rspa.2017.0104
ec_funded: 1
intvolume: ' 473'
issue: '2207'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1702.03229
month: '11'
oa: 1
oa_version: Submitted Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: 'Proceedings of the Royal Society A: Mathematical, Physical and Engineering
Sciences'
publication_identifier:
issn:
- '13645021'
publication_status: published
publisher: Royal Society of London
publist_id: '7256'
quality_controlled: '1'
scopus_import: 1
status: public
title: On stochastic differential equations with arbitrarily slow convergence rates
for strong approximation in two space dimensions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 473
year: '2017'
...
---
_id: '567'
abstract:
- lang: eng
text: "This book is a concise and self-contained introduction of recent techniques
to prove local spectral universality for large random matrices. Random matrix
theory is a fast expanding research area, and this book mainly focuses on the
methods that the authors participated in developing over the past few years. Many
other interesting topics are not included, and neither are several new developments
within the framework of these methods. The authors have chosen instead to present
key concepts that they believe are the core of these methods and should be relevant
for future applications. They keep technicalities to a minimum to make the book
accessible to graduate students. With this in mind, they include in this book
the basic notions and tools for high-dimensional analysis, such as large deviation,
entropy, Dirichlet form, and the logarithmic Sobolev inequality.\r\n"
alternative_title:
- Courant Lecture Notes
article_processing_charge: No
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horng
full_name: Yau, Horng
last_name: Yau
citation:
ama: Erdös L, Yau H. A Dynamical Approach to Random Matrix Theory. Vol 28.
American Mathematical Society; 2017. doi:10.1090/cln/028
apa: Erdös, L., & Yau, H. (2017). A Dynamical Approach to Random Matrix Theory
(Vol. 28). American Mathematical Society. https://doi.org/10.1090/cln/028
chicago: Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix
Theory. Vol. 28. Courant Lecture Notes. American Mathematical Society, 2017.
https://doi.org/10.1090/cln/028.
ieee: L. Erdös and H. Yau, A Dynamical Approach to Random Matrix Theory,
vol. 28. American Mathematical Society, 2017.
ista: Erdös L, Yau H. 2017. A Dynamical Approach to Random Matrix Theory, American
Mathematical Society, 226p.
mla: Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory.
Vol. 28, American Mathematical Society, 2017, doi:10.1090/cln/028.
short: L. Erdös, H. Yau, A Dynamical Approach to Random Matrix Theory, American
Mathematical Society, 2017.
date_created: 2018-12-11T11:47:13Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2022-05-24T06:57:28Z
day: '01'
department:
- _id: LaEr
doi: 10.1090/cln/028
ec_funded: 1
intvolume: ' 28'
language:
- iso: eng
month: '01'
oa_version: None
page: '226'
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication_identifier:
eisbn:
- 978-1-4704-4194-4
isbn:
- 9-781-4704-3648-3
publication_status: published
publisher: American Mathematical Society
publist_id: '7247'
quality_controlled: '1'
series_title: Courant Lecture Notes
status: public
title: A Dynamical Approach to Random Matrix Theory
type: book
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2017'
...
---
_id: '568'
abstract:
- lang: eng
text: 'We study robust properties of zero sets of continuous maps f: X → ℝn. Formally,
we analyze the family Z< r(f) := (g-1(0): ||g - f|| < r) of all zero sets
of all continuous maps g closer to f than r in the max-norm. All of these sets
are outside A := (x: |f(x)| ≥ r) and we claim that Z< r(f) is fully determined
by A and an element of a certain cohomotopy group which (by a recent result) is
computable whenever the dimension of X is at most 2n - 3. By considering all r
> 0 simultaneously, the pointed cohomotopy groups form a persistence module-a
structure leading to persistence diagrams as in the case of persistent homology
or well groups. Eventually, we get a descriptor of persistent robust properties
of zero sets that has better descriptive power (Theorem A) and better computability
status (Theorem B) than the established well diagrams. Moreover, if we endow every
point of each zero set with gradients of the perturbation, the robust description
of the zero sets by elements of cohomotopy groups is in some sense the best possible
(Theorem C).'
author:
- first_name: Peter
full_name: Franek, Peter
id: 473294AE-F248-11E8-B48F-1D18A9856A87
last_name: Franek
- first_name: Marek
full_name: Krcál, Marek
id: 33E21118-F248-11E8-B48F-1D18A9856A87
last_name: Krcál
citation:
ama: Franek P, Krcál M. Persistence of zero sets. Homology, Homotopy and Applications.
2017;19(2):313-342. doi:10.4310/HHA.2017.v19.n2.a16
apa: Franek, P., & Krcál, M. (2017). Persistence of zero sets. Homology,
Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2017.v19.n2.a16
chicago: Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology,
Homotopy and Applications. International Press, 2017. https://doi.org/10.4310/HHA.2017.v19.n2.a16.
ieee: P. Franek and M. Krcál, “Persistence of zero sets,” Homology, Homotopy
and Applications, vol. 19, no. 2. International Press, pp. 313–342, 2017.
ista: Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and
Applications. 19(2), 313–342.
mla: Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy
and Applications, vol. 19, no. 2, International Press, 2017, pp. 313–42, doi:10.4310/HHA.2017.v19.n2.a16.
short: P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.
date_created: 2018-12-11T11:47:14Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2021-01-12T08:03:12Z
day: '01'
department:
- _id: UlWa
- _id: HeEd
doi: 10.4310/HHA.2017.v19.n2.a16
ec_funded: 1
intvolume: ' 19'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1507.04310
month: '01'
oa: 1
oa_version: Submitted Version
page: 313 - 342
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 2590DB08-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '701309'
name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes
(H2020)
publication: Homology, Homotopy and Applications
publication_identifier:
issn:
- '15320073'
publication_status: published
publisher: International Press
publist_id: '7246'
quality_controlled: '1'
scopus_import: 1
status: public
title: Persistence of zero sets
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2017'
...
---
_id: '570'
abstract:
- lang: eng
text: 'Most phenotypes are determined by molecular systems composed of specifically
interacting molecules. However, unlike for individual components, little is known
about the distributions of mutational effects of molecular systems as a whole.
We ask how the distribution of mutational effects of a transcriptional regulatory
system differs from the distributions of its components, by first independently,
and then simultaneously, mutating a transcription factor and the associated promoter
it represses. We find that the system distribution exhibits increased phenotypic
variation compared to individual component distributions - an effect arising from
intermolecular epistasis between the transcription factor and its DNA-binding
site. In large part, this epistasis can be qualitatively attributed to the structure
of the transcriptional regulatory system and could therefore be a common feature
in prokaryotes. Counter-intuitively, intermolecular epistasis can alleviate the
constraints of individual components, thereby increasing phenotypic variation
that selection could act on and facilitating adaptive evolution. '
article_number: e28921
author:
- first_name: Mato
full_name: Lagator, Mato
id: 345D25EC-F248-11E8-B48F-1D18A9856A87
last_name: Lagator
- first_name: Srdjan
full_name: Sarikas, Srdjan
id: 35F0286E-F248-11E8-B48F-1D18A9856A87
last_name: Sarikas
- first_name: Hande
full_name: Acar, Hande
id: 2DDF136A-F248-11E8-B48F-1D18A9856A87
last_name: Acar
orcid: 0000-0003-1986-9753
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. Regulatory network structure
determines patterns of intermolecular epistasis. eLife. 2017;6. doi:10.7554/eLife.28921
apa: Lagator, M., Sarikas, S., Acar, H., Bollback, J. P., & Guet, C. C. (2017).
Regulatory network structure determines patterns of intermolecular epistasis.
ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.28921
chicago: Lagator, Mato, Srdjan Sarikas, Hande Acar, Jonathan P Bollback, and Calin
C Guet. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.”
ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.28921.
ieee: M. Lagator, S. Sarikas, H. Acar, J. P. Bollback, and C. C. Guet, “Regulatory
network structure determines patterns of intermolecular epistasis,” eLife,
vol. 6. eLife Sciences Publications, 2017.
ista: Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. 2017. Regulatory network
structure determines patterns of intermolecular epistasis. eLife. 6, e28921.
mla: Lagator, Mato, et al. “Regulatory Network Structure Determines Patterns of
Intermolecular Epistasis.” ELife, vol. 6, e28921, eLife Sciences Publications,
2017, doi:10.7554/eLife.28921.
short: M. Lagator, S. Sarikas, H. Acar, J.P. Bollback, C.C. Guet, ELife 6 (2017).
date_created: 2018-12-11T11:47:14Z
date_published: 2017-11-13T00:00:00Z
date_updated: 2021-01-12T08:03:15Z
day: '13'
ddc:
- '576'
department:
- _id: CaGu
- _id: JoBo
- _id: NiBa
doi: 10.7554/eLife.28921
ec_funded: 1
file:
- access_level: open_access
checksum: 273ab17f33305e4eaafd911ff88e7c5b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:42Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5096'
file_name: IST-2017-918-v1+1_elife-28921-figures-v3.pdf
file_size: 8453470
relation: main_file
- access_level: open_access
checksum: b433f90576c7be597cd43367946f8e7f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:43Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5097'
file_name: IST-2017-918-v1+2_elife-28921-v3.pdf
file_size: 1953221
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
has_accepted_license: '1'
intvolume: ' 6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 2578D616-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '648440'
name: Selective Barriers to Horizontal Gene Transfer
publication: eLife
publication_identifier:
issn:
- 2050084X
publication_status: published
publisher: eLife Sciences Publications
publist_id: '7244'
pubrep_id: '918'
quality_controlled: '1'
scopus_import: 1
status: public
title: Regulatory network structure determines patterns of intermolecular epistasis
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2017'
...
---
_id: '569'
abstract:
- lang: eng
text: The actomyosin ring generates force to ingress the cytokinetic cleavage furrow
in animal cells, yet its filament organization and the mechanism of contractility
is not well understood. We quantified actin filament order in human cells using
fluorescence polarization microscopy and found that cleavage furrow ingression
initiates by contraction of an equatorial actin network with randomly oriented
filaments. The network subsequently gradually reoriented actin filaments along
the cell equator. This strictly depended on myosin II activity, suggesting local
network reorganization by mechanical forces. Cortical laser microsurgery revealed
that during cytokinesis progression, mechanical tension increased substantially
along the direction of the cell equator, while the network contracted laterally
along the pole-to-pole axis without a detectable increase in tension. Our data
suggest that an asymmetric increase in cortical tension promotes filament reorientation
along the cytokinetic cleavage furrow, which might have implications for diverse
other biological processes involving actomyosin rings.
article_number: e30867
author:
- first_name: Felix
full_name: Spira, Felix
last_name: Spira
- first_name: Sara
full_name: Cuylen Haering, Sara
last_name: Cuylen Haering
- first_name: Shalin
full_name: Mehta, Shalin
last_name: Mehta
- first_name: Matthias
full_name: Samwer, Matthias
last_name: Samwer
- first_name: Anne
full_name: Reversat, Anne
id: 35B76592-F248-11E8-B48F-1D18A9856A87
last_name: Reversat
orcid: 0000-0003-0666-8928
- first_name: Amitabh
full_name: Verma, Amitabh
last_name: Verma
- first_name: Rudolf
full_name: Oldenbourg, Rudolf
last_name: Oldenbourg
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Daniel
full_name: Gerlich, Daniel
last_name: Gerlich
citation:
ama: Spira F, Cuylen Haering S, Mehta S, et al. Cytokinesis in vertebrate cells
initiates by contraction of an equatorial actomyosin network composed of randomly
oriented filaments. eLife. 2017;6. doi:10.7554/eLife.30867
apa: Spira, F., Cuylen Haering, S., Mehta, S., Samwer, M., Reversat, A., Verma,
A., … Gerlich, D. (2017). Cytokinesis in vertebrate cells initiates by contraction
of an equatorial actomyosin network composed of randomly oriented filaments. ELife.
eLife Sciences Publications. https://doi.org/10.7554/eLife.30867
chicago: Spira, Felix, Sara Cuylen Haering, Shalin Mehta, Matthias Samwer, Anne
Reversat, Amitabh Verma, Rudolf Oldenbourg, Michael K Sixt, and Daniel Gerlich.
“Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin
Network Composed of Randomly Oriented Filaments.” ELife. eLife Sciences
Publications, 2017. https://doi.org/10.7554/eLife.30867.
ieee: F. Spira et al., “Cytokinesis in vertebrate cells initiates by contraction
of an equatorial actomyosin network composed of randomly oriented filaments,”
eLife, vol. 6. eLife Sciences Publications, 2017.
ista: Spira F, Cuylen Haering S, Mehta S, Samwer M, Reversat A, Verma A, Oldenbourg
R, Sixt MK, Gerlich D. 2017. Cytokinesis in vertebrate cells initiates by contraction
of an equatorial actomyosin network composed of randomly oriented filaments. eLife.
6, e30867.
mla: Spira, Felix, et al. “Cytokinesis in Vertebrate Cells Initiates by Contraction
of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.”
ELife, vol. 6, e30867, eLife Sciences Publications, 2017, doi:10.7554/eLife.30867.
short: F. Spira, S. Cuylen Haering, S. Mehta, M. Samwer, A. Reversat, A. Verma,
R. Oldenbourg, M.K. Sixt, D. Gerlich, ELife 6 (2017).
date_created: 2018-12-11T11:47:14Z
date_published: 2017-11-06T00:00:00Z
date_updated: 2023-02-23T12:30:29Z
day: '06'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.7554/eLife.30867
file:
- access_level: open_access
checksum: ba09c1451153d39e4f4b7cee013e314c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:40Z
date_updated: 2020-07-14T12:47:10Z
file_id: '4829'
file_name: IST-2017-919-v1+1_elife-30867-figures-v1.pdf
file_size: 9666973
relation: main_file
- access_level: open_access
checksum: 01eb51f1d6ad679947415a51c988e137
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:41Z
date_updated: 2020-07-14T12:47:10Z
file_id: '4830'
file_name: IST-2017-919-v1+2_elife-30867-v1.pdf
file_size: 5951246
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
has_accepted_license: '1'
intvolume: ' 6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: eLife
publication_identifier:
issn:
- 2050084X
publication_status: published
publisher: eLife Sciences Publications
publist_id: '7245'
pubrep_id: '919'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin
network composed of randomly oriented filaments
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2017'
...
---
_id: '571'
abstract:
- lang: eng
text: Blood platelets are critical for hemostasis and thrombosis and play diverse
roles during immune responses. Despite these versatile tasks in mammalian biology,
their skills on a cellular level are deemed limited, mainly consisting in rolling,
adhesion, and aggregate formation. Here, we identify an unappreciated asset of
platelets and show that adherent platelets use adhesion receptors to mechanically
probe the adhesive substrate in their local microenvironment. When actomyosin-dependent
traction forces overcome substrate resistance, platelets migrate and pile up the
adhesive substrate together with any bound particulate material. They use this
ability to act as cellular scavengers, scanning the vascular surface for potential
invaders and collecting deposited bacteria. Microbe collection by migrating platelets
boosts the activity of professional phagocytes, exacerbating inflammatory tissue
injury in sepsis. This assigns platelets a central role in innate immune responses
and identifies them as potential targets to dampen inflammatory tissue damage
in clinical scenarios of severe systemic infection. In addition to their role
in thrombosis and hemostasis, platelets can also migrate to sites of infection
to help trap bacteria and clear the vascular surface.
author:
- first_name: Florian R
full_name: Gärtner, Florian R
id: 397A88EE-F248-11E8-B48F-1D18A9856A87
last_name: Gärtner
orcid: 0000-0001-6120-3723
- first_name: Zerkah
full_name: Ahmad, Zerkah
last_name: Ahmad
- first_name: Gerhild
full_name: Rosenberger, Gerhild
last_name: Rosenberger
- first_name: Shuxia
full_name: Fan, Shuxia
last_name: Fan
- first_name: Leo
full_name: Nicolai, Leo
last_name: Nicolai
- first_name: Benjamin
full_name: Busch, Benjamin
last_name: Busch
- first_name: Gökce
full_name: Yavuz, Gökce
last_name: Yavuz
- first_name: Manja
full_name: Luckner, Manja
last_name: Luckner
- first_name: Hellen
full_name: Ishikawa Ankerhold, Hellen
last_name: Ishikawa Ankerhold
- first_name: Roman
full_name: Hennel, Roman
last_name: Hennel
- first_name: Alexandre
full_name: Benechet, Alexandre
last_name: Benechet
- first_name: Michael
full_name: Lorenz, Michael
last_name: Lorenz
- first_name: Sue
full_name: Chandraratne, Sue
last_name: Chandraratne
- first_name: Irene
full_name: Schubert, Irene
last_name: Schubert
- first_name: Sebastian
full_name: Helmer, Sebastian
last_name: Helmer
- first_name: Bianca
full_name: Striednig, Bianca
last_name: Striednig
- first_name: Konstantin
full_name: Stark, Konstantin
last_name: Stark
- first_name: Marek
full_name: Janko, Marek
last_name: Janko
- first_name: Ralph
full_name: Böttcher, Ralph
last_name: Böttcher
- first_name: Admar
full_name: Verschoor, Admar
last_name: Verschoor
- first_name: Catherine
full_name: Leon, Catherine
last_name: Leon
- first_name: Christian
full_name: Gachet, Christian
last_name: Gachet
- first_name: Thomas
full_name: Gudermann, Thomas
last_name: Gudermann
- first_name: Michael
full_name: Mederos Y Schnitzler, Michael
last_name: Mederos Y Schnitzler
- first_name: Zachary
full_name: Pincus, Zachary
last_name: Pincus
- first_name: Matteo
full_name: Iannacone, Matteo
last_name: Iannacone
- first_name: Rainer
full_name: Haas, Rainer
last_name: Haas
- first_name: Gerhard
full_name: Wanner, Gerhard
last_name: Wanner
- first_name: Kirsten
full_name: Lauber, Kirsten
last_name: Lauber
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Steffen
full_name: Massberg, Steffen
last_name: Massberg
citation:
ama: Gärtner FR, Ahmad Z, Rosenberger G, et al. Migrating platelets are mechano
scavengers that collect and bundle bacteria. Cell Press. 2017;171(6):1368-1382.
doi:10.1016/j.cell.2017.11.001
apa: Gärtner, F. R., Ahmad, Z., Rosenberger, G., Fan, S., Nicolai, L., Busch, B.,
… Massberg, S. (2017). Migrating platelets are mechano scavengers that collect
and bundle bacteria. Cell Press. Cell Press. https://doi.org/10.1016/j.cell.2017.11.001
chicago: Gärtner, Florian R, Zerkah Ahmad, Gerhild Rosenberger, Shuxia Fan, Leo
Nicolai, Benjamin Busch, Gökce Yavuz, et al. “Migrating Platelets Are Mechano
Scavengers That Collect and Bundle Bacteria.” Cell Press. Cell Press, 2017.
https://doi.org/10.1016/j.cell.2017.11.001.
ieee: F. R. Gärtner et al., “Migrating platelets are mechano scavengers that
collect and bundle bacteria,” Cell Press, vol. 171, no. 6. Cell Press,
pp. 1368–1382, 2017.
ista: Gärtner FR, Ahmad Z, Rosenberger G, Fan S, Nicolai L, Busch B, Yavuz G, Luckner
M, Ishikawa Ankerhold H, Hennel R, Benechet A, Lorenz M, Chandraratne S, Schubert
I, Helmer S, Striednig B, Stark K, Janko M, Böttcher R, Verschoor A, Leon C, Gachet
C, Gudermann T, Mederos Y Schnitzler M, Pincus Z, Iannacone M, Haas R, Wanner
G, Lauber K, Sixt MK, Massberg S. 2017. Migrating platelets are mechano scavengers
that collect and bundle bacteria. Cell Press. 171(6), 1368–1382.
mla: Gärtner, Florian R., et al. “Migrating Platelets Are Mechano Scavengers That
Collect and Bundle Bacteria.” Cell Press, vol. 171, no. 6, Cell Press,
2017, pp. 1368–82, doi:10.1016/j.cell.2017.11.001.
short: F.R. Gärtner, Z. Ahmad, G. Rosenberger, S. Fan, L. Nicolai, B. Busch, G.
Yavuz, M. Luckner, H. Ishikawa Ankerhold, R. Hennel, A. Benechet, M. Lorenz, S.
Chandraratne, I. Schubert, S. Helmer, B. Striednig, K. Stark, M. Janko, R. Böttcher,
A. Verschoor, C. Leon, C. Gachet, T. Gudermann, M. Mederos Y Schnitzler, Z. Pincus,
M. Iannacone, R. Haas, G. Wanner, K. Lauber, M.K. Sixt, S. Massberg, Cell Press
171 (2017) 1368–1382.
date_created: 2018-12-11T11:47:15Z
date_published: 2017-11-30T00:00:00Z
date_updated: 2021-01-12T08:03:15Z
day: '30'
department:
- _id: MiSi
doi: 10.1016/j.cell.2017.11.001
ec_funded: 1
intvolume: ' 171'
issue: '6'
language:
- iso: eng
month: '11'
oa_version: None
page: 1368 - 1382
project:
- _id: 260AA4E2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '747687'
name: Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells
publication: Cell Press
publication_identifier:
issn:
- '00928674'
publication_status: published
publisher: Cell Press
publist_id: '7243'
quality_controlled: '1'
scopus_import: 1
status: public
title: Migrating platelets are mechano scavengers that collect and bundle bacteria
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 171
year: '2017'
...
---
_id: '572'
abstract:
- lang: eng
text: In this review, we summarize the different biosynthesis-related pathways that
contribute to the regulation of endogenous auxin in plants. We demonstrate that
all known genes involved in auxin biosynthesis also have a role in root formation,
from the initiation of a root meristem during embryogenesis to the generation
of a functional root system with a primary root, secondary lateral root branches
and adventitious roots. Furthermore, the versatile adaptation of root development
in response to environmental challenges is mediated by both local and distant
control of auxin biosynthesis. In conclusion, auxin homeostasis mediated by spatial
and temporal regulation of auxin biosynthesis plays a central role in determining
root architecture.
article_number: '2587'
article_processing_charge: No
author:
- first_name: Damilola
full_name: Olatunji, Damilola
last_name: Olatunji
- first_name: Danny
full_name: Geelen, Danny
last_name: Geelen
- first_name: Inge
full_name: Verstraeten, Inge
id: 362BF7FE-F248-11E8-B48F-1D18A9856A87
last_name: Verstraeten
orcid: 0000-0001-7241-2328
citation:
ama: Olatunji D, Geelen D, Verstraeten I. Control of endogenous auxin levels in
plant root development. International Journal of Molecular Sciences. 2017;18(12).
doi:10.3390/ijms18122587
apa: Olatunji, D., Geelen, D., & Verstraeten, I. (2017). Control of endogenous
auxin levels in plant root development. International Journal of Molecular
Sciences. MDPI. https://doi.org/10.3390/ijms18122587
chicago: Olatunji, Damilola, Danny Geelen, and Inge Verstraeten. “Control of Endogenous
Auxin Levels in Plant Root Development.” International Journal of Molecular
Sciences. MDPI, 2017. https://doi.org/10.3390/ijms18122587.
ieee: D. Olatunji, D. Geelen, and I. Verstraeten, “Control of endogenous auxin levels
in plant root development,” International Journal of Molecular Sciences,
vol. 18, no. 12. MDPI, 2017.
ista: Olatunji D, Geelen D, Verstraeten I. 2017. Control of endogenous auxin levels
in plant root development. International Journal of Molecular Sciences. 18(12),
2587.
mla: Olatunji, Damilola, et al. “Control of Endogenous Auxin Levels in Plant Root
Development.” International Journal of Molecular Sciences, vol. 18, no.
12, 2587, MDPI, 2017, doi:10.3390/ijms18122587.
short: D. Olatunji, D. Geelen, I. Verstraeten, International Journal of Molecular
Sciences 18 (2017).
date_created: 2018-12-11T11:47:15Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2021-01-12T08:03:16Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.3390/ijms18122587
file:
- access_level: open_access
checksum: 82d51f11e493f7eec02976d9a9a9805e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:55Z
date_updated: 2020-07-14T12:47:10Z
file_id: '4718'
file_name: IST-2017-917-v1+1_ijms-18-02587.pdf
file_size: 920962
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
has_accepted_license: '1'
intvolume: ' 18'
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: International Journal of Molecular Sciences
publication_status: published
publisher: MDPI
publist_id: '7242'
pubrep_id: '917'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Control of endogenous auxin levels in plant root development
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2017'
...
---
_id: '5803'
abstract:
- lang: eng
text: Different distance metrics produce Voronoi diagrams with different properties.
It is a well-known that on the (real) 2D plane or even on any 3D plane, a Voronoi
diagram (VD) based on the Euclidean distance metric produces convex Voronoi regions.
In this paper, we first show that this metric produces a persistent VD on the
2D digital plane, as it comprises digitally convex Voronoi regions and hence correctly
approximates the corresponding VD on the 2D real plane. Next, we show that on
a 3D digital plane D, the Euclidean metric spanning over its voxel set does not
guarantee a digital VD which is persistent with the real-space VD. As a solution,
we introduce a novel concept of functional-plane-convexity, which is ensured by
the Euclidean metric spanning over the pedal set of D. Necessary proofs and some
visual result have been provided to adjudge the merit and usefulness of the proposed
concept.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: 'Biswas R, Bhowmick P. Construction of persistent Voronoi diagram on 3D digital
plane. In: Combinatorial Image Analysis. Vol 10256. Cham: Springer Nature;
2017:93-104. doi:10.1007/978-3-319-59108-7_8'
apa: 'Biswas, R., & Bhowmick, P. (2017). Construction of persistent Voronoi
diagram on 3D digital plane. In Combinatorial image analysis (Vol. 10256,
pp. 93–104). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-59108-7_8'
chicago: 'Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi
Diagram on 3D Digital Plane.” In Combinatorial Image Analysis, 10256:93–104.
Cham: Springer Nature, 2017. https://doi.org/10.1007/978-3-319-59108-7_8.'
ieee: 'R. Biswas and P. Bhowmick, “Construction of persistent Voronoi diagram on
3D digital plane,” in Combinatorial image analysis, vol. 10256, Cham: Springer
Nature, 2017, pp. 93–104.'
ista: 'Biswas R, Bhowmick P. 2017.Construction of persistent Voronoi diagram on
3D digital plane. In: Combinatorial image analysis. LNCS, vol. 10256, 93–104.'
mla: Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram
on 3D Digital Plane.” Combinatorial Image Analysis, vol. 10256, Springer
Nature, 2017, pp. 93–104, doi:10.1007/978-3-319-59108-7_8.
short: R. Biswas, P. Bhowmick, in:, Combinatorial Image Analysis, Springer Nature,
Cham, 2017, pp. 93–104.
conference:
end_date: 2017-06-21
location: Plovdiv, Bulgaria
name: 'IWCIA: International Workshop on Combinatorial Image Analysis'
start_date: 2017-06-19
date_created: 2019-01-08T20:42:56Z
date_published: 2017-05-17T00:00:00Z
date_updated: 2022-01-28T07:48:24Z
day: '17'
department:
- _id: HeEd
doi: 10.1007/978-3-319-59108-7_8
extern: '1'
intvolume: ' 10256'
language:
- iso: eng
month: '05'
oa_version: None
page: 93-104
place: Cham
publication: Combinatorial image analysis
publication_identifier:
isbn:
- 978-3-319-59107-0
- 978-3-319-59108-7
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Construction of persistent Voronoi diagram on 3D digital plane
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 10256
year: '2017'
...