---
_id: '514'
abstract:
- lang: eng
text: 'Orientation in space is represented in specialized brain circuits. Persistent
head direction signals are transmitted from anterior thalamus to the presubiculum,
but the identity of the presubicular target neurons, their connectivity and function
in local microcircuits are unknown. Here, we examine how thalamic afferents recruit
presubicular principal neurons and Martinotti interneurons, and the ensuing synaptic
interactions between these cells. Pyramidal neuron activation of Martinotti cells
in superficial layers is strongly facilitating such that high-frequency head directional
stimulation efficiently unmutes synaptic excitation. Martinotti-cell feedback
plays a dual role: precisely timed spikes may not inhibit the firing of in-tune
head direction cells, while exerting lateral inhibition. Autonomous attractor
dynamics emerge from a modelled network implementing wiring motifs and timing
sensitive synaptic interactions in the pyramidal - Martinotti-cell feedback loop.
This inhibitory microcircuit is therefore tuned to refine and maintain head direction
information in the presubiculum.'
article_number: '16032'
author:
- first_name: Jean
full_name: Simonnet, Jean
last_name: Simonnet
- first_name: Mérie
full_name: Nassar, Mérie
last_name: Nassar
- first_name: Federico
full_name: Stella, Federico
id: 39AF1E74-F248-11E8-B48F-1D18A9856A87
last_name: Stella
orcid: 0000-0001-9439-3148
- first_name: Ivan
full_name: Cohen, Ivan
last_name: Cohen
- first_name: Bertrand
full_name: Mathon, Bertrand
last_name: Mathon
- first_name: Charlotte
full_name: Boccara, Charlotte
id: 3FC06552-F248-11E8-B48F-1D18A9856A87
last_name: Boccara
orcid: 0000-0001-7237-5109
- first_name: Richard
full_name: Miles, Richard
last_name: Miles
- first_name: Desdemona
full_name: Fricker, Desdemona
last_name: Fricker
citation:
ama: Simonnet J, Nassar M, Stella F, et al. Activity dependent feedback inhibition
may maintain head direction signals in mouse presubiculum. Nature Communications.
2017;8. doi:10.1038/ncomms16032
apa: Simonnet, J., Nassar, M., Stella, F., Cohen, I., Mathon, B., Boccara, C. N.,
… Fricker, D. (2017). Activity dependent feedback inhibition may maintain head
direction signals in mouse presubiculum. Nature Communications. Nature
Publishing Group. https://doi.org/10.1038/ncomms16032
chicago: Simonnet, Jean, Mérie Nassar, Federico Stella, Ivan Cohen, Bertrand Mathon,
Charlotte N. Boccara, Richard Miles, and Desdemona Fricker. “Activity Dependent
Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.”
Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms16032.
ieee: J. Simonnet et al., “Activity dependent feedback inhibition may maintain
head direction signals in mouse presubiculum,” Nature Communications, vol.
8. Nature Publishing Group, 2017.
ista: Simonnet J, Nassar M, Stella F, Cohen I, Mathon B, Boccara CN, Miles R, Fricker
D. 2017. Activity dependent feedback inhibition may maintain head direction signals
in mouse presubiculum. Nature Communications. 8, 16032.
mla: Simonnet, Jean, et al. “Activity Dependent Feedback Inhibition May Maintain
Head Direction Signals in Mouse Presubiculum.” Nature Communications, vol.
8, 16032, Nature Publishing Group, 2017, doi:10.1038/ncomms16032.
short: J. Simonnet, M. Nassar, F. Stella, I. Cohen, B. Mathon, C.N. Boccara, R.
Miles, D. Fricker, Nature Communications 8 (2017).
date_created: 2018-12-11T11:46:54Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2021-01-12T08:01:16Z
day: '01'
ddc:
- '571'
department:
- _id: JoCs
doi: 10.1038/ncomms16032
file:
- access_level: open_access
checksum: 76d8a2b72a58e56adb410ec37dfa7eee
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:31Z
date_updated: 2020-07-14T12:46:36Z
file_id: '5083'
file_name: IST-2018-937-v1+1_2017_Stella_Activity_dependent.pdf
file_size: 2948357
relation: main_file
file_date_updated: 2020-07-14T12:46:36Z
has_accepted_license: '1'
intvolume: ' 8'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
issn:
- '20411723'
publication_status: published
publisher: Nature Publishing Group
publist_id: '7305'
pubrep_id: '937'
quality_controlled: '1'
scopus_import: 1
status: public
title: Activity dependent feedback inhibition may maintain head direction signals
in mouse presubiculum
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: 8
year: '2017'
...
---
_id: '515'
abstract:
- lang: eng
text: 'The oxidative phosphorylation electron transport chain (OXPHOS-ETC) of the
inner mitochondrial membrane is composed of five large protein complexes, named
CI-CV. These complexes convert energy from the food we eat into ATP, a small molecule
used to power a multitude of essential reactions throughout the cell. OXPHOS-ETC
complexes are organized into supercomplexes (SCs) of defined stoichiometry: CI
forms a supercomplex with CIII2 and CIV (SC I+III2+IV, known as the respirasome),
as well as with CIII2 alone (SC I+III2). CIII2 forms a supercomplex with CIV (SC
III2+IV) and CV forms dimers (CV2). Recent cryo-EM studies have revealed the structures
of SC I+III2+IV and SC I+III2. Furthermore, recent work has shed light on the
assembly and function of the SCs. Here we review and compare these recent studies
and discuss how they have advanced our understanding of mitochondrial electron
transport.'
article_type: original
author:
- first_name: James A
full_name: Letts, James A
id: 322DA418-F248-11E8-B48F-1D18A9856A87
last_name: Letts
orcid: 0000-0002-9864-3586
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: 'Letts JA, Sazanov LA. Clarifying the supercomplex: The higher-order organization
of the mitochondrial electron transport chain. Nature Structural and Molecular
Biology. 2017;24(10):800-808. doi:10.1038/nsmb.3460'
apa: 'Letts, J. A., & Sazanov, L. A. (2017). Clarifying the supercomplex: The
higher-order organization of the mitochondrial electron transport chain. Nature
Structural and Molecular Biology. Nature Publishing Group. https://doi.org/10.1038/nsmb.3460'
chicago: 'Letts, James A, and Leonid A Sazanov. “Clarifying the Supercomplex: The
Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature
Structural and Molecular Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/nsmb.3460.'
ieee: 'J. A. Letts and L. A. Sazanov, “Clarifying the supercomplex: The higher-order
organization of the mitochondrial electron transport chain,” Nature Structural
and Molecular Biology, vol. 24, no. 10. Nature Publishing Group, pp. 800–808,
2017.'
ista: 'Letts JA, Sazanov LA. 2017. Clarifying the supercomplex: The higher-order
organization of the mitochondrial electron transport chain. Nature Structural
and Molecular Biology. 24(10), 800–808.'
mla: 'Letts, James A., and Leonid A. Sazanov. “Clarifying the Supercomplex: The
Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature
Structural and Molecular Biology, vol. 24, no. 10, Nature Publishing Group,
2017, pp. 800–08, doi:10.1038/nsmb.3460.'
short: J.A. Letts, L.A. Sazanov, Nature Structural and Molecular Biology 24 (2017)
800–808.
date_created: 2018-12-11T11:46:54Z
date_published: 2017-10-05T00:00:00Z
date_updated: 2021-01-12T08:01:17Z
day: '05'
ddc:
- '572'
department:
- _id: LeSa
doi: 10.1038/nsmb.3460
ec_funded: 1
file:
- access_level: open_access
checksum: 9bc7e8c41b43636dd7566289e511f096
content_type: application/pdf
creator: lsazanov
date_created: 2019-11-07T12:51:07Z
date_updated: 2020-07-14T12:46:36Z
file_id: '6993'
file_name: 29893_2_merged_1501257589_red.pdf
file_size: 4118385
relation: main_file
file_date_updated: 2020-07-14T12:46:36Z
has_accepted_license: '1'
intvolume: ' 24'
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 800 - 808
project:
- _id: 2590DB08-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '701309'
name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes
(H2020)
publication: Nature Structural and Molecular Biology
publication_identifier:
issn:
- '15459993'
publication_status: published
publisher: Nature Publishing Group
publist_id: '7304'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Clarifying the supercomplex: The higher-order organization of the mitochondrial
electron transport chain'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2017'
...
---
_id: '520'
abstract:
- lang: eng
text: Cyanobacteria are mostly engineered to be sustainable cell-factories by genetic
manipulations alone. Here, by modulating the concentration of allosteric effectors,
we focus on increasing product formation without further burdening the cells with
increased expression of enzymes. Resorting to a novel 96-well microplate cultivation
system for cyanobacteria, and using lactate-producing strains of Synechocystis
PCC6803 expressing different l-lactate dehydrogenases (LDH), we titrated the effect
of 2,5-anhydro-mannitol supplementation. The latter acts in cells as a nonmetabolizable
analogue of fructose 1,6-bisphosphate, a known allosteric regulator of one of
the tested LDHs. In this strain (SAA023), we achieved over 2-fold increase of
lactate productivity. Furthermore, we observed that as carbon is increasingly
deviated during growth toward product formation, there is an increased fixation
rate in the population of spontaneous mutants harboring an impaired production
pathway. This is a challenge in the development of green cell factories, which
may be countered by the incorporation in biotechnological processes of strategies
such as the one pioneered here.
article_type: letter_note
author:
- first_name: Wei
full_name: Du, Wei
last_name: Du
- first_name: Andreas
full_name: Angermayr, Andreas
id: 4677C796-F248-11E8-B48F-1D18A9856A87
last_name: Angermayr
orcid: 0000-0001-8619-2223
- first_name: Joeri
full_name: Jongbloets, Joeri
last_name: Jongbloets
- first_name: Douwe
full_name: Molenaar, Douwe
last_name: Molenaar
- first_name: Herwig
full_name: Bachmann, Herwig
last_name: Bachmann
- first_name: Klaas
full_name: Hellingwerf, Klaas
last_name: Hellingwerf
- first_name: Filipe
full_name: Branco Dos Santos, Filipe
last_name: Branco Dos Santos
citation:
ama: Du W, Angermayr A, Jongbloets J, et al. Nonhierarchical flux regulation exposes
the fitness burden associated with lactate production in Synechocystis sp. PCC6803.
ACS Synthetic Biology. 2017;6(3):395-401. doi:10.1021/acssynbio.6b00235
apa: Du, W., Angermayr, A., Jongbloets, J., Molenaar, D., Bachmann, H., Hellingwerf,
K., & Branco Dos Santos, F. (2017). Nonhierarchical flux regulation exposes
the fitness burden associated with lactate production in Synechocystis sp. PCC6803.
ACS Synthetic Biology. American Chemical Society. https://doi.org/10.1021/acssynbio.6b00235
chicago: Du, Wei, Andreas Angermayr, Joeri Jongbloets, Douwe Molenaar, Herwig Bachmann,
Klaas Hellingwerf, and Filipe Branco Dos Santos. “Nonhierarchical Flux Regulation
Exposes the Fitness Burden Associated with Lactate Production in Synechocystis
Sp. PCC6803.” ACS Synthetic Biology. American Chemical Society, 2017. https://doi.org/10.1021/acssynbio.6b00235.
ieee: W. Du et al., “Nonhierarchical flux regulation exposes the fitness
burden associated with lactate production in Synechocystis sp. PCC6803,” ACS
Synthetic Biology, vol. 6, no. 3. American Chemical Society, pp. 395–401,
2017.
ista: Du W, Angermayr A, Jongbloets J, Molenaar D, Bachmann H, Hellingwerf K, Branco
Dos Santos F. 2017. Nonhierarchical flux regulation exposes the fitness burden
associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic
Biology. 6(3), 395–401.
mla: Du, Wei, et al. “Nonhierarchical Flux Regulation Exposes the Fitness Burden
Associated with Lactate Production in Synechocystis Sp. PCC6803.” ACS Synthetic
Biology, vol. 6, no. 3, American Chemical Society, 2017, pp. 395–401, doi:10.1021/acssynbio.6b00235.
short: W. Du, A. Angermayr, J. Jongbloets, D. Molenaar, H. Bachmann, K. Hellingwerf,
F. Branco Dos Santos, ACS Synthetic Biology 6 (2017) 395–401.
date_created: 2018-12-11T11:46:56Z
date_published: 2017-03-17T00:00:00Z
date_updated: 2021-01-12T08:01:21Z
day: '17'
department:
- _id: ToBo
doi: 10.1021/acssynbio.6b00235
external_id:
pmid:
- '27936615'
intvolume: ' 6'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 395 - 401
pmid: 1
publication: ACS Synthetic Biology
publication_identifier:
issn:
- '21615063'
publication_status: published
publisher: American Chemical Society
publist_id: '7298'
quality_controlled: '1'
scopus_import: 1
status: public
title: Nonhierarchical flux regulation exposes the fitness burden associated with
lactate production in Synechocystis sp. PCC6803
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2017'
...
---
_id: '521'
abstract:
- lang: eng
text: Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y
induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful
in showing that the classical dimension raising theorems hold in large scale;
that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and
Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely
n-to-1 maps, which include the natural quotient maps via a finite group action,
and prove that they preserve the asymptotic dimension.
author:
- first_name: Kyle
full_name: Austin, Kyle
last_name: Austin
- first_name: Ziga
full_name: Virk, Ziga
id: 2E36B656-F248-11E8-B48F-1D18A9856A87
last_name: Virk
citation:
ama: Austin K, Virk Z. Higson compactification and dimension raising. Topology
and its Applications. 2017;215:45-57. doi:10.1016/j.topol.2016.10.005
apa: Austin, K., & Virk, Z. (2017). Higson compactification and dimension raising.
Topology and Its Applications. Elsevier. https://doi.org/10.1016/j.topol.2016.10.005
chicago: Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.”
Topology and Its Applications. Elsevier, 2017. https://doi.org/10.1016/j.topol.2016.10.005.
ieee: K. Austin and Z. Virk, “Higson compactification and dimension raising,” Topology
and its Applications, vol. 215. Elsevier, pp. 45–57, 2017.
ista: Austin K, Virk Z. 2017. Higson compactification and dimension raising. Topology
and its Applications. 215, 45–57.
mla: Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.”
Topology and Its Applications, vol. 215, Elsevier, 2017, pp. 45–57, doi:10.1016/j.topol.2016.10.005.
short: K. Austin, Z. Virk, Topology and Its Applications 215 (2017) 45–57.
date_created: 2018-12-11T11:46:56Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2021-01-12T08:01:21Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.topol.2016.10.005
intvolume: ' 215'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1608.03954v1
month: '01'
oa: 1
oa_version: Submitted Version
page: 45 - 57
publication: Topology and its Applications
publication_identifier:
issn:
- '01668641'
publication_status: published
publisher: Elsevier
publist_id: '7299'
quality_controlled: '1'
status: public
title: Higson compactification and dimension raising
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 215
year: '2017'
...
---
_id: '534'
abstract:
- lang: eng
text: We investigate the complexity of finding an embedded non-orientable surface
of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural
question in low-dimensional topology, and as a first non-trivial instance of embeddability
of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding
to the relatively few hardness results that are currently known in 3-manifold
topology. In addition, we show that the problem lies in NP when the Euler genus
g is odd, and we give an explicit algorithm in this case.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Benjamin
full_name: Burton, Benjamin
last_name: Burton
- first_name: Arnaud N
full_name: De Mesmay, Arnaud N
id: 3DB2F25C-F248-11E8-B48F-1D18A9856A87
last_name: De Mesmay
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-Manifolds.
Discrete & Computational Geometry. 2017;58(4):871-888. doi:10.1007/s00454-017-9900-0
apa: Burton, B., de Mesmay, A. N., & Wagner, U. (2017). Finding non-orientable
surfaces in 3-Manifolds. Discrete & Computational Geometry. Springer.
https://doi.org/10.1007/s00454-017-9900-0
chicago: Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable
Surfaces in 3-Manifolds.” Discrete & Computational Geometry. Springer,
2017. https://doi.org/10.1007/s00454-017-9900-0.
ieee: B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces
in 3-Manifolds,” Discrete & Computational Geometry, vol. 58, no. 4.
Springer, pp. 871–888, 2017.
ista: Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in
3-Manifolds. Discrete & Computational Geometry. 58(4), 871–888.
mla: Burton, Benjamin, et al. “Finding Non-Orientable Surfaces in 3-Manifolds.”
Discrete & Computational Geometry, vol. 58, no. 4, Springer, 2017,
pp. 871–88, doi:10.1007/s00454-017-9900-0.
short: B. Burton, A.N. de Mesmay, U. Wagner, Discrete & Computational Geometry
58 (2017) 871–888.
date_created: 2018-12-11T11:47:01Z
date_published: 2017-06-09T00:00:00Z
date_updated: 2023-02-21T17:01:34Z
day: '09'
department:
- _id: UlWa
doi: 10.1007/s00454-017-9900-0
external_id:
arxiv:
- '1602.07907'
intvolume: ' 58'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.07907
month: '06'
oa: 1
oa_version: Preprint
page: 871 - 888
publication: Discrete & Computational Geometry
publication_identifier:
issn:
- '01795376'
publication_status: published
publisher: Springer
publist_id: '7283'
quality_controlled: '1'
related_material:
record:
- id: '1379'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Finding non-orientable surfaces in 3-Manifolds
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2017'
...
---
_id: '538'
abstract:
- lang: ger
text: 'Optogenetik und Photopharmakologie ermöglichen präzise räumliche und zeitliche
Kontrolle von Proteinwechselwirkung und -funktion in Zellen und Tieren. Optogenetische
Methoden, die auf grünes Licht ansprechen und zum Trennen von Proteinkomplexen
geeignet sind, sind nichtweitläufig verfügbar, würden jedoch mehrfarbige Experimente
zur Beantwortung von biologischen Fragestellungen ermöglichen. Hier demonstrieren
wir die Verwendung von Cobalamin(Vitamin B12)-bindenden Domänen von bakteriellen
CarH-Transkriptionsfaktoren zur Grünlicht-induzierten Dissoziation von Rezeptoren.
Fusioniert mit dem Fibroblasten-W achstumsfaktor-Rezeptor 1 führten diese im Dunkeln
in kultivierten Zellen zu Signalaktivität durch Oligomerisierung, welche durch
Beleuchten umgehend aufgehoben wurde. In Zebrafischembryonen, die einen derartigen
Rezeptor exprimieren, ermöglichte grünes Licht die Kontrolle über abnormale Signalaktivität
während der Embryonalentwicklung. '
author:
- first_name: Stephanie
full_name: Kainrath, Stephanie
id: 32CFBA64-F248-11E8-B48F-1D18A9856A87
last_name: Kainrath
- first_name: Manuela
full_name: Stadler, Manuela
last_name: Stadler
- first_name: Eva
full_name: Gschaider-Reichhart, Eva
id: 3FEE232A-F248-11E8-B48F-1D18A9856A87
last_name: Gschaider-Reichhart
orcid: 0000-0002-7218-7738
- first_name: Martin
full_name: Distel, Martin
last_name: Distel
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
citation:
ama: Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. Grünlicht-induzierte
Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie.
2017;129(16):4679-4682. doi:10.1002/ange.201611998
apa: Kainrath, S., Stadler, M., Gschaider-Reichhart, E., Distel, M., & Janovjak,
H. L. (2017). Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende
Domänen. Angewandte Chemie. Wiley. https://doi.org/10.1002/ange.201611998
chicago: Kainrath, Stephanie, Manuela Stadler, Eva Gschaider-Reichhart, Martin Distel,
and Harald L Janovjak. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende
Domänen.” Angewandte Chemie. Wiley, 2017. https://doi.org/10.1002/ange.201611998.
ieee: S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, and H. L. Janovjak,
“Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen,”
Angewandte Chemie, vol. 129, no. 16. Wiley, pp. 4679–4682, 2017.
ista: Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. 2017.
Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte
Chemie. 129(16), 4679–4682.
mla: Kainrath, Stephanie, et al. “Grünlicht-Induzierte Rezeptorinaktivierung Durch
Cobalamin-Bindende Domänen.” Angewandte Chemie, vol. 129, no. 16, Wiley,
2017, pp. 4679–82, doi:10.1002/ange.201611998.
short: S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, H.L. Janovjak,
Angewandte Chemie 129 (2017) 4679–4682.
date_created: 2018-12-11T11:47:02Z
date_published: 2017-05-20T00:00:00Z
date_updated: 2021-01-12T08:01:33Z
day: '20'
ddc:
- '571'
department:
- _id: CaGu
- _id: HaJa
doi: 10.1002/ange.201611998
ec_funded: 1
file:
- access_level: open_access
checksum: d66fee867e7cdbfa3fe276c2fb0778bb
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:24Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5007'
file_name: IST-2018-932-v1+1_Kainrath_et_al-2017-Angewandte_Chemie.pdf
file_size: 1668557
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
intvolume: ' 129'
issue: '16'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 4679 - 4682
project:
- _id: 25548C20-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303564'
name: Microbial Ion Channels for Synthetic Neurobiology
- _id: 255A6082-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W1232-B24
name: Molecular Drug Targets
publication: Angewandte Chemie
publication_status: published
publisher: Wiley
publist_id: '7279'
pubrep_id: '932'
quality_controlled: '1'
status: public
title: Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen
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: 129
year: '2017'
...
---
_id: '540'
abstract:
- lang: eng
text: RNA-dependent RNA polymerases (RdRps) play a key role in the life cycle of
RNA viruses and impact their immunobiology. The arenavirus lymphocytic choriomeningitis
virus (LCMV) strain Clone 13 provides a benchmark model for studying chronic infection.
A major genetic determinant for its ability to persist maps to a single amino
acid exchange in the viral L protein, which exhibits RdRp activity, yet its functional
consequences remain elusive. To unravel the L protein interactions with the host
proteome, we engineered infectious L protein-tagged LCMV virions by reverse genetics.
A subsequent mass-spectrometric analysis of L protein pulldowns from infected
human cells revealed a comprehensive network of interacting host proteins. The
obtained LCMV L protein interactome was bioinformatically integrated with known
host protein interactors of RdRps from other RNA viruses, emphasizing interconnected
modules of human proteins. Functional characterization of selected interactors
highlighted proviral (DDX3X) as well as antiviral (NKRF, TRIM21) host factors.
To corroborate these findings, we infected Trim21-/-mice with LCMV and found impaired
virus control in chronic infection. These results provide insights into the complex
interactions of the arenavirus LCMV and other viral RdRps with the host proteome
and contribute to a better molecular understanding of how chronic viruses interact
with their host.
article_number: e1006758
author:
- first_name: Kseniya
full_name: Khamina, Kseniya
last_name: Khamina
- first_name: Alexander
full_name: Lercher, Alexander
last_name: Lercher
- first_name: Michael
full_name: Caldera, Michael
last_name: Caldera
- first_name: Christopher
full_name: Schliehe, Christopher
last_name: Schliehe
- first_name: Bojan
full_name: Vilagos, Bojan
last_name: Vilagos
- first_name: Mehmet
full_name: Sahin, Mehmet
last_name: Sahin
- first_name: Lindsay
full_name: Kosack, Lindsay
last_name: Kosack
- first_name: Anannya
full_name: Bhattacharya, Anannya
last_name: Bhattacharya
- first_name: Peter
full_name: Májek, Peter
last_name: Májek
- first_name: Alexey
full_name: Stukalov, Alexey
last_name: Stukalov
- first_name: Roberto
full_name: Sacco, Roberto
id: 42C9F57E-F248-11E8-B48F-1D18A9856A87
last_name: Sacco
- first_name: Leo
full_name: James, Leo
last_name: James
- first_name: Daniel
full_name: Pinschewer, Daniel
last_name: Pinschewer
- first_name: Keiryn
full_name: Bennett, Keiryn
last_name: Bennett
- first_name: Jörg
full_name: Menche, Jörg
last_name: Menche
- first_name: Andreas
full_name: Bergthaler, Andreas
last_name: Bergthaler
citation:
ama: Khamina K, Lercher A, Caldera M, et al. Characterization of host proteins interacting
with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens.
2017;13(12). doi:10.1371/journal.ppat.1006758
apa: Khamina, K., Lercher, A., Caldera, M., Schliehe, C., Vilagos, B., Sahin, M.,
… Bergthaler, A. (2017). Characterization of host proteins interacting with the
lymphocytic choriomeningitis virus L protein. PLoS Pathogens. Public Library
of Science. https://doi.org/10.1371/journal.ppat.1006758
chicago: Khamina, Kseniya, Alexander Lercher, Michael Caldera, Christopher Schliehe,
Bojan Vilagos, Mehmet Sahin, Lindsay Kosack, et al. “Characterization of Host
Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS
Pathogens. Public Library of Science, 2017. https://doi.org/10.1371/journal.ppat.1006758.
ieee: K. Khamina et al., “Characterization of host proteins interacting with
the lymphocytic choriomeningitis virus L protein,” PLoS Pathogens, vol.
13, no. 12. Public Library of Science, 2017.
ista: Khamina K, Lercher A, Caldera M, Schliehe C, Vilagos B, Sahin M, Kosack L,
Bhattacharya A, Májek P, Stukalov A, Sacco R, James L, Pinschewer D, Bennett K,
Menche J, Bergthaler A. 2017. Characterization of host proteins interacting with
the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 13(12), e1006758.
mla: Khamina, Kseniya, et al. “Characterization of Host Proteins Interacting with
the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens, vol.
13, no. 12, e1006758, Public Library of Science, 2017, doi:10.1371/journal.ppat.1006758.
short: K. Khamina, A. Lercher, M. Caldera, C. Schliehe, B. Vilagos, M. Sahin, L.
Kosack, A. Bhattacharya, P. Májek, A. Stukalov, R. Sacco, L. James, D. Pinschewer,
K. Bennett, J. Menche, A. Bergthaler, PLoS Pathogens 13 (2017).
date_created: 2018-12-11T11:47:03Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2021-01-12T08:01:48Z
day: '01'
ddc:
- '576'
- '616'
department:
- _id: GaNo
doi: 10.1371/journal.ppat.1006758
file:
- access_level: open_access
checksum: 1aa20f19a1e90664fadce6e7d5284fdc
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:26Z
date_updated: 2020-07-14T12:46:44Z
file_id: '4944'
file_name: IST-2018-931-v1+1_journal.ppat.1006758.pdf
file_size: 4106772
relation: main_file
file_date_updated: 2020-07-14T12:46:44Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: PLoS Pathogens
publication_identifier:
issn:
- '15537366'
publication_status: published
publisher: Public Library of Science
publist_id: '7276'
pubrep_id: '931'
quality_controlled: '1'
scopus_import: 1
status: public
title: Characterization of host proteins interacting with the lymphocytic choriomeningitis
virus L protein
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: 13
year: '2017'
...
---
_id: '541'
abstract:
- lang: eng
text: 'While we have good understanding of bacterial metabolism at the population
level, we know little about the metabolic behavior of individual cells: do single
cells in clonal populations sometimes specialize on different metabolic pathways?
Such metabolic specialization could be driven by stochastic gene expression and
could provide individual cells with growth benefits of specialization. We measured
the degree of phenotypic specialization in two parallel metabolic pathways, the
assimilation of glucose and arabinose. We grew Escherichia coli in chemostats,
and used isotope-labeled sugars in combination with nanometer-scale secondary
ion mass spectrometry and mathematical modeling to quantify sugar assimilation
at the single-cell level. We found large variation in metabolic activities between
single cells, both in absolute assimilation and in the degree to which individual
cells specialize in the assimilation of different sugars. Analysis of transcriptional
reporters indicated that this variation was at least partially based on cell-to-cell
variation in gene expression. Metabolic differences between cells in clonal populations
could potentially reduce metabolic incompatibilities between different pathways,
and increase the rate at which parallel reactions can be performed.'
article_number: e1007122
author:
- first_name: Nela
full_name: Nikolic, Nela
id: 42D9CABC-F248-11E8-B48F-1D18A9856A87
last_name: Nikolic
orcid: 0000-0001-9068-6090
- first_name: Frank
full_name: Schreiber, Frank
last_name: Schreiber
- first_name: Alma
full_name: Dal Co, Alma
last_name: Dal Co
- first_name: Daniel
full_name: Kiviet, Daniel
last_name: Kiviet
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Sten
full_name: Littmann, Sten
last_name: Littmann
- first_name: Marcel
full_name: Kuypers, Marcel
last_name: Kuypers
- first_name: Martin
full_name: Ackermann, Martin
last_name: Ackermann
citation:
ama: Nikolic N, Schreiber F, Dal Co A, et al. Cell-to-cell variation and specialization
in sugar metabolism in clonal bacterial populations. PLoS Genetics. 2017;13(12).
doi:10.1371/journal.pgen.1007122
apa: Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann,
S., … Ackermann, M. (2017). Cell-to-cell variation and specialization in sugar
metabolism in clonal bacterial populations. PLoS Genetics. Public Library
of Science. https://doi.org/10.1371/journal.pgen.1007122
chicago: Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller,
Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Cell-to-Cell Variation and
Specialization in Sugar Metabolism in Clonal Bacterial Populations.” PLoS Genetics.
Public Library of Science, 2017. https://doi.org/10.1371/journal.pgen.1007122.
ieee: N. Nikolic et al., “Cell-to-cell variation and specialization in sugar
metabolism in clonal bacterial populations,” PLoS Genetics, vol. 13, no.
12. Public Library of Science, 2017.
ista: Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers
M, Ackermann M. 2017. Cell-to-cell variation and specialization in sugar metabolism
in clonal bacterial populations. PLoS Genetics. 13(12), e1007122.
mla: Nikolic, Nela, et al. “Cell-to-Cell Variation and Specialization in Sugar Metabolism
in Clonal Bacterial Populations.” PLoS Genetics, vol. 13, no. 12, e1007122,
Public Library of Science, 2017, doi:10.1371/journal.pgen.1007122.
short: N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann,
M. Kuypers, M. Ackermann, PLoS Genetics 13 (2017).
date_created: 2018-12-11T11:47:04Z
date_published: 2017-12-18T00:00:00Z
date_updated: 2023-02-23T14:10:34Z
day: '18'
ddc:
- '576'
- '579'
department:
- _id: CaGu
doi: 10.1371/journal.pgen.1007122
ec_funded: 1
file:
- access_level: open_access
checksum: 22426d9382f21554bad5fa5967afcfd0
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:35Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5088'
file_name: IST-2018-959-v1+1_2017_Nikolic_Cell-to-cell.pdf
file_size: 1308475
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '12'
language:
- iso: eng
month: '12'
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: PLoS Genetics
publication_identifier:
issn:
- '15537390'
publication_status: published
publisher: Public Library of Science
publist_id: '7275'
pubrep_id: '959'
quality_controlled: '1'
related_material:
record:
- id: '9844'
relation: research_data
status: public
- id: '9845'
relation: research_data
status: public
- id: '9846'
relation: research_data
status: public
scopus_import: 1
status: public
title: Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial
populations
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: 13
year: '2017'
...
---
_id: '545'
abstract:
- lang: eng
text: Development of vascular tissue is a remarkable example of intercellular communication
and coordinated development involving hormonal signaling and tissue polarity.
Thus far, studies on vascular patterning and regeneration have been conducted
mainly in trees—woody plants—with a well-developed layer of vascular cambium and
secondary tissues. Trees are difficult to use as genetic models, i.e., due to
long generation time, unstable environmental conditions, and lack of available
mutants and transgenic lines. Therefore, the use of the main genetic model plant
Arabidopsis thaliana (L.) Heynh., with a wealth of available marker and transgenic
lines, provides a unique opportunity to address molecular mechanism of vascular
tissue formation and regeneration. With specific treatments, the tiny weed Arabidopsis
can serve as a model to understand the growth of mighty trees and interconnect
a tree physiology with molecular genetics and cell biology of Arabidopsis.
alternative_title:
- Agricultural and Biological Sciences
author:
- first_name: Ewa
full_name: Mazur, Ewa
last_name: Mazur
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Mazur E, Friml J. Vascular tissue development and regeneration in the model
plant arabidopsis. In: Jurić S, ed. Plant Engineering. Plant Engineering.
InTech; 2017:113-140. doi:10.5772/intechopen.69712'
apa: Mazur, E., & Friml, J. (2017). Vascular tissue development and regeneration
in the model plant arabidopsis. In S. Jurić (Ed.), Plant Engineering (pp.
113–140). InTech. https://doi.org/10.5772/intechopen.69712
chicago: Mazur, Ewa, and Jiří Friml. “Vascular Tissue Development and Regeneration
in the Model Plant Arabidopsis.” In Plant Engineering, edited by Snježana
Jurić, 113–40. Plant Engineering. InTech, 2017. https://doi.org/10.5772/intechopen.69712.
ieee: E. Mazur and J. Friml, “Vascular tissue development and regeneration in the
model plant arabidopsis,” in Plant Engineering, S. Jurić, Ed. InTech, 2017,
pp. 113–140.
ista: 'Mazur E, Friml J. 2017.Vascular tissue development and regeneration in the
model plant arabidopsis. In: Plant Engineering. Agricultural and Biological Sciences,
, 113–140.'
mla: Mazur, Ewa, and Jiří Friml. “Vascular Tissue Development and Regeneration in
the Model Plant Arabidopsis.” Plant Engineering, edited by Snježana Jurić,
InTech, 2017, pp. 113–40, doi:10.5772/intechopen.69712.
short: E. Mazur, J. Friml, in:, S. Jurić (Ed.), Plant Engineering, InTech, 2017,
pp. 113–140.
date_created: 2018-12-11T11:47:05Z
date_published: 2017-11-17T00:00:00Z
date_updated: 2024-02-12T12:03:42Z
day: '17'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.5772/intechopen.69712
ec_funded: 1
editor:
- first_name: Snježana
full_name: Jurić, Snježana
last_name: Jurić
file:
- access_level: open_access
checksum: e1f05e5850dfd9f9434d2d373ca61941
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:49Z
date_updated: 2020-07-14T12:46:58Z
file_id: '4969'
file_name: IST-2018-929-v1+1_56106.pdf
file_size: 7443683
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 113 - 140
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Plant Engineering
publication_status: published
publisher: InTech
publist_id: '7269'
pubrep_id: '929'
quality_controlled: '1'
related_material:
record:
- id: '1274'
relation: earlier_version
status: public
series_title: Plant Engineering
status: public
title: Vascular tissue development and regeneration in the model plant arabidopsis
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: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '5450'
abstract:
- lang: eng
text: 'In this report the implementation of the institutional data repository IST
DataRep at IST Austria will be covered: Starting with the research phase when
requirements for a repository were established, the procedure of choosing a repository-software
and its customization based on the results of user-testings will be discussed.
Followed by reflections on the marketing strategies in regard of impact, and at
the end sharing some experiences of one year operating IST DataRep.'
author:
- first_name: Barbara
full_name: Barbara Petritsch
id: 406048EC-F248-11E8-B48F-1D18A9856A87
last_name: Petritsch
orcid: 0000-0003-2724-4614
citation:
ama: Petritsch B. Implementing the Institutional Data Repository IST DataRep.
IST Austria; 2017.
apa: Petritsch, B. (2017). Implementing the institutional data repository IST
DataRep. IST Austria.
chicago: Petritsch, Barbara. Implementing the Institutional Data Repository IST
DataRep. IST Austria, 2017.
ieee: B. Petritsch, Implementing the institutional data repository IST DataRep.
IST Austria, 2017.
ista: Petritsch B. 2017. Implementing the institutional data repository IST DataRep,
IST Austria,p.
mla: Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep.
IST Austria, 2017.
short: B. Petritsch, Implementing the Institutional Data Repository IST DataRep,
IST Austria, 2017.
date_created: 2018-12-12T11:39:24Z
date_published: 2017-06-26T00:00:00Z
date_updated: 2020-07-14T23:05:03Z
day: '26'
department:
- _id: E-Lib
extern: 0
file:
- access_level: open_access
checksum: 6321792dcfa82bf490f17615a9b22355
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:22Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5483'
file_name: IST-2017-724-v1+1_DataRep_Project_Report_2017.pdf
file_size: 3460985
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
main_file_link:
- open_access: '1'
url: https://repository.ist.ac.at/id/eprint/724.
month: '06'
oa: 1
publication_date: 2017-06-26
publisher: IST Austria
pubrep_id: '724'
status: public
title: Implementing the institutional data repository IST DataRep
type: report
year: '2017'
...
---
_id: '5455'
abstract:
- lang: eng
text: 'A fundamental algorithmic problem at the heart of static analysis is Dyck
reachability. The input is a graphwhere the edges are labeled with different types
of opening and closing parentheses, and the reachabilityinformation is computed
via paths whose parentheses are properly matched. We present new results for Dyckreachability
problems with applications to alias analysis and data-dependence analysis. Our
main contributions,that include improved upper bounds as well as lower bounds
that establish optimality guarantees, are asfollows:First, we consider Dyck reachability
on bidirected graphs, which is the standard way of performing field-sensitive
points-to analysis. Given a bidirected graph withnnodes andmedges, we present:
(i) an algorithmwith worst-case running timeO(m+n·α(n)), whereα(n)is the inverse
Ackermann function, improving thepreviously knownO(n2)time bound; (ii) a matching
lower bound that shows that our algorithm is optimalwrt to worst-case complexity;
and (iii) an optimal average-case upper bound ofO(m)time, improving thepreviously
knownO(m·logn)bound.Second, we consider the problem of context-sensitive data-dependence
analysis, where the task is to obtainanalysis summaries of library code in the
presence of callbacks. Our algorithm preprocesses libraries in almostlinear time,
after which the contribution of the library in the complexity of the client analysis
is only linear,and only wrt the number of call sites.Third, we prove that combinatorial
algorithms for Dyck reachability on general graphs with truly sub-cubic bounds
cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean
MatrixMultiplication, which is a long-standing open problem. Thus we establish
that the existing combinatorialalgorithms for Dyck reachability are (conditionally)
optimal for general graphs. We also show that the samehardness holds for graphs
of constant treewidth.Finally, we provide a prototype implementation of our algorithms
for both alias analysis and data-dependenceanalysis. Our experimental evaluation
demonstrates that the new algorithms significantly outperform allexisting methods
on the two problems, over real-world benchmarks.'
alternative_title:
- IST Austria Technical Report
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: Bhavya
full_name: Choudhary, Bhavya
last_name: Choudhary
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck Reachability for
Data-Dependence and Alias Analysis. IST Austria; 2017. doi:10.15479/AT:IST-2017-870-v1-1
apa: Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck
reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1
chicago: Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal
Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017.
https://doi.org/10.15479/AT:IST-2017-870-v1-1.
ieee: K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability
for data-dependence and alias analysis. IST Austria, 2017.
ista: Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability
for data-dependence and alias analysis, IST Austria, 37p.
mla: Chatterjee, Krishnendu, et al. Optimal Dyck Reachability for Data-Dependence
and Alias Analysis. IST Austria, 2017, doi:10.15479/AT:IST-2017-870-v1-1.
short: K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for
Data-Dependence and Alias Analysis, IST Austria, 2017.
date_created: 2018-12-12T11:39:26Z
date_published: 2017-10-23T00:00:00Z
date_updated: 2023-02-21T15:54:10Z
day: '23'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2017-870-v1-1
file:
- access_level: open_access
checksum: 177a84a46e3ac17e87b31534ad16a4c9
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:02Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5524'
file_name: IST-2017-870-v1+1_main.pdf
file_size: 960491
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '37'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '870'
related_material:
record:
- id: '10416'
relation: later_version
status: public
status: public
title: Optimal Dyck reachability for data-dependence and alias analysis
type: technical_report
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2017'
...
---
_id: '5456'
abstract:
- lang: eng
text: "We present a new dynamic partial-order reduction method for stateless model
checking of concurrent programs. A common approach for exploring program behaviors
relies on enumerating the traces of the program, without storing the visited states
(aka stateless exploration). As the number of distinct traces grows exponentially,
dynamic partial-order reduction (DPOR) techniques have been successfully used
to partition the space of traces into equivalence classes (Mazurkiewicz partitioning),
with the goal of exploring only few representative traces from each class.\r\nWe
introduce a new equivalence on traces under sequential consistency semantics,
which we call the observation equivalence. Two traces are observationally equivalent
if every read event observes the same write event in both traces. While the traditional
Mazurkiewicz equivalence is control-centric, our new definition is data-centric.
We show that our observation equivalence is coarser than the Mazurkiewicz equivalence,
and in many cases even exponentially coarser. We devise a DPOR exploration of
the trace space, called data-centric DPOR, based on the observation equivalence.\r\n1.
For acyclic architectures, our algorithm is guaranteed to explore exactly one
representative trace from each observation class, while spending polynomial time
per class. Hence, our algorithm is optimal wrt the observation equivalence, and
in several cases explores exponentially fewer traces than any enumerative method
based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider
an equivalence between traces which is finer than the observation equivalence;
but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially
coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence.
\r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based
DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show
a significant reduction in both running time and the number of explored equivalence
classes."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Marek
full_name: Chalupa, Marek
last_name: Chalupa
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Nishant
full_name: Sinha, Nishant
last_name: Sinha
- first_name: Kapil
full_name: Vaidya, Kapil
last_name: Vaidya
citation:
ama: Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-Centric
Dynamic Partial Order Reduction. IST Austria; 2017. doi:10.15479/AT:IST-2017-872-v1-1
apa: Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K.
(2017). Data-centric dynamic partial order reduction. IST Austria. https://doi.org/10.15479/AT:IST-2017-872-v1-1
chicago: Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha,
and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria,
2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1.
ieee: M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric
dynamic partial order reduction. IST Austria, 2017.
ista: Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric
dynamic partial order reduction, IST Austria, 36p.
mla: Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction.
IST Austria, 2017, doi:10.15479/AT:IST-2017-872-v1-1.
short: M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric
Dynamic Partial Order Reduction, IST Austria, 2017.
date_created: 2018-12-12T11:39:26Z
date_published: 2017-10-23T00:00:00Z
date_updated: 2023-02-23T12:26:54Z
day: '23'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2017-872-v1-1
file:
- access_level: open_access
checksum: d2635c4cf013000f0a1b09e80f9e4ab7
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:26Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5487'
file_name: IST-2017-872-v1+1_main.pdf
file_size: 910347
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '36'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '872'
related_material:
record:
- id: '10417'
relation: later_version
status: public
- id: '5448'
relation: earlier_version
status: public
status: public
title: Data-centric dynamic partial order reduction
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '548'
abstract:
- lang: eng
text: In this work maximum entropy distributions in the space of steady states of
metabolic networks are considered upon constraining the first and second moments
of the growth rate. Coexistence of fast and slow phenotypes, with bimodal flux
distributions, emerges upon considering control on the average growth (optimization)
and its fluctuations (heterogeneity). This is applied to the carbon catabolic
core of Escherichia coli where it quantifies the metabolic activity of slow growing
phenotypes and it provides a quantitative map with metabolic fluxes, opening the
possibility to detect coexistence from flux data. A preliminary analysis on data
for E. coli cultures in standard conditions shows degeneracy for the inferred
parameters that extend in the coexistence region.
alternative_title:
- Rapid Communications
article_number: '060401'
article_processing_charge: No
author:
- first_name: Daniele
full_name: De Martino, Daniele
id: 3FF5848A-F248-11E8-B48F-1D18A9856A87
last_name: De Martino
orcid: 0000-0002-5214-4706
citation:
ama: De Martino D. Maximum entropy modeling of metabolic networks by constraining
growth-rate moments predicts coexistence of phenotypes. Physical Review E.
2017;96(6). doi:10.1103/PhysRevE.96.060401
apa: De Martino, D. (2017). Maximum entropy modeling of metabolic networks by constraining
growth-rate moments predicts coexistence of phenotypes. Physical Review E.
American Physical Society. https://doi.org/10.1103/PhysRevE.96.060401
chicago: De Martino, Daniele. “Maximum Entropy Modeling of Metabolic Networks by
Constraining Growth-Rate Moments Predicts Coexistence of Phenotypes.” Physical
Review E. American Physical Society, 2017. https://doi.org/10.1103/PhysRevE.96.060401.
ieee: D. De Martino, “Maximum entropy modeling of metabolic networks by constraining
growth-rate moments predicts coexistence of phenotypes,” Physical Review E,
vol. 96, no. 6. American Physical Society, 2017.
ista: De Martino D. 2017. Maximum entropy modeling of metabolic networks by constraining
growth-rate moments predicts coexistence of phenotypes. Physical Review E. 96(6),
060401.
mla: De Martino, Daniele. “Maximum Entropy Modeling of Metabolic Networks by Constraining
Growth-Rate Moments Predicts Coexistence of Phenotypes.” Physical Review E,
vol. 96, no. 6, 060401, American Physical Society, 2017, doi:10.1103/PhysRevE.96.060401.
short: D. De Martino, Physical Review E 96 (2017).
date_created: 2018-12-11T11:47:06Z
date_published: 2017-12-21T00:00:00Z
date_updated: 2023-10-10T13:29:38Z
day: '21'
department:
- _id: GaTk
doi: 10.1103/PhysRevE.96.060401
ec_funded: 1
intvolume: ' 96'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1707.00320
month: '12'
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: Physical Review E
publication_identifier:
issn:
- 2470-0045
publication_status: published
publisher: American Physical Society
publist_id: '7266'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Maximum entropy modeling of metabolic networks by constraining growth-rate
moments predicts coexistence of phenotypes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2017'
...
---
_id: '549'
abstract:
- lang: eng
text: Model checking is usually based on a comprehensive traversal of the state
space. Causality-based model checking is a radically different approach that instead
analyzes the cause-effect relationships in a program. We give an overview on a
new class of model checking algorithms that capture the causal relationships in
a special data structure called concurrent traces. Concurrent traces identify
key events in an execution history and link them through their cause-effect relationships.
The model checker builds a tableau of concurrent traces, where the case splits
represent different causal explanations of a hypothetical error. Causality-based
model checking has been implemented in the ARCTOR tool, and applied to previously
intractable multi-threaded benchmarks.
alternative_title:
- EPTCS
article_processing_charge: No
author:
- first_name: Bernd
full_name: Finkbeiner, Bernd
last_name: Finkbeiner
- first_name: Andrey
full_name: Kupriyanov, Andrey
id: 2C311BF8-F248-11E8-B48F-1D18A9856A87
last_name: Kupriyanov
citation:
ama: 'Finkbeiner B, Kupriyanov A. Causality-based model checking. In: Electronic
Proceedings in Theoretical Computer Science. Vol 259. Open Publishing Association;
2017:31-38. doi:10.4204/EPTCS.259.3'
apa: 'Finkbeiner, B., & Kupriyanov, A. (2017). Causality-based model checking.
In Electronic Proceedings in Theoretical Computer Science (Vol. 259, pp.
31–38). Uppsala, Sweden: Open Publishing Association. https://doi.org/10.4204/EPTCS.259.3'
chicago: Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.”
In Electronic Proceedings in Theoretical Computer Science, 259:31–38. Open
Publishing Association, 2017. https://doi.org/10.4204/EPTCS.259.3.
ieee: B. Finkbeiner and A. Kupriyanov, “Causality-based model checking,” in Electronic
Proceedings in Theoretical Computer Science, Uppsala, Sweden, 2017, vol. 259,
pp. 31–38.
ista: 'Finkbeiner B, Kupriyanov A. 2017. Causality-based model checking. Electronic
Proceedings in Theoretical Computer Science. CREST: Causal Reasoning for Embedded
and Safety-Critical Systems Technologies, EPTCS, vol. 259, 31–38.'
mla: Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.”
Electronic Proceedings in Theoretical Computer Science, vol. 259, Open
Publishing Association, 2017, pp. 31–38, doi:10.4204/EPTCS.259.3.
short: B. Finkbeiner, A. Kupriyanov, in:, Electronic Proceedings in Theoretical
Computer Science, Open Publishing Association, 2017, pp. 31–38.
conference:
end_date: 2017-04-29
location: Uppsala, Sweden
name: 'CREST: Causal Reasoning for Embedded and Safety-Critical Systems Technologies'
start_date: 2017-04-29
date_created: 2018-12-11T11:47:07Z
date_published: 2017-10-10T00:00:00Z
date_updated: 2023-10-17T12:02:46Z
day: '10'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4204/EPTCS.259.3
file:
- access_level: open_access
checksum: 6274f6c0da3376a7b079180d81568518
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:21Z
date_updated: 2020-07-14T12:47:00Z
file_id: '4939'
file_name: IST-2018-925-v1+1_1710.03391v1.pdf
file_size: 209294
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
intvolume: ' 259'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1710.03391v1
month: '10'
oa: 1
oa_version: Submitted Version
page: 31 - 38
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Electronic Proceedings in Theoretical Computer Science
publication_identifier:
issn:
- 2075-2180
publication_status: published
publisher: Open Publishing Association
publist_id: '7264'
pubrep_id: '925'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Causality-based model checking
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 259
year: '2017'
...
---
_id: '550'
abstract:
- lang: eng
text: For large random matrices X with independent, centered entries but not necessarily
identical variances, the eigenvalue density of XX* is well-approximated by a deterministic
measure on ℝ. We show that the density of this measure has only square and cubic-root
singularities away from zero. We also extend the bulk local law in [5] to the
vicinity of these singularities.
article_number: '63'
author:
- first_name: Johannes
full_name: Alt, Johannes
id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
last_name: Alt
citation:
ama: Alt J. Singularities of the density of states of random Gram matrices. Electronic
Communications in Probability. 2017;22. doi:10.1214/17-ECP97
apa: Alt, J. (2017). Singularities of the density of states of random Gram matrices.
Electronic Communications in Probability. Institute of Mathematical Statistics.
https://doi.org/10.1214/17-ECP97
chicago: Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.”
Electronic Communications in Probability. Institute of Mathematical Statistics,
2017. https://doi.org/10.1214/17-ECP97.
ieee: J. Alt, “Singularities of the density of states of random Gram matrices,”
Electronic Communications in Probability, vol. 22. Institute of Mathematical
Statistics, 2017.
ista: Alt J. 2017. Singularities of the density of states of random Gram matrices.
Electronic Communications in Probability. 22, 63.
mla: Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.”
Electronic Communications in Probability, vol. 22, 63, Institute of Mathematical
Statistics, 2017, doi:10.1214/17-ECP97.
short: J. Alt, Electronic Communications in Probability 22 (2017).
date_created: 2018-12-11T11:47:07Z
date_published: 2017-11-21T00:00:00Z
date_updated: 2023-09-07T12:38:08Z
day: '21'
ddc:
- '539'
department:
- _id: LaEr
doi: 10.1214/17-ECP97
ec_funded: 1
file:
- access_level: open_access
checksum: 0ec05303a0de190de145654237984c79
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:04Z
date_updated: 2020-07-14T12:47:00Z
file_id: '4663'
file_name: IST-2018-926-v1+1_euclid.ecp.1511233247.pdf
file_size: 470876
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
intvolume: ' 22'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Electronic Communications in Probability
publication_identifier:
issn:
- 1083589X
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '7265'
pubrep_id: '926'
quality_controlled: '1'
related_material:
record:
- id: '149'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Singularities of the density of states of random Gram matrices
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: 22
year: '2017'
...
---
_id: '551'
abstract:
- lang: eng
text: 'Evolutionary graph theory studies the evolutionary dynamics in a population
structure given as a connected graph. Each node of the graph represents an individual
of the population, and edges determine how offspring are placed. We consider the
classical birth-death Moran process where there are two types of individuals,
namely, the residents with fitness 1 and mutants with fitness r. The fitness indicates
the reproductive strength. The evolutionary dynamics happens as follows: in the
initial step, in a population of all resident individuals a mutant is introduced,
and then at each step, an individual is chosen proportional to the fitness of
its type to reproduce, and the offspring replaces a neighbor uniformly at random.
The process stops when all individuals are either residents or mutants. The probability
that all individuals in the end are mutants is called the fixation probability,
which is a key factor in the rate of evolution. We consider the problem of approximating
the fixation probability. The class of algorithms that is extremely relevant for
approximation of the fixation probabilities is the Monte-Carlo simulation of the
process. Previous results present a polynomial-time Monte-Carlo algorithm for
undirected graphs when r is given in unary. First, we present a simple modification:
instead of simulating each step, we discard ineffective steps, where no node changes
type (i.e., either residents replace residents, or mutants replace mutants). Using
the above simple modification and our result that the number of effective steps
is concentrated around the expected number of effective steps, we present faster
polynomial-time Monte-Carlo algorithms for undirected graphs. Our algorithms are
always at least a factor O(n2/ log n) faster as compared to the previous algorithms,
where n is the number of nodes, and is polynomial even if r is given in binary.
We also present lower bounds showing that the upper bound on the expected number
of effective steps we present is asymptotically tight for undirected graphs. '
alternative_title:
- LIPIcs
article_number: '61'
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
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation
probability of the Moran process on undirected graphs. In: Leibniz International
Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.61'
apa: 'Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo
algorithms for fixation probability of the Moran process on undirected graphs.
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.61'
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster
Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected
Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.
ieee: K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms
for fixation probability of the Moran process on undirected graphs,” in Leibniz
International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
ista: 'Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms
for fixation probability of the Moran process on undirected graphs. Leibniz International
Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science
(SG), LIPIcs, vol. 83, 61.'
mla: Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation
Probability of the Moran Process on Undirected Graphs.” Leibniz International
Proceedings in Informatics, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.61.
short: K. Chatterjee, R. Ibsen-Jensen, M. Nowak, 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:34Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2017.61
file:
- access_level: open_access
checksum: 2eed5224c0e4e259484a1d71acb8ba6a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:04Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5322'
file_name: IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf
file_size: 535077
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
intvolume: ' 83'
language:
- iso: eng
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: '7263'
pubrep_id: '924'
quality_controlled: '1'
scopus_import: 1
status: public
title: Faster Monte Carlo algorithms for fixation probability of the Moran process
on undirected graphs
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: '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: '5559'
abstract:
- lang: eng
text: Strong amplifiers of natural selection
article_processing_charge: No
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak , Martin
last_name: 'Nowak '
citation:
ama: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Strong amplifiers of natural
selection. 2017. doi:10.15479/AT:ISTA:51
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak , M. (2017). Strong
amplifiers of natural selection. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:51
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak . “Strong Amplifiers of Natural Selection.” Institute of Science and Technology
Austria, 2017. https://doi.org/10.15479/AT:ISTA:51.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , “Strong amplifiers
of natural selection.” Institute of Science and Technology Austria, 2017.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Strong amplifiers
of natural selection, Institute of Science and Technology Austria, 10.15479/AT:ISTA:51.
mla: Pavlogiannis, Andreas, et al. Strong Amplifiers of Natural Selection.
Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:51.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak , (2017).
datarep_id: '51'
date_created: 2018-12-12T12:31:32Z
date_published: 2017-01-02T00:00:00Z
date_updated: 2024-02-21T13:48:42Z
day: '02'
ddc:
- '519'
department:
- _id: KrCh
doi: 10.15479/AT:ISTA:51
ec_funded: 1
file:
- access_level: open_access
checksum: b427dd46a30096a1911b245640c47af8
content_type: video/mp4
creator: system
date_created: 2018-12-12T13:05:18Z
date_updated: 2020-07-14T12:47:02Z
file_id: '5644'
file_name: IST-2017-51-v1+2_illustration.mp4
file_size: 32987015
relation: main_file
file_date_updated: 2020-07-14T12:47:02Z
has_accepted_license: '1'
keyword:
- natural selection
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '5452'
relation: research_paper
status: public
- id: '5751'
relation: research_paper
status: public
status: public
title: Strong amplifiers of natural selection
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '5560'
abstract:
- lang: eng
text: "This repository contains the data collected for the manuscript \"Biased partitioning
of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity\".\r\nThe
data is compressed into a single archive. Within the archive, different folders
correspond to figures of the main text and the SI of the related publication.\r\nData
is saved as plain text, with each folder containing a separate readme file describing
the format. Typically, the data is from fluorescence microscopy measurements of
single cells growing in a microfluidic \"mother machine\" device, and consists
of relevant values (primarily arbitrary unit or normalized fluorescence measurements,
and division times / growth rates) after raw microscopy images have been processed,
segmented, and their features extracted, as described in the methods section of
the related publication."
article_processing_charge: No
author:
- 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: Andersson, Anna M
id: 2B8A40DA-F248-11E8-B48F-1D18A9856A87
last_name: Andersson
orcid: 0000-0003-2912-6769
- first_name: Kathrin
full_name: Tomasek, Kathrin
id: 3AEC8556-F248-11E8-B48F-1D18A9856A87
last_name: Tomasek
orcid: 0000-0003-3768-877X
- first_name: Enrique
full_name: Balleza, Enrique
last_name: Balleza
- first_name: Daniel
full_name: Kiviet, Daniel
last_name: Kiviet
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- 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: Bergmiller T, Andersson AM, Tomasek K, et al. Biased partitioning of the multi-drug
efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity. 2017. doi:10.15479/AT:ISTA:53
apa: Bergmiller, T., Andersson, A. M., Tomasek, K., Balleza, E., Kiviet, D., Hauschild,
R., … Guet, C. C. (2017). Biased partitioning of the multi-drug efflux pump AcrAB-TolC
underlies long-lived phenotypic heterogeneity. Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:53
chicago: Bergmiller, Tobias, Anna M Andersson, Kathrin Tomasek, Enrique Balleza,
Daniel Kiviet, Robert Hauschild, Gašper Tkačik, and Calin C Guet. “Biased Partitioning
of the Multi-Drug Efflux Pump AcrAB-TolC Underlies Long-Lived Phenotypic Heterogeneity.”
Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:53.
ieee: T. Bergmiller et al., “Biased partitioning of the multi-drug efflux
pump AcrAB-TolC underlies long-lived phenotypic heterogeneity.” Institute of Science
and Technology Austria, 2017.
ista: Bergmiller T, Andersson AM, Tomasek K, Balleza E, Kiviet D, Hauschild R, Tkačik
G, Guet CC. 2017. Biased partitioning of the multi-drug efflux pump AcrAB-TolC
underlies long-lived phenotypic heterogeneity, Institute of Science and Technology
Austria, 10.15479/AT:ISTA:53.
mla: Bergmiller, Tobias, et al. Biased Partitioning of the Multi-Drug Efflux
Pump AcrAB-TolC Underlies Long-Lived Phenotypic Heterogeneity. Institute of
Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:53.
short: T. Bergmiller, A.M. Andersson, K. Tomasek, E. Balleza, D. Kiviet, R. Hauschild,
G. Tkačik, C.C. Guet, (2017).
datarep_id: '53'
date_created: 2018-12-12T12:31:32Z
date_published: 2017-03-10T00:00:00Z
date_updated: 2024-02-21T13:49:00Z
day: '10'
ddc:
- '571'
department:
- _id: CaGu
- _id: GaTk
- _id: Bio
doi: 10.15479/AT:ISTA:53
file:
- access_level: open_access
checksum: d77859af757ac8025c50c7b12b52eaf3
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:38Z
date_updated: 2020-07-14T12:47:03Z
file_id: '5603'
file_name: IST-2017-53-v1+1_Data_MDE.zip
file_size: 6773204
relation: main_file
file_date_updated: 2020-07-14T12:47:03Z
has_accepted_license: '1'
keyword:
- single cell microscopy
- mother machine microfluidic device
- AcrAB-TolC pump
- multi-drug efflux
- Escherichia coli
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '03'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '665'
relation: research_paper
status: public
status: public
title: Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived
phenotypic heterogeneity
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...