---
_id: '958'
abstract:
- lang: eng
text: Biosensors that exploit Forster resonance energy transfer (FRET) can be used
to visualize biological and physiological processes and are capable of providing
detailed information in both spatial and temporal dimensions. In a FRET-based
biosensor, substrate binding is associated with a change in the relative positions
of two fluorophores, leading to a change in FRET efficiency that may be observed
in the fluorescence spectrum. As a result, their design requires a ligand-binding
protein that exhibits a conformational change upon binding. However, not all ligand-binding
proteins produce responsive sensors upon conjugation to fluorescent proteins or
dyes, and identifying the optimum locations for the fluorophores often involves
labor-intensive iterative design or high-throughput screening. Combining the genetic
fusion of a fluorescent protein to the ligand-binding protein with site-specific
covalent attachment of a fluorescent dye can allow fine control over the positions
of the two fluorophores, allowing the construction of very sensitive sensors.
This relies upon the accurate prediction of the locations of the two fluorophores
in bound and unbound states. In this chapter, we describe a method for computational
identification of dye-attachment sites that allows the use of cysteine modification
to attach synthetic dyes that can be paired with a fluorescent protein for the
purposes of creating FRET sensors.
alternative_title:
- Methods in Molecular Biology
author:
- first_name: Joshua
full_name: Mitchell, Joshua
last_name: Mitchell
- first_name: William
full_name: Zhang, William
last_name: Zhang
- first_name: Michel
full_name: Herde, Michel
last_name: Herde
- first_name: Christian
full_name: Henneberger, Christian
last_name: Henneberger
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Megan
full_name: O'Mara, Megan
last_name: O'Mara
- first_name: Colin
full_name: Jackson, Colin
last_name: Jackson
citation:
ama: 'Mitchell J, Zhang W, Herde M, et al. Method for developing optical sensors
using a synthetic dye fluorescent protein FRET pair and computational modeling
and assessment. In: Stein V, ed. Synthetic Protein Switches. Vol 1596.
Synthetic Protein Switches. Springer; 2017:89-99. doi:10.1007/978-1-4939-6940-1_6'
apa: Mitchell, J., Zhang, W., Herde, M., Henneberger, C., Janovjak, H. L., O’Mara,
M., & Jackson, C. (2017). Method for developing optical sensors using a synthetic
dye fluorescent protein FRET pair and computational modeling and assessment. In
V. Stein (Ed.), Synthetic Protein Switches (Vol. 1596, pp. 89–99). Springer.
https://doi.org/10.1007/978-1-4939-6940-1_6
chicago: Mitchell, Joshua, William Zhang, Michel Herde, Christian Henneberger, Harald
L Janovjak, Megan O’Mara, and Colin Jackson. “Method for Developing Optical Sensors
Using a Synthetic Dye Fluorescent Protein FRET Pair and Computational Modeling
and Assessment.” In Synthetic Protein Switches, edited by Viktor Stein,
1596:89–99. Synthetic Protein Switches. Springer, 2017. https://doi.org/10.1007/978-1-4939-6940-1_6.
ieee: J. Mitchell et al., “Method for developing optical sensors using a
synthetic dye fluorescent protein FRET pair and computational modeling and assessment,”
in Synthetic Protein Switches, vol. 1596, V. Stein, Ed. Springer, 2017,
pp. 89–99.
ista: 'Mitchell J, Zhang W, Herde M, Henneberger C, Janovjak HL, O’Mara M, Jackson
C. 2017.Method for developing optical sensors using a synthetic dye fluorescent
protein FRET pair and computational modeling and assessment. In: Synthetic Protein
Switches. Methods in Molecular Biology, vol. 1596, 89–99.'
mla: Mitchell, Joshua, et al. “Method for Developing Optical Sensors Using a Synthetic
Dye Fluorescent Protein FRET Pair and Computational Modeling and Assessment.”
Synthetic Protein Switches, edited by Viktor Stein, vol. 1596, Springer,
2017, pp. 89–99, doi:10.1007/978-1-4939-6940-1_6.
short: J. Mitchell, W. Zhang, M. Herde, C. Henneberger, H.L. Janovjak, M. O’Mara,
C. Jackson, in:, V. Stein (Ed.), Synthetic Protein Switches, Springer, 2017, pp.
89–99.
date_created: 2018-12-11T11:49:24Z
date_published: 2017-05-15T00:00:00Z
date_updated: 2021-01-12T08:22:13Z
day: '15'
department:
- _id: HaJa
doi: 10.1007/978-1-4939-6940-1_6
editor:
- first_name: Viktor
full_name: Stein, Viktor
last_name: Stein
intvolume: ' 1596'
language:
- iso: eng
month: '05'
oa_version: None
page: 89 - 99
publication: Synthetic Protein Switches
publication_identifier:
issn:
- '10643745'
publication_status: published
publisher: Springer
publist_id: '6450'
quality_controlled: '1'
scopus_import: 1
series_title: Synthetic Protein Switches
status: public
title: Method for developing optical sensors using a synthetic dye fluorescent protein
FRET pair and computational modeling and assessment
type: book_chapter
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 1596
year: '2017'
...
---
_id: '9707'
abstract:
- lang: eng
text: Branching morphogenesis of the epithelial ureteric bud forms the renal collecting
duct system and is critical for normal nephron number, while low nephron number
is implicated in hypertension and renal disease. Ureteric bud growth and branching
requires GDNF signaling from the surrounding mesenchyme to cells at the ureteric
bud tips, via the Ret receptor tyrosine kinase and coreceptor Gfrα1; Ret signaling
up-regulates transcription factors Etv4 and Etv5, which are also critical for
branching. Despite extensive knowledge of the genetic control of these events,
it is not understood, at the cellular level, how renal branching morphogenesis
is achieved or how Ret signaling influences epithelial cell behaviors to promote
this process. Analysis of chimeric embryos previously suggested a role for Ret
signaling in promoting cell rearrangements in the nephric duct, but this method
was unsuited to study individual cell behaviors during ureteric bud branching.
Here, we use Mosaic Analysis with Double Markers (MADM), combined with organ culture
and time-lapse imaging, to trace the movements and divisions of individual ureteric
bud tip cells. We first examine wild-type clones and then Ret or Etv4 mutant/wild-type
clones in which the mutant and wild-type sister cells are differentially and heritably
marked by green and red fluorescent proteins. We find that, in normal kidneys,
most individual tip cells behave as self-renewing progenitors, some of whose progeny
remain at the tips while others populate the growing UB trunks. In Ret or Etv4
MADM clones, the wild-type cells generated at a UB tip are much more likely to
remain at, or move to, the new tips during branching and elongation, while their
Ret−/− or Etv4−/− sister cells tend to lag behind and contribute only to the trunks.
By tracking successive mitoses in a cell lineage, we find that Ret signaling has
little effect on proliferation, in contrast to its effects on cell movement. Our
results show that Ret/Etv4 signaling promotes directed cell movements in the ureteric
bud tips, and suggest a model in which these cell movements mediate branching
morphogenesis.
article_processing_charge: No
author:
- first_name: Paul
full_name: Riccio, Paul
last_name: Riccio
- first_name: Christina
full_name: Cebrián, Christina
last_name: Cebrián
- first_name: Hui
full_name: Zong, Hui
last_name: Zong
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Frank
full_name: Costantini, Frank
last_name: Costantini
citation:
ama: 'Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. Data from: Ret and
Etv4 promote directed movements of progenitor cells during renal branching morphogenesis.
2017. doi:10.5061/dryad.pk16b'
apa: 'Riccio, P., Cebrián, C., Zong, H., Hippenmeyer, S., & Costantini, F. (2017).
Data from: Ret and Etv4 promote directed movements of progenitor cells during
renal branching morphogenesis. Dryad. https://doi.org/10.5061/dryad.pk16b'
chicago: 'Riccio, Paul, Christina Cebrián, Hui Zong, Simon Hippenmeyer, and Frank
Costantini. “Data from: Ret and Etv4 Promote Directed Movements of Progenitor
Cells during Renal Branching Morphogenesis.” Dryad, 2017. https://doi.org/10.5061/dryad.pk16b.'
ieee: 'P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, and F. Costantini, “Data
from: Ret and Etv4 promote directed movements of progenitor cells during renal
branching morphogenesis.” Dryad, 2017.'
ista: 'Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. 2017. Data from:
Ret and Etv4 promote directed movements of progenitor cells during renal branching
morphogenesis, Dryad, 10.5061/dryad.pk16b.'
mla: 'Riccio, Paul, et al. Data from: Ret and Etv4 Promote Directed Movements
of Progenitor Cells during Renal Branching Morphogenesis. Dryad, 2017, doi:10.5061/dryad.pk16b.'
short: P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, F. Costantini, (2017).
date_created: 2021-07-23T09:39:34Z
date_published: 2017-01-14T00:00:00Z
date_updated: 2022-08-25T13:34:55Z
day: '14'
department:
- _id: SiHi
doi: 10.5061/dryad.pk16b
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.pk16b
month: '01'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '9702'
relation: used_in_publication
status: deleted
status: public
title: 'Data from: Ret and Etv4 promote directed movements of progenitor cells during
renal branching morphogenesis'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '9844'
article_processing_charge: No
author:
- first_name: Nela
full_name: Nikolic, Nela
id: 42D9CABC-F248-11E8-B48F-1D18A9856A87
last_name: Nikolic
orcid: 0000-0001-9068-6090
- first_name: Frank
full_name: Schreiber, Frank
last_name: Schreiber
- first_name: Alma
full_name: Dal Co, Alma
last_name: Dal Co
- first_name: Daniel
full_name: Kiviet, Daniel
last_name: Kiviet
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Sten
full_name: Littmann, Sten
last_name: Littmann
- first_name: Marcel
full_name: Kuypers, Marcel
last_name: Kuypers
- first_name: Martin
full_name: Ackermann, Martin
last_name: Ackermann
citation:
ama: Nikolic N, Schreiber F, Dal Co A, et al. Source data for figures and tables.
2017. doi:10.1371/journal.pgen.1007122.s018
apa: Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann,
S., … Ackermann, M. (2017). Source data for figures and tables. Public Library
of Science. https://doi.org/10.1371/journal.pgen.1007122.s018
chicago: Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller,
Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Source Data for Figures
and Tables.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pgen.1007122.s018.
ieee: N. Nikolic et al., “Source data for figures and tables.” Public Library
of Science, 2017.
ista: Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers
M, Ackermann M. 2017. Source data for figures and tables, Public Library of Science,
10.1371/journal.pgen.1007122.s018.
mla: Nikolic, Nela, et al. Source Data for Figures and Tables. Public Library
of Science, 2017, doi:10.1371/journal.pgen.1007122.s018.
short: N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann,
M. Kuypers, M. Ackermann, (2017).
date_created: 2021-08-09T13:27:16Z
date_published: 2017-12-18T00:00:00Z
date_updated: 2023-02-23T12:25:04Z
day: '18'
department:
- _id: CaGu
doi: 10.1371/journal.pgen.1007122.s018
month: '12'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '541'
relation: used_in_publication
status: public
status: public
title: Source data for figures and tables
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '12905'
article_processing_charge: No
author:
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Janos
full_name: Kiss, Janos
id: 3D3A06F8-F248-11E8-B48F-1D18A9856A87
last_name: Kiss
citation:
ama: 'Schlögl A, Kiss J. Scientific Computing at IST Austria. In: AHPC17 – Austrian
HPC Meeting 2017. FSP Scientific Computing; 2017:28.'
apa: 'Schlögl, A., & Kiss, J. (2017). Scientific Computing at IST Austria. In
AHPC17 – Austrian HPC Meeting 2017 (p. 28). Grundlsee, Austria: FSP Scientific
Computing.'
chicago: Schlögl, Alois, and Janos Kiss. “Scientific Computing at IST Austria.”
In AHPC17 – Austrian HPC Meeting 2017, 28. FSP Scientific Computing, 2017.
ieee: A. Schlögl and J. Kiss, “Scientific Computing at IST Austria,” in AHPC17
– Austrian HPC Meeting 2017, Grundlsee, Austria, 2017, p. 28.
ista: 'Schlögl A, Kiss J. 2017. Scientific Computing at IST Austria. AHPC17 – Austrian
HPC Meeting 2017. AHPC: Austrian HPC Meeting, 28.'
mla: Schlögl, Alois, and Janos Kiss. “Scientific Computing at IST Austria.” AHPC17
– Austrian HPC Meeting 2017, FSP Scientific Computing, 2017, p. 28.
short: A. Schlögl, J. Kiss, in:, AHPC17 – Austrian HPC Meeting 2017, FSP Scientific
Computing, 2017, p. 28.
conference:
end_date: 2017-03-03
location: Grundlsee, Austria
name: 'AHPC: Austrian HPC Meeting'
start_date: 2017-03-01
date_created: 2023-05-05T12:58:53Z
date_published: 2017-03-03T00:00:00Z
date_updated: 2023-05-16T07:22:23Z
day: '03'
ddc:
- '000'
department:
- _id: ScienComp
file:
- access_level: open_access
checksum: 7bcc499479d4f4c5ce6c0071c24ca6c6
content_type: application/pdf
creator: dernst
date_created: 2023-05-16T07:20:50Z
date_updated: 2023-05-16T07:20:50Z
file_id: '12969'
file_name: 2017_AHPC_Schloegl.pdf
file_size: 1005486
relation: main_file
success: 1
file_date_updated: 2023-05-16T07:20:50Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ahpc17/BOOKLET_AHPC17.pdf
month: '03'
oa: 1
oa_version: Published Version
page: '28'
publication: AHPC17 – Austrian HPC Meeting 2017
publication_status: published
publisher: FSP Scientific Computing
status: public
title: Scientific Computing at IST Austria
type: conference_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '13160'
abstract:
- lang: eng
text: "Transforming deterministic ω\r\n-automata into deterministic parity automata
is traditionally done using variants of appearance records. We present a more
efficient variant of this approach, tailored to Rabin automata, and several optimizations
applicable to all appearance records. We compare the methods experimentally and
find out that our method produces smaller automata than previous approaches. Moreover,
the experiments demonstrate the potential of our method for LTL synthesis, using
LTL-to-Rabin translators. It leads to significantly smaller parity automata when
compared to state-of-the-art approaches on complex formulae."
acknowledgement: This work is partially funded by the DFG project “Verified Model
Checkers” and by the Czech Science Foundation, grant No. P202/12/G061.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Clara
full_name: Waldmann, Clara
last_name: Waldmann
- first_name: Maximilian
full_name: Weininger, Maximilian
last_name: Weininger
citation:
ama: 'Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record
for transforming Rabin automata into parity automata. In: Tools and Algorithms
for the Construction and Analysis of Systems. Vol 10205. Springer; 2017:443-460.
doi:10.1007/978-3-662-54577-5_26'
apa: 'Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2017).
Index appearance record for transforming Rabin automata into parity automata.
In Tools and Algorithms for the Construction and Analysis of Systems (Vol.
10205, pp. 443–460). Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_26'
chicago: Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger.
“Index Appearance Record for Transforming Rabin Automata into Parity Automata.”
In Tools and Algorithms for the Construction and Analysis of Systems, 10205:443–60.
Springer, 2017. https://doi.org/10.1007/978-3-662-54577-5_26.
ieee: J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance
record for transforming Rabin automata into parity automata,” in Tools and
Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden,
2017, vol. 10205, pp. 443–460.
ista: 'Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2017. Index appearance
record for transforming Rabin automata into parity automata. Tools and Algorithms
for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for
the Construction and Analysis of Systems, LNCS, vol. 10205, 443–460.'
mla: Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata
into Parity Automata.” Tools and Algorithms for the Construction and Analysis
of Systems, vol. 10205, Springer, 2017, pp. 443–60, doi:10.1007/978-3-662-54577-5_26.
short: J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, in:, Tools and
Algorithms for the Construction and Analysis of Systems, Springer, 2017, pp. 443–460.
conference:
end_date: 2017-04-29
location: Uppsala, Sweden
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2017-04-22
date_created: 2023-06-21T13:21:14Z
date_published: 2017-03-31T00:00:00Z
date_updated: 2023-06-21T13:29:46Z
day: '31'
department:
- _id: KrCh
doi: 10.1007/978-3-662-54577-5_26
external_id:
arxiv:
- '1701.05738'
intvolume: ' 10205'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1701.05738
month: '03'
oa: 1
oa_version: Preprint
page: 443-460
publication: Tools and Algorithms for the Construction and Analysis of Systems
publication_identifier:
eisbn:
- '9783662545775'
eissn:
- 1611-3349
isbn:
- '9783662545768'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
status: public
title: Index appearance record for transforming Rabin automata into parity automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10205
year: '2017'
...
---
_id: '950'
abstract:
- lang: eng
text: "Two-player games on graphs are widely studied in formal methods as they model
the interaction between a system and its environment. The game is played by moving
a token throughout a graph to produce an infinite path. There are several common
modes to determine how the players move the token through the graph; e.g., in
turn-based games the players alternate turns in moving the token. We study the
bidding mode of moving the token, which, to the best of our knowledge, has never
been studied in infinite-duration games. Both players have separate budgets, which
sum up to $1$. In each turn, a bidding takes place. Both players submit bids simultaneously,
and a bid is legal if it does not exceed the available budget. The winner of the
bidding pays his bid to the other player and moves the token. For reachability
objectives, repeated bidding games have been studied and are called Richman games.
There, a central question is the existence and computation of threshold budgets;
namely, a value t\\in [0,1] such that if\\PO's budget exceeds $t$, he can win
the game, and if\\PT's budget exceeds 1-t, he can win the game. We focus on parity
games and mean-payoff games. We show the existence of threshold budgets in these
games, and reduce the problem of finding them to Richman games. We also determine
the strategy-complexity of an optimal strategy. Our most interesting result shows
that memoryless strategies suffice for mean-payoff bidding games. \r\n"
alternative_title:
- LIPIcs
article_number: '17'
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- 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: Ventsislav K
full_name: Chonev, Ventsislav K
id: 36CBE2E6-F248-11E8-B48F-1D18A9856A87
last_name: Chonev
citation:
ama: 'Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. In: Vol
85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.CONCUR.2017.21'
apa: 'Avni, G., Henzinger, T. A., & Chonev, V. K. (2017). Infinite-duration
bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin,
Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21'
chicago: Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration
Bidding Games,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
https://doi.org/10.4230/LIPIcs.CONCUR.2017.21.
ieee: 'G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,”
presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.'
ista: 'Avni G, Henzinger TA, Chonev VK. 2017. Infinite-duration bidding games. CONCUR:
Concurrency Theory, LIPIcs, vol. 85, 17.'
mla: Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, 17, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.21.
short: G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2017.
conference:
end_date: 2017-09-07
location: Berlin, Germany
name: 'CONCUR: Concurrency Theory'
start_date: 2017-09-05
date_created: 2018-12-11T11:49:22Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-08-29T07:02:13Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4230/LIPIcs.CONCUR.2017.21
external_id:
arxiv:
- '1705.01433'
file:
- access_level: open_access
checksum: 6d5cccf755207b91ccbef95d8275b013
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:00Z
date_updated: 2020-07-14T12:48:16Z
file_id: '5318'
file_name: IST-2017-844-v1+1_concur-cr.pdf
file_size: 335170
relation: main_file
file_date_updated: 2020-07-14T12:48:16Z
has_accepted_license: '1'
intvolume: ' 85'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
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_identifier:
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6466'
pubrep_id: '844'
quality_controlled: '1'
related_material:
record:
- id: '6752'
relation: later_version
status: public
scopus_import: 1
status: public
title: Infinite-duration bidding games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 85
year: '2017'
...
---
_id: '683'
abstract:
- lang: eng
text: 'Given a triangulation of a point set in the plane, a flip deletes an edge
e whose removal leaves a convex quadrilateral, and replaces e by the opposite
diagonal of the quadrilateral. It is well known that any triangulation of a point
set can be reconfigured to any other triangulation by some sequence of flips.
We explore this question in the setting where each edge of a triangulation has
a label, and a flip transfers the label of the removed edge to the new edge. It
is not true that every labelled triangulation of a point set can be reconfigured
to every other labelled triangulation via a sequence of flips, but we characterize
when this is possible. There is an obvious necessary condition: for each label
l, if edge e has label l in the first triangulation and edge f has label l in
the second triangulation, then there must be some sequence of flips that moves
label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot
formulated the Orbit Conjecture, which states that this necessary condition is
also sufficient, i.e. that all labels can be simultaneously mapped to their destination
if and only if each label individually can be mapped to its destination. We prove
this conjecture. Furthermore, we give a polynomial-time algorithm to find a sequence
of flips to reconfigure one labelled triangulation to another, if such a sequence
exists, and we prove an upper bound of O(n7) on the length of the flip sequence.
Our proof uses the topological result that the sets of pairwise non-crossing edges
on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional
ball (this follows from a result of Orden and Santos; we give a different proof
based on a shelling argument). The dual cell complex of this simplicial ball,
called the flip complex, has the usual flip graph as its 1-skeleton. We use properties
of the 2-skeleton of the flip complex to prove the Orbit Conjecture.'
alternative_title:
- LIPIcs
article_number: '49'
author:
- first_name: Anna
full_name: Lubiw, Anna
last_name: Lubiw
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping
edge labelled triangulations. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2017. doi:10.4230/LIPIcs.SoCG.2017.49'
apa: 'Lubiw, A., Masárová, Z., & Wagner, U. (2017). A proof of the orbit conjecture
for flipping edge labelled triangulations (Vol. 77). Presented at the SoCG: Symposium
on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2017.49'
chicago: Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture
for Flipping Edge Labelled Triangulations,” Vol. 77. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2017. https://doi.org/10.4230/LIPIcs.SoCG.2017.49.
ieee: 'A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for
flipping edge labelled triangulations,” presented at the SoCG: Symposium on Computational
Geometry, Brisbane, Australia, 2017, vol. 77.'
ista: 'Lubiw A, Masárová Z, Wagner U. 2017. A proof of the orbit conjecture for
flipping edge labelled triangulations. SoCG: Symposium on Computational Geometry,
LIPIcs, vol. 77, 49.'
mla: Lubiw, Anna, et al. A Proof of the Orbit Conjecture for Flipping Edge Labelled
Triangulations. Vol. 77, 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017, doi:10.4230/LIPIcs.SoCG.2017.49.
short: A. Lubiw, Z. Masárová, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2017.
conference:
end_date: 2017-07-07
location: Brisbane, Australia
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2017-07-04
date_created: 2018-12-11T11:47:54Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-09-05T15:01:43Z
day: '01'
ddc:
- '514'
- '516'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2017.49
file:
- access_level: open_access
checksum: 24fdde981cc513352a78dcf9b0660ae9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:12Z
date_updated: 2020-07-14T12:47:41Z
file_id: '5265'
file_name: IST-2017-896-v1+1_LIPIcs-SoCG-2017-49.pdf
file_size: 710007
relation: main_file
file_date_updated: 2020-07-14T12:47:41Z
has_accepted_license: '1'
intvolume: ' 77'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7033'
pubrep_id: '896'
quality_controlled: '1'
related_material:
record:
- id: '5986'
relation: later_version
status: public
scopus_import: 1
status: public
title: A proof of the orbit conjecture for flipping edge labelled triangulations
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2017'
...
---
_id: '1155'
abstract:
- lang: eng
text: This dissertation concerns the automatic verification of probabilistic systems
and programs with arrays by statistical and logical methods. Although statistical
and logical methods are different in nature, we show that they can be successfully
combined for system analysis. In the first part of the dissertation we present
a new statistical algorithm for the verification of probabilistic systems with
respect to unbounded properties, including linear temporal logic. Our algorithm
often performs faster than the previous approaches, and at the same time requires
less information about the system. In addition, our method can be generalized
to unbounded quantitative properties such as mean-payoff bounds. In the second
part, we introduce two techniques for comparing probabilistic systems. Probabilistic
systems are typically compared using the notion of equivalence, which requires
the systems to have the equal probability of all behaviors. However, this notion
is often too strict, since probabilities are typically only empirically estimated,
and any imprecision may break the relation between processes. On the one hand,
we propose to replace the Boolean notion of equivalence by a quantitative distance
of similarity. For this purpose, we introduce a statistical framework for estimating
distances between Markov chains based on their simulation runs, and we investigate
which distances can be approximated in our framework. On the other hand, we propose
to compare systems with respect to a new qualitative logic, which expresses that
behaviors occur with probability one or a positive probability. This qualitative
analysis is robust with respect to modeling errors and applicable to many domains.
In the last part, we present a new quantifier-free logic for integer arrays, which
allows us to express counting. Counting properties are prevalent in array-manipulating
programs, however they cannot be expressed in the quantified fragments of the
theory of arrays. We present a decision procedure for our logic, and provide several
complexity results.
acknowledgement: ' First of all, I want to thank my advisor, prof. Thomas A. Henzinger,
for his guidance during my PhD program. I am grateful for the freedom I was given
to pursue my research interests, and his continuous support. Working with prof.
Henzinger was a truly inspiring experience and taught me what it means to be a scientist.
I want to express my gratitude to my collaborators: Nikola Beneš, Krishnendu Chatterjee,
Martin Chmelík, Ashutosh Gupta, Willibald Krenn, Jan Kˇretínský, Dejan Nickovic,
Andrey Kupriyanov, and Tatjana Petrov. I have learned a great deal from my collaborators,
and without their help this thesis would not be possible. In addition, I want to
thank the members of my thesis committee: Dirk Beyer, Dejan Nickovic, and Georg
Weissenbacher for their advice and reviewing this dissertation. I would especially
like to acknowledge the late Helmut Veith, who was a member of my committee. I will
remember Helmut for his kindness, enthusiasm, and wit, as well as for being an inspiring
scientist. Finally, I would like to thank my colleagues for making my stay at IST
such a pleasant experience: Guy Avni, Sergiy Bogomolov, Ventsislav Chonev, Rasmus
Ibsen-Jensen, Mirco Giacobbe, Bernhard Kragl, Hui Kong, Petr Novotný, Jan Otop,
Andreas Pavlogiannis, Tantjana Petrov, Arjun Radhakrishna, Jakob Ruess, Thorsten
Tarrach, as well as other members of groups Henzinger and Chatterjee. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
citation:
ama: Daca P. Statistical and logical methods for property checking. 2017. doi:10.15479/AT:ISTA:TH_730
apa: Daca, P. (2017). Statistical and logical methods for property checking.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_730
chicago: Daca, Przemyslaw. “Statistical and Logical Methods for Property Checking.”
Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:TH_730.
ieee: P. Daca, “Statistical and logical methods for property checking,” Institute
of Science and Technology Austria, 2017.
ista: Daca P. 2017. Statistical and logical methods for property checking. Institute
of Science and Technology Austria.
mla: Daca, Przemyslaw. Statistical and Logical Methods for Property Checking.
Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:TH_730.
short: P. Daca, Statistical and Logical Methods for Property Checking, Institute
of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:50:27Z
date_published: 2017-01-02T00:00:00Z
date_updated: 2023-09-07T11:58:34Z
day: '02'
ddc:
- '004'
- '005'
degree_awarded: PhD
department:
- _id: ToHe
doi: 10.15479/AT:ISTA:TH_730
ec_funded: 1
file:
- access_level: open_access
checksum: 1406a681cb737508234fde34766be2c2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:26Z
date_updated: 2020-07-14T12:44:34Z
file_id: '4880'
file_name: IST-2017-730-v1+1_Statistical_and_Logical_Methods_for_Property_Checking.pdf
file_size: 1028586
relation: main_file
file_date_updated: 2020-07-14T12:44:34Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '163'
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6203'
pubrep_id: '730'
related_material:
record:
- id: '1093'
relation: part_of_dissertation
status: public
- id: '1230'
relation: part_of_dissertation
status: public
- id: '1234'
relation: part_of_dissertation
status: public
- id: '1391'
relation: part_of_dissertation
status: public
- id: '1501'
relation: part_of_dissertation
status: public
- id: '1502'
relation: part_of_dissertation
status: public
- id: '2063'
relation: part_of_dissertation
status: public
- id: '2167'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
title: Statistical and logical methods for property checking
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '6291'
abstract:
- lang: eng
text: Bacteria and their pathogens – phages – are the most abundant living entities
on Earth. Throughout their coevolution, bacteria have evolved multiple immune
systems to overcome the ubiquitous threat from the phages. Although the molecu-
lar details of these immune systems’ functions are relatively well understood,
their epidemiological consequences for the phage-bacterial communities have been
largely neglected. In this thesis we employed both experimental and theoretical
methods to explore whether herd and social immunity may arise in bacterial popu-
lations. Using our experimental system consisting of Escherichia coli strains
with a CRISPR based immunity to the T7 phage we show that herd immunity arises
in phage-bacterial communities and that it is accentuated when the populations
are spatially structured. By fitting a mathematical model, we inferred expressions
for the herd immunity threshold and the velocity of spread of a phage epidemic
in partially resistant bacterial populations, which both depend on the bacterial
growth rate, phage burst size and phage latent period. We also investigated the
poten- tial for social immunity in Streptococcus thermophilus and its phage 2972
using a bioinformatic analysis of potentially coding short open reading frames
with a signalling signature, encoded within the CRISPR associated genes. Subsequently,
we tested one identified potentially signalling peptide and found that its addition
to a phage-challenged culture increases probability of survival of bacteria two
fold, although the results were only marginally significant. Together, these results
demonstrate that the ubiquitous arms races between bacteria and phages have further
consequences at the level of the population.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Pavel
full_name: Payne, Pavel
id: 35F78294-F248-11E8-B48F-1D18A9856A87
last_name: Payne
orcid: 0000-0002-2711-9453
citation:
ama: Payne P. Bacterial herd and social immunity to phages. 2017.
apa: Payne, P. (2017). Bacterial herd and social immunity to phages. Institute
of Science and Technology Austria.
chicago: Payne, Pavel. “Bacterial Herd and Social Immunity to Phages.” Institute
of Science and Technology Austria, 2017.
ieee: P. Payne, “Bacterial herd and social immunity to phages,” Institute of Science
and Technology Austria, 2017.
ista: Payne P. 2017. Bacterial herd and social immunity to phages. Institute of
Science and Technology Austria.
mla: Payne, Pavel. Bacterial Herd and Social Immunity to Phages. Institute
of Science and Technology Austria, 2017.
short: P. Payne, Bacterial Herd and Social Immunity to Phages, Institute of Science
and Technology Austria, 2017.
date_created: 2019-04-09T15:16:45Z
date_published: 2017-02-01T00:00:00Z
date_updated: 2023-09-07T12:00:00Z
day: '01'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: NiBa
- _id: JoBo
file:
- access_level: closed
checksum: a0fc5c26a89c0ea759947ffba87d0d8f
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T15:15:32Z
date_updated: 2020-07-14T12:47:27Z
file_id: '6292'
file_name: thesis_pavel_payne_final_w_signature_page.pdf
file_size: 3025175
relation: main_file
- access_level: open_access
checksum: af531e921a7f64a9e0af4cd8783b2226
content_type: application/pdf
creator: dernst
date_created: 2021-02-22T13:45:59Z
date_updated: 2021-02-22T13:45:59Z
file_id: '9187'
file_name: 2017_Payne_Thesis.pdf
file_size: 3111536
relation: main_file
success: 1
file_date_updated: 2021-02-22T13:45:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '83'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
title: Bacterial herd and social immunity to phages
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '561'
abstract:
- lang: eng
text: Restriction–modification systems are widespread genetic elements that protect
bacteria from bacteriophage infections by recognizing and cleaving heterologous
DNA at short, well-defined sequences called restriction sites. Bioinformatic evidence
shows that restriction sites are significantly underrepresented in bacteriophage
genomes, presumably because bacteriophages with fewer restriction sites are more
likely to escape cleavage by restriction–modification systems. However, how mutations
in restriction sites affect the likelihood of bacteriophage escape is unknown.
Using the bacteriophage l and the restriction–modification system EcoRI, we show
that while mutation effects at different restriction sites are unequal, they are
independent. As a result, the probability of bacteriophage escape increases with
each mutated restriction site. Our results experimentally support the role of
restriction site avoidance as a response to selection imposed by restriction–modification
systems and offer an insight into the events underlying the process of bacteriophage
escape.
acknowledgement: This work was funded by an HFSP Young Investigators' grant RGY0079/2011
(C.C.G.). M.P. is a recipient of a DOC Fellowship of the Austrian Academy of Science
at the Institute of Science and Technology Austria.
article_number: '20170646'
article_processing_charge: No
article_type: original
author:
- first_name: Maros
full_name: Pleska, Maros
id: 4569785E-F248-11E8-B48F-1D18A9856A87
last_name: Pleska
orcid: 0000-0001-7460-7479
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Pleska M, Guet CC. Effects of mutations in phage restriction sites during escape
from restriction–modification. Biology Letters. 2017;13(12). doi:10.1098/rsbl.2017.0646
apa: Pleska, M., & Guet, C. C. (2017). Effects of mutations in phage restriction
sites during escape from restriction–modification. Biology Letters. The
Royal Society. https://doi.org/10.1098/rsbl.2017.0646
chicago: Pleska, Maros, and Calin C Guet. “Effects of Mutations in Phage Restriction
Sites during Escape from Restriction–Modification.” Biology Letters. The
Royal Society, 2017. https://doi.org/10.1098/rsbl.2017.0646.
ieee: M. Pleska and C. C. Guet, “Effects of mutations in phage restriction sites
during escape from restriction–modification,” Biology Letters, vol. 13,
no. 12. The Royal Society, 2017.
ista: Pleska M, Guet CC. 2017. Effects of mutations in phage restriction sites during
escape from restriction–modification. Biology Letters. 13(12), 20170646.
mla: Pleska, Maros, and Calin C. Guet. “Effects of Mutations in Phage Restriction
Sites during Escape from Restriction–Modification.” Biology Letters, vol.
13, no. 12, 20170646, The Royal Society, 2017, doi:10.1098/rsbl.2017.0646.
short: M. Pleska, C.C. Guet, Biology Letters 13 (2017).
date_created: 2018-12-11T11:47:11Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2023-09-07T11:59:32Z
day: '01'
department:
- _id: CaGu
doi: 10.1098/rsbl.2017.0646
external_id:
pmid:
- '29237814'
intvolume: ' 13'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1098/rsbl.2017.0646
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 251BCBEC-B435-11E9-9278-68D0E5697425
grant_number: RGY0079/2011
name: Multi-Level Conflicts in Evolutionary Dynamics of Restriction-Modification
Systems (HFSP Young investigators' grant)
- _id: 251D65D8-B435-11E9-9278-68D0E5697425
grant_number: '24210'
name: Effects of Stochasticity on the Function of Restriction-Modi cation Systems
at the Single-Cell Level (DOC Fellowship)
publication: Biology Letters
publication_identifier:
issn:
- 1744-9561
publication_status: published
publisher: The Royal Society
publist_id: '7253'
quality_controlled: '1'
related_material:
record:
- id: '9847'
relation: research_data
status: public
- id: '202'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Effects of mutations in phage restriction sites during escape from restriction–modification
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2017'
...
---
_id: '818'
abstract:
- lang: eng
text: 'Antibiotics have diverse effects on bacteria, including massive changes in
bacterial gene expression. Whereas the gene expression changes under many antibiotics
have been measured, the temporal organization of these responses and their dependence
on the bacterial growth rate are unclear. As described in Chapter 1, we quantified
the temporal gene expression changes in the bacterium Escherichia coli in response
to the sudden exposure to antibiotics using a fluorescent reporter library and
a robotic system. Our data show temporally structured gene expression responses,
with response times for individual genes ranging from tens of minutes to several
hours. We observed that many stress response genes were activated in response
to antibiotics. As certain stress responses cross-protect bacteria from other
stressors, we then asked whether cellular responses to antibiotics have a similar
protective role in Chapter 2. Indeed, we found that the trimethoprim-induced acid
stress response protects bacteria from subsequent acid stress. We combined microfluidics
with time-lapse imaging to monitor survival, intracellular pH, and acid stress
response in single cells. This approach revealed that the variable expression
of the acid resistance operon gadBC strongly correlates with single-cell survival
time. Cells with higher gadBC expression following trimethoprim maintain higher
intracellular pH and survive the acid stress longer. Overall, we provide a way
to identify single-cell cross-protection between antibiotics and environmental
stressors from temporal gene expression data, and show how antibiotics can increase
bacterial fitness in changing environments. While gene expression changes to antibiotics
show a clear temporal structure at the population-level, it is unclear whether
this clear temporal order is followed by every single cell. Using dual-reporter
strains described in Chapter 3, we measured gene expression dynamics of promoter
pairs in the same cells using microfluidics and microscopy. Chapter 4 shows that
the oxidative stress response and the DNA stress response showed little timing
variability and a clear temporal order under the antibiotic nitrofurantoin. In
contrast, the acid stress response under trimethoprim ran independently from all
other activated response programs including the DNA stress response, which showed
particularly high timing variability in this stress condition. In summary, this
approach provides insight into the temporal organization of gene expression programs
at the single-cell level and suggests dependencies between response programs and
the underlying variability-introducing mechanisms. Altogether, this work advances
our understanding of the diverse effects that antibiotics have on bacteria. These
results were obtained by taking into account gene expression dynamics, which allowed
us to identify general principles, molecular mechanisms, and dependencies between
genes. Our findings may have implications for infectious disease treatments, and
microbial communities in the human body and in nature. '
acknowledgement: 'First of all, I would like to express great gratitude to my PhD
supervisor Tobias Bollenbach. Through his open and trusting attitude I had the freedom
to explore different scientific directions during this project, and follow the research
lines of my interest. I am thankful for constructive and often extensive discussions
and his support and commitment during the different stages of my PhD. I want to
thank my committee members, Călin Guet, Terry Hwa and Nassos Typas for their interest
and their valuable input to this project. Special thanks to Nassos for career guidance,
and for accepting me in his lab. A big thank you goes to the past, present and affiliated
members of the Bollenbach group: Guillaume Chevereau, Marjon de Vos, Marta Lukačišinová,
Veronika Bierbaum, Qi Qin, Marcin Zagórski, Martin Lukačišin, Andreas Angermayr,
Bor Kavčič, Julia Tischler, Dilay Ayhan, Jaroslav Ferenc, and Georg Rieckh. I enjoyed
working and discussing with you very much and I will miss our lengthy group meetings,
our inspiring journal clubs, and our common lunches. Special thanks to Bor for great
mental and professional support during the hard months of thesis writing, and to
Marta for very creative times during the beginning of our PhDs. May the ‘Bacterial
Survival Guide’ decorate the walls of IST forever! A great thanks to my friend and
collaborator Georg Rieckh for his enthusiasm and for getting so involved in these
projects, for his endurance and for his company throughout the years. Thanks to
the FriSBi crowd at IST Austria for interesting meetings and discussions. In particular
I want to thank Magdalena Steinrück, and Anna Andersson for inspiring exchange,
and enjoyable time together. Thanks to everybody who contributed to the cover for
Cell Systems: The constructive input from Tobias Bollenbach, Bor Kavčič, Georg Rieckh,
Marta Lukačišinová, and Sebastian Nozzi, and the professional implementation by
the graphic designer Martina Markus from the University of Cologne. Thanks to all
my office mates in the first floor Bertalanffy building throughout the years: for
ensuring a pleasant working atmosphere, and for your company! In general, I want
to thank all the people that make IST such a great environment, with the many possibilities
to shape our own social and research environment. I want to thank my family for
all kind of practical support during the years, and my second family in Argentina
for their enthusiasm. Thanks to my brother Bernhard and my sister Martina for being
great siblings, and to Helena and Valentin for the joy you brought to my life. My
deep gratitude goes to Sebastian Nozzi, for constant support, patience, love and
for believing in me. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Karin
full_name: Mitosch, Karin
id: 39B66846-F248-11E8-B48F-1D18A9856A87
last_name: Mitosch
citation:
ama: Mitosch K. Timing, variability and cross-protection in bacteria – insights
from dynamic gene expression responses to antibiotics. 2017. doi:10.15479/AT:ISTA:th_862
apa: Mitosch, K. (2017). Timing, variability and cross-protection in bacteria
– insights from dynamic gene expression responses to antibiotics. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_862
chicago: Mitosch, Karin. “Timing, Variability and Cross-Protection in Bacteria –
Insights from Dynamic Gene Expression Responses to Antibiotics.” Institute of
Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_862.
ieee: K. Mitosch, “Timing, variability and cross-protection in bacteria – insights
from dynamic gene expression responses to antibiotics,” Institute of Science and
Technology Austria, 2017.
ista: Mitosch K. 2017. Timing, variability and cross-protection in bacteria – insights
from dynamic gene expression responses to antibiotics. Institute of Science and
Technology Austria.
mla: Mitosch, Karin. Timing, Variability and Cross-Protection in Bacteria – Insights
from Dynamic Gene Expression Responses to Antibiotics. Institute of Science
and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_862.
short: K. Mitosch, Timing, Variability and Cross-Protection in Bacteria – Insights
from Dynamic Gene Expression Responses to Antibiotics, Institute of Science and
Technology Austria, 2017.
date_created: 2018-12-11T11:48:40Z
date_published: 2017-09-27T00:00:00Z
date_updated: 2023-09-07T12:00:26Z
day: '27'
ddc:
- '571'
- '579'
degree_awarded: PhD
department:
- _id: ToBo
doi: 10.15479/AT:ISTA:th_862
file:
- access_level: closed
checksum: da3993c5f90f59a8e8623cc31ad501dd
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T08:48:51Z
date_updated: 2020-07-14T12:48:09Z
file_id: '6210'
file_name: Thesis_KarinMitosch.docx
file_size: 6331071
relation: source_file
- access_level: open_access
checksum: 24c3d9e51992f1b721f3df55aa13fcb8
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T08:48:51Z
date_updated: 2020-07-14T12:48:09Z
file_id: '6211'
file_name: Thesis_KarinMitosch.pdf
file_size: 9289852
relation: main_file
file_date_updated: 2020-07-14T12:48:09Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '113'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6831'
pubrep_id: '862'
related_material:
record:
- id: '2001'
relation: part_of_dissertation
status: public
- id: '666'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
title: Timing, variability and cross-protection in bacteria – insights from dynamic
gene expression responses to antibiotics
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '666'
abstract:
- lang: eng
text: Antibiotics elicit drastic changes in microbial gene expression, including
the induction of stress response genes. While certain stress responses are known
to “cross-protect” bacteria from other stressors, it is unclear whether cellular
responses to antibiotics have a similar protective role. By measuring the genome-wide
transcriptional response dynamics of Escherichia coli to four antibiotics, we
found that trimethoprim induces a rapid acid stress response that protects bacteria
from subsequent exposure to acid. Combining microfluidics with time-lapse imaging
to monitor survival and acid stress response in single cells revealed that the
noisy expression of the acid resistance operon gadBC correlates with single-cell
survival. Cells with higher gadBC expression following trimethoprim maintain higher
intracellular pH and survive the acid stress longer. The seemingly random single-cell
survival under acid stress can therefore be predicted from gadBC expression and
rationalized in terms of GadB/C molecular function. Overall, we provide a roadmap
for identifying the molecular mechanisms of single-cell cross-protection between
antibiotics and other stressors.
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Karin
full_name: Mitosch, Karin
id: 39B66846-F248-11E8-B48F-1D18A9856A87
last_name: Mitosch
- first_name: Georg
full_name: Rieckh, Georg
id: 34DA8BD6-F248-11E8-B48F-1D18A9856A87
last_name: Rieckh
- first_name: Tobias
full_name: Bollenbach, Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: Mitosch K, Rieckh G, Bollenbach MT. Noisy response to antibiotic stress predicts
subsequent single cell survival in an acidic environment. Cell Systems.
2017;4(4):393-403. doi:10.1016/j.cels.2017.03.001
apa: Mitosch, K., Rieckh, G., & Bollenbach, M. T. (2017). Noisy response to
antibiotic stress predicts subsequent single cell survival in an acidic environment.
Cell Systems. Cell Press. https://doi.org/10.1016/j.cels.2017.03.001
chicago: Mitosch, Karin, Georg Rieckh, and Mark Tobias Bollenbach. “Noisy Response
to Antibiotic Stress Predicts Subsequent Single Cell Survival in an Acidic Environment.”
Cell Systems. Cell Press, 2017. https://doi.org/10.1016/j.cels.2017.03.001.
ieee: K. Mitosch, G. Rieckh, and M. T. Bollenbach, “Noisy response to antibiotic
stress predicts subsequent single cell survival in an acidic environment,” Cell
Systems, vol. 4, no. 4. Cell Press, pp. 393–403, 2017.
ista: Mitosch K, Rieckh G, Bollenbach MT. 2017. Noisy response to antibiotic stress
predicts subsequent single cell survival in an acidic environment. Cell Systems.
4(4), 393–403.
mla: Mitosch, Karin, et al. “Noisy Response to Antibiotic Stress Predicts Subsequent
Single Cell Survival in an Acidic Environment.” Cell Systems, vol. 4, no.
4, Cell Press, 2017, pp. 393–403, doi:10.1016/j.cels.2017.03.001.
short: K. Mitosch, G. Rieckh, M.T. Bollenbach, Cell Systems 4 (2017) 393–403.
date_created: 2018-12-11T11:47:48Z
date_published: 2017-04-26T00:00:00Z
date_updated: 2023-09-07T12:00:25Z
day: '26'
ddc:
- '576'
- '610'
department:
- _id: ToBo
- _id: GaTk
doi: 10.1016/j.cels.2017.03.001
ec_funded: 1
file:
- access_level: open_access
checksum: 04ff20011c3d9a601c514aa999a5fe1a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:54Z
date_updated: 2020-07-14T12:47:35Z
file_id: '5041'
file_name: IST-2017-901-v1+1_1-s2.0-S2405471217300868-main.pdf
file_size: 2438660
relation: main_file
file_date_updated: 2020-07-14T12:47:35Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 393 - 403
project:
- _id: 25E83C2C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303507'
name: Optimality principles in responses to antibiotics
- _id: 25E9AF9E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27201-B22
name: Revealing the mechanisms underlying drug interactions
- _id: 25EB3A80-B435-11E9-9278-68D0E5697425
grant_number: RGP0042/2013
name: Revealing the fundamental limits of cell growth
publication: Cell Systems
publication_identifier:
issn:
- '24054712'
publication_status: published
publisher: Cell Press
publist_id: '7061'
pubrep_id: '901'
quality_controlled: '1'
related_material:
record:
- id: '818'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Noisy response to antibiotic stress predicts subsequent single cell survival
in an acidic environment
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2017'
...
---
_id: '821'
abstract:
- lang: eng
text: "This dissertation focuses on algorithmic aspects of program verification,
and presents modeling and complexity advances on several problems related to the\r\nstatic
analysis of programs, the stateless model checking of concurrent programs, and
the competitive analysis of real-time scheduling algorithms.\r\nOur contributions
can be broadly grouped into five categories.\r\n\r\nOur first contribution is
a set of new algorithms and data structures for the quantitative and data-flow
analysis of programs, based on the graph-theoretic notion of treewidth.\r\nIt
has been observed that the control-flow graphs of typical programs have special
structure, and are characterized as graphs of small treewidth.\r\nWe utilize this
structural property to provide faster algorithms for the quantitative and data-flow
analysis of recursive and concurrent programs.\r\nIn most cases we make an algebraic
treatment of the considered problem,\r\nwhere several interesting analyses, such
as the reachability, shortest path, and certain kind of data-flow analysis problems
follow as special cases. \r\nWe exploit the constant-treewidth property to obtain
algorithmic improvements for on-demand versions of the problems, \r\nand provide
data structures with various tradeoffs between the resources spent in the preprocessing
and querying phase.\r\nWe also improve on the algorithmic complexity of quantitative
problems outside the algebraic path framework,\r\nnamely of the minimum mean-payoff,
minimum ratio, and minimum initial credit for energy problems.\r\n\r\n\r\nOur
second contribution is a set of algorithms for Dyck reachability with applications
to data-dependence analysis and alias analysis.\r\nIn particular, we develop an
optimal algorithm for Dyck reachability on bidirected graphs, which are ubiquitous
in context-insensitive, field-sensitive points-to analysis.\r\nAdditionally, we
develop an efficient algorithm for context-sensitive data-dependence analysis
via Dyck reachability,\r\nwhere the task is to obtain analysis summaries of library
code in the presence of callbacks.\r\nOur algorithm preprocesses libraries in
almost linear time, after which the contribution of the library in the complexity
of the client analysis is (i)~linear in the number of call sites and (ii)~only
logarithmic in the size of the whole library, as opposed to linear in the size
of the whole library.\r\nFinally, we prove that Dyck reachability is Boolean Matrix
Multiplication-hard in general, and the hardness also holds for graphs of constant
treewidth.\r\nThis hardness result strongly indicates that there exist no combinatorial
algorithms for Dyck reachability with truly subcubic complexity.\r\n\r\n\r\nOur
third contribution is the formalization and algorithmic treatment of the Quantitative
Interprocedural Analysis framework.\r\nIn this framework, the transitions of a
recursive program are annotated as good, bad or neutral, and receive a weight
which measures\r\nthe magnitude of their respective effect.\r\nThe Quantitative
Interprocedural Analysis problem asks to determine whether there exists an infinite
run of the program where the long-run ratio of the bad weights over the good weights
is above a given threshold.\r\nWe illustrate how several quantitative problems
related to static analysis of recursive programs can be instantiated in this framework,\r\nand
present some case studies to this direction.\r\n\r\n\r\nOur fourth contribution
is a new dynamic partial-order reduction for the stateless model checking of concurrent
programs. Traditional approaches rely on the standard Mazurkiewicz equivalence
between traces, by means of partitioning the trace space into equivalence classes,
and attempting to explore a few representatives from each class.\r\nWe present
a new dynamic partial-order reduction method called the Data-centric Partial
Order Reduction (DC-DPOR).\r\nOur algorithm is based on a new equivalence between
traces, called the observation equivalence.\r\nDC-DPOR explores a coarser partitioning
of the trace space than any exploration method based on the standard Mazurkiewicz
equivalence.\r\nDepending on the program, the new partitioning can be even exponentially
coarser.\r\nAdditionally, DC-DPOR spends only polynomial time in each explored
class.\r\n\r\n\r\nOur fifth contribution is the use of automata and game-theoretic
verification techniques in the competitive analysis and synthesis of real-time
scheduling algorithms for firm-deadline tasks.\r\nOn the analysis side, we leverage
automata on infinite words to compute the competitive ratio of real-time schedulers
subject to various environmental constraints.\r\nOn the synthesis side, we introduce
a new instance of two-player mean-payoff partial-information games, and show\r\nhow
the synthesis of an optimal real-time scheduler can be reduced to computing winning
strategies in this new type of games."
acknowledgement: "First, I am thankful to my advisor, Krishnendu Chatterjee, for offering
me the opportunity to\r\nmaterialize my scientific curiosity in a remarkably wide
range of interesting topics, as well as for his constant availability and continuous
support throughout my doctoral studies. I have had the privilege of collaborating
with, discussing and getting inspired by all members of my committee: Thomas A.
Henzinger, Ulrich Schmid and Martin A. Nowak. The role of the above four people
has been very instrumental both to the research carried out for this dissertation,
and to the researcher I evolved to in the process.\r\nI have greatly enjoyed my
numerous brainstorming sessions with Rasmus Ibsen-Jensen, many\r\nof which led to
results on low-treewidth graphs presented here. I thank Alex Kößler for our\r\ndiscussions
on modeling and analyzing real-time scheduling algorithms, Yaron Velner for our\r\ncollaboration
on the Quantitative Interprocedural Analysis framework, and Nishant Sinha for our
initial discussions on partial order reduction techniques in stateless model checking.
I also thank Jan Otop, Ben Adlam, Bernhard Kragl and Josef Tkadlec for our fruitful
collaborations on\r\ntopics outside the scope of this dissertation, as well as the
interns Prateesh Goyal, Amir Kafshdar Goharshady, Samarth Mishra, Bhavya Choudhary
and Marek Chalupa, with whom I have shared my excitement on various research topics.
Together with my collaborators, I thank officemates and members of the Chatterjee
and Henzinger groups throughout the years, Thorsten Tarrach, Ventsi Chonev, Roopsha
Samanta, Przemek Daca, Mirco Giacobbe, Tanja Petrov, Ashutosh\r\nGupta, Arjun Radhakrishna,
\ Petr Novontý, Christian Hilbe, Jakob Ruess, Martin Chmelik,\r\nCezara Dragoi,
Johannes Reiter, Andrey Kupriyanov, Guy Avni, Sasha Rubin, Jessica Davies, Hongfei
Fu, Thomas Ferrère, Pavol Cerný, Ali Sezgin, Jan Kretínský, Sergiy Bogomolov, Hui\r\nKong,
Benjamin Aminof, Duc-Hiep Chu, and Damien Zufferey. Besides collaborations and
office spaces, with many of the above people I have been fortunate to share numerous
whiteboard\r\ndiscussions, as well as memorable long walks and amicable meals accompanied
by stimulating\r\nconversations. I am highly indebted to Elisabeth Hacker for her
continuous assistance in matters\r\nthat often exceeded her official duties, and
who made my integration in Austria a smooth process."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Pavlogiannis A. Algorithmic advances in program analysis and their applications.
2017. doi:10.15479/AT:ISTA:th_854
apa: Pavlogiannis, A. (2017). Algorithmic advances in program analysis and their
applications. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_854
chicago: Pavlogiannis, Andreas. “Algorithmic Advances in Program Analysis and Their
Applications.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_854.
ieee: A. Pavlogiannis, “Algorithmic advances in program analysis and their applications,”
Institute of Science and Technology Austria, 2017.
ista: Pavlogiannis A. 2017. Algorithmic advances in program analysis and their applications.
Institute of Science and Technology Austria.
mla: Pavlogiannis, Andreas. Algorithmic Advances in Program Analysis and Their
Applications. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_854.
short: A. Pavlogiannis, Algorithmic Advances in Program Analysis and Their Applications,
Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:41Z
date_published: 2017-08-09T00:00:00Z
date_updated: 2023-09-07T12:01:59Z
day: '09'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: KrCh
doi: 10.15479/AT:ISTA:th_854
ec_funded: 1
file:
- access_level: open_access
checksum: 3a3ec003f6ee73f41f82a544d63dfc77
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:44Z
date_updated: 2020-07-14T12:48:10Z
file_id: '4900'
file_name: IST-2017-854-v1+1_Pavlogiannis_Thesis_PubRep.pdf
file_size: 4103115
relation: main_file
- access_level: closed
checksum: bd2facc45ff8a2e20c5ed313c2ccaa83
content_type: application/zip
creator: dernst
date_created: 2019-04-05T07:59:31Z
date_updated: 2020-07-14T12:48:10Z
file_id: '6201'
file_name: 2017_thesis_Pavlogiannis.zip
file_size: 14744374
relation: source_file
file_date_updated: 2020-07-14T12:48:10Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: '418'
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6828'
pubrep_id: '854'
related_material:
record:
- id: '1071'
relation: part_of_dissertation
status: public
- id: '1437'
relation: part_of_dissertation
status: public
- id: '1602'
relation: part_of_dissertation
status: public
- id: '1604'
relation: part_of_dissertation
status: public
- id: '1607'
relation: part_of_dissertation
status: public
- id: '1714'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
title: Algorithmic advances in program analysis and their applications
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '820'
abstract:
- lang: eng
text: "The lac operon is a classic model system for bacterial gene regulation, and
has been studied extensively in E. coli, a classic model organism. However, not
much is known about E. coli’s ecology and life outside the laboratory, in particular
in soil and water environments. The natural diversity of the lac operon outside
the laboratory, its role in the ecology of E. coli and the selection pressures
it is exposed to, are similarly unknown.\r\nIn Chapter Two of this thesis, I explore
the genetic diversity, phylogenetic history and signatures of selection of the
lac operon across 20 natural isolates of E. coli and divergent clades of Escherichia.
I found that complete lac operons were present in all isolates examined, which
in all but one case were functional. The lac operon phylogeny conformed to the
whole-genome phylogeny of the divergent Escherichia clades, which excludes horizontal
gene transfer as an explanation for the presence of functional lac operons in
these clades. All lac operon genes showed a signature of purifying selection;
this signature was strongest for the lacY gene. Lac operon genes of human and
environmental isolates showed similar signatures of selection, except the lacZ
gene, which showed a stronger signature of selection in environmental isolates.\r\nIn
Chapter Three, I try to identify the natural genetic variation relevant for phenotype
and fitness in the lac operon, comparing growth rate on lactose and LacZ activity
of the lac operons of these wild isolates in a common genetic background. Sequence
variation in the lac promoter region, upstream of the -10 and -35 RNA polymerase
binding motif, predicted variation in LacZ activity at full induction, using a
thermodynamic model of polymerase binding (Tugrul, 2016). However, neither variation
in LacZ activity, nor RNA polymerase binding predicted by the model correlated
with variation in growth rate. Lac operons of human and environmental isolates
did not differ systematically in either growth rate on lactose or LacZ protein
activity, suggesting that these lac operons have been exposed to similar selection
pressures. We thus have no evidence that the phenotypic variation we measured
is relevant for fitness.\r\nTo start assessing the effect of genomic background
on the growth phenotype conferred by the lac operon, I compared growth on minimal
medium with lactose between lac operon constructs and the corresponding original
isolates, I found that maximal growth rate was determined by genomic background,
with almost all backgrounds conferring higher growth rates than lab strain K12
MG1655. However, I found no evidence that the lactose concentration at which growth
was half maximal depended on genomic background."
acknowledgement: "ERC H2020 programme (grant agreement no. 648440)\r\nThanks to Jon
Bollback for giving me the chance to do this work, for sharing the ideas that lay
at the basis of this work, for his honesty and openness, showing himself to me as
a person and not just as a boss. Thanks to Nick Barton for his guidance at the last
stage, reading and commenting extensively on several versions of this manuscript,
and for his encouragement; thanks to both Jon and Nick for their kindness and patience.
Thanks to Erik van Nimwegen and Calin Guet for their time and willingness to be
in my thesis committee, and to Erik van Nimwegen especially for agreeing to enter
my thesis committee at the last moment, and for his very sharp, helpful and relevant
comments during and after the defense. Thanks to my collaborators and discussion
partners: Anne Kupczok, for her guidance, ideas and discussions during the construction
of the manuscript of Chapter Two, and her comments on the manuscript; Georg Rieckh
for making me aware of the issue of parameter identifiability, suggesting how to
solve it, and for his unfortunate idea to start the plasmid enterprise in the first
place; Murat Tugrul for sharing his model, for his enthusiasm, and his comments
on Chapter Three; Srdjan Sarikas for his collaboration on the Monod model fitting,
fast forwarding the analysis to turbo speed and making beautiful figures, and making
the discussion fun on top of it all; Vanessa Barone for her last minute comments,
especially on Chapter Three, providing a sharp and very helpful experimentalist
perspective at the last moment; Maros Pleska and Marjon de Vos for their comments
on the manuscript of Chapter Two; Gasper Tkacik for his crucial input on the relation
between growth rate and lactose concentration; Bor Kavcic for his input on growth
rate modeling and error propagation. Thanks to the Bollback, Bollenbach, Barton,
Guet and Tkacik group members for both pro- viding an inspiring and supportive scientific
environment to work in, as well as a lot of warmth and colour to everyday life.
And thanks to the friends I found here, to the people who were there for me and
to the people who changed my life, making it stranger and more beautiful than I
could have imagined, Maros, Vanessa, Tade, Suzi, Andrej, Peter, Tiago, Kristof,
Karin, Irene, Misha, Mato, Guillaume and Zanin. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Fabienne
full_name: Jesse, Fabienne
id: 4C8C26A4-F248-11E8-B48F-1D18A9856A87
last_name: Jesse
citation:
ama: Jesse F. The lac operon in the wild. 2017. doi:10.15479/AT:ISTA:th_857
apa: Jesse, F. (2017). The lac operon in the wild. Institute of Science and
Technology Austria. https://doi.org/10.15479/AT:ISTA:th_857
chicago: Jesse, Fabienne. “The Lac Operon in the Wild.” Institute of Science and
Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_857.
ieee: F. Jesse, “The lac operon in the wild,” Institute of Science and Technology
Austria, 2017.
ista: Jesse F. 2017. The lac operon in the wild. Institute of Science and Technology
Austria.
mla: Jesse, Fabienne. The Lac Operon in the Wild. Institute of Science and
Technology Austria, 2017, doi:10.15479/AT:ISTA:th_857.
short: F. Jesse, The Lac Operon in the Wild, Institute of Science and Technology
Austria, 2017.
date_created: 2018-12-11T11:48:41Z
date_published: 2017-08-25T00:00:00Z
date_updated: 2023-09-07T12:01:21Z
day: '25'
ddc:
- '576'
- '577'
- '579'
degree_awarded: PhD
department:
- _id: JoBo
doi: 10.15479/AT:ISTA:th_857
ec_funded: 1
file:
- access_level: open_access
checksum: c62257a7bff0c5f39e1abffc6bfcca5c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:00Z
date_updated: 2020-07-14T12:48:10Z
file_id: '5252'
file_name: IST-2017-857-v1+1_thesis_fabienne.pdf
file_size: 3417773
relation: main_file
- access_level: closed
checksum: fc87d7d72fce52824a3ae7dcad0413a8
content_type: application/x-tex
creator: dernst
date_created: 2019-04-05T08:51:59Z
date_updated: 2020-07-14T12:48:10Z
file_id: '6212'
file_name: 2017_thesis_Jesse_source.tex
file_size: 215899
relation: source_file
file_date_updated: 2020-07-14T12:48:10Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '87'
project:
- _id: 2578D616-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '648440'
name: Selective Barriers to Horizontal Gene Transfer
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6829'
pubrep_id: '857'
status: public
supervisor:
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
title: The lac operon in the wild
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '838'
abstract:
- lang: eng
text: 'In this thesis we discuss the exact security of message authentications codes
HMAC , NMAC , and PMAC . NMAC is a mode of operation which turns a fixed input-length
keyed hash function f into a variable input-length function. A practical single-key
variant of NMAC called HMAC is a very popular and widely deployed message authentication
code (MAC). PMAC is a block-cipher based mode of operation, which also happens
to be the most famous fully parallel MAC. NMAC was introduced by Bellare, Canetti
and Krawczyk Crypto’96, who proved it to be a secure pseudorandom function (PRF),
and thus also a MAC, under two assumptions. Unfortunately, for many instantiations
of HMAC one of them has been found to be wrong. To restore the provable guarantees
for NMAC , Bellare [Crypto’06] showed its security without this assumption. PMAC
was introduced by Black and Rogaway at Eurocrypt 2002. If instantiated with a
pseudorandom permutation over n -bit strings, PMAC constitutes a provably secure
variable input-length PRF. For adversaries making q queries, each of length at
most ` (in n -bit blocks), and of total length σ ≤ q` , the original paper proves
an upper bound on the distinguishing advantage of O ( σ 2 / 2 n ), while the currently
best bound is O ( qσ/ 2 n ). In this work we show that this bound is tight by
giving an attack with advantage Ω( q 2 `/ 2 n ). In the PMAC construction one
initially XORs a mask to every message block, where the mask for the i th block
is computed as τ i := γ i · L , where L is a (secret) random value, and γ i is
the i -th codeword of the Gray code. Our attack applies more generally to any
sequence of γ i ’s which contains a large coset of a subgroup of GF (2 n ). As
for NMAC , our first contribution is a simpler and uniform proof: If f is an ε
-secure PRF (against q queries) and a δ - non-adaptively secure PRF (against q
queries), then NMAC f is an ( ε + `qδ )-secure PRF against q queries of length
at most ` blocks each. We also show that this ε + `qδ bound is basically tight
by constructing an f for which an attack with advantage `qδ exists. Moreover,
we analyze the PRF-security of a modification of NMAC called NI by An and Bellare
that avoids the constant rekeying on multi-block messages in NMAC and allows for
an information-theoretic analysis. We carry out such an analysis, obtaining a
tight `q 2 / 2 c bound for this step, improving over the trivial bound of ` 2
q 2 / 2 c . Finally, we investigate, if the security of PMAC can be further improved
by using τ i ’s that are k -wise independent, for k > 1 (the original has k
= 1). We observe that the security of PMAC will not increase in general if k =
2, and then prove that the security increases to O ( q 2 / 2 n ), if the k = 4.
Due to simple extension attacks, this is the best bound one can hope for, using
any distribution on the masks. Whether k = 3 is already sufficient to get this
level of security is left as an open problem. Keywords: Message authentication
codes, Pseudorandom functions, HMAC, PMAC. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Michal
full_name: Rybar, Michal
id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87
last_name: Rybar
citation:
ama: Rybar M. (The exact security of) Message authentication codes. 2017. doi:10.15479/AT:ISTA:th_828
apa: Rybar, M. (2017). (The exact security of) Message authentication codes.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_828
chicago: Rybar, Michal. “(The Exact Security of) Message Authentication Codes.”
Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_828.
ieee: M. Rybar, “(The exact security of) Message authentication codes,” Institute
of Science and Technology Austria, 2017.
ista: Rybar M. 2017. (The exact security of) Message authentication codes. Institute
of Science and Technology Austria.
mla: Rybar, Michal. (The Exact Security of) Message Authentication Codes.
Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_828.
short: M. Rybar, (The Exact Security of) Message Authentication Codes, Institute
of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:46Z
date_published: 2017-06-26T00:00:00Z
date_updated: 2023-09-07T12:02:28Z
day: '26'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: KrPi
doi: 10.15479/AT:ISTA:th_828
file:
- access_level: open_access
checksum: ff8639ec4bded6186f44c7bd3ee26804
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:13Z
date_updated: 2020-07-14T12:48:12Z
file_id: '4799'
file_name: IST-2017-828-v1+3_2017_Rybar_thesis.pdf
file_size: 847400
relation: main_file
- access_level: closed
checksum: 3462101745ce8ad199c2d0f75dae4a7e
content_type: application/zip
creator: dernst
date_created: 2019-04-05T08:24:11Z
date_updated: 2020-07-14T12:48:12Z
file_id: '6202'
file_name: 2017_Thesis_Rybar_source.zip
file_size: 26054879
relation: source_file
file_date_updated: 2020-07-14T12:48:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '86'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6810'
pubrep_id: '828'
related_material:
record:
- id: '2082'
relation: part_of_dissertation
status: public
- id: '6196'
relation: part_of_dissertation
status: public
status: public
title: (The exact security of) Message authentication codes
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '6196'
abstract:
- lang: eng
text: PMAC is a simple and parallel block-cipher mode of operation, which was introduced
by Black and Rogaway at Eurocrypt 2002. If instantiated with a (pseudo)random
permutation over n-bit strings, PMAC constitutes a provably secure variable input-length
(pseudo)random function. For adversaries making q queries, each of length at most
l (in n-bit blocks), and of total length σ ≤ ql, the original paper proves an
upper bound on the distinguishing advantage of Ο(σ2/2n), while the currently
best bound is Ο (qσ/2n).In this work we show that this bound is tight by giving
an attack with advantage Ω (q2l/2n). In the PMAC construction one initially XORs
a mask to every message block, where the mask for the ith block is computed as
τi := γi·L, where L is a (secret) random value, and γi is the i-th codeword of
the Gray code. Our attack applies more generally to any sequence of γi’s which
contains a large coset of a subgroup of GF(2n). We then investigate if the security
of PMAC can be further improved by using τi’s that are k-wise independent, for
k > 1 (the original distribution is only 1-wise independent). We observe that
the security of PMAC will not increase in general, even if the masks are chosen
from a 2-wise independent distribution, and then prove that the security increases
to O(q<2/2n), if the τi are 4-wise independent. Due to simple extension attacks,
this is the best bound one can hope for, using any distribution on the masks.
Whether 3-wise independence is already sufficient to get this level of security
is left as an open problem.
author:
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Michal
full_name: Rybar, Michal
id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87
last_name: Rybar
citation:
ama: Gazi P, Pietrzak KZ, Rybar M. The exact security of PMAC. IACR Transactions
on Symmetric Cryptology. 2017;2016(2):145-161. doi:10.13154/TOSC.V2016.I2.145-161
apa: Gazi, P., Pietrzak, K. Z., & Rybar, M. (2017). The exact security of PMAC.
IACR Transactions on Symmetric Cryptology. Ruhr University Bochum. https://doi.org/10.13154/TOSC.V2016.I2.145-161
chicago: Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact Security
of PMAC.” IACR Transactions on Symmetric Cryptology. Ruhr University Bochum,
2017. https://doi.org/10.13154/TOSC.V2016.I2.145-161.
ieee: P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact security of PMAC,” IACR
Transactions on Symmetric Cryptology, vol. 2016, no. 2. Ruhr University Bochum,
pp. 145–161, 2017.
ista: Gazi P, Pietrzak KZ, Rybar M. 2017. The exact security of PMAC. IACR Transactions
on Symmetric Cryptology. 2016(2), 145–161.
mla: Gazi, Peter, et al. “The Exact Security of PMAC.” IACR Transactions on Symmetric
Cryptology, vol. 2016, no. 2, Ruhr University Bochum, 2017, pp. 145–61, doi:10.13154/TOSC.V2016.I2.145-161.
short: P. Gazi, K.Z. Pietrzak, M. Rybar, IACR Transactions on Symmetric Cryptology
2016 (2017) 145–161.
date_created: 2019-04-04T13:48:23Z
date_published: 2017-02-03T00:00:00Z
date_updated: 2023-09-07T12:02:27Z
day: '03'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.13154/TOSC.V2016.I2.145-161
ec_funded: 1
file:
- access_level: open_access
checksum: f23161d685dd957ae8d7274132999684
content_type: application/pdf
creator: dernst
date_created: 2019-04-04T13:53:58Z
date_updated: 2020-07-14T12:47:24Z
file_id: '6197'
file_name: 2017_IACR_Gazi.pdf
file_size: 597335
relation: main_file
file_date_updated: 2020-07-14T12:47:24Z
has_accepted_license: '1'
intvolume: ' 2016'
issue: '2'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 145-161
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: IACR Transactions on Symmetric Cryptology
publication_identifier:
eissn:
- 2519-173X
publication_status: published
publisher: Ruhr University Bochum
quality_controlled: '1'
related_material:
record:
- id: '838'
relation: dissertation_contains
status: public
status: public
title: The exact security of PMAC
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2016
year: '2017'
...
---
_id: '837'
abstract:
- lang: eng
text: 'The hippocampus is a key brain region for memory and notably for spatial
memory, and is needed for both spatial working and reference memories. Hippocampal
place cells selectively discharge in specific locations of the environment to
form mnemonic represen tations of space. Several behavioral protocols have been
designed to test spatial memory which requires the experimental subject to utilize
working memory and reference memory. However, less is known about how these memory
traces are presented in the hippo campus, especially considering tasks that require
both spatial working and long -term reference memory demand. The aim of my thesis
was to elucidate how spatial working memory, reference memory, and the combination
of both are represented in the hippocampus. In this thesis, using a radial eight
-arm maze, I examined how the combined demand on these memories influenced place
cell assemblies while reference memories were partially updated by changing some
of the reward- arms. This was contrasted with task varian ts requiring working
or reference memories only. Reference memory update led to gradual place field
shifts towards the rewards on the switched arms. Cells developed enhanced firing
in passes between newly -rewarded arms as compared to those containing an unchanged
reward. The working memory task did not show such gradual changes. Place assemblies
on occasions replayed trajectories of the maze; at decision points the next arm
choice was preferentially replayed in tasks needing reference memory while in
the pure working memory task the previously visited arm was replayed. Hence trajectory
replay only reflected the decision of the animal in tasks needing reference memory
update. At the reward locations, in all three tasks outbound trajectories of the
current arm were preferentially replayed, showing the animals’ next path to the
center. At reward locations trajectories were replayed preferentially in reverse
temporal order. Moreover, in the center reverse replay was seen in the working
memory task but in the other tasks forward replay was seen. Hence, the direction
of reactivation was determined by the goal locations so that part of the trajectory
which was closer to the goal was reactivated later in an HSE while places further
away from the goal were reactivated earlier. Altogether my work demonstrated that
reference memory update triggers several levels of reorganization of the hippocampal
cognitive map which are not seen in simpler working memory demand s. Moreover,
hippocampus is likely to be involved in spatial decisions through reactivating
planned trajectories when reference memory recall is required for such a decision. '
acknowledgement: 'I am very grateful for the opportunity I have had as a graduate
student to explore and incredibly interesting branch of neuroscience, and for the
people who made it possible. Firstly, I would like to offer my thanks to my supervisor
Professor Jozsef Csicsvari for his great support, guidance and patience offered
over the years. The door to his office was always open whenever I had questions.
I have learned a lot from him about carefully designing experiments, asking interesting
questions and how to integrate results into a broader picture. I also express my
gratitude to the remarkable post- doc , Dr. Joseph O’Neill. He is a gre at scientific
role model who is always willing to teach , and advice and talk through problems
with his full attention. Many thanks to my wonderful “office mates” over the years
and their support and encouragement, Alice Avernhe, Philipp Schönenberger, Desiree
Dickerson, Karel Blahna, Charlotte Boccara, Igor Gridchyn, Peter Baracskay, Krisztián
Kovács, Dámaris Rangel, Karola Käfer and Federico Stella. They were the ones in
the lab for the many useful discussions about science and for making the laboratory
such a nice and friendly place to work in. A special thank goes to Michael LoBianco
and Jago Wallenschus for wonderful technical support. I would also like to thank
Professor Peter Jonas and Professor David M Bannerman for being my qualifying exam
and thesi s committee members despite their busy schedule. I am also very thankful
to IST Austria for their support all throughout my PhD. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Haibing
full_name: Xu, Haibing
id: 310349D0-F248-11E8-B48F-1D18A9856A87
last_name: Xu
citation:
ama: Xu H. Reactivation of the hippocampal cognitive map in goal-directed spatial
tasks. 2017. doi:10.15479/AT:ISTA:th_858
apa: Xu, H. (2017). Reactivation of the hippocampal cognitive map in goal-directed
spatial tasks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_858
chicago: Xu, Haibing. “Reactivation of the Hippocampal Cognitive Map in Goal-Directed
Spatial Tasks.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_858.
ieee: H. Xu, “Reactivation of the hippocampal cognitive map in goal-directed spatial
tasks,” Institute of Science and Technology Austria, 2017.
ista: Xu H. 2017. Reactivation of the hippocampal cognitive map in goal-directed
spatial tasks. Institute of Science and Technology Austria.
mla: Xu, Haibing. Reactivation of the Hippocampal Cognitive Map in Goal-Directed
Spatial Tasks. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_858.
short: H. Xu, Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial
Tasks, Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:46Z
date_published: 2017-08-23T00:00:00Z
date_updated: 2023-09-07T12:06:38Z
day: '23'
ddc:
- '571'
degree_awarded: PhD
department:
- _id: JoCs
doi: 10.15479/AT:ISTA:th_858
file:
- access_level: closed
checksum: f11925fbbce31e495124b6bc4f10573c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T08:59:51Z
date_updated: 2020-07-14T12:48:12Z
file_id: '6213'
file_name: 2017_Xu_Haibing_Thesis_Source.docx
file_size: 3589490
relation: source_file
- access_level: open_access
checksum: ffb10749a537d615fab1ef0937ccb157
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T08:59:51Z
date_updated: 2020-07-14T12:48:12Z
file_id: '6214'
file_name: 2017_Xu_Thesis_IST.pdf
file_size: 11668613
relation: main_file
file_date_updated: 2020-07-14T12:48:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '93'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6811'
pubrep_id: '858'
related_material:
record:
- id: '5828'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
title: Reactivation of the hippocampal cognitive map in goal-directed spatial tasks
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '938'
abstract:
- lang: eng
text: The thesis encompasses several topics of plant cell biology which were studied
in the model plant Arabidopsis thaliana. Chapter 1 concerns the plant hormone
auxin and its polar transport through cells and tissues. The highly controlled,
directional transport of auxin is facilitated by plasma membrane-localized transporters.
Transporters from the PIN family direct auxin transport due to their polarized
localizations at cell membranes. Substantial effort has been put into research
on cellular trafficking of PIN proteins, which is thought to underlie their polar
distribution. I participated in a forward genetic screen aimed at identifying
novel regulators of PIN polarity. The screen yielded several genes which may be
involved in PIN polarity regulation or participate in polar auxin transport by
other means. Chapter 2 focuses on the endomembrane system, with particular attention
to clathrin-mediated endocytosis. The project started with identification of several
proteins that interact with clathrin light chains. Among them, I focused on two
putative homologues of auxilin, which in non-plant systems is an endocytotic factor
known for uncoating clathrin-coated vesicles in the final step of endocytosis.
The body of my work consisted of an in-depth characterization of transgenic A.
thaliana lines overexpressing these putative auxilins in an inducible manner.
Overexpression of these proteins leads to an inhibition of endocytosis, as documented
by imaging of cargoes and clathrin-related endocytic machinery. An extension of
this work is an investigation into a concept of homeostatic regulation acting
between distinct transport processes in the endomembrane system. With auxilin
overexpressing lines, where endocytosis is blocked specifically, I made observations
on the mutual relationship between two opposite trafficking processes of secretion
and endocytosis. In Chapter 3, I analyze cortical microtubule arrays and their
relationship to auxin signaling and polarized growth in elongating cells. In plants,
microtubules are organized into arrays just below the plasma membrane, and it
is thought that their function is to guide membrane-docked cellulose synthase
complexes. These, in turn, influence cell wall structure and cell shape by directed
deposition of cellulose fibres. In elongating cells, cortical microtubule arrays
are able to reorient in relation to long cell axis, and these reorientations have
been linked to cell growth and to signaling of growth-regulating factors such
as auxin or light. In this chapter, I am addressing the causal relationship between
microtubule array reorientation, growth, and auxin signaling. I arrive at a model
where array reorientation is not guided by auxin directly, but instead is only
controlled by growth, which, in turn, is regulated by auxin.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Maciek
full_name: Adamowski, Maciek
id: 45F536D2-F248-11E8-B48F-1D18A9856A87
last_name: Adamowski
orcid: 0000-0001-6463-5257
citation:
ama: Adamowski M. Investigations into cell polarity and trafficking in the plant
model Arabidopsis thaliana . 2017. doi:10.15479/AT:ISTA:th_842
apa: Adamowski, M. (2017). Investigations into cell polarity and trafficking
in the plant model Arabidopsis thaliana . Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:th_842
chicago: Adamowski, Maciek. “Investigations into Cell Polarity and Trafficking in
the Plant Model Arabidopsis Thaliana .” Institute of Science and Technology Austria,
2017. https://doi.org/10.15479/AT:ISTA:th_842.
ieee: M. Adamowski, “Investigations into cell polarity and trafficking in the plant
model Arabidopsis thaliana ,” Institute of Science and Technology Austria, 2017.
ista: Adamowski M. 2017. Investigations into cell polarity and trafficking in the
plant model Arabidopsis thaliana . Institute of Science and Technology Austria.
mla: Adamowski, Maciek. Investigations into Cell Polarity and Trafficking in
the Plant Model Arabidopsis Thaliana . Institute of Science and Technology
Austria, 2017, doi:10.15479/AT:ISTA:th_842.
short: M. Adamowski, Investigations into Cell Polarity and Trafficking in the Plant
Model Arabidopsis Thaliana , Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:49:18Z
date_published: 2017-06-02T00:00:00Z
date_updated: 2023-09-07T12:06:09Z
day: '02'
ddc:
- '581'
- '583'
- '580'
degree_awarded: PhD
department:
- _id: JiFr
doi: 10.15479/AT:ISTA:th_842
file:
- access_level: closed
checksum: 193425764d9aaaed3ac57062a867b315
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T09:03:20Z
date_updated: 2020-07-14T12:48:15Z
file_id: '6215'
file_name: 2017_Adamowski-Thesis_Source.docx
file_size: 46903863
relation: source_file
- access_level: open_access
checksum: df5ab01be81f821e1b958596a1ec8d21
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T09:03:19Z
date_updated: 2020-07-14T12:48:15Z
file_id: '6216'
file_name: 2017_Adamowski-Thesis.pdf
file_size: 8698888
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '117'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6483'
pubrep_id: '842'
related_material:
record:
- id: '1591'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
title: 'Investigations into cell polarity and trafficking in the plant model Arabidopsis
thaliana '
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '992'
abstract:
- lang: eng
text: "An instance of the Constraint Satisfaction Problem (CSP) is given by a finite
set of\r\nvariables, a finite domain of labels, and a set of constraints, each
constraint acting on\r\na subset of the variables. The goal is to find an assignment
of labels to its variables\r\nthat satisfies all constraints (or decide whether
one exists). If we allow more general\r\n“soft” constraints, which come with (possibly
infinite) costs of particular assignments,\r\nwe obtain instances from a richer
class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal
is to find an assignment with minimum total cost.\r\nIn this thesis, we focus
(assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity
of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent
of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage,
that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe
complexity classification modulo (missing pieces of) complexity classification
for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’
perfect\r\nmatching algorithm. This generalization contributes to complexity classfications
in two\r\nways. First, it gives a new (largest known) polynomial-time solvable
class of Boolean\r\nCSPs in which every variable may appear in at most two constraints
and second, it\r\nsettles full classification of Boolean CSPs with planar drawing
(again parametrized by a\r\nconstraint language)."
acknowledgement: FP7/2007-2013/ERC grant agreement no 616160
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Rolinek M. Complexity of constraint satisfaction. 2017. doi:10.15479/AT:ISTA:th_815
apa: Rolinek, M. (2017). Complexity of constraint satisfaction. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_815
chicago: Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of
Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815.
ieee: M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science
and Technology Austria, 2017.
ista: Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science
and Technology Austria.
mla: Rolinek, Michal. Complexity of Constraint Satisfaction. Institute of
Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_815.
short: M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and
Technology Austria, 2017.
date_created: 2018-12-11T11:49:35Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2023-09-07T12:05:41Z
day: '01'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:th_815
ec_funded: 1
file:
- access_level: open_access
checksum: 81761fb939acb7585c36629f765b4373
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:55Z
date_updated: 2020-07-14T12:48:18Z
file_id: '4654'
file_name: IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf
file_size: 786145
relation: main_file
- access_level: closed
checksum: 2b2d7e1d6c1c79a9795a7aa0f860baf3
content_type: application/zip
creator: dernst
date_created: 2019-04-05T08:43:24Z
date_updated: 2020-07-14T12:48:18Z
file_id: '6208'
file_name: 2017_Thesis_Rolinek_source.zip
file_size: 5936337
relation: source_file
file_date_updated: 2020-07-14T12:48:18Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '97'
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6407'
pubrep_id: '815'
status: public
supervisor:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
title: Complexity of constraint satisfaction
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '718'
abstract:
- lang: eng
text: Mapping every simplex in the Delaunay mosaic of a discrete point set to the
radius of the smallest empty circumsphere gives a generalized discrete Morse function.
Choosing the points from a Poisson point process in ℝ n , we study the expected
number of simplices in the Delaunay mosaic as well as the expected number of critical
simplices and nonsingular intervals in the corresponding generalized discrete
gradient. Observing connections with other probabilistic models, we obtain precise
expressions for the expected numbers in low dimensions. In particular, we obtain
the expected numbers of simplices in the Poisson–Delaunay mosaic in dimensions
n ≤ 4.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Anton
full_name: Nikitenko, Anton
id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87
last_name: Nikitenko
orcid: 0000-0002-0659-3201
- first_name: Matthias
full_name: Reitzner, Matthias
last_name: Reitzner
citation:
ama: Edelsbrunner H, Nikitenko A, Reitzner M. Expected sizes of poisson Delaunay
mosaics and their discrete Morse functions. Advances in Applied Probability.
2017;49(3):745-767. doi:10.1017/apr.2017.20
apa: Edelsbrunner, H., Nikitenko, A., & Reitzner, M. (2017). Expected sizes
of poisson Delaunay mosaics and their discrete Morse functions. Advances in
Applied Probability. Cambridge University Press. https://doi.org/10.1017/apr.2017.20
chicago: Edelsbrunner, Herbert, Anton Nikitenko, and Matthias Reitzner. “Expected
Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” Advances
in Applied Probability. Cambridge University Press, 2017. https://doi.org/10.1017/apr.2017.20.
ieee: H. Edelsbrunner, A. Nikitenko, and M. Reitzner, “Expected sizes of poisson
Delaunay mosaics and their discrete Morse functions,” Advances in Applied Probability,
vol. 49, no. 3. Cambridge University Press, pp. 745–767, 2017.
ista: Edelsbrunner H, Nikitenko A, Reitzner M. 2017. Expected sizes of poisson Delaunay
mosaics and their discrete Morse functions. Advances in Applied Probability. 49(3),
745–767.
mla: Edelsbrunner, Herbert, et al. “Expected Sizes of Poisson Delaunay Mosaics and
Their Discrete Morse Functions.” Advances in Applied Probability, vol.
49, no. 3, Cambridge University Press, 2017, pp. 745–67, doi:10.1017/apr.2017.20.
short: H. Edelsbrunner, A. Nikitenko, M. Reitzner, Advances in Applied Probability
49 (2017) 745–767.
date_created: 2018-12-11T11:48:07Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-09-07T12:07:12Z
day: '01'
department:
- _id: HeEd
doi: 10.1017/apr.2017.20
ec_funded: 1
external_id:
arxiv:
- '1607.05915'
intvolume: ' 49'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1607.05915
month: '09'
oa: 1
oa_version: Preprint
page: 745 - 767
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: Advances in Applied Probability
publication_identifier:
issn:
- '00018678'
publication_status: published
publisher: Cambridge University Press
publist_id: '6962'
quality_controlled: '1'
related_material:
record:
- id: '6287'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Expected sizes of poisson Delaunay mosaics and their discrete Morse functions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 49
year: '2017'
...