---
_id: '2025'
abstract:
- lang: eng
text: Small GTP-binding proteins of the Ras superfamily play diverse roles in intracellular
trafficking. Among them, the Rab, Arf, and Rho families function in successive
steps of vesicle transport, in forming vesicles from donor membranes, directing
vesicle trafficking toward target membranes and docking vesicles onto target membranes.
These proteins act as molecular switches that are controlled by a cycle of GTP
binding and hydrolysis regulated by guanine nucleotide exchange factors (GEFs)
and GTPase-activating proteins (GAPs). In this study we explored the role of GAPs
in the regulation of the endocytic pathway using fluorescently labeled yeast mating
pheromone α-factor. Among 25 non-essential GAP mutants, we found that deletion
of the GLO3 gene, encoding Arf-GAP protein, caused defective internalization of
fluorescently labeled α-factor. Quantitative analysis revealed that glo3Δ cells
show defective α-factor binding to the cell surface. Interestingly, Ste2p, the
α-factor receptor, was mis-localized from the plasma membrane to the vacuole in
glo3Δ cells. Domain deletion mutants of Glo3p revealed that a GAP-independent
function, as well as the GAP activity, of Glo3p is important for both α-factor
binding and Ste2p localization at the cell surface. Additionally, we found that
deletion of the GLO3 gene affects the size and number of Arf1p-residing Golgi
compartments and causes a defect in transport from the TGN to the plasma membrane.
Furthermore, we demonstrated that glo3Δ cells were defective in the late endosome-to-TGN
transport pathway, but not in the early endosome-to-TGN transport pathway. These
findings suggest novel roles for Arf-GAP Glo3p in endocytic recycling of cell
surface proteins.
article_processing_charge: No
author:
- first_name: Daiki
full_name: Kawada, Daiki
last_name: Kawada
- first_name: Hiromu
full_name: Kobayashi, Hiromu
last_name: Kobayashi
- first_name: Tsuyoshi
full_name: Tomita, Tsuyoshi
last_name: Tomita
- first_name: Eisuke
full_name: Nakata, Eisuke
last_name: Nakata
- first_name: Makoto
full_name: Nagano, Makoto
last_name: Nagano
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Junko
full_name: Toshima, Junko
last_name: Toshima
- first_name: Jiro
full_name: Toshimaa, Jiro
last_name: Toshimaa
citation:
ama: Kawada D, Kobayashi H, Tomita T, et al. The yeast Arf-GAP Glo3p is required
for the endocytic recycling of cell surface proteins. Biochimica et Biophysica
Acta - Molecular Cell Research. 2015;1853(1):144-156. doi:10.1016/j.bbamcr.2014.10.009
apa: Kawada, D., Kobayashi, H., Tomita, T., Nakata, E., Nagano, M., Siekhaus, D.
E., … Toshimaa, J. (2015). The yeast Arf-GAP Glo3p is required for the endocytic
recycling of cell surface proteins. Biochimica et Biophysica Acta - Molecular
Cell Research. Elsevier. https://doi.org/10.1016/j.bbamcr.2014.10.009
chicago: Kawada, Daiki, Hiromu Kobayashi, Tsuyoshi Tomita, Eisuke Nakata, Makoto
Nagano, Daria E Siekhaus, Junko Toshima, and Jiro Toshimaa. “The Yeast Arf-GAP
Glo3p Is Required for the Endocytic Recycling of Cell Surface Proteins.” Biochimica
et Biophysica Acta - Molecular Cell Research. Elsevier, 2015. https://doi.org/10.1016/j.bbamcr.2014.10.009.
ieee: D. Kawada et al., “The yeast Arf-GAP Glo3p is required for the endocytic
recycling of cell surface proteins,” Biochimica et Biophysica Acta - Molecular
Cell Research, vol. 1853, no. 1. Elsevier, pp. 144–156, 2015.
ista: Kawada D, Kobayashi H, Tomita T, Nakata E, Nagano M, Siekhaus DE, Toshima
J, Toshimaa J. 2015. The yeast Arf-GAP Glo3p is required for the endocytic recycling
of cell surface proteins. Biochimica et Biophysica Acta - Molecular Cell Research.
1853(1), 144–156.
mla: Kawada, Daiki, et al. “The Yeast Arf-GAP Glo3p Is Required for the Endocytic
Recycling of Cell Surface Proteins.” Biochimica et Biophysica Acta - Molecular
Cell Research, vol. 1853, no. 1, Elsevier, 2015, pp. 144–56, doi:10.1016/j.bbamcr.2014.10.009.
short: D. Kawada, H. Kobayashi, T. Tomita, E. Nakata, M. Nagano, D.E. Siekhaus,
J. Toshima, J. Toshimaa, Biochimica et Biophysica Acta - Molecular Cell Research
1853 (2015) 144–156.
date_created: 2018-12-11T11:55:17Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2025-09-23T14:51:55Z
day: '01'
ddc:
- '570'
department:
- _id: DaSi
doi: 10.1016/j.bbamcr.2014.10.009
external_id:
isi:
- '000347598100014'
file:
- access_level: open_access
checksum: 5bb328edebb6a91337cadd7d63f961b7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:18Z
date_updated: 2020-07-14T12:45:25Z
file_id: '4936'
file_name: IST-2016-615-v1+1_BBAMCR.pdf
file_size: 926685
relation: main_file
file_date_updated: 2020-07-14T12:45:25Z
fulldoi: https://doi.org/10.1016/j.bbamcr.2014.10.009
has_accepted_license: '1'
intvolume: ' 1853'
isi: 1
issue: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '01'
oa: 1
oa_version: Submitted Version
page: 144 - 156
publication: Biochimica et Biophysica Acta - Molecular Cell Research
publication_status: published
publisher: Elsevier
publist_id: '5047'
pubrep_id: '615'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface
proteins
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 1853
year: '2015'
...
---
_id: '2030'
abstract:
- lang: eng
text: A hybrid-parallel direct-numerical-simulation method with application to turbulent
Taylor-Couette flow is presented. The Navier-Stokes equations are discretized
in cylindrical coordinates with the spectral Fourier-Galerkin method in the axial
and azimuthal directions, and high-order finite differences in the radial direction.
Time is advanced by a second-order, semi-implicit projection scheme, which requires
the solution of five Helmholtz/Poisson equations, avoids staggered grids and renders
very small slip velocities. Nonlinear terms are evaluated with the pseudospectral
method. The code is parallelized using a hybrid MPI-OpenMP strategy, which, compared
with a flat MPI parallelization, is simpler to implement, allows to reduce inter-node
communications and MPI overhead that become relevant at high processor-core counts,
and helps to contain the memory footprint. A strong scaling study shows that the
hybrid code maintains scalability up to more than 20,000 processor cores and thus
allows to perform simulations at higher resolutions than previously feasible.
In particular, it opens up the possibility to simulate turbulent Taylor-Couette
flows at Reynolds numbers up to O(105). This enables to probe hydrodynamic turbulence
in Keplerian flows in experimentally relevant regimes.
article_processing_charge: No
arxiv: 1
author:
- first_name: Liang
full_name: Shi, Liang
id: 374A3F1A-F248-11E8-B48F-1D18A9856A87
last_name: Shi
- first_name: Markus
full_name: Rampp, Markus
last_name: Rampp
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
citation:
ama: Shi L, Rampp M, Hof B, Avila M. A hybrid MPI-OpenMP parallel implementation
for pseudospectral simulations with application to Taylor-Couette flow. Computers
and Fluids. 2015;106(1):1-11. doi:10.1016/j.compfluid.2014.09.021
apa: Shi, L., Rampp, M., Hof, B., & Avila, M. (2015). A hybrid MPI-OpenMP parallel
implementation for pseudospectral simulations with application to Taylor-Couette
flow. Computers and Fluids. Elsevier. https://doi.org/10.1016/j.compfluid.2014.09.021
chicago: Shi, Liang, Markus Rampp, Björn Hof, and Marc Avila. “A Hybrid MPI-OpenMP
Parallel Implementation for Pseudospectral Simulations with Application to Taylor-Couette
Flow.” Computers and Fluids. Elsevier, 2015. https://doi.org/10.1016/j.compfluid.2014.09.021.
ieee: L. Shi, M. Rampp, B. Hof, and M. Avila, “A hybrid MPI-OpenMP parallel implementation
for pseudospectral simulations with application to Taylor-Couette flow,” Computers
and Fluids, vol. 106, no. 1. Elsevier, pp. 1–11, 2015.
ista: Shi L, Rampp M, Hof B, Avila M. 2015. A hybrid MPI-OpenMP parallel implementation
for pseudospectral simulations with application to Taylor-Couette flow. Computers
and Fluids. 106(1), 1–11.
mla: Shi, Liang, et al. “A Hybrid MPI-OpenMP Parallel Implementation for Pseudospectral
Simulations with Application to Taylor-Couette Flow.” Computers and Fluids,
vol. 106, no. 1, Elsevier, 2015, pp. 1–11, doi:10.1016/j.compfluid.2014.09.021.
short: L. Shi, M. Rampp, B. Hof, M. Avila, Computers and Fluids 106 (2015) 1–11.
date_created: 2018-12-11T11:55:18Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2025-09-22T14:31:33Z
day: '01'
department:
- _id: BjHo
doi: 10.1016/j.compfluid.2014.09.021
external_id:
arxiv:
- '1311.2481'
isi:
- '000346213200001'
fulldoi: https://doi.org/10.1016/j.compfluid.2014.09.021
intvolume: ' 106'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1311.2481
month: '01'
oa: 1
oa_version: Preprint
page: 1 - 11
publication: Computers and Fluids
publication_status: published
publisher: Elsevier
publist_id: '5042'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations
with application to Taylor-Couette flow
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 106
year: '2015'
...
---
_id: '2035'
abstract:
- lang: eng
text: "Considering a continuous self-map and the induced endomorphism on homology,
we study the eigenvalues and eigenspaces of the latter. Taking a filtration of
representations, we define the persistence of the eigenspaces, effectively introducing
a hierarchical organization of the map. The algorithm that computes this information
for a finite sample is proved to be stable, and to give the correct answer for
a sufficiently dense sample. Results computed with an implementation of the algorithm
provide evidence of its practical utility.\r\n"
acknowledgement: This research is partially supported by the Toposys project FP7-ICT-318493-STREP,
by ESF under the ACAT Research Network Programme, by the Russian Government under
mega project 11.G34.31.0053, and by the Polish National Science Center under Grant
No. N201 419639.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Grzegorz
full_name: Jablonski, Grzegorz
id: 4483EF78-F248-11E8-B48F-1D18A9856A87
last_name: Jablonski
orcid: 0000-0002-3536-9866
- first_name: Marian
full_name: Mrozek, Marian
last_name: Mrozek
citation:
ama: Edelsbrunner H, Jablonski G, Mrozek M. The persistent homology of a self-map.
Foundations of Computational Mathematics. 2015;15(5):1213-1244. doi:10.1007/s10208-014-9223-y
apa: Edelsbrunner, H., Jablonski, G., & Mrozek, M. (2015). The persistent homology
of a self-map. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-014-9223-y
chicago: Edelsbrunner, Herbert, Grzegorz Jablonski, and Marian Mrozek. “The Persistent
Homology of a Self-Map.” Foundations of Computational Mathematics. Springer,
2015. https://doi.org/10.1007/s10208-014-9223-y.
ieee: H. Edelsbrunner, G. Jablonski, and M. Mrozek, “The persistent homology of
a self-map,” Foundations of Computational Mathematics, vol. 15, no. 5.
Springer, pp. 1213–1244, 2015.
ista: Edelsbrunner H, Jablonski G, Mrozek M. 2015. The persistent homology of a
self-map. Foundations of Computational Mathematics. 15(5), 1213–1244.
mla: Edelsbrunner, Herbert, et al. “The Persistent Homology of a Self-Map.” Foundations
of Computational Mathematics, vol. 15, no. 5, Springer, 2015, pp. 1213–44,
doi:10.1007/s10208-014-9223-y.
short: H. Edelsbrunner, G. Jablonski, M. Mrozek, Foundations of Computational Mathematics
15 (2015) 1213–1244.
date_created: 2018-12-11T11:55:20Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2025-09-23T14:08:54Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/s10208-014-9223-y
ec_funded: 1
external_id:
isi:
- '000360862900004'
file:
- access_level: open_access
checksum: 3566f3a8b0c1bc550e62914a88c584ff
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:10Z
date_updated: 2020-07-14T12:45:26Z
file_id: '4670'
file_name: IST-2016-486-v1+1_s10208-014-9223-y.pdf
file_size: 1317546
relation: main_file
file_date_updated: 2020-07-14T12:45:26Z
fulldoi: https://doi.org/10.1007/s10208-014-9223-y
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '10'
oa: 1
oa_version: Published Version
page: 1213 - 1244
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Foundations of Computational Mathematics
publication_status: published
publisher: Springer
publist_id: '5022'
pubrep_id: '486'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The persistent homology of a self-map
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 15
year: '2015'
...
---
_id: '10794'
abstract:
- lang: eng
text: Mathematical models are of fundamental importance in the understanding of
complex population dynamics. For instance, they can be used to predict the population
evolution starting from different initial conditions or to test how a system responds
to external perturbations. For this analysis to be meaningful in real applications,
however, it is of paramount importance to choose an appropriate model structure
and to infer the model parameters from measured data. While many parameter inference
methods are available for models based on deterministic ordinary differential
equations, the same does not hold for more detailed individual-based models. Here
we consider, in particular, stochastic models in which the time evolution of the
species abundances is described by a continuous-time Markov chain. These models
are governed by a master equation that is typically difficult to solve. Consequently,
traditional inference methods that rely on iterative evaluation of parameter likelihoods
are computationally intractable. The aim of this paper is to present recent advances
in parameter inference for continuous-time Markov chain models, based on a moment
closure approximation of the parameter likelihood, and to investigate how these
results can help in understanding, and ultimately controlling, complex systems
in ecology. Specifically, we illustrate through an agricultural pest case study
how parameters of a stochastic individual-based model can be identified from measured
data and how the resulting model can be used to solve an optimal control problem
in a stochastic setting. In particular, we show how the matter of determining
the optimal combination of two different pest control methods can be formulated
as a chance constrained optimization problem where the control action is modeled
as a state reset, leading to a hybrid system formulation.
acknowledgement: "The authors would like to acknowledge contributions from Baptiste
Mottet who performed preliminary analysis regarding parameter inference for the
considered case study in a student project (Mottet, 2014/2015).\r\nThe research
leading to these results has received funding from the People Programme (Marie Curie
Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under
REA grant agreement No. [291734] and from SystemsX under the project SignalX."
article_number: '42'
article_processing_charge: No
article_type: original
author:
- first_name: Francesca
full_name: Parise, Francesca
last_name: Parise
- first_name: John
full_name: Lygeros, John
last_name: Lygeros
- first_name: Jakob
full_name: Ruess, Jakob
id: 4A245D00-F248-11E8-B48F-1D18A9856A87
last_name: Ruess
orcid: 0000-0003-1615-3282
citation:
ama: 'Parise F, Lygeros J, Ruess J. Bayesian inference for stochastic individual-based
models of ecological systems: a pest control simulation study. Frontiers in
Environmental Science. 2015;3. doi:10.3389/fenvs.2015.00042'
apa: 'Parise, F., Lygeros, J., & Ruess, J. (2015). Bayesian inference for stochastic
individual-based models of ecological systems: a pest control simulation study.
Frontiers in Environmental Science. Frontiers. https://doi.org/10.3389/fenvs.2015.00042'
chicago: 'Parise, Francesca, John Lygeros, and Jakob Ruess. “Bayesian Inference
for Stochastic Individual-Based Models of Ecological Systems: A Pest Control Simulation
Study.” Frontiers in Environmental Science. Frontiers, 2015. https://doi.org/10.3389/fenvs.2015.00042.'
ieee: 'F. Parise, J. Lygeros, and J. Ruess, “Bayesian inference for stochastic individual-based
models of ecological systems: a pest control simulation study,” Frontiers in
Environmental Science, vol. 3. Frontiers, 2015.'
ista: 'Parise F, Lygeros J, Ruess J. 2015. Bayesian inference for stochastic individual-based
models of ecological systems: a pest control simulation study. Frontiers in Environmental
Science. 3, 42.'
mla: 'Parise, Francesca, et al. “Bayesian Inference for Stochastic Individual-Based
Models of Ecological Systems: A Pest Control Simulation Study.” Frontiers in
Environmental Science, vol. 3, 42, Frontiers, 2015, doi:10.3389/fenvs.2015.00042.'
short: F. Parise, J. Lygeros, J. Ruess, Frontiers in Environmental Science 3 (2015).
corr_author: '1'
date_created: 2022-02-25T11:42:25Z
date_published: 2015-06-10T00:00:00Z
date_updated: 2025-04-15T06:50:01Z
day: '10'
ddc:
- '000'
- '570'
department:
- _id: ToHe
- _id: GaTk
doi: 10.3389/fenvs.2015.00042
ec_funded: 1
file:
- access_level: open_access
checksum: 26c222487564e1be02a11d688d6f769d
content_type: application/pdf
creator: dernst
date_created: 2022-02-25T11:55:26Z
date_updated: 2022-02-25T11:55:26Z
file_id: '10795'
file_name: 2015_FrontiersEnvironmScience_Parise.pdf
file_size: 1371201
relation: main_file
success: 1
file_date_updated: 2022-02-25T11:55:26Z
fulldoi: https://doi.org/10.3389/fenvs.2015.00042
has_accepted_license: '1'
intvolume: ' 3'
keyword:
- General Environmental Science
language:
- iso: eng
month: '06'
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
publication: Frontiers in Environmental Science
publication_identifier:
issn:
- 2296-665X
publication_status: published
publisher: Frontiers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Bayesian inference for stochastic individual-based models of ecological systems:
a pest control simulation study'
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: 3
year: '2015'
...
---
OA_place: publisher
OA_type: green
_id: '10796'
abstract:
- lang: eng
text: 'We consider concurrent mean-payoff games, a very well-studied class of two-player
(player 1 vs player 2) zero-sum games on finite-state graphs where every transition
is assigned a reward between 0 and 1, and the payoff function is the long-run
average of the rewards. The value is the maximal expected payoff that player 1
can guarantee against all strategies of player 2. We consider the computation
of the set of states with value 1 under finite-memory strategies for player 1,
and our main results for the problem are as follows: (1) we present a polynomial-time
algorithm; (2) we show that whenever there is a finite-memory strategy, there
is a stationary strategy that does not need memory at all; and (3) we present
an optimal bound (which is double exponential) on the patience of stationary strategies
(where patience of a distribution is the inverse of the smallest positive probability
and represents a complexity measure of a stationary strategy).'
acknowledgement: "The research was partly supported by FWF Grant No P 23499-N23, FWF
NFN Grant\r\nNo S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
faculty fellows award."
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- 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, Ibsen-Jensen R. The value 1 problem under finite-memory strategies
for concurrent mean-payoff games. In: Proceedings of the Twenty-Sixth Annual
ACM-SIAM Symposium on Discrete Algorithms. Vol 2015. SIAM; 2015:1018-1029.
doi:10.1137/1.9781611973730.69'
apa: 'Chatterjee, K., & Ibsen-Jensen, R. (2015). The value 1 problem under finite-memory
strategies for concurrent mean-payoff games. In Proceedings of the Twenty-Sixth
Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2015, pp. 1018–1029).
San Diego, CA, United States: SIAM. https://doi.org/10.1137/1.9781611973730.69'
chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under
Finite-Memory Strategies for Concurrent Mean-Payoff Games.” In Proceedings
of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015:1018–29.
SIAM, 2015. https://doi.org/10.1137/1.9781611973730.69.
ieee: K. Chatterjee and R. Ibsen-Jensen, “The value 1 problem under finite-memory
strategies for concurrent mean-payoff games,” in Proceedings of the Twenty-Sixth
Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States,
2015, vol. 2015, no. 1, pp. 1018–1029.
ista: 'Chatterjee K, Ibsen-Jensen R. 2015. The value 1 problem under finite-memory
strategies for concurrent mean-payoff games. Proceedings of the Twenty-Sixth Annual
ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms
vol. 2015, 1018–1029.'
mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under
Finite-Memory Strategies for Concurrent Mean-Payoff Games.” Proceedings of
the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2015,
no. 1, SIAM, 2015, pp. 1018–29, doi:10.1137/1.9781611973730.69.
short: K. Chatterjee, R. Ibsen-Jensen, in:, Proceedings of the Twenty-Sixth Annual
ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2015, pp. 1018–1029.
conference:
end_date: 2015-01-06
location: San Diego, CA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2015-01-04
corr_author: '1'
date_created: 2022-02-25T12:18:43Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2025-06-26T06:54:08Z
day: '01'
department:
- _id: KrCh
doi: 10.1137/1.9781611973730.69
ec_funded: 1
external_id:
arxiv:
- '1409.6690'
fulldoi: https://doi.org/10.1137/1.9781611973730.69
intvolume: ' 2015'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1409.6690
month: '01'
oa: 1
oa_version: Preprint
page: 1018-1029
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _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'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete
Algorithms
publication_identifier:
isbn:
- 978-161197374-7
publication_status: published
publisher: SIAM
quality_controlled: '1'
scopus_import: '1'
status: public
title: The value 1 problem under finite-memory strategies for concurrent mean-payoff
games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2015
year: '2015'
...
---
_id: '802'
abstract:
- lang: eng
text: Glycoinositolphosphoceramides (GIPCs) are complex sphingolipids present at
the plasma membrane of various eukaryotes with the important exception of mammals.
In fungi, these glycosphingolipids commonly contain an alpha-mannose residue (Man)
linked at position 2 of the inositol. However, several pathogenic fungi additionally
synthesize zwitterionic GIPCs carrying an alpha-glucosamine residue (GlcN) at
this position. In the human pathogen Aspergillus fumigatus, the GlcNalpha1,2IPC
core (where IPC is inositolphosphoceramide) is elongated to Manalpha1,3Manalpha1,6GlcNalpha1,2IPC,
which is the most abundant GIPC synthesized by this fungus. In this study, we
identified an A. fumigatus N-acetylglucosaminyltransferase, named GntA, and demonstrate
its involvement in the initiation of zwitterionic GIPC biosynthesis. Targeted
deletion of the gene encoding GntA in A. fumigatus resulted in complete absence
of zwitterionic GIPC; a phenotype that could be reverted by episomal expression
of GntA in the mutant. The N-acetylhexosaminyltransferase activity of GntA was
substantiated by production of N-acetylhexosamine-IPC in the yeast Saccharomyces
cerevisiae upon GntA expression. Using an in vitro assay, GntA was furthermore
shown to use UDP-N-acetylglucosamine as donor substrate to generate a glycolipid
product resistant to saponification and to digestion by phosphatidylinositol-phospholipase
C as expected for GlcNAcalpha1,2IPC. Finally, as the enzymes involved in mannosylation
of IPC, GntA was localized to the Golgi apparatus, the site of IPC synthesis.
article_processing_charge: No
author:
- first_name: Jakob
full_name: Engel, Jakob
last_name: Engel
- first_name: Philipp S
full_name: Schmalhorst, Philipp S
id: 309D50DA-F248-11E8-B48F-1D18A9856A87
last_name: Schmalhorst
orcid: 0000-0002-5795-0133
- first_name: Anke
full_name: Kruger, Anke
last_name: Kruger
- first_name: Christina
full_name: Muller, Christina
last_name: Muller
- first_name: Falk
full_name: Buettner, Falk
last_name: Buettner
- first_name: Françoise
full_name: Routier, Françoise
last_name: Routier
citation:
ama: Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. Characterization
of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic
glycoinositolphosphoceramide biosynthesis. Glycobiology. 2015;25(12):1423-1430.
doi:10.1093/glycob/cwv059
apa: Engel, J., Schmalhorst, P. S., Kruger, A., Muller, C., Buettner, F., &
Routier, F. (2015). Characterization of an N-acetylglucosaminyltransferase involved
in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis.
Glycobiology. Oxford University Press. https://doi.org/10.1093/glycob/cwv059
chicago: Engel, Jakob, Philipp S Schmalhorst, Anke Kruger, Christina Muller, Falk
Buettner, and Françoise Routier. “Characterization of an N-Acetylglucosaminyltransferase
Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.”
Glycobiology. Oxford University Press, 2015. https://doi.org/10.1093/glycob/cwv059.
ieee: J. Engel, P. S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, and F. Routier,
“Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus
fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis,” Glycobiology,
vol. 25, no. 12. Oxford University Press, pp. 1423–1430, 2015.
ista: Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. 2015.
Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus
fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology.
25(12), 1423–1430.
mla: Engel, Jakob, et al. “Characterization of an N-Acetylglucosaminyltransferase
Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.”
Glycobiology, vol. 25, no. 12, Oxford University Press, 2015, pp. 1423–30,
doi:10.1093/glycob/cwv059.
short: J. Engel, P.S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, F. Routier,
Glycobiology 25 (2015) 1423–1430.
date_created: 2018-12-11T11:48:35Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2025-09-23T08:14:24Z
day: '01'
department:
- _id: CaHe
doi: 10.1093/glycob/cwv059
external_id:
isi:
- '000368443700010'
pmid:
- '26306635'
fulldoi: https://doi.org/10.1093/glycob/cwv059
intvolume: ' 25'
isi: 1
issue: '12'
language:
- iso: eng
month: '12'
oa_version: None
page: 1423 - 1430
pmid: 1
publication: Glycobiology
publication_status: published
publisher: Oxford University Press
publist_id: '6851'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus
fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 25
year: '2015'
...
---
_id: '8183'
abstract:
- lang: eng
text: "We study conditions under which a finite simplicial complex $K$ can be mapped
to $\\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding
is a map $f: K\\to \\mathbb R^d$ such that the images of any $r$\r\npairwise disjoint
simplices of $K$ do not have a common point. We show that if $r$ is not a prime
power and $d\\geq 2r+1$, then there is a counterexample to the topological Tverberg
conjecture, i.e., there is an almost $r$-embedding of\r\nthe $(d+1)(r-1)$-simplex
in $\\mathbb R^d$. This improves on previous constructions of counterexamples
(for $d\\geq 3r$) based on a series of papers by M. \\\"Ozaydin, M. Gromov, P.
Blagojevi\\'c, F. Frick, G. Ziegler, and the second and fourth present authors.
The counterexamples are obtained by proving the following algebraic criterion
in codimension 2: If $r\\ge3$ and if $K$ is a finite $2(r-1)$-complex then there
exists an almost $r$-embedding $K\\to \\mathbb R^{2r}$ if and only if there exists
a general position PL map $f:K\\to \\mathbb R^{2r}$ such that the algebraic intersection
number of the $f$-images of any $r$ pairwise disjoint simplices of $K$ is zero.
This result can be restated in terms of cohomological obstructions or equivariant
maps, and extends an analogous codimension 3 criterion by the second and fourth
authors. As another application we classify ornaments $f:S^3 \\sqcup S^3\\sqcup
S^3\\to \\mathbb R^5$ up to ornament\r\nconcordance. It follows from work of M.
Freedman, V. Krushkal and P. Teichner that the analogous criterion for $r=2$ is
false. We prove a lemma on singular higher-dimensional Borromean rings, yielding
an elementary proof of the counterexample."
acknowledgement: We would like to thank A. Klyachko, V. Krushkal, S. Melikhov, M.
Tancer, P. Teichner and anonymous referees for helpful discussions.
article_number: '1511.03501'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
- first_name: Isaac
full_name: Mabillard, Isaac
id: 32BF9DAA-F248-11E8-B48F-1D18A9856A87
last_name: Mabillard
- first_name: A.
full_name: Skopenkov, A.
last_name: Skopenkov
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity
intersections, III. Codimension 2. arXiv. doi:10.48550/arXiv.1511.03501
apa: Avvakumov, S., Mabillard, I., Skopenkov, A., & Wagner, U. (n.d.). Eliminating
higher-multiplicity intersections, III. Codimension 2. arXiv. https://doi.org/10.48550/arXiv.1511.03501
chicago: Avvakumov, Sergey, Isaac Mabillard, A. Skopenkov, and Uli Wagner. “Eliminating
Higher-Multiplicity Intersections, III. Codimension 2.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1511.03501.
ieee: S. Avvakumov, I. Mabillard, A. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity
intersections, III. Codimension 2,” arXiv. .
ista: Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity
intersections, III. Codimension 2. arXiv, 1511.03501.
mla: Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III.
Codimension 2.” ArXiv, 1511.03501, doi:10.48550/arXiv.1511.03501.
short: S. Avvakumov, I. Mabillard, A. Skopenkov, U. Wagner, ArXiv (n.d.).
corr_author: '1'
date_created: 2020-07-30T10:45:19Z
date_published: 2015-11-15T00:00:00Z
date_updated: 2026-04-08T07:25:54Z
day: '15'
department:
- _id: UlWa
doi: 10.48550/arXiv.1511.03501
external_id:
arxiv:
- '1511.03501'
fulldoi: https://doi.org/10.48550/arXiv.1511.03501
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.03501
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '9308'
relation: later_version
status: public
- id: '10220'
relation: later_version
status: public
- id: '8156'
relation: dissertation_contains
status: public
status: public
title: Eliminating higher-multiplicity intersections, III. Codimension 2
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '9532'
abstract:
- lang: eng
text: Genomic imprinting, an inherently epigenetic phenomenon defined by parent
of origin-dependent gene expression, is observed in mammals and flowering plants.
Genome-scale surveys of imprinted expression and the underlying differential epigenetic
marks have led to the discovery of hundreds of imprinted plant genes and confirmed
DNA and histone methylation as key regulators of plant imprinting. However, the
biological roles of the vast majority of imprinted plant genes are unknown, and
the evolutionary forces shaping plant imprinting remain rather opaque. Here, we
review the mechanisms of plant genomic imprinting and discuss theories of imprinting
evolution and biological significance in light of recent findings.
article_processing_charge: No
article_type: review
author:
- first_name: Jessica A.
full_name: Rodrigues, Jessica A.
last_name: Rodrigues
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Rodrigues JA, Zilberman D. Evolution and function of genomic imprinting in
plants. Genes and Development. 2015;29(24):2517–2531. doi:10.1101/gad.269902.115
apa: Rodrigues, J. A., & Zilberman, D. (2015). Evolution and function of genomic
imprinting in plants. Genes and Development. Cold Spring Harbor Laboratory
Press. https://doi.org/10.1101/gad.269902.115
chicago: Rodrigues, Jessica A., and Daniel Zilberman. “Evolution and Function of
Genomic Imprinting in Plants.” Genes and Development. Cold Spring Harbor
Laboratory Press, 2015. https://doi.org/10.1101/gad.269902.115.
ieee: J. A. Rodrigues and D. Zilberman, “Evolution and function of genomic imprinting
in plants,” Genes and Development, vol. 29, no. 24. Cold Spring Harbor
Laboratory Press, pp. 2517–2531, 2015.
ista: Rodrigues JA, Zilberman D. 2015. Evolution and function of genomic imprinting
in plants. Genes and Development. 29(24), 2517–2531.
mla: Rodrigues, Jessica A., and Daniel Zilberman. “Evolution and Function of Genomic
Imprinting in Plants.” Genes and Development, vol. 29, no. 24, Cold Spring
Harbor Laboratory Press, 2015, pp. 2517–2531, doi:10.1101/gad.269902.115.
short: J.A. Rodrigues, D. Zilberman, Genes and Development 29 (2015) 2517–2531.
date_created: 2021-06-08T09:56:24Z
date_published: 2015-12-15T00:00:00Z
date_updated: 2021-12-14T07:58:15Z
day: '15'
ddc:
- '570'
department:
- _id: DaZi
doi: 10.1101/gad.269902.115
extern: '1'
external_id:
pmid:
- '26680300'
file:
- access_level: open_access
checksum: 086a88cfca4677646da26ed960cb02e9
content_type: application/pdf
creator: asandaue
date_created: 2021-06-08T09:55:10Z
date_updated: 2021-06-08T09:55:10Z
file_id: '9533'
file_name: 2015_GenesAndDevelopment_Rodrigues.pdf
file_size: 1116846
relation: main_file
success: 1
file_date_updated: 2021-06-08T09:55:10Z
fulldoi: https://doi.org/10.1101/gad.269902.115
has_accepted_license: '1'
intvolume: ' 29'
issue: '24'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 2517–2531
pmid: 1
publication: Genes and Development
publication_identifier:
eissn:
- 1549-5477
issn:
- 0890-9369
publication_status: published
publisher: Cold Spring Harbor Laboratory Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolution and function of genomic imprinting in plants
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 29
year: '2015'
...
---
_id: '9711'
article_processing_charge: No
author:
- first_name: Guillaume
full_name: Chevereau, Guillaume
id: 424D78A0-F248-11E8-B48F-1D18A9856A87
last_name: Chevereau
- first_name: Marta
full_name: Lukacisinova, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisinova
orcid: 0000-0002-2519-8004
- first_name: Tugce
full_name: Batur, Tugce
last_name: Batur
- first_name: Aysegul
full_name: Guvenek, Aysegul
last_name: Guvenek
- first_name: Dilay Hazal
full_name: Ayhan, Dilay Hazal
last_name: Ayhan
- first_name: Erdal
full_name: Toprak, Erdal
last_name: Toprak
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: Chevereau G, Lukacisinova M, Batur T, et al. Excel file containing the raw
data for all figures. 2015. doi:10.1371/journal.pbio.1002299.s001
apa: Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D. H., Toprak,
E., & Bollenbach, M. T. (2015). Excel file containing the raw data for all
figures. Public Library of Science. https://doi.org/10.1371/journal.pbio.1002299.s001
chicago: Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek,
Dilay Hazal Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Excel File Containing
the Raw Data for All Figures.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pbio.1002299.s001.
ieee: G. Chevereau et al., “Excel file containing the raw data for all figures.”
Public Library of Science, 2015.
ista: Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan DH, Toprak E, Bollenbach
MT. 2015. Excel file containing the raw data for all figures, Public Library of
Science, 10.1371/journal.pbio.1002299.s001.
mla: Chevereau, Guillaume, et al. Excel File Containing the Raw Data for All
Figures. Public Library of Science, 2015, doi:10.1371/journal.pbio.1002299.s001.
short: G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D.H. Ayhan, E. Toprak,
M.T. Bollenbach, (2015).
date_created: 2021-07-23T11:53:50Z
date_published: 2015-11-18T00:00:00Z
date_updated: 2025-09-23T09:58:54Z
day: '18'
department:
- _id: ToBo
doi: 10.1371/journal.pbio.1002299.s001
fulldoi: https://doi.org/10.1371/journal.pbio.1002299.s001
month: '11'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1619'
relation: used_in_publication
status: public
status: public
title: Excel file containing the raw data for all figures
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9712'
article_processing_charge: No
author:
- first_name: Murat
full_name: Tugrul, Murat
id: 37C323C6-F248-11E8-B48F-1D18A9856A87
last_name: Tugrul
orcid: 0000-0002-8523-0758
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: Tugrul M, Paixao T, Barton NH, Tkačik G. Other fitness models for comparison
& for interacting TFBSs. 2015. doi:10.1371/journal.pgen.1005639.s001
apa: Tugrul, M., Paixao, T., Barton, N. H., & Tkačik, G. (2015). Other fitness
models for comparison & for interacting TFBSs. Public Library of Science.
https://doi.org/10.1371/journal.pgen.1005639.s001
chicago: Tugrul, Murat, Tiago Paixao, Nicholas H Barton, and Gašper Tkačik. “Other
Fitness Models for Comparison & for Interacting TFBSs.” Public Library of
Science, 2015. https://doi.org/10.1371/journal.pgen.1005639.s001.
ieee: M. Tugrul, T. Paixao, N. H. Barton, and G. Tkačik, “Other fitness models for
comparison & for interacting TFBSs.” Public Library of Science, 2015.
ista: Tugrul M, Paixao T, Barton NH, Tkačik G. 2015. Other fitness models for comparison
& for interacting TFBSs, Public Library of Science, 10.1371/journal.pgen.1005639.s001.
mla: Tugrul, Murat, et al. Other Fitness Models for Comparison & for Interacting
TFBSs. Public Library of Science, 2015, doi:10.1371/journal.pgen.1005639.s001.
short: M. Tugrul, T. Paixao, N.H. Barton, G. Tkačik, (2015).
date_created: 2021-07-23T12:00:37Z
date_published: 2015-11-06T00:00:00Z
date_updated: 2025-09-23T08:31:14Z
day: '06'
department:
- _id: NiBa
- _id: CaGu
- _id: GaTk
doi: 10.1371/journal.pgen.1005639.s001
fulldoi: https://doi.org/10.1371/journal.pgen.1005639.s001
month: '11'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1666'
relation: used_in_publication
status: public
status: public
title: Other fitness models for comparison & for interacting TFBSs
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9715'
article_processing_charge: No
author:
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
orcid: 0000-0002-2519-824X
- first_name: Reinmar
full_name: Hager, Reinmar
last_name: Hager
citation:
ama: Trubenova B, Novak S, Hager R. Mathematical inference of the results. 2015.
doi:10.1371/journal.pone.0126907.s001
apa: Trubenova, B., Novak, S., & Hager, R. (2015). Mathematical inference of
the results. Public Library of Science. https://doi.org/10.1371/journal.pone.0126907.s001
chicago: Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Mathematical Inference
of the Results.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0126907.s001.
ieee: B. Trubenova, S. Novak, and R. Hager, “Mathematical inference of the results.”
Public Library of Science, 2015.
ista: Trubenova B, Novak S, Hager R. 2015. Mathematical inference of the results,
Public Library of Science, 10.1371/journal.pone.0126907.s001.
mla: Trubenova, Barbora, et al. Mathematical Inference of the Results. Public
Library of Science, 2015, doi:10.1371/journal.pone.0126907.s001.
short: B. Trubenova, S. Novak, R. Hager, (2015).
date_created: 2021-07-23T12:11:30Z
date_published: 2015-05-18T00:00:00Z
date_updated: 2025-09-23T09:21:54Z
day: '18'
department:
- _id: NiBa
doi: 10.1371/journal.pone.0126907.s001
fulldoi: https://doi.org/10.1371/journal.pone.0126907.s001
month: '05'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1809'
relation: used_in_publication
status: public
status: public
title: Mathematical inference of the results
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9718'
article_processing_charge: No
author:
- first_name: Tamar
full_name: Friedlander, Tamar
id: 36A5845C-F248-11E8-B48F-1D18A9856A87
last_name: Friedlander
- first_name: Avraham E.
full_name: Mayo, Avraham E.
last_name: Mayo
- first_name: Tsvi
full_name: Tlusty, Tsvi
last_name: Tlusty
- first_name: Uri
full_name: Alon, Uri
last_name: Alon
citation:
ama: Friedlander T, Mayo AE, Tlusty T, Alon U. Supporting information text. 2015.
doi:10.1371/journal.pcbi.1004055.s001
apa: Friedlander, T., Mayo, A. E., Tlusty, T., & Alon, U. (2015). Supporting
information text. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004055.s001
chicago: Friedlander, Tamar, Avraham E. Mayo, Tsvi Tlusty, and Uri Alon. “Supporting
Information Text.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004055.s001.
ieee: T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Supporting information
text.” Public Library of Science, 2015.
ista: Friedlander T, Mayo AE, Tlusty T, Alon U. 2015. Supporting information text,
Public Library of Science, 10.1371/journal.pcbi.1004055.s001.
mla: Friedlander, Tamar, et al. Supporting Information Text. Public Library
of Science, 2015, doi:10.1371/journal.pcbi.1004055.s001.
short: T. Friedlander, A.E. Mayo, T. Tlusty, U. Alon, (2015).
date_created: 2021-07-26T08:35:23Z
date_published: 2015-03-23T00:00:00Z
date_updated: 2025-09-23T08:43:16Z
day: '23'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1004055.s001
fulldoi: https://doi.org/10.1371/journal.pcbi.1004055.s001
month: '03'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1827'
relation: used_in_publication
status: public
status: public
title: Supporting information text
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9719'
abstract:
- lang: eng
text: Parasitism creates selection for resistance mechanisms in host populations
and is hypothesized to promote increased host evolvability. However, the influence
of these traits on host evolution when parasites are no longer present is unclear.
We used experimental evolution and whole-genome sequencing of Escherichia coli
to determine the effects of past and present exposure to parasitic viruses (phages)
on the spread of mutator alleles, resistance, and bacterial competitive fitness.
We found that mutator alleles spread rapidly during adaptation to any of four
different phage species, and this pattern was even more pronounced with multiple
phages present simultaneously. However, hypermutability did not detectably accelerate
adaptation in the absence of phages and recovery of fitness costs associated with
resistance. Several lineages evolved phage resistance through elevated mucoidy,
and during subsequent evolution in phage-free conditions they rapidly reverted
to nonmucoid, phage-susceptible phenotypes. Genome sequencing revealed that this
phenotypic reversion was achieved by additional genetic changes rather than by
genotypic reversion of the initial resistance mutations. Insertion sequence (IS)
elements played a key role in both the acquisition of resistance and adaptation
in the absence of parasites; unlike single nucleotide polymorphisms, IS insertions
were not more frequent in mutator lineages. Our results provide a genetic explanation
for rapid reversion of mucoidy, a phenotype observed in other bacterial species
including human pathogens. Moreover, this demonstrates that the types of genetic
change underlying adaptation to fitness costs, and consequently the impact of
evolvability mechanisms such as increased point-mutation rates, depend critically
on the mechanism of resistance.
article_processing_charge: No
author:
- first_name: Sébastien
full_name: Wielgoss, Sébastien
last_name: Wielgoss
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Anna M.
full_name: Bischofberger, Anna M.
last_name: Bischofberger
- first_name: Alex R.
full_name: Hall, Alex R.
last_name: Hall
citation:
ama: 'Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. Data from: Adaptation
to parasites and costs of parasite resistance in mutator and non-mutator bacteria.
2015. doi:10.5061/dryad.cj910'
apa: 'Wielgoss, S., Bergmiller, T., Bischofberger, A. M., & Hall, A. R. (2015).
Data from: Adaptation to parasites and costs of parasite resistance in mutator
and non-mutator bacteria. Dryad. https://doi.org/10.5061/dryad.cj910'
chicago: 'Wielgoss, Sébastien, Tobias Bergmiller, Anna M. Bischofberger, and Alex
R. Hall. “Data from: Adaptation to Parasites and Costs of Parasite Resistance
in Mutator and Non-Mutator Bacteria.” Dryad, 2015. https://doi.org/10.5061/dryad.cj910.'
ieee: 'S. Wielgoss, T. Bergmiller, A. M. Bischofberger, and A. R. Hall, “Data from:
Adaptation to parasites and costs of parasite resistance in mutator and non-mutator
bacteria.” Dryad, 2015.'
ista: 'Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. 2015. Data from: Adaptation
to parasites and costs of parasite resistance in mutator and non-mutator bacteria,
Dryad, 10.5061/dryad.cj910.'
mla: 'Wielgoss, Sébastien, et al. Data from: Adaptation to Parasites and Costs
of Parasite Resistance in Mutator and Non-Mutator Bacteria. Dryad, 2015, doi:10.5061/dryad.cj910.'
short: S. Wielgoss, T. Bergmiller, A.M. Bischofberger, A.R. Hall, (2015).
date_created: 2021-07-26T08:44:04Z
date_published: 2015-12-21T00:00:00Z
date_updated: 2026-04-29T05:57:01Z
day: '21'
department:
- _id: CaGu
doi: 10.5061/dryad.cj910
fulldoi: https://doi.org/10.5061/dryad.cj910
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.cj910
month: '12'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '5749'
relation: used_in_publication
status: public
status: public
title: 'Data from: Adaptation to parasites and costs of parasite resistance in mutator
and non-mutator bacteria'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9737'
article_processing_charge: No
author:
- first_name: Olga
full_name: Symonova, Olga
id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87
last_name: Symonova
orcid: 0000-0003-2012-9947
- first_name: Christopher
full_name: Topp, Christopher
last_name: Topp
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Symonova O, Topp C, Edelsbrunner H. Root traits computed by DynamicRoots for
the maize root shown in fig 2. 2015. doi:10.1371/journal.pone.0127657.s001
apa: Symonova, O., Topp, C., & Edelsbrunner, H. (2015). Root traits computed
by DynamicRoots for the maize root shown in fig 2. Public Library of Science.
https://doi.org/10.1371/journal.pone.0127657.s001
chicago: Symonova, Olga, Christopher Topp, and Herbert Edelsbrunner. “Root Traits
Computed by DynamicRoots for the Maize Root Shown in Fig 2.” Public Library of
Science, 2015. https://doi.org/10.1371/journal.pone.0127657.s001.
ieee: O. Symonova, C. Topp, and H. Edelsbrunner, “Root traits computed by DynamicRoots
for the maize root shown in fig 2.” Public Library of Science, 2015.
ista: Symonova O, Topp C, Edelsbrunner H. 2015. Root traits computed by DynamicRoots
for the maize root shown in fig 2, Public Library of Science, 10.1371/journal.pone.0127657.s001.
mla: Symonova, Olga, et al. Root Traits Computed by DynamicRoots for the Maize
Root Shown in Fig 2. Public Library of Science, 2015, doi:10.1371/journal.pone.0127657.s001.
short: O. Symonova, C. Topp, H. Edelsbrunner, (2015).
date_created: 2021-07-28T06:20:13Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2025-09-23T08:30:43Z
day: '01'
department:
- _id: MaJö
- _id: HeEd
doi: 10.1371/journal.pone.0127657.s001
fulldoi: https://doi.org/10.1371/journal.pone.0127657.s001
month: '06'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1793'
relation: used_in_publication
status: public
status: public
title: Root traits computed by DynamicRoots for the maize root shown in fig 2
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9742'
abstract:
- lang: eng
text: 'Repeated pathogen exposure is a common threat in colonies of social insects,
posing selection pressures on colony members to respond with improved disease-defense
performance. We here tested whether experience gained by repeated tending of low-level
fungus-exposed (Metarhizium robertsii) larvae may alter the performance of sanitary
brood care in the clonal ant, Platythyrea punctata. We trained ants individually
over nine consecutive trials to either sham-treated or fungus-exposed larvae.
We then compared the larval grooming behavior of naive and trained ants and measured
how effectively they removed infectious fungal conidiospores from the fungus-exposed
larvae. We found that the ants changed the duration of larval grooming in response
to both, larval treatment and their level of experience: (1) sham-treated larvae
received longer grooming than the fungus-exposed larvae and (2) trained ants performed
less self-grooming but longer larval grooming than naive ants, which was true
for both, ants trained to fungus-exposed and also to sham-treated larvae. Ants
that groomed the fungus-exposed larvae for longer periods removed a higher number
of fungal conidiospores from the surface of the fungus-exposed larvae. As experienced
ants performed longer larval grooming, they were more effective in fungal removal,
thus making them better caretakers under pathogen attack of the colony. By studying
this clonal ant, we can thus conclude that even in the absence of genetic variation
between colony members, differences in experience levels of brood care may affect
performance of sanitary brood care in social insects.'
article_processing_charge: No
author:
- first_name: Claudia
full_name: Westhus, Claudia
last_name: Westhus
- 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: Edouard
full_name: Tourdot, Edouard
last_name: Tourdot
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
- first_name: Claudie
full_name: Doums, Claudie
last_name: Doums
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. Data from:
Increased grooming after repeated brood care provides sanitary benefits in a clonal
ant. 2015. doi:10.5061/dryad.7kc79'
apa: 'Westhus, C., Ugelvig, L. V., Tourdot, E., Heinze, J., Doums, C., & Cremer,
S. (2015). Data from: Increased grooming after repeated brood care provides sanitary
benefits in a clonal ant. Dryad. https://doi.org/10.5061/dryad.7kc79'
chicago: 'Westhus, Claudia, Line V Ugelvig, Edouard Tourdot, Jürgen Heinze, Claudie
Doums, and Sylvia Cremer. “Data from: Increased Grooming after Repeated Brood
Care Provides Sanitary Benefits in a Clonal Ant.” Dryad, 2015. https://doi.org/10.5061/dryad.7kc79.'
ieee: 'C. Westhus, L. V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, and S. Cremer,
“Data from: Increased grooming after repeated brood care provides sanitary benefits
in a clonal ant.” Dryad, 2015.'
ista: 'Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. 2015. Data
from: Increased grooming after repeated brood care provides sanitary benefits
in a clonal ant, Dryad, 10.5061/dryad.7kc79.'
mla: 'Westhus, Claudia, et al. Data from: Increased Grooming after Repeated Brood
Care Provides Sanitary Benefits in a Clonal Ant. Dryad, 2015, doi:10.5061/dryad.7kc79.'
short: C. Westhus, L.V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, S. Cremer, (2015).
date_created: 2021-07-28T08:52:53Z
date_published: 2015-07-09T00:00:00Z
date_updated: 2025-09-29T11:42:25Z
day: '09'
department:
- _id: SyCr
doi: 10.5061/dryad.7kc79
fulldoi: https://doi.org/10.5061/dryad.7kc79
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.7kc79
month: '07'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '2161'
relation: used_in_publication
status: public
status: public
title: 'Data from: Increased grooming after repeated brood care provides sanitary
benefits in a clonal ant'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9765'
article_processing_charge: No
author:
- first_name: Guillaume
full_name: Chevereau, Guillaume
id: 424D78A0-F248-11E8-B48F-1D18A9856A87
last_name: Chevereau
- first_name: Marta
full_name: Lukacisinova, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisinova
orcid: 0000-0002-2519-8004
- first_name: Tugce
full_name: Batur, Tugce
last_name: Batur
- first_name: Aysegul
full_name: Guvenek, Aysegul
last_name: Guvenek
- first_name: Dilay Hazal
full_name: Ayhan, Dilay Hazal
last_name: Ayhan
- first_name: Erdal
full_name: Toprak, Erdal
last_name: Toprak
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: Chevereau G, Lukacisinova M, Batur T, et al. Gene ontology enrichment analysis
for the most sensitive gene deletion strains for all drugs. 2015. doi:10.1371/journal.pbio.1002299.s008
apa: Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D. H., Toprak,
E., & Bollenbach, M. T. (2015). Gene ontology enrichment analysis for the
most sensitive gene deletion strains for all drugs. Public Library of Science.
https://doi.org/10.1371/journal.pbio.1002299.s008
chicago: Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek,
Dilay Hazal Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Gene Ontology Enrichment
Analysis for the Most Sensitive Gene Deletion Strains for All Drugs.” Public Library
of Science, 2015. https://doi.org/10.1371/journal.pbio.1002299.s008.
ieee: G. Chevereau et al., “Gene ontology enrichment analysis for the most
sensitive gene deletion strains for all drugs.” Public Library of Science, 2015.
ista: Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan DH, Toprak E, Bollenbach
MT. 2015. Gene ontology enrichment analysis for the most sensitive gene deletion
strains for all drugs, Public Library of Science, 10.1371/journal.pbio.1002299.s008.
mla: Chevereau, Guillaume, et al. Gene Ontology Enrichment Analysis for the Most
Sensitive Gene Deletion Strains for All Drugs. Public Library of Science,
2015, doi:10.1371/journal.pbio.1002299.s008.
short: G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D.H. Ayhan, E. Toprak,
M.T. Bollenbach, (2015).
date_created: 2021-08-03T07:05:16Z
date_published: 2015-11-18T00:00:00Z
date_updated: 2025-09-23T09:58:54Z
day: '18'
department:
- _id: ToBo
doi: 10.1371/journal.pbio.1002299.s008
fulldoi: https://doi.org/10.1371/journal.pbio.1002299.s008
month: '11'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1619'
relation: used_in_publication
status: public
status: public
title: Gene ontology enrichment analysis for the most sensitive gene deletion strains
for all drugs
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9772'
article_processing_charge: No
author:
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
orcid: 0000-0002-2519-824X
- first_name: Reinmar
full_name: Hager, Reinmar
last_name: Hager
citation:
ama: Trubenova B, Novak S, Hager R. Description of the agent based simulations.
2015. doi:10.1371/journal.pone.0126907.s003
apa: Trubenova, B., Novak, S., & Hager, R. (2015). Description of the agent
based simulations. Public Library of Science. https://doi.org/10.1371/journal.pone.0126907.s003
chicago: Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Description of
the Agent Based Simulations.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0126907.s003.
ieee: B. Trubenova, S. Novak, and R. Hager, “Description of the agent based simulations.”
Public Library of Science, 2015.
ista: Trubenova B, Novak S, Hager R. 2015. Description of the agent based simulations,
Public Library of Science, 10.1371/journal.pone.0126907.s003.
mla: Trubenova, Barbora, et al. Description of the Agent Based Simulations.
Public Library of Science, 2015, doi:10.1371/journal.pone.0126907.s003.
short: B. Trubenova, S. Novak, R. Hager, (2015).
date_created: 2021-08-05T12:55:20Z
date_published: 2015-05-18T00:00:00Z
date_updated: 2025-09-23T09:21:54Z
day: '18'
department:
- _id: NiBa
doi: 10.1371/journal.pone.0126907.s003
fulldoi: https://doi.org/10.1371/journal.pone.0126907.s003
month: '05'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1809'
relation: used_in_publication
status: public
status: public
title: Description of the agent based simulations
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9773'
article_processing_charge: No
author:
- first_name: Tamar
full_name: Friedlander, Tamar
id: 36A5845C-F248-11E8-B48F-1D18A9856A87
last_name: Friedlander
- first_name: Avraham E.
full_name: Mayo, Avraham E.
last_name: Mayo
- first_name: Tsvi
full_name: Tlusty, Tsvi
last_name: Tlusty
- first_name: Uri
full_name: Alon, Uri
last_name: Alon
citation:
ama: Friedlander T, Mayo AE, Tlusty T, Alon U. Evolutionary simulation code. 2015.
doi:10.1371/journal.pcbi.1004055.s002
apa: Friedlander, T., Mayo, A. E., Tlusty, T., & Alon, U. (2015). Evolutionary
simulation code. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004055.s002
chicago: Friedlander, Tamar, Avraham E. Mayo, Tsvi Tlusty, and Uri Alon. “Evolutionary
Simulation Code.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004055.s002.
ieee: T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Evolutionary simulation
code.” Public Library of Science, 2015.
ista: Friedlander T, Mayo AE, Tlusty T, Alon U. 2015. Evolutionary simulation code,
Public Library of Science, 10.1371/journal.pcbi.1004055.s002.
mla: Friedlander, Tamar, et al. Evolutionary Simulation Code. Public Library
of Science, 2015, doi:10.1371/journal.pcbi.1004055.s002.
short: T. Friedlander, A.E. Mayo, T. Tlusty, U. Alon, (2015).
date_created: 2021-08-05T12:58:07Z
date_published: 2015-03-23T00:00:00Z
date_updated: 2025-09-23T08:43:16Z
day: '23'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1004055.s002
fulldoi: https://doi.org/10.1371/journal.pcbi.1004055.s002
month: '03'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1827'
relation: used_in_publication
status: public
status: public
title: Evolutionary simulation code
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
OA_place: repository
OA_type: green
_id: '1729'
abstract:
- lang: eng
text: We present a computer-aided programming approach to concurrency. The approach
allows programmers to program assuming a friendly, non-preemptive scheduler, and
our synthesis procedure inserts synchronization to ensure that the final program
works even with a preemptive scheduler. The correctness specification is implicit,
inferred from the non-preemptive behavior. Let us consider sequences of calls
that the program makes to an external interface. The specification requires that
any such sequence produced under a preemptive scheduler should be included in
the set of such sequences produced under a non-preemptive scheduler. The solution
is based on a finitary abstraction, an algorithm for bounded language inclusion
modulo an independence relation, and rules for inserting synchronization. We apply
the approach to device-driver programming, where the driver threads call the software
interface of the device and the API provided by the operating system. Our experiments
demonstrate that our synthesis method is precise and efficient, and, since it
does not require explicit specifications, is more practical than the conventional
approach based on user-provided assertions.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Edmund
full_name: Clarke, Edmund
last_name: Clarke
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Leonid
full_name: Ryzhyk, Leonid
last_name: Ryzhyk
- first_name: Roopsha
full_name: Samanta, Roopsha
id: 3D2AAC08-F248-11E8-B48F-1D18A9856A87
last_name: Samanta
- first_name: Thorsten
full_name: Tarrach, Thorsten
id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87
last_name: Tarrach
orcid: 0000-0003-4409-8487
citation:
ama: Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling
using synchronization synthesis. 2015;9207:180-197. doi:10.1007/978-3-319-21668-3_11
apa: 'Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta,
R., & Tarrach, T. (2015). From non-preemptive to preemptive scheduling using
synchronization synthesis. Presented at the CAV: Computer Aided Verification,
San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21668-3_11'
chicago: Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid
Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive
Scheduling Using Synchronization Synthesis.” Lecture Notes in Computer Science.
Springer, 2015. https://doi.org/10.1007/978-3-319-21668-3_11.
ieee: P. Cerny et al., “From non-preemptive to preemptive scheduling using
synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.
ista: Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach
T. 2015. From non-preemptive to preemptive scheduling using synchronization synthesis.
9207, 180–197.
mla: Cerny, Pavol, et al. From Non-Preemptive to Preemptive Scheduling Using
Synchronization Synthesis. Vol. 9207, Springer, 2015, pp. 180–97, doi:10.1007/978-3-319-21668-3_11.
short: P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta,
T. Tarrach, 9207 (2015) 180–197.
conference:
end_date: 2015-07-24
location: San Francisco, CA, United States
name: 'CAV: Computer Aided Verification'
start_date: 2015-07-18
date_created: 2018-12-11T11:53:42Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2026-04-09T10:54:00Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-21668-3_11
ec_funded: 1
external_id:
isi:
- '000491470400011'
file:
- access_level: open_access
checksum: 6ff58ac220e2f20cb001ba35d4924495
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:53Z
date_updated: 2025-06-26T07:12:35Z
file_id: '4715'
file_name: IST-2015-336-v1+1_long_version.pdf
file_size: 481922
relation: main_file
file_date_updated: 2025-06-26T07:12:35Z
fulldoi: https://doi.org/10.1007/978-3-319-21668-3_11
has_accepted_license: '1'
intvolume: ' 9207'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 180 - 197
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5398'
pubrep_id: '336'
quality_controlled: '1'
related_material:
record:
- id: '1338'
relation: later_version
status: public
- id: '1130'
relation: dissertation_contains
status: public
scopus_import: '1'
series_title: Lecture Notes in Computer Science
status: public
title: From non-preemptive to preemptive scheduling using synchronization synthesis
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9207
year: '2015'
...
---
_id: '1730'
abstract:
- lang: eng
text: How much cutting is needed to simplify the topology of a surface? We provide
bounds for several instances of this question, for the minimum length of topologically
non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial
map in triangulated combinatorial surfaces (or their dual cross-metric counterpart).
Our work builds upon Riemannian systolic inequalities, which bound the minimum
length of non-trivial closed curves in terms of the genus and the area of the
surface. We first describe a systematic way to translate Riemannian systolic inequalities
to a discrete setting, and vice-versa. This implies a conjecture by Przytycka
and Przytycki (Graph structure theory. Contemporary Mathematics, vol. 147, 1993),
a number of new systolic inequalities in the discrete setting, and the fact that
a theorem of Hutchinson on the edge-width of triangulated surfaces and Gromov’s
systolic inequality for surfaces are essentially equivalent. We also discuss how
these proofs generalize to higher dimensions. Then we focus on topological decompositions
of surfaces. Relying on ideas of Buser, we prove the existence of pants decompositions
of length O(g^(3/2)n^(1/2)) for any triangulated combinatorial surface of genus
g with n triangles, and describe an O(gn)-time algorithm to compute such a decomposition.
Finally, we consider the problem of embedding a cut graph (or more generally a
cellular graph) with a given combinatorial map on a given surface. Using random
triangulations, we prove (essentially) that, for any choice of a combinatorial
map, there are some surfaces on which any cellular embedding with that combinatorial
map has length superlinear in the number of triangles of the triangulated combinatorial
surface. There is also a similar result for graphs embedded on polyhedral triangulations.
article_processing_charge: No
arxiv: 1
author:
- first_name: Éric
full_name: Colin De Verdière, Éric
last_name: Colin De Verdière
- first_name: Alfredo
full_name: Hubard, Alfredo
last_name: Hubard
- first_name: Arnaud N
full_name: De Mesmay, Arnaud N
id: 3DB2F25C-F248-11E8-B48F-1D18A9856A87
last_name: De Mesmay
citation:
ama: Colin De Verdière É, Hubard A, de Mesmay AN. Discrete systolic inequalities
and decompositions of triangulated surfaces. Discrete & Computational Geometry.
2015;53(3):587-620. doi:10.1007/s00454-015-9679-9
apa: Colin De Verdière, É., Hubard, A., & de Mesmay, A. N. (2015). Discrete
systolic inequalities and decompositions of triangulated surfaces. Discrete
& Computational Geometry. Springer. https://doi.org/10.1007/s00454-015-9679-9
chicago: Colin De Verdière, Éric, Alfredo Hubard, and Arnaud N de Mesmay. “Discrete
Systolic Inequalities and Decompositions of Triangulated Surfaces.” Discrete
& Computational Geometry. Springer, 2015. https://doi.org/10.1007/s00454-015-9679-9.
ieee: É. Colin De Verdière, A. Hubard, and A. N. de Mesmay, “Discrete systolic inequalities
and decompositions of triangulated surfaces,” Discrete & Computational
Geometry, vol. 53, no. 3. Springer, pp. 587–620, 2015.
ista: Colin De Verdière É, Hubard A, de Mesmay AN. 2015. Discrete systolic inequalities
and decompositions of triangulated surfaces. Discrete & Computational Geometry.
53(3), 587–620.
mla: Colin De Verdière, Éric, et al. “Discrete Systolic Inequalities and Decompositions
of Triangulated Surfaces.” Discrete & Computational Geometry, vol.
53, no. 3, Springer, 2015, pp. 587–620, doi:10.1007/s00454-015-9679-9.
short: É. Colin De Verdière, A. Hubard, A.N. de Mesmay, Discrete & Computational
Geometry 53 (2015) 587–620.
date_created: 2018-12-11T11:53:42Z
date_published: 2015-04-02T00:00:00Z
date_updated: 2025-09-23T08:27:38Z
day: '02'
department:
- _id: UlWa
doi: 10.1007/s00454-015-9679-9
external_id:
arxiv:
- '1408.4036'
isi:
- '000353895200006'
fulldoi: https://doi.org/10.1007/s00454-015-9679-9
intvolume: ' 53'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1408.4036
month: '04'
oa: 1
oa_version: Preprint
page: 587 - 620
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '5397'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Discrete systolic inequalities and decompositions of triangulated surfaces
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 53
year: '2015'
...