---
_id: '139'
abstract:
- lang: eng
text: 'Genome-scale diversity data are increasingly available in a variety of biological
systems, and can be used to reconstruct the past evolutionary history of species
divergence. However, extracting the full demographic information from these data
is not trivial, and requires inferential methods that account for the diversity
of coalescent histories throughout the genome. Here, we evaluate the potential
and limitations of one such approach. We reexamine a well-known system of mussel
sister species, using the joint site frequency spectrum (jSFS) of synonymousmutations
computed either fromexome capture or RNA-seq, in an Approximate Bayesian Computation
(ABC) framework. We first assess the best sampling strategy (number of: individuals,
loci, and bins in the jSFS), and show that model selection is robust to variation
in the number of individuals and loci. In contrast, different binning choices
when summarizing the jSFS, strongly affect the results: including classes of low
and high frequency shared polymorphisms can more effectively reveal recent migration
events. We then take advantage of the flexibility of ABC to compare more realistic
models of speciation, including variation in migration rates through time (i.e.,
periodic connectivity) and across genes (i.e., genome-wide heterogeneity in migration
rates). We show that these models were consistently selected as the most probable,
suggesting that mussels have experienced a complex history of gene flow during
divergence and that the species boundary is semi-permeable. Our work provides
a comprehensive evaluation of ABC demographic inference in mussels based on the
coding jSFS, and supplies guidelines for employing different sequencing techniques
and sampling strategies. We emphasize, perhaps surprisingly, that inferences are
less limited by the volume of data, than by the way in which they are analyzed.'
article_number: '30083438'
article_processing_charge: No
author:
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: Camille
full_name: Roux, Camille
last_name: Roux
- first_name: Pierre
full_name: Gagnaire, Pierre
last_name: Gagnaire
- first_name: Jonathan
full_name: Romiguier, Jonathan
last_name: Romiguier
- first_name: Nicolas
full_name: Faivre, Nicolas
last_name: Faivre
- first_name: John
full_name: Welch, John
last_name: Welch
- first_name: Nicolas
full_name: Bierne, Nicolas
last_name: Bierne
citation:
ama: 'Fraisse C, Roux C, Gagnaire P, et al. The divergence history of European blue
mussel species reconstructed from Approximate Bayesian Computation: The effects
of sequencing techniques and sampling strategies. PeerJ. 2018;2018(7).
doi:10.7717/peerj.5198'
apa: 'Fraisse, C., Roux, C., Gagnaire, P., Romiguier, J., Faivre, N., Welch, J.,
& Bierne, N. (2018). The divergence history of European blue mussel species
reconstructed from Approximate Bayesian Computation: The effects of sequencing
techniques and sampling strategies. PeerJ. PeerJ. https://doi.org/10.7717/peerj.5198'
chicago: 'Fraisse, Christelle, Camille Roux, Pierre Gagnaire, Jonathan Romiguier,
Nicolas Faivre, John Welch, and Nicolas Bierne. “The Divergence History of European
Blue Mussel Species Reconstructed from Approximate Bayesian Computation: The Effects
of Sequencing Techniques and Sampling Strategies.” PeerJ. PeerJ, 2018.
https://doi.org/10.7717/peerj.5198.'
ieee: 'C. Fraisse et al., “The divergence history of European blue mussel
species reconstructed from Approximate Bayesian Computation: The effects of sequencing
techniques and sampling strategies,” PeerJ, vol. 2018, no. 7. PeerJ, 2018.'
ista: 'Fraisse C, Roux C, Gagnaire P, Romiguier J, Faivre N, Welch J, Bierne N.
2018. The divergence history of European blue mussel species reconstructed from
Approximate Bayesian Computation: The effects of sequencing techniques and sampling
strategies. PeerJ. 2018(7), 30083438.'
mla: 'Fraisse, Christelle, et al. “The Divergence History of European Blue Mussel
Species Reconstructed from Approximate Bayesian Computation: The Effects of Sequencing
Techniques and Sampling Strategies.” PeerJ, vol. 2018, no. 7, 30083438,
PeerJ, 2018, doi:10.7717/peerj.5198.'
short: C. Fraisse, C. Roux, P. Gagnaire, J. Romiguier, N. Faivre, J. Welch, N. Bierne,
PeerJ 2018 (2018).
date_created: 2018-12-11T11:44:50Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2023-10-17T12:25:28Z
day: '30'
ddc:
- '576'
department:
- _id: BeVi
- _id: NiBa
doi: 10.7717/peerj.5198
external_id:
isi:
- '000440484800002'
file:
- access_level: open_access
checksum: 7d55ae22598a1c70759cd671600cff53
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:42:11Z
date_updated: 2020-07-14T12:44:48Z
file_id: '5739'
file_name: 2018_PeerJ_Fraisse.pdf
file_size: 1480792
relation: main_file
file_date_updated: 2020-07-14T12:44:48Z
has_accepted_license: '1'
intvolume: ' 2018'
isi: 1
issue: '7'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '07'
oa: 1
oa_version: Published Version
publication: PeerJ
publication_status: published
publisher: PeerJ
publist_id: '7784'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The divergence history of European blue mussel species reconstructed from
Approximate Bayesian Computation: The effects of sequencing techniques and sampling
strategies'
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: 2018
year: '2018'
...
---
_id: '14'
abstract:
- lang: eng
text: The intercellular transport of auxin is driven by PIN-formed (PIN) auxin efflux
carriers. PINs are localized at the plasma membrane (PM) and on constitutively
recycling endomembrane vesicles. Therefore, PINs can mediate auxin transport either
by direct translocation across the PM or by pumping auxin into secretory vesicles
(SVs), leading to its secretory release upon fusion with the PM. Which of these
two mechanisms dominates is a matter of debate. Here, we addressed the issue with
a mathematical modeling approach. We demonstrate that the efficiency of secretory
transport depends on SV size, half-life of PINs on the PM, pH, exocytosis frequency
and PIN density. 3D structured illumination microscopy (SIM) was used to determine
PIN density on the PM. Combining this data with published values of the other
parameters, we show that the transport activity of PINs in SVs would have to be
at least 1000× greater than on the PM in order to produce a comparable macroscopic
auxin transport. If both transport mechanisms operated simultaneously and PINs
were equally active on SVs and PM, the contribution of secretion to the total
auxin flux would be negligible. In conclusion, while secretory vesicle-mediated
transport of auxin is an intriguing and theoretically possible model, it is unlikely
to be a major mechanism of auxin transport inplanta.
acknowledgement: 'European Research Council (ERC): 742985 to Jiri Friml; M.A. was
supported by the Austrian Science Fund (FWF) (M2379-B28); AJ was supported by the
Austria Science Fund (FWF): I03630 to Jiri Friml.'
article_processing_charge: No
article_type: original
author:
- first_name: Sander
full_name: Hille, Sander
last_name: Hille
- first_name: Maria
full_name: Akhmanova, Maria
id: 3425EC26-F248-11E8-B48F-1D18A9856A87
last_name: Akhmanova
orcid: 0000-0003-1522-3162
- first_name: Matous
full_name: Glanc, Matous
id: 1AE1EA24-02D0-11E9-9BAA-DAF4881429F2
last_name: Glanc
orcid: 0000-0003-0619-7783
- first_name: Alexander J
full_name: Johnson, Alexander J
id: 46A62C3A-F248-11E8-B48F-1D18A9856A87
last_name: Johnson
orcid: 0000-0002-2739-8843
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Hille S, Akhmanova M, Glanc M, Johnson AJ, Friml J. Relative contribution
of PIN-containing secretory vesicles and plasma membrane PINs to the directed
auxin transport: Theoretical estimation. International Journal of Molecular
Sciences. 2018;19(11). doi:10.3390/ijms19113566'
apa: 'Hille, S., Akhmanova, M., Glanc, M., Johnson, A. J., & Friml, J. (2018).
Relative contribution of PIN-containing secretory vesicles and plasma membrane
PINs to the directed auxin transport: Theoretical estimation. International
Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms19113566'
chicago: 'Hille, Sander, Maria Akhmanova, Matous Glanc, Alexander J Johnson, and
Jiří Friml. “Relative Contribution of PIN-Containing Secretory Vesicles and Plasma
Membrane PINs to the Directed Auxin Transport: Theoretical Estimation.” International
Journal of Molecular Sciences. MDPI, 2018. https://doi.org/10.3390/ijms19113566.'
ieee: 'S. Hille, M. Akhmanova, M. Glanc, A. J. Johnson, and J. Friml, “Relative
contribution of PIN-containing secretory vesicles and plasma membrane PINs to
the directed auxin transport: Theoretical estimation,” International Journal
of Molecular Sciences, vol. 19, no. 11. MDPI, 2018.'
ista: 'Hille S, Akhmanova M, Glanc M, Johnson AJ, Friml J. 2018. Relative contribution
of PIN-containing secretory vesicles and plasma membrane PINs to the directed
auxin transport: Theoretical estimation. International Journal of Molecular Sciences.
19(11).'
mla: 'Hille, Sander, et al. “Relative Contribution of PIN-Containing Secretory Vesicles
and Plasma Membrane PINs to the Directed Auxin Transport: Theoretical Estimation.”
International Journal of Molecular Sciences, vol. 19, no. 11, MDPI, 2018,
doi:10.3390/ijms19113566.'
short: S. Hille, M. Akhmanova, M. Glanc, A.J. Johnson, J. Friml, International Journal
of Molecular Sciences 19 (2018).
date_created: 2018-12-11T11:44:09Z
date_published: 2018-11-12T00:00:00Z
date_updated: 2023-09-18T08:09:32Z
day: '12'
ddc:
- '580'
department:
- _id: DaSi
- _id: JiFr
doi: 10.3390/ijms19113566
ec_funded: 1
external_id:
isi:
- '000451528500282'
file:
- access_level: open_access
checksum: e4b59c2599b0ca26ebf5b8434bcde94a
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:04:11Z
date_updated: 2020-07-14T12:44:50Z
file_id: '5719'
file_name: 2018_IJMS_Hille.pdf
file_size: 2200593
relation: main_file
file_date_updated: 2020-07-14T12:44:50Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
- _id: 26538374-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03630
name: Molecular mechanisms of endocytic cargo recognition in plants
publication: International Journal of Molecular Sciences
publication_identifier:
eissn:
- 1422-0067
publication_status: published
publisher: MDPI
publist_id: '8042'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Relative contribution of PIN-containing secretory vesicles and plasma membrane
PINs to the directed auxin transport: Theoretical estimation'
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 19
year: '2018'
...
---
_id: '140'
abstract:
- lang: eng
text: Reachability analysis is difficult for hybrid automata with affine differential
equations, because the reach set needs to be approximated. Promising abstraction
techniques usually employ interval methods or template polyhedra. Interval methods
account for dense time and guarantee soundness, and there are interval-based tools
that overapproximate affine flowpipes. But interval methods impose bounded and
rigid shapes, which make refinement expensive and fixpoint detection difficult.
Template polyhedra, on the other hand, can be adapted flexibly and can be unbounded,
but sound template refinement for unbounded reachability analysis has been implemented
only for systems with piecewise constant dynamics. We capitalize on the advantages
of both techniques, combining interval arithmetic and template polyhedra, using
the former to abstract time and the latter to abstract space. During a CEGAR loop,
whenever a spurious error trajectory is found, we compute additional space constraints
and split time intervals, and use these space-time interpolants to eliminate the
counterexample. Space-time interpolation offers a lazy, flexible framework for
increasing precision while guaranteeing soundness, both for error avoidance and
fixpoint detection. To the best of out knowledge, this is the first abstraction
refinement scheme for the reachability analysis over unbounded and dense time
of affine hybrid systems, which is both sound and automatic. We demonstrate the
effectiveness of our algorithm with several benchmark examples, which cannot be
handled by other tools.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981.
Springer; 2018:468-486. doi:10.1007/978-3-319-96145-3_25'
apa: 'Frehse, G., Giacobbe, M., & Henzinger, T. A. (2018). Space-time interpolants
(Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification,
Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_25'
chicago: Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,”
10981:468–86. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_25.
ieee: 'G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented
at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981,
pp. 468–486.'
ista: 'Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer
Aided Verification, LNCS, vol. 10981, 468–486.'
mla: Frehse, Goran, et al. Space-Time Interpolants. Vol. 10981, Springer,
2018, pp. 468–86, doi:10.1007/978-3-319-96145-3_25.
short: G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.
conference:
end_date: 2018-07-17
location: Oxford, United Kingdom
name: 'CAV: Computer Aided Verification'
start_date: 2018-07-14
date_created: 2018-12-11T11:44:50Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2023-09-19T09:30:43Z
day: '18'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-319-96145-3_25
external_id:
isi:
- '000491481600025'
file:
- access_level: open_access
checksum: 6dca832f575d6b3f0ea9dff56f579142
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:53Z
date_updated: 2020-07-14T12:44:50Z
file_id: '5310'
file_name: IST-2018-1010-v1+1_space-time_interpolants.pdf
file_size: 563710
relation: main_file
file_date_updated: 2020-07-14T12:44:50Z
has_accepted_license: '1'
intvolume: ' 10981'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 468 - 486
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_identifier:
issn:
- '03029743'
publication_status: published
publisher: Springer
publist_id: '7783'
pubrep_id: '1010'
quality_controlled: '1'
related_material:
record:
- id: '6894'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Space-time interpolants
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10981
year: '2018'
...
---
_id: '14003'
abstract:
- lang: eng
text: "Molecular chirality plays an essential role in most biochemical processes.
The observation and quantification of chirality-sensitive signals, however, remains
extremely challenging, especially on ultrafast timescales and in dilute media.
Here, we describe the experimental realization of an all-optical and ultrafast
scheme for detecting chiral dynamics in molecules. This technique is based on
high-harmonic generation by a combination of two-color counterrotating femtosecond
laser pulses with polarization states tunable from linear to circular. We demonstrate
two different implementations of chiral-sensitive high-harmonic spectroscopy on
an ensemble of randomly oriented methyloxirane molecules in the gas phase. Using
two elliptically polarized fields, we observe that the ellipticities maximizing
the harmonic signal reach up to \r\n4.4\r\n±\r\n0.2\r\n%\r\n (at 17.6 eV). Using
two circularly polarized fields, we observe circular dichroisms ranging up to
\r\n13\r\n±\r\n6\r\n%\r\n (28.3–33.1 eV). Our theoretical analysis confirms that
the observed chiral response originates from subfemtosecond electron dynamics
driven by the magnetic component of the driving laser field. This assignment is
supported by the experimental observation of a strong intensity dependence of
the chiral effects and its agreement with theory. We moreover report and explain
a pronounced variation of the signal strength and dichroism with the driving-field
ellipticities and harmonic orders. Finally, we demonstrate the sensitivity of
the experimental observables to the shape of the electron hole. This technique
for chiral discrimination will yield femtosecond temporal resolution when integrated
in a pump-probe scheme and subfemtosecond resolution on chiral charge migration
in a self-probing scheme."
article_number: '031060'
article_processing_charge: No
article_type: original
author:
- first_name: Denitsa Rangelova
full_name: Baykusheva, Denitsa Rangelova
id: 71b4d059-2a03-11ee-914d-dfa3beed6530
last_name: Baykusheva
- first_name: Hans Jakob
full_name: Wörner, Hans Jakob
last_name: Wörner
citation:
ama: Baykusheva DR, Wörner HJ. Chiral discrimination through bielliptical high-harmonic
spectroscopy. Physical Review X. 2018;8(3). doi:10.1103/physrevx.8.031060
apa: Baykusheva, D. R., & Wörner, H. J. (2018). Chiral discrimination through
bielliptical high-harmonic spectroscopy. Physical Review X. American Physical
Society. https://doi.org/10.1103/physrevx.8.031060
chicago: Baykusheva, Denitsa Rangelova, and Hans Jakob Wörner. “Chiral Discrimination
through Bielliptical High-Harmonic Spectroscopy.” Physical Review X. American
Physical Society, 2018. https://doi.org/10.1103/physrevx.8.031060.
ieee: D. R. Baykusheva and H. J. Wörner, “Chiral discrimination through bielliptical
high-harmonic spectroscopy,” Physical Review X, vol. 8, no. 3. American
Physical Society, 2018.
ista: Baykusheva DR, Wörner HJ. 2018. Chiral discrimination through bielliptical
high-harmonic spectroscopy. Physical Review X. 8(3), 031060.
mla: Baykusheva, Denitsa Rangelova, and Hans Jakob Wörner. “Chiral Discrimination
through Bielliptical High-Harmonic Spectroscopy.” Physical Review X, vol.
8, no. 3, 031060, American Physical Society, 2018, doi:10.1103/physrevx.8.031060.
short: D.R. Baykusheva, H.J. Wörner, Physical Review X 8 (2018).
date_created: 2023-08-10T06:34:48Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2023-08-22T07:42:07Z
day: '01'
doi: 10.1103/physrevx.8.031060
extern: '1'
intvolume: ' 8'
issue: '3'
keyword:
- General Physics and Astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1103/PhysRevX.8.031060
month: '07'
oa: 1
oa_version: Published Version
publication: Physical Review X
publication_identifier:
eissn:
- 2160-3308
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Chiral discrimination through bielliptical high-harmonic spectroscopy
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2018'
...
---
_id: '141'
abstract:
- lang: eng
text: 'Given a model and a specification, the fundamental model-checking problem
asks for algorithmic verification of whether the model satisfies the specification.
We consider graphs and Markov decision processes (MDPs), which are fundamental
models for reactive systems. One of the very basic specifications that arise in
verification of reactive systems is the strong fairness (aka Streett) objective.
Given different types of requests and corresponding grants, the objective requires
that for each type, if the request event happens infinitely often, then the corresponding
grant event must also happen infinitely often. All ω -regular objectives can be
expressed as Streett objectives and hence they are canonical in verification.
To handle the state-space explosion, symbolic algorithms are required that operate
on a succinct implicit representation of the system rather than explicitly accessing
the system. While explicit algorithms for graphs and MDPs with Streett objectives
have been widely studied, there has been no improvement of the basic symbolic
algorithms. The worst-case numbers of symbolic steps required for the basic symbolic
algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work
we present the first sub-quadratic symbolic algorithm for graphs with Streett
objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic
insights we present an implementation of the new symbolic approach and show that
it improves the existing approach on several academic benchmark examples.'
acknowledgement: 'Acknowledgements. K. C. and M. H. are partially supported by the
Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported
by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant
(279307: Graph Games). V. T. is partially supported by the European Union’s Horizon
2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement
No. 665385.'
alternative_title:
- LNCS
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: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
- first_name: Simin
full_name: Oraee, Simin
last_name: Oraee
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms
for graphs and Markov decision processes with fairness objectives. In: Vol 10982.
Springer; 2018:178-197. doi:10.1007/978-3-319-96142-2_13'
apa: 'Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., & Toman,
V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness
objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification,
Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13'
chicago: Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin
Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes
with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13.
ieee: 'K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman,
“Symbolic algorithms for graphs and Markov decision processes with fairness objectives,”
presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018,
vol. 10982, pp. 178–197.'
ista: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic
algorithms for graphs and Markov decision processes with fairness objectives.
CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.'
mla: Chatterjee, Krishnendu, et al. Symbolic Algorithms for Graphs and Markov
Decision Processes with Fairness Objectives. Vol. 10982, Springer, 2018, pp.
178–97, doi:10.1007/978-3-319-96142-2_13.
short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:,
Springer, 2018, pp. 178–197.
conference:
end_date: 2018-07-17
location: Oxford, United Kingdom
name: 'CAV: Computer Aided Verification'
start_date: 2018-07-14
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2025-07-14T09:10:15Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-319-96142-2_13
ec_funded: 1
external_id:
isi:
- '000491469700013'
file:
- access_level: open_access
checksum: 1a6ffa4febe8bb8ac28be3adb3eafebc
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T08:52:38Z
date_updated: 2020-07-14T12:44:53Z
file_id: '5737'
file_name: 2018_LNCS_Chatterjee.pdf
file_size: 675606
relation: main_file
file_date_updated: 2020-07-14T12:44:53Z
has_accepted_license: '1'
intvolume: ' 10982'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 178-197
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_status: published
publisher: Springer
publist_id: '7782'
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Symbolic algorithms for graphs and Markov decision processes with fairness
objectives
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10982
year: '2018'
...
---
_id: '14198'
abstract:
- lang: eng
text: "High-dimensional time series are common in many domains. Since human\r\ncognition
is not optimized to work well in high-dimensional spaces, these areas\r\ncould
benefit from interpretable low-dimensional representations. However, most\r\nrepresentation
learning algorithms for time series data are difficult to\r\ninterpret. This is
due to non-intuitive mappings from data features to salient\r\nproperties of the
representation and non-smoothness over time. To address this\r\nproblem, we propose
a new representation learning framework building on ideas\r\nfrom interpretable
discrete dimensionality reduction and deep generative\r\nmodeling. This framework
allows us to learn discrete representations of time\r\nseries, which give rise
to smooth and interpretable embeddings with superior\r\nclustering performance.
We introduce a new way to overcome the\r\nnon-differentiability in discrete representation
learning and present a\r\ngradient-based version of the traditional self-organizing
map algorithm that is\r\nmore performant than the original. Furthermore, to allow
for a probabilistic\r\ninterpretation of our method, we integrate a Markov model
in the representation\r\nspace. This model uncovers the temporal transition structure,
improves\r\nclustering performance even further and provides additional explanatory\r\ninsights
as well as a natural representation of uncertainty. We evaluate our\r\nmodel in
terms of clustering performance and interpretability on static\r\n(Fashion-)MNIST
data, a time series of linearly interpolated (Fashion-)MNIST\r\nimages, a chaotic
Lorenz attractor system with two macro states, as well as on\r\na challenging
real world medical time series application on the eICU data set.\r\nOur learned
representations compare favorably with competitor methods and\r\nfacilitate downstream
tasks on the real world data."
article_processing_charge: No
arxiv: 1
author:
- first_name: Vincent
full_name: Fortuin, Vincent
last_name: Fortuin
- first_name: Matthias
full_name: Hüser, Matthias
last_name: Hüser
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Heiko
full_name: Strathmann, Heiko
last_name: Strathmann
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
citation:
ama: 'Fortuin V, Hüser M, Locatello F, Strathmann H, Rätsch G. SOM-VAE: Interpretable
discrete representation learning on time series. In: International Conference
on Learning Representations. ; 2018.'
apa: 'Fortuin, V., Hüser, M., Locatello, F., Strathmann, H., & Rätsch, G. (2018).
SOM-VAE: Interpretable discrete representation learning on time series. In International
Conference on Learning Representations. New Orleans, LA, United States.'
chicago: 'Fortuin, Vincent, Matthias Hüser, Francesco Locatello, Heiko Strathmann,
and Gunnar Rätsch. “SOM-VAE: Interpretable Discrete Representation Learning on
Time Series.” In International Conference on Learning Representations,
2018.'
ieee: 'V. Fortuin, M. Hüser, F. Locatello, H. Strathmann, and G. Rätsch, “SOM-VAE:
Interpretable discrete representation learning on time series,” in International
Conference on Learning Representations, New Orleans, LA, United States, 2018.'
ista: 'Fortuin V, Hüser M, Locatello F, Strathmann H, Rätsch G. 2018. SOM-VAE: Interpretable
discrete representation learning on time series. International Conference on Learning
Representations. ICLR: International Conference on Learning Representations.'
mla: 'Fortuin, Vincent, et al. “SOM-VAE: Interpretable Discrete Representation Learning
on Time Series.” International Conference on Learning Representations,
2018.'
short: V. Fortuin, M. Hüser, F. Locatello, H. Strathmann, G. Rätsch, in:, International
Conference on Learning Representations, 2018.
conference:
end_date: 2019-05-09
location: New Orleans, LA, United States
name: 'ICLR: International Conference on Learning Representations'
start_date: 2019-05-06
date_created: 2023-08-22T14:12:48Z
date_published: 2018-06-06T00:00:00Z
date_updated: 2023-09-13T06:35:12Z
day: '06'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1806.02199'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.02199
month: '06'
oa: 1
oa_version: Preprint
publication: International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
status: public
title: 'SOM-VAE: Interpretable discrete representation learning on time series'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '142'
abstract:
- lang: eng
text: We address the problem of analyzing the reachable set of a polynomial nonlinear
continuous system by over-approximating the flowpipe of its dynamics. The common
approach to tackle this problem is to perform a numerical integration over a given
time horizon based on Taylor expansion and interval arithmetic. However, this
method results to be very conservative when there is a large difference in speed
between trajectories as time progresses. In this paper, we propose to use combinations
of barrier functions, which we call piecewise barrier tube (PBT), to over-approximate
flowpipe. The basic idea of PBT is that for each segment of a flowpipe, a coarse
box which is big enough to contain the segment is constructed using sampled simulation
and then in the box we compute by linear programming a set of barrier functions
(called barrier tube or BT for short) which work together to form a tube surrounding
the flowpipe. The benefit of using PBT is that (1) BT is independent of time and
hence can avoid being stretched and deformed by time; and (2) a small number of
BTs can form a tight over-approximation for the flowpipe, which means that the
computation required to decide whether the BTs intersect the unsafe set can be
reduced significantly. We implemented a prototype called PBTS in C++. Experiments
on some benchmark systems show that our approach is effective.
acknowledgement: 'Austrian Science Fund FWF: S11402-N23, S11405-N23, Z211-N32'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Kong H, Bartocci E, Henzinger TA. Reachable set over-approximation for nonlinear
systems using piecewise barrier tubes. In: Vol 10981. Springer; 2018:449-467.
doi:10.1007/978-3-319-96145-3_24'
apa: 'Kong, H., Bartocci, E., & Henzinger, T. A. (2018). Reachable set over-approximation
for nonlinear systems using piecewise barrier tubes (Vol. 10981, pp. 449–467).
Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer.
https://doi.org/10.1007/978-3-319-96145-3_24'
chicago: Kong, Hui, Ezio Bartocci, and Thomas A Henzinger. “Reachable Set Over-Approximation
for Nonlinear Systems Using Piecewise Barrier Tubes,” 10981:449–67. Springer,
2018. https://doi.org/10.1007/978-3-319-96145-3_24.
ieee: 'H. Kong, E. Bartocci, and T. A. Henzinger, “Reachable set over-approximation
for nonlinear systems using piecewise barrier tubes,” presented at the CAV: Computer
Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 449–467.'
ista: 'Kong H, Bartocci E, Henzinger TA. 2018. Reachable set over-approximation
for nonlinear systems using piecewise barrier tubes. CAV: Computer Aided Verification,
LNCS, vol. 10981, 449–467.'
mla: Kong, Hui, et al. Reachable Set Over-Approximation for Nonlinear Systems
Using Piecewise Barrier Tubes. Vol. 10981, Springer, 2018, pp. 449–67, doi:10.1007/978-3-319-96145-3_24.
short: H. Kong, E. Bartocci, T.A. Henzinger, in:, Springer, 2018, pp. 449–467.
conference:
end_date: 2018-07-17
location: Oxford, United Kingdom
name: 'CAV: Computer Aided Verification'
start_date: 2018-07-14
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2023-09-15T12:12:08Z
day: '18'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-96145-3_24
external_id:
isi:
- '000491481600024'
file:
- access_level: open_access
checksum: fd95e8026deacef3dc752a733bb9355f
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T15:57:06Z
date_updated: 2020-07-14T12:44:53Z
file_id: '5718'
file_name: 2018_LNCS_Kong.pdf
file_size: 5591566
relation: main_file
file_date_updated: 2020-07-14T12:44:53Z
has_accepted_license: '1'
intvolume: ' 10981'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 449 - 467
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_status: published
publisher: Springer
publist_id: '7781'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reachable set over-approximation for nonlinear systems using piecewise barrier
tubes
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10981
year: '2018'
...
---
_id: '14201'
abstract:
- lang: eng
text: "Variational inference is a popular technique to approximate a possibly\r\nintractable
Bayesian posterior with a more tractable one. Recently, boosting\r\nvariational
inference has been proposed as a new paradigm to approximate the\r\nposterior
by a mixture of densities by greedily adding components to the\r\nmixture. However,
as is the case with many other variational inference\r\nalgorithms, its theoretical
properties have not been studied. In the present\r\nwork, we study the convergence
properties of this approach from a modern\r\noptimization viewpoint by establishing
connections to the classic Frank-Wolfe\r\nalgorithm. Our analyses yields novel
theoretical insights regarding the\r\nsufficient conditions for convergence, explicit
rates, and algorithmic\r\nsimplifications. Since a lot of focus in previous works
for variational\r\ninference has been on tractability, our work is especially
important as a much\r\nneeded attempt to bridge the gap between probabilistic
models and their\r\ncorresponding theoretical properties."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Rajiv
full_name: Khanna, Rajiv
last_name: Khanna
- first_name: Joydeep
full_name: Ghosh, Joydeep
last_name: Ghosh
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
citation:
ama: 'Locatello F, Khanna R, Ghosh J, Rätsch G. Boosting variational inference:
An optimization perspective. In: Proceedings of the 21st International Conference
on Artificial Intelligence and Statistics. Vol 84. ML Research Press; 2018:464-472.'
apa: 'Locatello, F., Khanna, R., Ghosh, J., & Rätsch, G. (2018). Boosting variational
inference: An optimization perspective. In Proceedings of the 21st International
Conference on Artificial Intelligence and Statistics (Vol. 84, pp. 464–472).
Playa Blanca, Lanzarote: ML Research Press.'
chicago: 'Locatello, Francesco, Rajiv Khanna, Joydeep Ghosh, and Gunnar Rätsch.
“Boosting Variational Inference: An Optimization Perspective.” In Proceedings
of the 21st International Conference on Artificial Intelligence and Statistics,
84:464–72. ML Research Press, 2018.'
ieee: 'F. Locatello, R. Khanna, J. Ghosh, and G. Rätsch, “Boosting variational inference:
An optimization perspective,” in Proceedings of the 21st International Conference
on Artificial Intelligence and Statistics, Playa Blanca, Lanzarote, 2018,
vol. 84, pp. 464–472.'
ista: 'Locatello F, Khanna R, Ghosh J, Rätsch G. 2018. Boosting variational inference:
An optimization perspective. Proceedings of the 21st International Conference
on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence
and Statistics, PMLR, vol. 84, 464–472.'
mla: 'Locatello, Francesco, et al. “Boosting Variational Inference: An Optimization
Perspective.” Proceedings of the 21st International Conference on Artificial
Intelligence and Statistics, vol. 84, ML Research Press, 2018, pp. 464–72.'
short: F. Locatello, R. Khanna, J. Ghosh, G. Rätsch, in:, Proceedings of the 21st
International Conference on Artificial Intelligence and Statistics, ML Research
Press, 2018, pp. 464–472.
conference:
end_date: 2018-04-11
location: Playa Blanca, Lanzarote
name: 'AISTATS: Conference on Artificial Intelligence and Statistics'
start_date: 2018-04-09
date_created: 2023-08-22T14:15:20Z
date_published: 2018-04-15T00:00:00Z
date_updated: 2023-09-13T07:52:40Z
day: '15'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1708.01733'
intvolume: ' 84'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.01733
month: '04'
oa: 1
oa_version: Preprint
page: 464-472
publication: Proceedings of the 21st International Conference on Artificial Intelligence
and Statistics
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Boosting variational inference: An optimization perspective'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 84
year: '2018'
...
---
_id: '14202'
abstract:
- lang: eng
text: "Approximating a probability density in a tractable manner is a central task\r\nin
Bayesian statistics. Variational Inference (VI) is a popular technique that\r\nachieves
tractability by choosing a relatively simple variational family.\r\nBorrowing
ideas from the classic boosting framework, recent approaches attempt\r\nto \\emph{boost}
VI by replacing the selection of a single density with a\r\ngreedily constructed
mixture of densities. In order to guarantee convergence,\r\nprevious works impose
stringent assumptions that require significant effort for\r\npractitioners. Specifically,
they require a custom implementation of the greedy\r\nstep (called the LMO) for
every probabilistic model with respect to an\r\nunnatural variational family of
truncated distributions. Our work fixes these\r\nissues with novel theoretical
and algorithmic insights. On the theoretical\r\nside, we show that boosting VI
satisfies a relaxed smoothness assumption which\r\nis sufficient for the convergence
of the functional Frank-Wolfe (FW) algorithm.\r\nFurthermore, we rephrase the
LMO problem and propose to maximize the Residual\r\nELBO (RELBO) which replaces
the standard ELBO optimization in VI. These\r\ntheoretical enhancements allow
for black box implementation of the boosting\r\nsubroutine. Finally, we present
a stopping criterion drawn from the duality gap\r\nin the classic FW analyses
and exhaustive experiments to illustrate the\r\nusefulness of our theoretical
and algorithmic contributions."
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Gideon
full_name: Dresdner, Gideon
last_name: Dresdner
- first_name: Rajiv
full_name: Khanna, Rajiv
last_name: Khanna
- first_name: Isabel
full_name: Valera, Isabel
last_name: Valera
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
citation:
ama: 'Locatello F, Dresdner G, Khanna R, Valera I, Rätsch G. Boosting black box
variational inference. In: Advances in Neural Information Processing Systems.
Vol 31. Neural Information Processing Systems Foundation; 2018.'
apa: 'Locatello, F., Dresdner, G., Khanna, R., Valera, I., & Rätsch, G. (2018).
Boosting black box variational inference. In Advances in Neural Information
Processing Systems (Vol. 31). Montreal, Canada: Neural Information Processing
Systems Foundation.'
chicago: Locatello, Francesco, Gideon Dresdner, Rajiv Khanna, Isabel Valera, and
Gunnar Rätsch. “Boosting Black Box Variational Inference.” In Advances in Neural
Information Processing Systems, Vol. 31. Neural Information Processing Systems
Foundation, 2018.
ieee: F. Locatello, G. Dresdner, R. Khanna, I. Valera, and G. Rätsch, “Boosting
black box variational inference,” in Advances in Neural Information Processing
Systems, Montreal, Canada, 2018, vol. 31.
ista: 'Locatello F, Dresdner G, Khanna R, Valera I, Rätsch G. 2018. Boosting black
box variational inference. Advances in Neural Information Processing Systems.
NeurIPS: Neural Information Processing Systems vol. 31.'
mla: Locatello, Francesco, et al. “Boosting Black Box Variational Inference.” Advances
in Neural Information Processing Systems, vol. 31, Neural Information Processing
Systems Foundation, 2018.
short: F. Locatello, G. Dresdner, R. Khanna, I. Valera, G. Rätsch, in:, Advances
in Neural Information Processing Systems, Neural Information Processing Systems
Foundation, 2018.
conference:
end_date: 2018-12-08
location: Montreal, Canada
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2018-12-03
date_created: 2023-08-22T14:15:40Z
date_published: 2018-06-06T00:00:00Z
date_updated: 2023-09-13T07:38:24Z
day: '06'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1806.02185'
intvolume: ' 31'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.02185
month: '06'
oa: 1
oa_version: Preprint
publication: Advances in Neural Information Processing Systems
publication_identifier:
eissn:
- 1049-5258
isbn:
- '9781510884472'
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Boosting black box variational inference
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2018'
...
---
_id: '14203'
abstract:
- lang: eng
text: We propose a conditional gradient framework for a composite convex minimization
template with broad applications. Our approach combines smoothing and homotopy
techniques under the CGM framework, and provably achieves the optimal O(1/k−−√)
convergence rate. We demonstrate that the same rate holds if the linear subproblems
are solved approximately with additive or multiplicative error. In contrast with
the relevant work, we are able to characterize the convergence when the non-smooth
term is an indicator function. Specific applications of our framework include
the non-smooth minimization, semidefinite programming, and minimization with linear
inclusion constraints over a compact domain. Numerical evidence demonstrates the
benefits of our framework.
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Alp
full_name: Yurtsever, Alp
last_name: Yurtsever
- first_name: Olivier
full_name: Fercoq, Olivier
last_name: Fercoq
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Volkan
full_name: Cevher, Volkan
last_name: Cevher
citation:
ama: 'Yurtsever A, Fercoq O, Locatello F, Cevher V. A conditional gradient framework
for composite convex minimization with applications to semidefinite programming.
In: Proceedings of the 35th International Conference on Machine Learning.
Vol 80. ML Research Press; 2018:5727-5736.'
apa: 'Yurtsever, A., Fercoq, O., Locatello, F., & Cevher, V. (2018). A conditional
gradient framework for composite convex minimization with applications to semidefinite
programming. In Proceedings of the 35th International Conference on Machine
Learning (Vol. 80, pp. 5727–5736). Stockholm, Sweden: ML Research Press.'
chicago: Yurtsever, Alp, Olivier Fercoq, Francesco Locatello, and Volkan Cevher.
“A Conditional Gradient Framework for Composite Convex Minimization with Applications
to Semidefinite Programming.” In Proceedings of the 35th International Conference
on Machine Learning, 80:5727–36. ML Research Press, 2018.
ieee: A. Yurtsever, O. Fercoq, F. Locatello, and V. Cevher, “A conditional gradient
framework for composite convex minimization with applications to semidefinite
programming,” in Proceedings of the 35th International Conference on Machine
Learning, Stockholm, Sweden, 2018, vol. 80, pp. 5727–5736.
ista: 'Yurtsever A, Fercoq O, Locatello F, Cevher V. 2018. A conditional gradient
framework for composite convex minimization with applications to semidefinite
programming. Proceedings of the 35th International Conference on Machine Learning.
ICML: International Conference on Machine Learning, PMLR, vol. 80, 5727–5736.'
mla: Yurtsever, Alp, et al. “A Conditional Gradient Framework for Composite Convex
Minimization with Applications to Semidefinite Programming.” Proceedings of
the 35th International Conference on Machine Learning, vol. 80, ML Research
Press, 2018, pp. 5727–36.
short: A. Yurtsever, O. Fercoq, F. Locatello, V. Cevher, in:, Proceedings of the
35th International Conference on Machine Learning, ML Research Press, 2018, pp.
5727–5736.
conference:
end_date: 2018-07-15
location: Stockholm, Sweden
name: 'ICML: International Conference on Machine Learning'
start_date: 2018-07-10
date_created: 2023-08-22T14:16:01Z
date_published: 2018-07-15T00:00:00Z
date_updated: 2023-09-13T08:13:39Z
day: '15'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1804.08544'
intvolume: ' 80'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.08544
month: '07'
oa: 1
oa_version: Preprint
page: 5727-5736
publication: Proceedings of the 35th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
status: public
title: A conditional gradient framework for composite convex minimization with applications
to semidefinite programming
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2018'
...
---
_id: '14204'
abstract:
- lang: eng
text: Two popular examples of first-order optimization methods over linear spaces
are coordinate descent and matching pursuit algorithms, with their randomized
variants. While the former targets the optimization by moving along coordinates,
the latter considers a generalized notion of directions. Exploiting the connection
between the two algorithms, we present a unified analysis of both, providing affine
invariant sublinear O(1/t) rates on smooth objectives and linear convergence on
strongly convex objectives. As a byproduct of our affine invariant analysis of
matching pursuit, our rates for steepest coordinate descent are the tightest known.
Furthermore, we show the first accelerated convergence rate O(1/t2) for matching
pursuit and steepest coordinate descent on convex objectives.
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Anant
full_name: Raj, Anant
last_name: Raj
- first_name: Sai Praneeth
full_name: Karimireddy, Sai Praneeth
last_name: Karimireddy
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
- first_name: Bernhard
full_name: Schölkopf, Bernhard
last_name: Schölkopf
- first_name: Sebastian U.
full_name: Stich, Sebastian U.
last_name: Stich
- first_name: Martin
full_name: Jaggi, Martin
last_name: Jaggi
citation:
ama: 'Locatello F, Raj A, Karimireddy SP, et al. On matching pursuit and coordinate
descent. In: Proceedings of the 35th International Conference on Machine Learning.
Vol 80. ML Research Press; 2018:3198-3207.'
apa: Locatello, F., Raj, A., Karimireddy, S. P., Rätsch, G., Schölkopf, B., Stich,
S. U., & Jaggi, M. (2018). On matching pursuit and coordinate descent. In
Proceedings of the 35th International Conference on Machine Learning (Vol.
80, pp. 3198–3207). ML Research Press.
chicago: Locatello, Francesco, Anant Raj, Sai Praneeth Karimireddy, Gunnar Rätsch,
Bernhard Schölkopf, Sebastian U. Stich, and Martin Jaggi. “On Matching Pursuit
and Coordinate Descent.” In Proceedings of the 35th International Conference
on Machine Learning, 80:3198–3207. ML Research Press, 2018.
ieee: F. Locatello et al., “On matching pursuit and coordinate descent,”
in Proceedings of the 35th International Conference on Machine Learning,
2018, vol. 80, pp. 3198–3207.
ista: Locatello F, Raj A, Karimireddy SP, Rätsch G, Schölkopf B, Stich SU, Jaggi
M. 2018. On matching pursuit and coordinate descent. Proceedings of the 35th International
Conference on Machine Learning. , PMLR, vol. 80, 3198–3207.
mla: Locatello, Francesco, et al. “On Matching Pursuit and Coordinate Descent.”
Proceedings of the 35th International Conference on Machine Learning, vol.
80, ML Research Press, 2018, pp. 3198–207.
short: F. Locatello, A. Raj, S.P. Karimireddy, G. Rätsch, B. Schölkopf, S.U. Stich,
M. Jaggi, in:, Proceedings of the 35th International Conference on Machine Learning,
ML Research Press, 2018, pp. 3198–3207.
date_created: 2023-08-22T14:16:25Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2023-09-13T08:19:05Z
day: '01'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1803.09539'
intvolume: ' 80'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.09539
month: '07'
oa: 1
oa_version: Preprint
page: 3198-3207
publication: Proceedings of the 35th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: On matching pursuit and coordinate descent
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2018'
...
---
_id: '14224'
abstract:
- lang: eng
text: Clustering is a cornerstone of unsupervised learning which can be thought
as disentangling multiple generative mechanisms underlying the data. In this paper
we introduce an algorithmic framework to train mixtures of implicit generative
models which we particularize for variational autoencoders. Relying on an additional
set of discriminators, we propose a competitive procedure in which the models
only need to approximate the portion of the data distribution from which they
can produce realistic samples. As a byproduct, each model is simpler to train,
and a clustering interpretation arises naturally from the partitioning of the
training points among the models. We empirically show that our approach splits
the training distribution in a reasonable way and increases the quality of the
generated samples.
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Damien
full_name: Vincent, Damien
last_name: Vincent
- first_name: Ilya
full_name: Tolstikhin, Ilya
last_name: Tolstikhin
- first_name: Gunnar
full_name: Ratsch, Gunnar
last_name: Ratsch
- first_name: Sylvain
full_name: Gelly, Sylvain
last_name: Gelly
- first_name: Bernhard
full_name: Scholkopf, Bernhard
last_name: Scholkopf
citation:
ama: 'Locatello F, Vincent D, Tolstikhin I, Ratsch G, Gelly S, Scholkopf B. Clustering
meets implicit generative models. In: 6th International Conference on Learning
Representations. ; 2018.'
apa: Locatello, F., Vincent, D., Tolstikhin, I., Ratsch, G., Gelly, S., & Scholkopf,
B. (2018). Clustering meets implicit generative models. In 6th International
Conference on Learning Representations. Vancouver, Canada.
chicago: Locatello, Francesco, Damien Vincent, Ilya Tolstikhin, Gunnar Ratsch, Sylvain
Gelly, and Bernhard Scholkopf. “Clustering Meets Implicit Generative Models.”
In 6th International Conference on Learning Representations, 2018.
ieee: F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, and B. Scholkopf,
“Clustering meets implicit generative models,” in 6th International Conference
on Learning Representations, Vancouver, Canada, 2018.
ista: Locatello F, Vincent D, Tolstikhin I, Ratsch G, Gelly S, Scholkopf B. 2018.
Clustering meets implicit generative models. 6th International Conference on Learning
Representations. International Conference on Machine Learning.
mla: Locatello, Francesco, et al. “Clustering Meets Implicit Generative Models.”
6th International Conference on Learning Representations, 2018.
short: F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, B. Scholkopf,
in:, 6th International Conference on Learning Representations, 2018.
conference:
end_date: 2018-05-03
location: Vancouver, Canada
name: International Conference on Machine Learning
start_date: 2018-04-30
date_created: 2023-08-22T14:25:34Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-09-13T09:08:24Z
day: '01'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1804.11130'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.11130
month: '05'
oa: 1
oa_version: Preprint
publication: 6th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
scopus_import: '1'
status: public
title: Clustering meets implicit generative models
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '14284'
abstract:
- lang: eng
text: Pore-forming toxins (PFT) are virulence factors that transform from soluble
to membrane-bound states. The Yersinia YaxAB system represents a family of binary
α-PFTs with orthologues in human, insect, and plant pathogens, with unknown structures.
YaxAB was shown to be cytotoxic and likely involved in pathogenesis, though the
molecular basis for its two-component lytic mechanism remains elusive. Here, we
present crystal structures of YaxA and YaxB, together with a cryo-electron microscopy
map of the YaxAB complex. Our structures reveal a pore predominantly composed
of decamers of YaxA–YaxB heterodimers. Both subunits bear membrane-active moieties,
but only YaxA is capable of binding to membranes by itself. YaxB can subsequently
be recruited to membrane-associated YaxA and induced to present its lytic transmembrane
helices. Pore formation can progress by further oligomerization of YaxA–YaxB dimers.
Our results allow for a comparison between pore assemblies belonging to the wider
ClyA-like family of α-PFTs, highlighting diverse pore architectures.
article_number: '1806'
article_processing_charge: No
article_type: original
author:
- first_name: Bastian
full_name: Bräuning, Bastian
last_name: Bräuning
- first_name: Eva
full_name: Bertosin, Eva
last_name: Bertosin
- first_name: Florian M
full_name: Praetorius, Florian M
id: dfec9381-4341-11ee-8fd8-faa02bba7d62
last_name: Praetorius
- first_name: Christian
full_name: Ihling, Christian
last_name: Ihling
- first_name: Alexandra
full_name: Schatt, Alexandra
last_name: Schatt
- first_name: Agnes
full_name: Adler, Agnes
last_name: Adler
- first_name: Klaus
full_name: Richter, Klaus
last_name: Richter
- first_name: Andrea
full_name: Sinz, Andrea
last_name: Sinz
- first_name: Hendrik
full_name: Dietz, Hendrik
last_name: Dietz
- first_name: Michael
full_name: Groll, Michael
last_name: Groll
citation:
ama: Bräuning B, Bertosin E, Praetorius FM, et al. Structure and mechanism of the
two-component α-helical pore-forming toxin YaxAB. Nature Communications.
2018;9. doi:10.1038/s41467-018-04139-2
apa: Bräuning, B., Bertosin, E., Praetorius, F. M., Ihling, C., Schatt, A., Adler,
A., … Groll, M. (2018). Structure and mechanism of the two-component α-helical
pore-forming toxin YaxAB. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-04139-2
chicago: Bräuning, Bastian, Eva Bertosin, Florian M Praetorius, Christian Ihling,
Alexandra Schatt, Agnes Adler, Klaus Richter, Andrea Sinz, Hendrik Dietz, and
Michael Groll. “Structure and Mechanism of the Two-Component α-Helical Pore-Forming
Toxin YaxAB.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-04139-2.
ieee: B. Bräuning et al., “Structure and mechanism of the two-component α-helical
pore-forming toxin YaxAB,” Nature Communications, vol. 9. Springer Nature,
2018.
ista: Bräuning B, Bertosin E, Praetorius FM, Ihling C, Schatt A, Adler A, Richter
K, Sinz A, Dietz H, Groll M. 2018. Structure and mechanism of the two-component
α-helical pore-forming toxin YaxAB. Nature Communications. 9, 1806.
mla: Bräuning, Bastian, et al. “Structure and Mechanism of the Two-Component α-Helical
Pore-Forming Toxin YaxAB.” Nature Communications, vol. 9, 1806, Springer
Nature, 2018, doi:10.1038/s41467-018-04139-2.
short: B. Bräuning, E. Bertosin, F.M. Praetorius, C. Ihling, A. Schatt, A. Adler,
K. Richter, A. Sinz, H. Dietz, M. Groll, Nature Communications 9 (2018).
date_created: 2023-09-06T12:07:33Z
date_published: 2018-05-04T00:00:00Z
date_updated: 2023-11-07T11:46:12Z
day: '04'
doi: 10.1038/s41467-018-04139-2
extern: '1'
external_id:
pmid:
- '29728606'
intvolume: ' 9'
keyword:
- General Physics and Astronomy
- General Biochemistry
- Genetics and Molecular Biology
- General Chemistry
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1038/s41467-018-04139-2
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structure and mechanism of the two-component α-helical pore-forming toxin YaxAB
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2018'
...
---
_id: '143'
abstract:
- lang: eng
text: 'Vector Addition Systems with States (VASS) provide a well-known and fundamental
model for the analysis of concurrent processes, parameterized systems, and are
also used as abstract models of programs in resource bound analysis. In this paper
we study the problem of obtaining asymptotic bounds on the termination time of
a given VASS. In particular, we focus on the practically important case of obtaining
polynomial bounds on termination time. Our main contributions are as follows:
First, we present a polynomial-time algorithm for deciding whether a given VASS
has a linear asymptotic complexity. We also show that if the complexity of a VASS
is not linear, it is at least quadratic. Second, we classify VASS according to
quantitative properties of their cycles. We show that certain singularities in
these properties are the key reason for non-polynomial asymptotic complexity of
VASS. In absence of singularities, we show that the asymptotic complexity is always
polynomial and of the form Θ(nk), for some integer k d, where d is the dimension
of the VASS. We present a polynomial-time algorithm computing the optimal k. For
general VASS, the same algorithm, which is based on a complete technique for the
construction of ranking functions in VASS, produces a valid lower bound, i.e.,
a k such that the termination complexity is (nk). Our results are based on new
insights into the geometry of VASS dynamics, which hold the potential for further
applicability to VASS analysis.'
alternative_title:
- ACM/IEEE Symposium on Logic in Computer Science
article_processing_charge: No
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Antonín
full_name: Kučera, Antonín
last_name: Kučera
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
- first_name: Dominik
full_name: Velan, Dominik
last_name: Velan
- first_name: Florian
full_name: Zuleger, Florian
last_name: Zuleger
citation:
ama: 'Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. Efficient
algorithms for asymptotic bounds on termination time in VASS. In: Vol F138033.
IEEE; 2018:185-194. doi:10.1145/3209108.3209191'
apa: 'Brázdil, T., Chatterjee, K., Kučera, A., Novotný, P., Velan, D., & Zuleger,
F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS
(Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science,
Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191'
chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný, Dominik
Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination
Time in VASS,” F138033:185–94. IEEE, 2018. https://doi.org/10.1145/3209108.3209191.
ieee: 'T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, and F. Zuleger,
“Efficient algorithms for asymptotic bounds on termination time in VASS,” presented
at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033,
pp. 185–194.'
ista: 'Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. 2018. Efficient
algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer
Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.'
mla: Brázdil, Tomáš, et al. Efficient Algorithms for Asymptotic Bounds on Termination
Time in VASS. Vol. F138033, IEEE, 2018, pp. 185–94, doi:10.1145/3209108.3209191.
short: T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, F. Zuleger, in:,
IEEE, 2018, pp. 185–194.
conference:
end_date: 2018-07-12
location: Oxford, United Kingdom
name: 'LICS: Logic in Computer Science'
start_date: 2018-07-09
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-09T00:00:00Z
date_updated: 2025-06-02T08:53:48Z
day: '09'
department:
- _id: KrCh
doi: 10.1145/3209108.3209191
ec_funded: 1
external_id:
isi:
- '000545262800020'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.10985
month: '07'
oa: 1
oa_version: Preprint
page: 185 - 194
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_identifier:
isbn:
- 978-1-4503-5583-4
publication_status: published
publisher: IEEE
publist_id: '7780'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient algorithms for asymptotic bounds on termination time in VASS
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: F138033
year: '2018'
...
---
_id: '14306'
abstract:
- lang: eng
text: 'Function and activity of biomolecules often depend on their spatial arrangement.
The method introduced here allows genetically encoding the spatial arrangement
of proteins and DNA. The approach relies on staple proteins that fold double-stranded
DNA into user-defined shapes. This thesis describes the development of staple
proteins based on the DNA recognition of TAL effectors and presents experimentally
derived rules for designing a variety of self-assembling nanoscale shapes featuring
structural motifs such as curvature, vertices, corners, and multilayer helix packing. '
article_processing_charge: No
author:
- first_name: Florian M
full_name: Praetorius, Florian M
id: dfec9381-4341-11ee-8fd8-faa02bba7d62
last_name: Praetorius
citation:
ama: Praetorius FM. Genetically encoding the spatial arrangement of DNA and proteins
in self-assembling nanostructures. 2018.
apa: Praetorius, F. M. (2018). Genetically encoding the spatial arrangement of
DNA and proteins in self-assembling nanostructures. Technische Universität
München.
chicago: Praetorius, Florian M. “Genetically Encoding the Spatial Arrangement of
DNA and Proteins in Self-Assembling Nanostructures.” Technische Universität München,
2018.
ieee: F. M. Praetorius, “Genetically encoding the spatial arrangement of DNA and
proteins in self-assembling nanostructures,” Technische Universität München, 2018.
ista: Praetorius FM. 2018. Genetically encoding the spatial arrangement of DNA and
proteins in self-assembling nanostructures. Technische Universität München.
mla: Praetorius, Florian M. Genetically Encoding the Spatial Arrangement of DNA
and Proteins in Self-Assembling Nanostructures. Technische Universität München,
2018.
short: F.M. Praetorius, Genetically Encoding the Spatial Arrangement of DNA and
Proteins in Self-Assembling Nanostructures, Technische Universität München, 2018.
date_created: 2023-09-06T13:11:22Z
date_published: 2018-01-16T00:00:00Z
date_updated: 2023-11-07T11:43:38Z
day: '16'
degree_awarded: PhD
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://mediatum.ub.tum.de/1398662
month: '01'
oa: 1
oa_version: Published Version
publication_status: published
publisher: Technische Universität München
status: public
supervisor:
- first_name: Hendrik
full_name: Dietz, Hendrik
last_name: Dietz
title: Genetically encoding the spatial arrangement of DNA and proteins in self-assembling
nanostructures
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '14327'
abstract:
- lang: eng
text: "A common assumption in causal modeling posits that the data is generated
by a\r\nset of independent mechanisms, and algorithms should aim to recover this\r\nstructure.
Standard unsupervised learning, however, is often concerned with\r\ntraining a
single model to capture the overall distribution or aspects thereof.\r\nInspired
by clustering approaches, we consider mixtures of implicit generative\r\nmodels
that ``disentangle'' the independent generative mechanisms underlying\r\nthe data.
Relying on an additional set of discriminators, we propose a\r\ncompetitive training
procedure in which the models only need to capture the\r\nportion of the data
distribution from which they can produce realistic samples.\r\nAs a by-product,
each model is simpler and faster to train. We empirically show\r\nthat our approach
splits the training distribution in a sensible way and\r\nincreases the quality
of the generated samples."
article_number: '1804.11130'
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Damien
full_name: Vincent, Damien
last_name: Vincent
- first_name: Ilya
full_name: Tolstikhin, Ilya
last_name: Tolstikhin
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
- first_name: Sylvain
full_name: Gelly, Sylvain
last_name: Gelly
- first_name: Bernhard
full_name: Schölkopf, Bernhard
last_name: Schölkopf
citation:
ama: Locatello F, Vincent D, Tolstikhin I, Rätsch G, Gelly S, Schölkopf B. Competitive
training of mixtures of independent deep generative models. arXiv. doi:10.48550/arXiv.1804.11130
apa: Locatello, F., Vincent, D., Tolstikhin, I., Rätsch, G., Gelly, S., & Schölkopf,
B. (n.d.). Competitive training of mixtures of independent deep generative models.
arXiv. https://doi.org/10.48550/arXiv.1804.11130
chicago: Locatello, Francesco, Damien Vincent, Ilya Tolstikhin, Gunnar Rätsch, Sylvain
Gelly, and Bernhard Schölkopf. “Competitive Training of Mixtures of Independent
Deep Generative Models.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1804.11130.
ieee: F. Locatello, D. Vincent, I. Tolstikhin, G. Rätsch, S. Gelly, and B. Schölkopf,
“Competitive training of mixtures of independent deep generative models,” arXiv.
.
ista: Locatello F, Vincent D, Tolstikhin I, Rätsch G, Gelly S, Schölkopf B. Competitive
training of mixtures of independent deep generative models. arXiv, 1804.11130.
mla: Locatello, Francesco, et al. “Competitive Training of Mixtures of Independent
Deep Generative Models.” ArXiv, 1804.11130, doi:10.48550/arXiv.1804.11130.
short: F. Locatello, D. Vincent, I. Tolstikhin, G. Rätsch, S. Gelly, B. Schölkopf,
ArXiv (n.d.).
date_created: 2023-09-13T12:20:49Z
date_published: 2018-04-30T00:00:00Z
date_updated: 2023-09-13T12:23:03Z
day: '30'
department:
- _id: FrLo
doi: 10.48550/arXiv.1804.11130
extern: '1'
external_id:
arxiv:
- '1804.11130'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1804.11130
month: '04'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Competitive training of mixtures of independent deep generative models
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '144'
abstract:
- lang: eng
text: The task of a monitor is to watch, at run-time, the execution of a reactive
system, and signal the occurrence of a safety violation in the observed sequence
of events. While finite-state monitors have been studied extensively, in practice,
monitoring software also makes use of unbounded memory. We define a model of automata
equipped with integer-valued registers which can execute only a bounded number
of instructions between consecutive events, and thus can form the theoretical
basis for the study of infinite-state monitors. We classify these register monitors
according to the number k of available registers, and the type of register instructions.
In stark contrast to the theory of computability for register machines, we prove
that for every k 1, monitors with k + 1 counters (with instruction set 〈+1, =〉)
are strictly more expressive than monitors with k counters. We also show that
adder monitors (with instruction set 〈1, +, =〉) are strictly more expressive than
counter monitors, but are complete for monitoring all computable safety -languages
for k = 6. Real-time monitors are further required to signal the occurrence of
a safety violation as soon as it occurs. The expressiveness hierarchy for counter
monitors carries over to real-time monitors. We then show that 2 adders cannot
simulate 3 counters in real-time. Finally, we show that real-time adder monitors
with inequalities are as expressive as real-time Turing machines.
alternative_title:
- ACM/IEEE Symposium on Logic in Computer Science
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- 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: Ege
full_name: Saraç, Ege
last_name: Saraç
citation:
ama: 'Ferrere T, Henzinger TA, Saraç E. A theory of register monitors. In: Vol Part
F138033. IEEE; 2018:394-403. doi:10.1145/3209108.3209194'
apa: 'Ferrere, T., Henzinger, T. A., & Saraç, E. (2018). A theory of register
monitors (Vol. Part F138033, pp. 394–403). Presented at the LICS: Logic in Computer
Science, Oxford, UK: IEEE. https://doi.org/10.1145/3209108.3209194'
chicago: Ferrere, Thomas, Thomas A Henzinger, and Ege Saraç. “A Theory of Register
Monitors,” Part F138033:394–403. IEEE, 2018. https://doi.org/10.1145/3209108.3209194.
ieee: 'T. Ferrere, T. A. Henzinger, and E. Saraç, “A theory of register monitors,”
presented at the LICS: Logic in Computer Science, Oxford, UK, 2018, vol. Part
F138033, pp. 394–403.'
ista: 'Ferrere T, Henzinger TA, Saraç E. 2018. A theory of register monitors. LICS:
Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol.
Part F138033, 394–403.'
mla: Ferrere, Thomas, et al. A Theory of Register Monitors. Vol. Part F138033,
IEEE, 2018, pp. 394–403, doi:10.1145/3209108.3209194.
short: T. Ferrere, T.A. Henzinger, E. Saraç, in:, IEEE, 2018, pp. 394–403.
conference:
end_date: 2018-07-12
location: Oxford, UK
name: 'LICS: Logic in Computer Science'
start_date: 2018-07-09
date_created: 2018-12-11T11:44:52Z
date_published: 2018-07-09T00:00:00Z
date_updated: 2023-09-08T11:49:13Z
day: '09'
department:
- _id: ToHe
doi: 10.1145/3209108.3209194
external_id:
isi:
- '000545262800041'
isi: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 394 - 403
publication_status: published
publisher: IEEE
publist_id: '7779'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A theory of register monitors
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: Part F138033
year: '2018'
...
---
_id: '145'
abstract:
- lang: eng
text: Aged proteins can become hazardous to cellular function, by accumulating molecular
damage. This implies that cells should preferentially rely on newly produced ones.
We tested this hypothesis in cultured hippocampal neurons, focusing on synaptic
transmission. We found that newly synthesized vesicle proteins were incorporated
in the actively recycling pool of vesicles responsible for all neurotransmitter
release during physiological activity. We observed this for the calcium sensor
Synaptotagmin 1, for the neurotransmitter transporter VGAT, and for the fusion
protein VAMP2 (Synaptobrevin 2). Metabolic labeling of proteins and visualization
by secondary ion mass spectrometry enabled us to query the entire protein makeup
of the actively recycling vesicles, which we found to be younger than that of
non-recycling vesicles. The young vesicle proteins remained in use for up to ~
24 h, during which they participated in recycling a few hundred times. They were
afterward reluctant to release and were degraded after an additional ~ 24–48 h.
We suggest that the recycling pool of synaptic vesicles relies on newly synthesized
proteins, while the inactive reserve pool contains older proteins.
acknowledgement: We thank Reinhard Jahn for providing a plasmid for YFP-SNAP25. We
thank Erwin Neher for help with the development of the mathematical model of the
synaptic vesicle life cycle. We thank Martin Meschkat, Andreas Höbartner, Annedore
Punge, and Peer Hoopmann for help with the experiments. We thank Burkhard Rammner
for providing the illustrations of synaptic vesicle and protein dynamics. We thank
Manuel Maidorn, Martin Helm, and Katharina N. Richter for critically reading the
manuscript. S.T. was supported by an Excellence Stipend of the Göttingen Graduate
School for Neurosciences, Biophysics, and Molecular Biosciences (GGNB). E.F.F. is
a recipient of long-term fellowships from the European Molecular Biology Organization
(ALTF_797-2012) and from the Human Frontier Science Program (HFSP_LT000830/2013).
The work was supported by grants to S.O.R. from the European Research Council (ERC-2013-CoG
NeuroMolAnatomy) and from the Deutsche Forschungsgemeinschaft (Cluster of Excellence
Nanoscale Microscopy and Molecular Physiology of the Brain, SFB1190/P09, SFB889/A05,
and SFB1286/A03, and DFG RI 1967 7/1). The nanoSIMS instrument was funded by the
German Federal Ministry of Education and Research (03F0626A).
article_number: e98044
article_processing_charge: No
article_type: original
author:
- first_name: Sven M
full_name: Truckenbrodt, Sven M
id: 45812BD4-F248-11E8-B48F-1D18A9856A87
last_name: Truckenbrodt
- first_name: Abhiyan
full_name: Viplav, Abhiyan
last_name: Viplav
- first_name: Sebsatian
full_name: Jähne, Sebsatian
last_name: Jähne
- first_name: Angela
full_name: Vogts, Angela
last_name: Vogts
- first_name: Annette
full_name: Denker, Annette
last_name: Denker
- first_name: Hanna
full_name: Wildhagen, Hanna
last_name: Wildhagen
- first_name: Eugenio
full_name: Fornasiero, Eugenio
last_name: Fornasiero
- first_name: Silvio
full_name: Rizzoli, Silvio
last_name: Rizzoli
citation:
ama: Truckenbrodt SM, Viplav A, Jähne S, et al. Newly produced synaptic vesicle
proteins are preferentially used in synaptic transmission. The EMBO Journal.
2018;37(15). doi:10.15252/embj.201798044
apa: Truckenbrodt, S. M., Viplav, A., Jähne, S., Vogts, A., Denker, A., Wildhagen,
H., … Rizzoli, S. (2018). Newly produced synaptic vesicle proteins are preferentially
used in synaptic transmission. The EMBO Journal. Wiley. https://doi.org/10.15252/embj.201798044
chicago: Truckenbrodt, Sven M, Abhiyan Viplav, Sebsatian Jähne, Angela Vogts, Annette
Denker, Hanna Wildhagen, Eugenio Fornasiero, and Silvio Rizzoli. “Newly Produced
Synaptic Vesicle Proteins Are Preferentially Used in Synaptic Transmission.” The
EMBO Journal. Wiley, 2018. https://doi.org/10.15252/embj.201798044.
ieee: S. M. Truckenbrodt et al., “Newly produced synaptic vesicle proteins
are preferentially used in synaptic transmission,” The EMBO Journal, vol.
37, no. 15. Wiley, 2018.
ista: Truckenbrodt SM, Viplav A, Jähne S, Vogts A, Denker A, Wildhagen H, Fornasiero
E, Rizzoli S. 2018. Newly produced synaptic vesicle proteins are preferentially
used in synaptic transmission. The EMBO Journal. 37(15), e98044.
mla: Truckenbrodt, Sven M., et al. “Newly Produced Synaptic Vesicle Proteins Are
Preferentially Used in Synaptic Transmission.” The EMBO Journal, vol. 37,
no. 15, e98044, Wiley, 2018, doi:10.15252/embj.201798044.
short: S.M. Truckenbrodt, A. Viplav, S. Jähne, A. Vogts, A. Denker, H. Wildhagen,
E. Fornasiero, S. Rizzoli, The EMBO Journal 37 (2018).
date_created: 2018-12-11T11:44:52Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-09-13T09:02:48Z
day: '01'
ddc:
- '570'
department:
- _id: JoDa
doi: 10.15252/embj.201798044
external_id:
isi:
- '000440416900005'
pmid:
- '29950309'
file:
- access_level: open_access
checksum: a540feb6c9af6aefc78de531461a8835
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T14:17:29Z
date_updated: 2020-07-14T12:44:56Z
file_id: '5710'
file_name: 2018_EMBO_Truckenbrodt.pdf
file_size: 2846470
relation: main_file
file_date_updated: 2020-07-14T12:44:56Z
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '15'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
publication: The EMBO Journal
publication_identifier:
issn:
- 0261-4189
publication_status: published
publisher: Wiley
publist_id: '7778'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Newly produced synaptic vesicle proteins are preferentially used in synaptic
transmission
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_id: '146'
abstract:
- lang: eng
text: The root cap protects the stem cell niche of angiosperm roots from damage.
In Arabidopsis, lateral root cap (LRC) cells covering the meristematic zone are
regularly lost through programmed cell death, while the outermost layer of the
root cap covering the tip is repeatedly sloughed. Efficient coordination with
stem cells producing new layers is needed to maintain a constant size of the cap.
We present a signalling pair, the peptide IDA-LIKE1 (IDL1) and its receptor HAESA-LIKE2
(HSL2), mediating such communication. Live imaging over several days characterized
this process from initial fractures in LRC cell files to full separation of a
layer. Enhanced expression of IDL1 in the separating root cap layers resulted
in increased frequency of sloughing, balanced with generation of new layers in
a HSL2-dependent manner. Transcriptome analyses linked IDL1-HSL2 signalling to
the transcription factors BEARSKIN1/2 and genes associated with programmed cell
death. Mutations in either IDL1 or HSL2 slowed down cell division, maturation
and separation. Thus, IDL1-HSL2 signalling potentiates dynamic regulation of the
homeostatic balance between stem cell division and sloughing activity.
article_processing_charge: No
article_type: original
author:
- first_name: Chun Lin
full_name: Shi, Chun Lin
last_name: Shi
- first_name: Daniel
full_name: Von Wangenheim, Daniel
id: 49E91952-F248-11E8-B48F-1D18A9856A87
last_name: Von Wangenheim
orcid: 0000-0002-6862-1247
- first_name: Ullrich
full_name: Herrmann, Ullrich
last_name: Herrmann
- first_name: Mari
full_name: Wildhagen, Mari
last_name: Wildhagen
- first_name: Ivan
full_name: Kulik, Ivan
id: F0AB3FCE-02D1-11E9-BD0E-99399A5D3DEB
last_name: Kulik
- first_name: Andreas
full_name: Kopf, Andreas
last_name: Kopf
- first_name: Takashi
full_name: Ishida, Takashi
last_name: Ishida
- first_name: Vilde
full_name: Olsson, Vilde
last_name: Olsson
- first_name: Mari Kristine
full_name: Anker, Mari Kristine
last_name: Anker
- first_name: Markus
full_name: Albert, Markus
last_name: Albert
- first_name: Melinka A
full_name: Butenko, Melinka A
last_name: Butenko
- first_name: Georg
full_name: Felix, Georg
last_name: Felix
- first_name: Shinichiro
full_name: Sawa, Shinichiro
last_name: Sawa
- first_name: Manfred
full_name: Claassen, Manfred
last_name: Claassen
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Reidunn B
full_name: Aalen, Reidunn B
last_name: Aalen
citation:
ama: Shi CL, von Wangenheim D, Herrmann U, et al. The dynamics of root cap sloughing
in Arabidopsis is regulated by peptide signalling. Nature Plants. 2018;4(8):596-604.
doi:10.1038/s41477-018-0212-z
apa: Shi, C. L., von Wangenheim, D., Herrmann, U., Wildhagen, M., Kulik, I., Kopf,
A., … Aalen, R. B. (2018). The dynamics of root cap sloughing in Arabidopsis is
regulated by peptide signalling. Nature Plants. Nature Publishing Group.
https://doi.org/10.1038/s41477-018-0212-z
chicago: Shi, Chun Lin, Daniel von Wangenheim, Ullrich Herrmann, Mari Wildhagen,
Ivan Kulik, Andreas Kopf, Takashi Ishida, et al. “The Dynamics of Root Cap Sloughing
in Arabidopsis Is Regulated by Peptide Signalling.” Nature Plants. Nature
Publishing Group, 2018. https://doi.org/10.1038/s41477-018-0212-z.
ieee: C. L. Shi et al., “The dynamics of root cap sloughing in Arabidopsis
is regulated by peptide signalling,” Nature Plants, vol. 4, no. 8. Nature
Publishing Group, pp. 596–604, 2018.
ista: Shi CL, von Wangenheim D, Herrmann U, Wildhagen M, Kulik I, Kopf A, Ishida
T, Olsson V, Anker MK, Albert M, Butenko MA, Felix G, Sawa S, Claassen M, Friml
J, Aalen RB. 2018. The dynamics of root cap sloughing in Arabidopsis is regulated
by peptide signalling. Nature Plants. 4(8), 596–604.
mla: Shi, Chun Lin, et al. “The Dynamics of Root Cap Sloughing in Arabidopsis Is
Regulated by Peptide Signalling.” Nature Plants, vol. 4, no. 8, Nature
Publishing Group, 2018, pp. 596–604, doi:10.1038/s41477-018-0212-z.
short: C.L. Shi, D. von Wangenheim, U. Herrmann, M. Wildhagen, I. Kulik, A. Kopf,
T. Ishida, V. Olsson, M.K. Anker, M. Albert, M.A. Butenko, G. Felix, S. Sawa,
M. Claassen, J. Friml, R.B. Aalen, Nature Plants 4 (2018) 596–604.
date_created: 2018-12-11T11:44:52Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2023-09-19T10:08:45Z
day: '30'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1038/s41477-018-0212-z
external_id:
isi:
- '000443861300016'
pmid:
- '30061750'
file:
- access_level: open_access
checksum: da33101c76ee1b2dc5ab28fd2ccba9d0
content_type: application/pdf
creator: dernst
date_created: 2019-11-18T16:24:07Z
date_updated: 2020-07-14T12:44:56Z
file_id: '7043'
file_name: 2018_NaturePlants_Shi.pdf
file_size: 226829
relation: main_file
file_date_updated: 2020-07-14T12:44:56Z
has_accepted_license: '1'
intvolume: ' 4'
isi: 1
issue: '8'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 596 - 604
pmid: 1
publication: Nature Plants
publication_status: published
publisher: Nature Publishing Group
publist_id: '7777'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/new-process-in-root-development-discovered/
scopus_import: '1'
status: public
title: The dynamics of root cap sloughing in Arabidopsis is regulated by peptide signalling
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 4
year: '2018'
...
---
_id: '147'
abstract:
- lang: eng
text: The trafficking of subcellular cargos in eukaryotic cells crucially depends
on vesicle budding, a process mediated by ARF-GEFs (ADP-ribosylation factor guanine
nucleotide exchange factors). In plants, ARF-GEFs play essential roles in endocytosis,
vacuolar trafficking, recycling, secretion, and polar trafficking. Moreover, they
are important for plant development, mainly through controlling the polar subcellular
localization of PIN-FORMED (PIN) transporters of the plant hormone auxin. Here,
using a chemical genetics screen in Arabidopsis thaliana, we identified Endosidin
4 (ES4), an inhibitor of eukaryotic ARF-GEFs. ES4 acts similarly to and synergistically
with the established ARF-GEF inhibitor Brefeldin A and has broad effects on intracellular
trafficking, including endocytosis, exocytosis, and vacuolar targeting. Additionally,
Arabidopsis and yeast (Sacharomyces cerevisiae) mutants defective in ARF-GEF show
altered sensitivity to ES4. ES4 interferes with the activation-based membrane
association of the ARF1 GTPases, but not of their mutant variants that are activated
independently of ARF-GEF activity. Biochemical approaches and docking simulations
confirmed that ES4 specifically targets the SEC7 domain-containing ARF-GEFs. These
observations collectively identify ES4 as a chemical tool enabling the study of
ARF-GEF-mediated processes, including ARF-GEF-mediated plant development.
acknowledgement: We thank Gerd Jürgens, Sandra Richter, and Sheng Yang He for providing
antibodies; Maciek Adamowski, Fernando Aniento, Sebastian Bednarek, Nico Callewaert,
Matyás Fendrych, Elena Feraru, and Mugurel I. Feraru for helpful suggestions; Siamsa
Doyle for critical reading of the manuscript and helpful comments and suggestions;
and Stephanie Smith and Martine De Cock for help in editing and language corrections.
We acknowledge the core facility Cellular Imaging of CEITEC supported by the Czech-BioImaging
large RI project (LM2015062 funded by MEYS CR) for their support with obtaining
scientific data presented in this article. Plant Sciences Core Facility of CEITEC
Masaryk University is gratefully acknowledged for obtaining part of the scientific
data presented in this article. We acknowledge support from the Fondation pour la
Recherche Médicale and from the Institut National du Cancer (J.C.). The research
leading to these results was funded by the European Research Council under the European
Union's 7th Framework Program (FP7/2007-2013)/ERC grant agreement numbers 282300
and 742985 and the Czech Science Foundation GAČR (GA18-26981S; J.F.); Ministry of
Education, Youth, and Sports/MEYS of the Czech Republic under the Project CEITEC
2020 (LQ1601; T.N.); the China Science Council for a predoctoral fellowship (Q.L.);
a joint research project within the framework of cooperation between the Research
Foundation-Flanders and the Bulgarian Academy of Sciences (VS.025.13N; K.M. and
E.R.); Vetenskapsrådet and Vinnova (Verket för Innovationssystem; S.R.), Knut och
Alice Wallenbergs Stiftelse via “Shapesystem” Grant 2012.0050 (S.R.), Kempe stiftelserna
(P.G.), Tryggers CTS410 (P.G.).
article_processing_charge: No
article_type: original
author:
- first_name: Urszula
full_name: Kania, Urszula
id: 4AE5C486-F248-11E8-B48F-1D18A9856A87
last_name: Kania
- first_name: Tomasz
full_name: Nodzyński, Tomasz
last_name: Nodzyński
- first_name: Qing
full_name: Lu, Qing
last_name: Lu
- first_name: Glenn R
full_name: Hicks, Glenn R
last_name: Hicks
- first_name: Wim
full_name: Nerinckx, Wim
last_name: Nerinckx
- first_name: Kiril
full_name: Mishev, Kiril
last_name: Mishev
- first_name: Francois
full_name: Peurois, Francois
last_name: Peurois
- first_name: Jacqueline
full_name: Cherfils, Jacqueline
last_name: Cherfils
- first_name: Rycke Riet Maria
full_name: De, Rycke Riet Maria
last_name: De
- first_name: Peter
full_name: Grones, Peter
id: 399876EC-F248-11E8-B48F-1D18A9856A87
last_name: Grones
- first_name: Stéphanie
full_name: Robert, Stéphanie
last_name: Robert
- first_name: Eugenia
full_name: Russinova, Eugenia
last_name: Russinova
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Kania U, Nodzyński T, Lu Q, et al. The inhibitor Endosidin 4 targets SEC7 domain-type
ARF GTPase exchange factors and interferes with sub cellular trafficking in eukaryotes.
The Plant Cell. 2018;30(10):2553-2572. doi:10.1105/tpc.18.00127
apa: Kania, U., Nodzyński, T., Lu, Q., Hicks, G. R., Nerinckx, W., Mishev, K., …
Friml, J. (2018). The inhibitor Endosidin 4 targets SEC7 domain-type ARF GTPase
exchange factors and interferes with sub cellular trafficking in eukaryotes. The
Plant Cell. Oxford University Press. https://doi.org/10.1105/tpc.18.00127
chicago: Kania, Urszula, Tomasz Nodzyński, Qing Lu, Glenn R Hicks, Wim Nerinckx,
Kiril Mishev, Francois Peurois, et al. “The Inhibitor Endosidin 4 Targets SEC7
Domain-Type ARF GTPase Exchange Factors and Interferes with Sub Cellular Trafficking
in Eukaryotes.” The Plant Cell. Oxford University Press, 2018. https://doi.org/10.1105/tpc.18.00127.
ieee: U. Kania et al., “The inhibitor Endosidin 4 targets SEC7 domain-type
ARF GTPase exchange factors and interferes with sub cellular trafficking in eukaryotes,”
The Plant Cell, vol. 30, no. 10. Oxford University Press, pp. 2553–2572,
2018.
ista: Kania U, Nodzyński T, Lu Q, Hicks GR, Nerinckx W, Mishev K, Peurois F, Cherfils
J, De RRM, Grones P, Robert S, Russinova E, Friml J. 2018. The inhibitor Endosidin
4 targets SEC7 domain-type ARF GTPase exchange factors and interferes with sub
cellular trafficking in eukaryotes. The Plant Cell. 30(10), 2553–2572.
mla: Kania, Urszula, et al. “The Inhibitor Endosidin 4 Targets SEC7 Domain-Type
ARF GTPase Exchange Factors and Interferes with Sub Cellular Trafficking in Eukaryotes.”
The Plant Cell, vol. 30, no. 10, Oxford University Press, 2018, pp. 2553–72,
doi:10.1105/tpc.18.00127.
short: U. Kania, T. Nodzyński, Q. Lu, G.R. Hicks, W. Nerinckx, K. Mishev, F. Peurois,
J. Cherfils, R.R.M. De, P. Grones, S. Robert, E. Russinova, J. Friml, The Plant
Cell 30 (2018) 2553–2572.
date_created: 2018-12-11T11:44:52Z
date_published: 2018-11-12T00:00:00Z
date_updated: 2025-05-07T11:12:30Z
day: '12'
department:
- _id: JiFr
doi: 10.1105/tpc.18.00127
ec_funded: 1
external_id:
isi:
- '000450000500023'
pmid:
- '30018156'
intvolume: ' 30'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1105/tpc.18.00127
month: '11'
oa: 1
oa_version: Published Version
page: 2553 - 2572
pmid: 1
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: The Plant Cell
publication_identifier:
issn:
- 1040-4651
publication_status: published
publisher: Oxford University Press
publist_id: '7776'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The inhibitor Endosidin 4 targets SEC7 domain-type ARF GTPase exchange factors
and interferes with sub cellular trafficking in eukaryotes
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 30
year: '2018'
...