---
_id: '7182'
abstract:
- lang: eng
text: During infection pathogens secrete small molecules, termed effectors, to manipulate
and control the interaction with their specific hosts. Both the pathogen and the
plant are under high selective pressure to rapidly adapt and co-evolve in what
is usually referred to as molecular arms race. Components of the host’s immune
system form a network that processes information about molecules with a foreign
origin and damage-associated signals, integrating them with developmental and
abiotic cues to adapt the plant’s responses. Both in the case of nucleotide-binding
leucine-rich repeat receptors and leucine-rich repeat receptor kinases interaction
networks have been extensively characterized. However, little is known on whether
pathogenic effectors form complexes to overcome plant immunity and promote disease.
Ustilago maydis, a biotrophic fungal pathogen that infects maize plants, produces
effectors that target hubs in the immune network of the host cell. Here we assess
the capability of U. maydis effector candidates to interact with each other, which
may play a crucial role during the infection process. Using a systematic yeast-two-hybrid
approach and based on a preliminary pooled screen, we selected 63 putative effectors
for one-on-one matings with a library of nearly 300 effector candidates. We found
that 126 of these effector candidates interacted either with themselves or other
predicted effectors. Although the functional relevance of the observed interactions
remains elusive, we propose that the observed abundance in complex formation between
effectors adds an additional level of complexity to effector research and should
be taken into consideration when studying effector evolution and function. Based
on this fundamental finding, we suggest various scenarios which could evolutionarily
drive the formation and stabilization of an effector interactome.
article_number: '1437'
article_processing_charge: No
article_type: original
author:
- first_name: André
full_name: Alcântara, André
last_name: Alcântara
- first_name: Jason
full_name: Bosch, Jason
last_name: Bosch
- first_name: Fahimeh
full_name: Nazari, Fahimeh
last_name: Nazari
- first_name: Gesa
full_name: Hoffmann, Gesa
last_name: Hoffmann
- first_name: Michelle C
full_name: Gallei, Michelle C
id: 35A03822-F248-11E8-B48F-1D18A9856A87
last_name: Gallei
orcid: 0000-0003-1286-7368
- first_name: Simon
full_name: Uhse, Simon
last_name: Uhse
- first_name: Martin A.
full_name: Darino, Martin A.
last_name: Darino
- first_name: Toluwase
full_name: Olukayode, Toluwase
last_name: Olukayode
- first_name: Daniel
full_name: Reumann, Daniel
last_name: Reumann
- first_name: Laura
full_name: Baggaley, Laura
last_name: Baggaley
- first_name: Armin
full_name: Djamei, Armin
last_name: Djamei
citation:
ama: Alcântara A, Bosch J, Nazari F, et al. Systematic Y2H screening reveals extensive
effector-complex formation. Frontiers in Plant Science. 2019;10(11). doi:10.3389/fpls.2019.01437
apa: Alcântara, A., Bosch, J., Nazari, F., Hoffmann, G., Gallei, M. C., Uhse, S.,
… Djamei, A. (2019). Systematic Y2H screening reveals extensive effector-complex
formation. Frontiers in Plant Science. Frontiers. https://doi.org/10.3389/fpls.2019.01437
chicago: Alcântara, André, Jason Bosch, Fahimeh Nazari, Gesa Hoffmann, Michelle
C Gallei, Simon Uhse, Martin A. Darino, et al. “Systematic Y2H Screening Reveals
Extensive Effector-Complex Formation.” Frontiers in Plant Science. Frontiers,
2019. https://doi.org/10.3389/fpls.2019.01437.
ieee: A. Alcântara et al., “Systematic Y2H screening reveals extensive effector-complex
formation,” Frontiers in Plant Science, vol. 10, no. 11. Frontiers, 2019.
ista: Alcântara A, Bosch J, Nazari F, Hoffmann G, Gallei MC, Uhse S, Darino MA,
Olukayode T, Reumann D, Baggaley L, Djamei A. 2019. Systematic Y2H screening reveals
extensive effector-complex formation. Frontiers in Plant Science. 10(11), 1437.
mla: Alcântara, André, et al. “Systematic Y2H Screening Reveals Extensive Effector-Complex
Formation.” Frontiers in Plant Science, vol. 10, no. 11, 1437, Frontiers,
2019, doi:10.3389/fpls.2019.01437.
short: A. Alcântara, J. Bosch, F. Nazari, G. Hoffmann, M.C. Gallei, S. Uhse, M.A.
Darino, T. Olukayode, D. Reumann, L. Baggaley, A. Djamei, Frontiers in Plant Science
10 (2019).
date_created: 2019-12-15T23:00:43Z
date_published: 2019-11-14T00:00:00Z
date_updated: 2026-04-16T08:34:31Z
day: '14'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.3389/fpls.2019.01437
external_id:
isi:
- '000499821700001'
pmid:
- '31803201'
file:
- access_level: open_access
checksum: 995aa838aec2064d93550de82b40bbd1
content_type: application/pdf
creator: dernst
date_created: 2019-12-16T07:58:43Z
date_updated: 2020-07-14T12:47:52Z
file_id: '7185'
file_name: 2019_FrontiersPlant_Alcantara.pdf
file_size: 1532505
relation: main_file
file_date_updated: 2020-07-14T12:47:52Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: Frontiers in Plant Science
publication_identifier:
eissn:
- 1664-462X
publication_status: published
publisher: Frontiers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Systematic Y2H screening reveals extensive effector-complex formation
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 10
year: '2019'
...
---
_id: '6466'
abstract:
- lang: eng
text: "One of the most striking and consistent results in speciation genomics is
the heterogeneous divergence observed across the genomes of closely related species.
This pattern was initially attributed to different levels of gene exchange—with
divergence preserved at loci generating a barrier to gene flow but homogenized
at unlinked neutral loci. Although there is evidence to support this model, it
is now recognized that interpreting patterns of divergence across genomes is not
so straightforward. One \r\nproblem is that heterogenous divergence between populations
can also be generated by other processes (e.g. recurrent selective sweeps or background
selection) without any involvement of differential gene flow. Thus, integrated
studies that identify which loci are likely subject to divergent selection are
required to shed light on the interplay between selection and gene flow during
the early phases of speciation. In this issue of Molecular Ecology, Rifkin et
al. (2019) confront this challenge using a pair of sister morning glory species.
They wisely design their sampling to take the geographic context of individuals
into account, including geographically isolated (allopatric) and co‐occurring
(sympatric) populations. This enabled them to show that individuals are phenotypically
less differentiated in sympatry. They also found that the loci that resist introgression
are enriched for those most differentiated in allopatry and loci that exhibit
signals of divergent selection. One great strength of the \r\nstudy is the combination
of methods from population genetics and molecular evolution, including the development
of a model to simultaneously infer admixture proportions and selfing rates."
article_processing_charge: No
author:
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
citation:
ama: Field D, Fraisse C. Breaking down barriers in morning glories. Molecular
ecology. 2019;28(7):1579-1581. doi:10.1111/mec.15048
apa: Field, D., & Fraisse, C. (2019). Breaking down barriers in morning glories.
Molecular Ecology. Wiley. https://doi.org/10.1111/mec.15048
chicago: Field, David, and Christelle Fraisse. “Breaking down Barriers in Morning
Glories.” Molecular Ecology. Wiley, 2019. https://doi.org/10.1111/mec.15048.
ieee: D. Field and C. Fraisse, “Breaking down barriers in morning glories,” Molecular
ecology, vol. 28, no. 7. Wiley, pp. 1579–1581, 2019.
ista: Field D, Fraisse C. 2019. Breaking down barriers in morning glories. Molecular
ecology. 28(7), 1579–1581.
mla: Field, David, and Christelle Fraisse. “Breaking down Barriers in Morning Glories.”
Molecular Ecology, vol. 28, no. 7, Wiley, 2019, pp. 1579–81, doi:10.1111/mec.15048.
short: D. Field, C. Fraisse, Molecular Ecology 28 (2019) 1579–1581.
date_created: 2019-05-19T21:59:15Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2026-04-16T08:33:17Z
day: '01'
ddc:
- '580'
- '576'
department:
- _id: NiBa
doi: 10.1111/mec.15048
external_id:
isi:
- '000474808300001'
file:
- access_level: open_access
checksum: 521e3aff3e9263ddf2ffbfe0b6157715
content_type: application/pdf
creator: dernst
date_created: 2019-05-20T11:49:06Z
date_updated: 2020-07-14T12:47:31Z
file_id: '6472'
file_name: 2019_MolecularEcology_Field.pdf
file_size: 367711
relation: main_file
file_date_updated: 2020-07-14T12:47:31Z
has_accepted_license: '1'
intvolume: ' 28'
isi: 1
issue: '7'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 1579-1581
publication: Molecular ecology
publication_identifier:
eissn:
- 1365-294X
issn:
- 0962-1083
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Breaking down barriers in morning glories
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 28
year: '2019'
...
---
_id: '6575'
abstract:
- lang: eng
text: Motivated by recent experimental observations of coherent many-body revivals
in a constrained Rydbergatom chain, we construct a weak quasilocal deformation
of the Rydberg-blockaded Hamiltonian, whichmakes the revivals virtually perfect.
Our analysis suggests the existence of an underlying nonintegrableHamiltonian
which supports an emergent SU(2)-spin dynamics within a small subspace of the
many-bodyHilbert space. We show that such perfect dynamics necessitates the existence
of atypical, nonergodicenergy eigenstates—quantum many-body scars. Furthermore,
using these insights, we construct a toymodel that hosts exact quantum many-body
scars, providing an intuitive explanation of their origin. Ourresults offer specific
routes to enhancing coherent many-body revivals and provide a step towardestablishing
the stability of quantum many-body scars in the thermodynamic limit.
article_number: '220603'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Soonwon
full_name: Choi, Soonwon
last_name: Choi
- first_name: Christopher J.
full_name: Turner, Christopher J.
last_name: Turner
- first_name: Hannes
full_name: Pichler, Hannes
last_name: Pichler
- first_name: Wen Wei
full_name: Ho, Wen Wei
last_name: Ho
- first_name: Alexios
full_name: Michailidis, Alexios
id: 36EBAD38-F248-11E8-B48F-1D18A9856A87
last_name: Michailidis
orcid: 0000-0002-8443-1064
- first_name: Zlatko
full_name: Papić, Zlatko
last_name: Papić
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Mikhail D.
full_name: Lukin, Mikhail D.
last_name: Lukin
- first_name: Dmitry A.
full_name: Abanin, Dmitry A.
last_name: Abanin
citation:
ama: Choi S, Turner CJ, Pichler H, et al. Emergent SU(2) dynamics and perfect quantum
many-body scars. Physical Review Letters. 2019;122(22). doi:10.1103/PhysRevLett.122.220603
apa: Choi, S., Turner, C. J., Pichler, H., Ho, W. W., Michailidis, A., Papić, Z.,
… Abanin, D. A. (2019). Emergent SU(2) dynamics and perfect quantum many-body
scars. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.122.220603
chicago: Choi, Soonwon, Christopher J. Turner, Hannes Pichler, Wen Wei Ho, Alexios
Michailidis, Zlatko Papić, Maksym Serbyn, Mikhail D. Lukin, and Dmitry A. Abanin.
“Emergent SU(2) Dynamics and Perfect Quantum Many-Body Scars.” Physical Review
Letters. American Physical Society, 2019. https://doi.org/10.1103/PhysRevLett.122.220603.
ieee: S. Choi et al., “Emergent SU(2) dynamics and perfect quantum many-body
scars,” Physical Review Letters, vol. 122, no. 22. American Physical Society,
2019.
ista: Choi S, Turner CJ, Pichler H, Ho WW, Michailidis A, Papić Z, Serbyn M, Lukin
MD, Abanin DA. 2019. Emergent SU(2) dynamics and perfect quantum many-body scars.
Physical Review Letters. 122(22), 220603.
mla: Choi, Soonwon, et al. “Emergent SU(2) Dynamics and Perfect Quantum Many-Body
Scars.” Physical Review Letters, vol. 122, no. 22, 220603, American Physical
Society, 2019, doi:10.1103/PhysRevLett.122.220603.
short: S. Choi, C.J. Turner, H. Pichler, W.W. Ho, A. Michailidis, Z. Papić, M. Serbyn,
M.D. Lukin, D.A. Abanin, Physical Review Letters 122 (2019).
date_created: 2019-06-23T21:59:13Z
date_published: 2019-06-07T00:00:00Z
date_updated: 2026-04-16T08:33:54Z
day: '07'
department:
- _id: MaSe
doi: 10.1103/PhysRevLett.122.220603
external_id:
arxiv:
- '1812.05561'
isi:
- '000470885800005'
intvolume: ' 122'
isi: 1
issue: '22'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1812.05561
month: '06'
oa: 1
oa_version: Preprint
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Emergent SU(2) dynamics and perfect quantum many-body scars
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 122
year: '2019'
...
---
OA_place: publisher
_id: '6473'
abstract:
- lang: eng
text: "Single cells are constantly interacting with their environment and each other,
more importantly, the accurate perception of environmental cues is crucial for
growth, survival, and reproduction. This communication between cells and their
environment can be formalized in mathematical terms and be quantified as the information
flow between them, as prescribed by information theory. \r\nThe recent availability
of real–time dynamical patterns of signaling molecules in single cells has allowed
us to identify encoding about the identity of the environment in the time–series.
However, efficient estimation of the information transmitted by these signals
has been a data–analysis challenge due to the high dimensionality of the trajectories
and the limited number of samples. In the first part of this thesis, we develop
and evaluate decoding–based estimation methods to lower bound the mutual information
and derive model–based precise information estimates for biological reaction networks
governed by the chemical master equation. This is followed by applying the decoding-based
methods to study the intracellular representation of extracellular changes in
budding yeast, by observing the transient dynamics of nuclear translocation of
10 transcription factors in response to 3 stress conditions. Additionally, we
apply these estimators to previously published data on ERK and Ca2+ signaling
and yeast stress response. We argue that this single cell decoding-based measure
of information provides an unbiased, quantitative and interpretable measure for
the fidelity of biological signaling processes. \r\nFinally, in the last section,
we deal with gene regulation which is primarily controlled by transcription factors
(TFs) that bind to the DNA to activate gene expression. The possibility that non-cognate
TFs activate transcription diminishes the accuracy of regulation with potentially
disastrous effects for the cell. This ’crosstalk’ acts as a previously unexplored
source of noise in biochemical networks and puts a strong constraint on their
performance. To mitigate erroneous initiation we propose an out of equilibrium
scheme that implements kinetic proofreading. We show that such architectures are
favored over their equilibrium counterparts for complex organisms despite introducing
noise in gene expression. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Sarah A
full_name: Cepeda Humerez, Sarah A
id: 3DEE19A4-F248-11E8-B48F-1D18A9856A87
last_name: Cepeda Humerez
citation:
ama: Cepeda Humerez SA. Estimating information flow in single cells. 2019. doi:10.15479/AT:ISTA:6473
apa: Cepeda Humerez, S. A. (2019). Estimating information flow in single cells.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6473
chicago: Cepeda Humerez, Sarah A. “Estimating Information Flow in Single Cells.”
Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6473.
ieee: S. A. Cepeda Humerez, “Estimating information flow in single cells,” Institute
of Science and Technology Austria, 2019.
ista: Cepeda Humerez SA. 2019. Estimating information flow in single cells. Institute
of Science and Technology Austria.
mla: Cepeda Humerez, Sarah A. Estimating Information Flow in Single Cells.
Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6473.
short: S.A. Cepeda Humerez, Estimating Information Flow in Single Cells, Institute
of Science and Technology Austria, 2019.
corr_author: '1'
date_created: 2019-05-21T00:11:23Z
date_published: 2019-05-23T00:00:00Z
date_updated: 2026-04-16T08:37:38Z
day: '23'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: GaTk
doi: 10.15479/AT:ISTA:6473
file:
- access_level: closed
checksum: 75f9184c1346e10a5de5f9cc7338309a
content_type: application/zip
creator: scepeda
date_created: 2019-05-23T11:18:16Z
date_updated: 2020-07-14T12:47:31Z
file_id: '6480'
file_name: Thesis_Cepeda.zip
file_size: 23937464
relation: source_file
- access_level: open_access
checksum: afdc0633ddbd71d5b13550d7fb4f4454
content_type: application/pdf
creator: scepeda
date_created: 2019-05-23T11:18:13Z
date_updated: 2020-07-14T12:47:31Z
file_id: '6481'
file_name: CepedaThesis.pdf
file_size: 16646985
relation: main_file
file_date_updated: 2020-07-14T12:47:31Z
has_accepted_license: '1'
keyword:
- Information estimation
- Time-series
- data analysis
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '135'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '2016'
relation: dissertation_contains
status: public
- id: '281'
relation: dissertation_contains
status: public
- id: '1576'
relation: dissertation_contains
status: public
- id: '6900'
relation: dissertation_contains
status: public
status: public
supervisor:
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
title: Estimating information flow in single cells
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2019'
...
---
_id: '6900'
abstract:
- lang: eng
text: Across diverse biological systems—ranging from neural networks to intracellular
signaling and genetic regulatory networks—the information about changes in the
environment is frequently encoded in the full temporal dynamics of the network
nodes. A pressing data-analysis challenge has thus been to efficiently estimate
the amount of information that these dynamics convey from experimental data. Here
we develop and evaluate decoding-based estimation methods to lower bound the mutual
information about a finite set of inputs, encoded in single-cell high-dimensional
time series data. For biological reaction networks governed by the chemical Master
equation, we derive model-based information approximations and analytical upper
bounds, against which we benchmark our proposed model-free decoding estimators.
In contrast to the frequently-used k-nearest-neighbor estimator, decoding-based
estimators robustly extract a large fraction of the available information from
high-dimensional trajectories with a realistic number of data samples. We apply
these estimators to previously published data on Erk and Ca2+ signaling in mammalian
cells and to yeast stress-response, and find that substantial amount of information
about environmental state can be encoded by non-trivial response statistics even
in stationary signals. We argue that these single-cell, decoding-based information
estimates, rather than the commonly-used tests for significant differences between
selected population response statistics, provide a proper and unbiased measure
for the performance of biological signaling networks.
article_processing_charge: No
author:
- first_name: Sarah A
full_name: Cepeda Humerez, Sarah A
id: 3DEE19A4-F248-11E8-B48F-1D18A9856A87
last_name: Cepeda Humerez
- first_name: Jakob
full_name: Ruess, Jakob
last_name: Ruess
orcid: 0000-0003-1615-3282
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: Cepeda Humerez SA, Ruess J, Tkačik G. Estimating information in time-varying
signals. PLoS computational biology. 2019;15(9):e1007290. doi:10.1371/journal.pcbi.1007290
apa: Cepeda Humerez, S. A., Ruess, J., & Tkačik, G. (2019). Estimating information
in time-varying signals. PLoS Computational Biology. Public Library of
Science. https://doi.org/10.1371/journal.pcbi.1007290
chicago: Cepeda Humerez, Sarah A, Jakob Ruess, and Gašper Tkačik. “Estimating Information
in Time-Varying Signals.” PLoS Computational Biology. Public Library of
Science, 2019. https://doi.org/10.1371/journal.pcbi.1007290.
ieee: S. A. Cepeda Humerez, J. Ruess, and G. Tkačik, “Estimating information in
time-varying signals,” PLoS computational biology, vol. 15, no. 9. Public
Library of Science, p. e1007290, 2019.
ista: Cepeda Humerez SA, Ruess J, Tkačik G. 2019. Estimating information in time-varying
signals. PLoS computational biology. 15(9), e1007290.
mla: Cepeda Humerez, Sarah A., et al. “Estimating Information in Time-Varying Signals.”
PLoS Computational Biology, vol. 15, no. 9, Public Library of Science,
2019, p. e1007290, doi:10.1371/journal.pcbi.1007290.
short: S.A. Cepeda Humerez, J. Ruess, G. Tkačik, PLoS Computational Biology 15 (2019)
e1007290.
date_created: 2019-09-22T22:00:37Z
date_published: 2019-09-03T00:00:00Z
date_updated: 2026-04-16T08:37:39Z
day: '03'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1007290
external_id:
isi:
- '000489741800021'
pmid:
- '31479447'
file:
- access_level: open_access
checksum: 81bdce1361c9aa8395d6fa635fb6ab47
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T10:53:45Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6925'
file_name: 2019_PLoS_Cepeda-Humerez.pdf
file_size: 3081855
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: e1007290
pmid: 1
project:
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
publication: PLoS computational biology
publication_identifier:
eissn:
- 1553-7358
issn:
- 1553-734X
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
record:
- id: '6473'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: Estimating information in time-varying signals
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 15
year: '2019'
...
---
_id: '7214'
abstract:
- lang: eng
text: "Background: Many cancer genomes are extensively rearranged with highly aberrant
chromosomal karyotypes. Structural and copy number variations in cancer genomes
can be determined via abnormal mapping of sequenced reads to the reference genome.
Recently it became possible to reconcile both of these types of large-scale variations
into a karyotype graph representation of the rearranged cancer genomes. Such a
representation, however, does not directly describe the linear and/or circular
structure of the underlying rearranged cancer chromosomes, thus limiting possible
analysis of cancer genomes somatic evolutionary process as well as functional
genomic changes brought by the large-scale genome rearrangements.\r\n\r\nResults:
Here we address the aforementioned limitation by introducing a novel methodological
framework for recovering rearranged cancer chromosomes from karyotype graphs.
For a cancer karyotype graph we formulate an Eulerian Decomposition Problem (EDP)
of finding a collection of linear and/or circular rearranged cancer chromosomes
that are determined by the graph. We derive and prove computational complexities
for several variations of the EDP. We then demonstrate that Eulerian decomposition
of the cancer karyotype graphs is not always unique and present the Consistent
Contig Covering Problem (CCCP) of recovering unambiguous cancer contigs from the
cancer karyotype graph, and describe a novel algorithm CCR capable of solving
CCCP in polynomial time. We apply CCR on a prostate cancer dataset and demonstrate
that it is capable of consistently recovering large cancer contigs even when underlying
cancer genomes are highly rearranged.\r\n\r\nConclusions: CCR can recover rearranged
cancer contigs from karyotype graphs thereby addressing existing limitation in
inferring chromosomal structures of rearranged cancer genomes and advancing our
understanding of both patient/cancer-specific as well as the overall genetic instability
in cancer."
article_number: '641'
article_processing_charge: No
article_type: original
author:
- first_name: Sergey
full_name: Aganezov, Sergey
last_name: Aganezov
- first_name: Ilya
full_name: Zban, Ilya
last_name: Zban
- first_name: Vitalii
full_name: Aksenov, Vitalii
id: 2980135A-F248-11E8-B48F-1D18A9856A87
last_name: Aksenov
- first_name: Nikita
full_name: Alexeev, Nikita
last_name: Alexeev
- first_name: Michael C.
full_name: Schatz, Michael C.
last_name: Schatz
citation:
ama: Aganezov S, Zban I, Aksenov V, Alexeev N, Schatz MC. Recovering rearranged
cancer chromosomes from karyotype graphs. BMC Bioinformatics. 2019;20.
doi:10.1186/s12859-019-3208-4
apa: Aganezov, S., Zban, I., Aksenov, V., Alexeev, N., & Schatz, M. C. (2019).
Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinformatics.
BMC. https://doi.org/10.1186/s12859-019-3208-4
chicago: Aganezov, Sergey, Ilya Zban, Vitalii Aksenov, Nikita Alexeev, and Michael
C. Schatz. “Recovering Rearranged Cancer Chromosomes from Karyotype Graphs.” BMC
Bioinformatics. BMC, 2019. https://doi.org/10.1186/s12859-019-3208-4.
ieee: S. Aganezov, I. Zban, V. Aksenov, N. Alexeev, and M. C. Schatz, “Recovering
rearranged cancer chromosomes from karyotype graphs,” BMC Bioinformatics,
vol. 20. BMC, 2019.
ista: Aganezov S, Zban I, Aksenov V, Alexeev N, Schatz MC. 2019. Recovering rearranged
cancer chromosomes from karyotype graphs. BMC Bioinformatics. 20, 641.
mla: Aganezov, Sergey, et al. “Recovering Rearranged Cancer Chromosomes from Karyotype
Graphs.” BMC Bioinformatics, vol. 20, 641, BMC, 2019, doi:10.1186/s12859-019-3208-4.
short: S. Aganezov, I. Zban, V. Aksenov, N. Alexeev, M.C. Schatz, BMC Bioinformatics
20 (2019).
date_created: 2019-12-29T23:00:46Z
date_published: 2019-12-17T00:00:00Z
date_updated: 2026-04-16T08:35:00Z
day: '17'
ddc:
- '570'
department:
- _id: DaAl
doi: 10.1186/s12859-019-3208-4
external_id:
isi:
- '000511618800007'
file:
- access_level: open_access
checksum: 7a30357efdcf8f66587ed495c0927724
content_type: application/pdf
creator: dernst
date_created: 2020-01-02T16:10:58Z
date_updated: 2020-07-14T12:47:54Z
file_id: '7221'
file_name: 2019_BMCBioinfo_Aganezov.pdf
file_size: 1917374
relation: main_file
file_date_updated: 2020-07-14T12:47:54Z
has_accepted_license: '1'
intvolume: ' 20'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: BMC Bioinformatics
publication_identifier:
eissn:
- 1471-2105
publication_status: published
publisher: BMC
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recovering rearranged cancer chromosomes from karyotype graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 20
year: '2019'
...
---
_id: '6989'
abstract:
- lang: eng
text: 'When can a polyomino piece of paper be folded into a unit cube? Prior work
studied tree-like polyominoes, but polyominoes with holes remain an intriguing
open problem. We present sufficient conditions for a polyomino with hole(s) to
fold into a cube, and conditions under which cube folding is impossible. In particular,
we show that all but five special simple holes guarantee foldability. '
acknowledgement: This research was performed in part at the 33rd Bellairs Winter Workshop
on Computational Geometry. We thank all other participants for a fruitful atmosphere.
article_processing_charge: No
arxiv: 1
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Hugo A
full_name: Akitaya, Hugo A
last_name: Akitaya
- first_name: Kenneth C
full_name: Cheung, Kenneth C
last_name: Cheung
- first_name: Erik D
full_name: Demaine, Erik D
last_name: Demaine
- first_name: Martin L
full_name: Demaine, Martin L
last_name: Demaine
- first_name: Sandor P
full_name: Fekete, Sandor P
last_name: Fekete
- first_name: Linda
full_name: Kleist, Linda
last_name: Kleist
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Maarten
full_name: Löffler, Maarten
last_name: Löffler
- 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: Klara
full_name: Mundilova, Klara
last_name: Mundilova
- first_name: Christiane
full_name: Schmidt, Christiane
last_name: Schmidt
citation:
ama: 'Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes
into a cube. In: Proceedings of the 31st Canadian Conference on Computational
Geometry. Canadian Conference on Computational Geometry; 2019:164-170.'
apa: 'Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M.
L., Fekete, S. P., … Schmidt, C. (2019). Folding polyominoes with holes into a
cube. In Proceedings of the 31st Canadian Conference on Computational Geometry
(pp. 164–170). Edmonton, Canada: Canadian Conference on Computational Geometry.'
chicago: Aichholzer, Oswin, Hugo A Akitaya, Kenneth C Cheung, Erik D Demaine, Martin
L Demaine, Sandor P Fekete, Linda Kleist, et al. “Folding Polyominoes with Holes
into a Cube.” In Proceedings of the 31st Canadian Conference on Computational
Geometry, 164–70. Canadian Conference on Computational Geometry, 2019.
ieee: O. Aichholzer et al., “Folding polyominoes with holes into a cube,”
in Proceedings of the 31st Canadian Conference on Computational Geometry,
Edmonton, Canada, 2019, pp. 164–170.
ista: 'Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist
L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2019. Folding
polyominoes with holes into a cube. Proceedings of the 31st Canadian Conference
on Computational Geometry. CCCG: Canadian Conference in Computational Geometry,
164–170.'
mla: Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” Proceedings
of the 31st Canadian Conference on Computational Geometry, Canadian Conference
on Computational Geometry, 2019, pp. 164–70.
short: O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P.
Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt,
in:, Proceedings of the 31st Canadian Conference on Computational Geometry, Canadian
Conference on Computational Geometry, 2019, pp. 164–170.
conference:
end_date: 2019-08-10
location: Edmonton, Canada
name: 'CCCG: Canadian Conference in Computational Geometry'
start_date: 2019-08-08
date_created: 2019-11-04T16:46:11Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2026-04-16T09:14:30Z
day: '01'
department:
- _id: HeEd
external_id:
arxiv:
- '1910.09917'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://sites.ualberta.ca/~cccg2019/cccg2019_proceedings.pdf
month: '08'
oa: 1
oa_version: Published Version
page: 164-170
publication: Proceedings of the 31st Canadian Conference on Computational Geometry
publication_status: published
publisher: Canadian Conference on Computational Geometry
quality_controlled: '1'
related_material:
record:
- id: '8317'
relation: extended_version
status: public
scopus_import: '1'
status: public
title: Folding polyominoes with holes into a cube
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6352'
abstract:
- lang: eng
text: Chronic overuse of common pharmaceuticals, e.g. acetaminophen (paracetamol),
often leads to the development of acute liver failure (ALF). This study aimed
to elucidate the effect of cultured mesenchymal stem cells (MSCs) proteome on
the onset of liver damage and regeneration dynamics in animals with ALF induced
by acetaminophen, to test the liver protective efficacy of MSCs proteome depending
on the oxygen tension in cell culture, and to blueprint protein components responsible
for the effect. Protein compositions prepared from MSCs cultured in mild hypoxic
(5% and 10% O2) and normal (21% O2) conditions were used to treat ALF induced
in mice by injection of acetaminophen. To test the effect of reduced oxygen tension
in cell culture on resulting MSCs proteome content we applied a combination of
high performance liquid chromatography and mass-spectrometry (LC–MS/MS) for the
identification of proteins in lysates of MSCs cultured at different O2 levels.
The treatment of acetaminophen-administered animals with proteins released from
cultured MSCs resulted in the inhibition of inflammatory reactions in damaged
liver; the area of hepatocyte necrosis being reduced in the first 24 h. Compositions
obtained from MSCs cultured at lower O2 level were shown to be more potent than
a composition prepared from normoxic cells. A comparative characterization of
protein pattern and identification of individual components done by a cytokine
assay and proteomics analysis of protein compositions revealed that even moderate
hypoxia produces discrete changes in the expression of various subsets of proteins
responsible for intracellular respiration and cell signaling. The application
of proteins prepared from MSCs grown in vitro at reduced oxygen tension significantly
accelerates healing process in damaged liver tissue. The proteomics data obtained
for different preparations offer new information about the potential candidates
in the MSCs protein repertoire sensitive to oxygen tension in culture medium,
which can be involved in the generalized mechanisms the cells use to respond to
acute liver failure.
acknowledgement: The studies were supported by the Austrian Federal Ministry of Economy,
Family and Youth through the initiative “Laura Bassi Centres of Expertise” funding
the Center of Optimized Structural Stud-ies, grant No. 253275
article_processing_charge: Yes (via OA deal)
author:
- first_name: Andrey Alexandrovich
full_name: Temnov, Andrey Alexandrovich
last_name: Temnov
- first_name: Konstantin Arkadevich
full_name: Rogov, Konstantin Arkadevich
last_name: Rogov
- first_name: Alla Nikolaevna
full_name: Sklifas, Alla Nikolaevna
last_name: Sklifas
- first_name: Elena Valerievna
full_name: Klychnikova, Elena Valerievna
last_name: Klychnikova
- first_name: Markus
full_name: Hartl, Markus
last_name: Hartl
- first_name: Kristina
full_name: Djinovic-Carugo, Kristina
last_name: Djinovic-Carugo
- first_name: Alexej
full_name: Charnagalov, Alexej
id: 49F06DBA-F248-11E8-B48F-1D18A9856A87
last_name: Charnagalov
citation:
ama: Temnov AA, Rogov KA, Sklifas AN, et al. Protective properties of the cultured
stem cell proteome studied in an animal model of acetaminophen-induced acute liver
failure. Molecular Biology Reports. 2019. doi:10.1007/s11033-019-04765-z
apa: Temnov, A. A., Rogov, K. A., Sklifas, A. N., Klychnikova, E. V., Hartl, M.,
Djinovic-Carugo, K., & Charnagalov, A. (2019). Protective properties of the
cultured stem cell proteome studied in an animal model of acetaminophen-induced
acute liver failure. Molecular Biology Reports. Springer. https://doi.org/10.1007/s11033-019-04765-z
chicago: Temnov, Andrey Alexandrovich, Konstantin Arkadevich Rogov, Alla Nikolaevna
Sklifas, Elena Valerievna Klychnikova, Markus Hartl, Kristina Djinovic-Carugo,
and Alexej Charnagalov. “Protective Properties of the Cultured Stem Cell Proteome
Studied in an Animal Model of Acetaminophen-Induced Acute Liver Failure.” Molecular
Biology Reports. Springer, 2019. https://doi.org/10.1007/s11033-019-04765-z.
ieee: A. A. Temnov et al., “Protective properties of the cultured stem cell
proteome studied in an animal model of acetaminophen-induced acute liver failure,”
Molecular Biology Reports. Springer, 2019.
ista: Temnov AA, Rogov KA, Sklifas AN, Klychnikova EV, Hartl M, Djinovic-Carugo
K, Charnagalov A. 2019. Protective properties of the cultured stem cell proteome
studied in an animal model of acetaminophen-induced acute liver failure. Molecular
Biology Reports.
mla: Temnov, Andrey Alexandrovich, et al. “Protective Properties of the Cultured
Stem Cell Proteome Studied in an Animal Model of Acetaminophen-Induced Acute Liver
Failure.” Molecular Biology Reports, Springer, 2019, doi:10.1007/s11033-019-04765-z.
short: A.A. Temnov, K.A. Rogov, A.N. Sklifas, E.V. Klychnikova, M. Hartl, K. Djinovic-Carugo,
A. Charnagalov, Molecular Biology Reports (2019).
corr_author: '1'
date_created: 2019-04-28T21:59:14Z
date_published: 2019-04-12T00:00:00Z
date_updated: 2026-04-16T09:49:11Z
day: '12'
ddc:
- '570'
department:
- _id: LeSa
doi: 10.1007/s11033-019-04765-z
external_id:
isi:
- '000470332600049'
file:
- access_level: open_access
checksum: 45bf040bbce1cea274f6013fa18ba21b
content_type: application/pdf
creator: dernst
date_created: 2019-04-30T09:52:36Z
date_updated: 2020-07-14T12:47:28Z
file_id: '6362'
file_name: 2019_MolecularBioReport_Temnov.pdf
file_size: 1948014
relation: main_file
file_date_updated: 2020-07-14T12:47:28Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: Molecular Biology Reports
publication_identifier:
eissn:
- 1573-4978
issn:
- 0301-4851
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Protective properties of the cultured stem cell proteome studied in an animal
model of acetaminophen-induced acute liver failure
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2019'
...
---
_id: '7183'
abstract:
- lang: eng
text: 'A probabilistic vector addition system with states (pVASS) is a finite state
Markov process augmented with non-negative integer counters that can be incremented
or decremented during each state transition, blocking any behaviour that would
cause a counter to decrease below zero. The pVASS can be used as abstractions
of probabilistic programs with many decidable properties. The use of pVASS as
abstractions requires the presence of nondeterminism in the model. In this paper,
we develop techniques for checking fast termination of pVASS with nondeterminism.
That is, for every initial configuration of size n, we consider the worst expected
number of transitions needed to reach a configuration with some counter negative
(the expected termination time). We show that the problem whether the asymptotic
expected termination time is linear is decidable in polynomial time for a certain
natural class of pVASS with nondeterminism. Furthermore, we show the following
dichotomy: if the asymptotic expected termination time is not linear, then it
is at least quadratic, i.e., in Ω(n2).'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Tomás
full_name: Brázdil, Tomás
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Antonín
full_name: Kucera, Antonín
last_name: Kucera
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Dominik
full_name: Velan, Dominik
last_name: Velan
citation:
ama: 'Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. Deciding fast termination
for probabilistic VASS with nondeterminism. In: International Symposium on
Automated Technology for Verification and Analysis. Vol 11781. Springer Nature;
2019:462-478. doi:10.1007/978-3-030-31784-3_27'
apa: 'Brázdil, T., Chatterjee, K., Kucera, A., Novotný, P., & Velan, D. (2019).
Deciding fast termination for probabilistic VASS with nondeterminism. In International
Symposium on Automated Technology for Verification and Analysis (Vol. 11781,
pp. 462–478). Taipei, Taiwan: Springer Nature. https://doi.org/10.1007/978-3-030-31784-3_27'
chicago: Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, and
Dominik Velan. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.”
In International Symposium on Automated Technology for Verification and Analysis,
11781:462–78. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-31784-3_27.
ieee: T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, and D. Velan, “Deciding
fast termination for probabilistic VASS with nondeterminism,” in International
Symposium on Automated Technology for Verification and Analysis, Taipei, Taiwan,
2019, vol. 11781, pp. 462–478.
ista: 'Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. 2019. Deciding fast
termination for probabilistic VASS with nondeterminism. International Symposium
on Automated Technology for Verification and Analysis. ATVA: Automated TEchnology
for Verification and Analysis, LNCS, vol. 11781, 462–478.'
mla: Brázdil, Tomás, et al. “Deciding Fast Termination for Probabilistic VASS with
Nondeterminism.” International Symposium on Automated Technology for Verification
and Analysis, vol. 11781, Springer Nature, 2019, pp. 462–78, doi:10.1007/978-3-030-31784-3_27.
short: T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, D. Velan, in:, International
Symposium on Automated Technology for Verification and Analysis, Springer Nature,
2019, pp. 462–478.
conference:
end_date: 2019-10-31
location: Taipei, Taiwan
name: 'ATVA: Automated TEchnology for Verification and Analysis'
start_date: 2019-10-28
date_created: 2019-12-15T23:00:44Z
date_published: 2019-10-21T00:00:00Z
date_updated: 2026-04-16T09:51:24Z
day: '21'
department:
- _id: KrCh
doi: 10.1007/978-3-030-31784-3_27
external_id:
arxiv:
- '1907.11010'
isi:
- '000723515700027'
intvolume: ' 11781'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1907.11010
month: '10'
oa: 1
oa_version: Preprint
page: 462-478
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: International Symposium on Automated Technology for Verification and
Analysis
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030317836'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Deciding fast termination for probabilistic VASS with nondeterminism
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 11781
year: '2019'
...
---
OA_place: publisher
OA_type: free access
_id: '5830'
abstract:
- lang: eng
text: CLE peptides have been implicated in various developmental processes of plants
and mediate their responses to environmental stimuli. However, the biological
relevance of most CLE genes remains to be functionally characterized. Here, we
report that CLE9, which is expressed in stomata, acts as an essential regulator
in the induction of stomatal closure. Exogenous application of CLE9 peptides or
overexpression of CLE9 effectively led to stomatal closure and enhanced drought
tolerance, whereas CLE9 loss-of-function mutants were sensitivity to drought stress.
CLE9-induced stomatal closure was impaired in abscisic acid (ABA)-deficient mutants,
indicating that ABA is required for CLE9-medaited guard cell signalling. We further
deciphered that two guard cell ABA-signalling components, OST1 and SLAC1, were
responsible for CLE9-induced stomatal closure. MPK3 and MPK6 were activated by
the CLE9 peptide, and CLE9 peptides failed to close stomata in mpk3 and mpk6 mutants.
In addition, CLE9 peptides stimulated the induction of hydrogen peroxide (H2O2)
and nitric oxide (NO) synthesis associated with stomatal closure, which was abolished
in the NADPH oxidase-deficient mutants or nitric reductase mutants, respectively.
Collectively, our results reveal a novel ABA-dependent function of CLE9 in the
regulation of stomatal apertures, thereby suggesting a potential role of CLE9
in the stress acclimatization of plants.
acknowledgement: We thank Drs. Juan Xu, Yongfeng Guo, and Annie Marion-Poll for sharing
materials. We are grateful to Profs. Xiaoping She for helpful discussion and Zhezhi
Wang for his generosity in providing laboratory facilities. The study is supported
by the National Natural Science Foundation of China (31771556, 31271575, and 31200902
to G. W.), by the 100-Talent Program of Shaanxi Province (to G. W.), by the Fundamental
Research Funds for the Central Universities (GK201702016 to G. W.; GK201603110 to
L. C.), partly by the open funds of the State Key Laboratory of Plant Physiology
and Biochemistry (SKLPPBKF1805), and by the Initial Project for Post-Graduates of
Hubei University of Medicine (2016QDJZR14 to Y. Z.).
article_processing_charge: No
article_type: original
author:
- first_name: Luosha
full_name: Zhang, Luosha
last_name: Zhang
- first_name: Xiong
full_name: Shi, Xiong
last_name: Shi
- first_name: Yutao
full_name: Zhang, Yutao
last_name: Zhang
- first_name: Jiajing
full_name: Wang, Jiajing
last_name: Wang
- first_name: Jingwei
full_name: Yang, Jingwei
last_name: Yang
- first_name: Takashi
full_name: Ishida, Takashi
last_name: Ishida
- first_name: Wenqian
full_name: Jiang, Wenqian
last_name: Jiang
- first_name: Xiangyu
full_name: Han, Xiangyu
last_name: Han
- first_name: Jingke
full_name: Kang, Jingke
last_name: Kang
- first_name: Xuening
full_name: Wang, Xuening
last_name: Wang
- first_name: Lixia
full_name: Pan, Lixia
last_name: Pan
- first_name: Shuo
full_name: Lv, Shuo
last_name: Lv
- first_name: Bing
full_name: Cao, Bing
last_name: Cao
- first_name: Yonghong
full_name: Zhang, Yonghong
last_name: Zhang
- first_name: Jinbin
full_name: Wu, Jinbin
last_name: Wu
- first_name: Huibin
full_name: Han, Huibin
id: 31435098-F248-11E8-B48F-1D18A9856A87
last_name: Han
- first_name: Zhubing
full_name: Hu, Zhubing
last_name: Hu
- first_name: Langjun
full_name: Cui, Langjun
last_name: Cui
- first_name: Shinichiro
full_name: Sawa, Shinichiro
last_name: Sawa
- first_name: Junmin
full_name: He, Junmin
last_name: He
- first_name: Guodong
full_name: Wang, Guodong
last_name: Wang
citation:
ama: Zhang L, Shi X, Zhang Y, et al. CLE9 peptide-induced stomatal closure is mediated
by abscisic acid, hydrogen peroxide, and nitric oxide in arabidopsis thaliana.
Plant Cell and Environment. 2019;42(3):1033-1044. doi:10.1111/pce.13475
apa: Zhang, L., Shi, X., Zhang, Y., Wang, J., Yang, J., Ishida, T., … Wang, G. (2019).
CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen peroxide,
and nitric oxide in arabidopsis thaliana. Plant Cell and Environment. Wiley.
https://doi.org/10.1111/pce.13475
chicago: Zhang, Luosha, Xiong Shi, Yutao Zhang, Jiajing Wang, Jingwei Yang, Takashi
Ishida, Wenqian Jiang, et al. “CLE9 Peptide-Induced Stomatal Closure Is Mediated
by Abscisic Acid, Hydrogen Peroxide, and Nitric Oxide in Arabidopsis Thaliana.”
Plant Cell and Environment. Wiley, 2019. https://doi.org/10.1111/pce.13475.
ieee: L. Zhang et al., “CLE9 peptide-induced stomatal closure is mediated
by abscisic acid, hydrogen peroxide, and nitric oxide in arabidopsis thaliana,”
Plant Cell and Environment, vol. 42, no. 3. Wiley, pp. 1033–1044, 2019.
ista: Zhang L, Shi X, Zhang Y, Wang J, Yang J, Ishida T, Jiang W, Han X, Kang J,
Wang X, Pan L, Lv S, Cao B, Zhang Y, Wu J, Han H, Hu Z, Cui L, Sawa S, He J, Wang
G. 2019. CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen
peroxide, and nitric oxide in arabidopsis thaliana. Plant Cell and Environment.
42(3), 1033–1044.
mla: Zhang, Luosha, et al. “CLE9 Peptide-Induced Stomatal Closure Is Mediated by
Abscisic Acid, Hydrogen Peroxide, and Nitric Oxide in Arabidopsis Thaliana.” Plant
Cell and Environment, vol. 42, no. 3, Wiley, 2019, pp. 1033–44, doi:10.1111/pce.13475.
short: L. Zhang, X. Shi, Y. Zhang, J. Wang, J. Yang, T. Ishida, W. Jiang, X. Han,
J. Kang, X. Wang, L. Pan, S. Lv, B. Cao, Y. Zhang, J. Wu, H. Han, Z. Hu, L. Cui,
S. Sawa, J. He, G. Wang, Plant Cell and Environment 42 (2019) 1033–1044.
date_created: 2019-01-13T22:59:11Z
date_published: 2019-03-01T00:00:00Z
date_updated: 2026-04-16T09:47:37Z
day: '01'
department:
- _id: JiFr
doi: 10.1111/pce.13475
external_id:
isi:
- '000459014800021'
pmid:
- '30378140'
intvolume: ' 42'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/30378140
month: '03'
oa: 1
oa_version: Published Version
page: 1033-1044
pmid: 1
publication: Plant Cell and Environment
publication_identifier:
issn:
- 0140-7791
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen
peroxide, and nitric oxide in arabidopsis thaliana
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 42
year: '2019'
...
---
_id: '5911'
abstract:
- lang: eng
text: Empirical data suggest that inversions in many species contain genes important
for intraspecific divergence and speciation, yet mechanisms of evolution remain
unclear. While genes inside an inversion are tightly linked, inversions are not
static but evolve separately from the rest of the genome by new mutations, recombination
within arrangements, and gene flux between arrangements. Inversion polymorphisms
are maintained by different processes, for example, divergent or balancing selection,
or a mix of multiple processes. Moreover, the relative roles of selection, drift,
mutation, and recombination will change over the lifetime of an inversion and
within its area of distribution. We believe inversions are central to the evolution
of many species, but we need many more data and new models to understand the complex
mechanisms involved.
article_processing_charge: No
article_type: original
author:
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
citation:
ama: Faria R, Johannesson K, Butlin RK, Westram AM. Evolving inversions. Trends
in Ecology and Evolution. 2019;34(3):239-248. doi:10.1016/j.tree.2018.12.005
apa: Faria, R., Johannesson, K., Butlin, R. K., & Westram, A. M. (2019). Evolving
inversions. Trends in Ecology and Evolution. Elsevier. https://doi.org/10.1016/j.tree.2018.12.005
chicago: Faria, Rui, Kerstin Johannesson, Roger K. Butlin, and Anja M Westram. “Evolving
Inversions.” Trends in Ecology and Evolution. Elsevier, 2019. https://doi.org/10.1016/j.tree.2018.12.005.
ieee: R. Faria, K. Johannesson, R. K. Butlin, and A. M. Westram, “Evolving inversions,”
Trends in Ecology and Evolution, vol. 34, no. 3. Elsevier, pp. 239–248,
2019.
ista: Faria R, Johannesson K, Butlin RK, Westram AM. 2019. Evolving inversions.
Trends in Ecology and Evolution. 34(3), 239–248.
mla: Faria, Rui, et al. “Evolving Inversions.” Trends in Ecology and Evolution,
vol. 34, no. 3, Elsevier, 2019, pp. 239–48, doi:10.1016/j.tree.2018.12.005.
short: R. Faria, K. Johannesson, R.K. Butlin, A.M. Westram, Trends in Ecology and
Evolution 34 (2019) 239–248.
date_created: 2019-02-03T22:59:15Z
date_published: 2019-03-01T00:00:00Z
date_updated: 2026-04-16T09:48:52Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1016/j.tree.2018.12.005
ec_funded: 1
external_id:
isi:
- '000459899000013'
file:
- access_level: open_access
checksum: ef24572d6ebcc1452c067e05410cc4a2
content_type: application/pdf
creator: cziletti
date_created: 2020-01-09T10:55:58Z
date_updated: 2020-07-14T12:47:13Z
file_id: '7245'
file_name: 2019_Trends_Evolution_Faria.pdf
file_size: 1946795
relation: main_file
file_date_updated: 2020-07-14T12:47:13Z
has_accepted_license: '1'
intvolume: ' 34'
isi: 1
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 239-248
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Trends in Ecology and Evolution
publication_identifier:
issn:
- 0169-5347
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolving inversions
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 34
year: '2019'
...
---
_id: '5887'
abstract:
- lang: eng
text: 'Cryptographic security is usually defined as a guarantee that holds except
when a bad event with negligible probability occurs, and nothing is guaranteed
in that bad case. However, in settings where such failure can happen with substantial
probability, one needs to provide guarantees even for the bad case. A typical
example is where a (possibly weak) password is used instead of a secure cryptographic
key to protect a session, the bad event being that the adversary correctly guesses
the password. In a situation with multiple such sessions, a per-session guarantee
is desired: any session for which the password has not been guessed remains secure,
independently of whether other sessions have been compromised. A new formalism
for stating such gracefully degrading security guarantees is introduced and applied
to analyze the examples of password-based message authentication and password-based
encryption. While a natural per-message guarantee is achieved for authentication,
the situation of password-based encryption is more delicate: a per-session confidentiality
guarantee only holds against attackers for which the distribution of password-guessing
effort over the sessions is known in advance. In contrast, for more general attackers
without such a restriction, a strong, composable notion of security cannot be
achieved.'
article_processing_charge: No
article_type: original
author:
- first_name: Gregory
full_name: Demay, Gregory
last_name: Demay
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Ueli
full_name: Maurer, Ueli
last_name: Maurer
- first_name: Bjorn
full_name: Tackmann, Bjorn
last_name: Tackmann
citation:
ama: 'Demay G, Gazi P, Maurer U, Tackmann B. Per-session security: Password-based
cryptography revisited. Journal of Computer Security. 2019;27(1):75-111.
doi:10.3233/JCS-181131'
apa: 'Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2019). Per-session security:
Password-based cryptography revisited. Journal of Computer Security. IOS
Press. https://doi.org/10.3233/JCS-181131'
chicago: 'Demay, Gregory, Peter Gazi, Ueli Maurer, and Bjorn Tackmann. “Per-Session
Security: Password-Based Cryptography Revisited.” Journal of Computer Security.
IOS Press, 2019. https://doi.org/10.3233/JCS-181131.'
ieee: 'G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Per-session security: Password-based
cryptography revisited,” Journal of Computer Security, vol. 27, no. 1.
IOS Press, pp. 75–111, 2019.'
ista: 'Demay G, Gazi P, Maurer U, Tackmann B. 2019. Per-session security: Password-based
cryptography revisited. Journal of Computer Security. 27(1), 75–111.'
mla: 'Demay, Gregory, et al. “Per-Session Security: Password-Based Cryptography
Revisited.” Journal of Computer Security, vol. 27, no. 1, IOS Press, 2019,
pp. 75–111, doi:10.3233/JCS-181131.'
short: G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27
(2019) 75–111.
date_created: 2019-01-27T22:59:10Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2026-04-16T09:48:36Z
day: '01'
department:
- _id: KrPi
doi: 10.3233/JCS-181131
ec_funded: 1
intvolume: ' 27'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/166
month: '01'
oa: 1
oa_version: Preprint
page: 75-111
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Journal of Computer Security
publication_identifier:
issn:
- 0926-227X
publication_status: published
publisher: IOS Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Per-session security: Password-based cryptography revisited'
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 27
year: '2019'
...
---
_id: '6413'
abstract:
- lang: eng
text: Phase-field methods have long been used to model the flow of immiscible fluids.
Their ability to naturally capture interface topological changes is widely recognized,
but their accuracy in simulating flows of real fluids in practical geometries
is not established. We here quantitatively investigate the convergence of the
phase-field method to the sharp-interface limit with simulations of two-phase
pipe flow. We focus on core-annular flows, in which a highly viscous fluid is
lubricated by a less viscous fluid, and validate our simulations with an analytic
laminar solution, a formal linear stability analysis and also in the fully nonlinear
regime. We demonstrate the ability of the phase-field method to accurately deal
with non-rectangular geometry, strong advection, unsteady fluctuations and large
viscosity contrast. We argue that phase-field methods are very promising for quantitatively
studying moderately turbulent flows, especially at high concentrations of the
disperse phase.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Baofang
full_name: Song, Baofang
last_name: Song
- first_name: Carlos
full_name: Plana, Carlos
last_name: Plana
- first_name: Jose M
full_name: Lopez Alonso, Jose M
id: 40770848-F248-11E8-B48F-1D18A9856A87
last_name: Lopez Alonso
orcid: 0000-0002-0384-2022
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
citation:
ama: Song B, Plana C, Lopez Alonso JM, Avila M. Phase-field simulation of core-annular
pipe flow. International Journal of Multiphase Flow. 2019;117:14-24. doi:10.1016/j.ijmultiphaseflow.2019.04.027
apa: Song, B., Plana, C., Lopez Alonso, J. M., & Avila, M. (2019). Phase-field
simulation of core-annular pipe flow. International Journal of Multiphase Flow.
Elsevier. https://doi.org/10.1016/j.ijmultiphaseflow.2019.04.027
chicago: Song, Baofang, Carlos Plana, Jose M Lopez Alonso, and Marc Avila. “Phase-Field
Simulation of Core-Annular Pipe Flow.” International Journal of Multiphase
Flow. Elsevier, 2019. https://doi.org/10.1016/j.ijmultiphaseflow.2019.04.027.
ieee: B. Song, C. Plana, J. M. Lopez Alonso, and M. Avila, “Phase-field simulation
of core-annular pipe flow,” International Journal of Multiphase Flow, vol.
117. Elsevier, pp. 14–24, 2019.
ista: Song B, Plana C, Lopez Alonso JM, Avila M. 2019. Phase-field simulation of
core-annular pipe flow. International Journal of Multiphase Flow. 117, 14–24.
mla: Song, Baofang, et al. “Phase-Field Simulation of Core-Annular Pipe Flow.” International
Journal of Multiphase Flow, vol. 117, Elsevier, 2019, pp. 14–24, doi:10.1016/j.ijmultiphaseflow.2019.04.027.
short: B. Song, C. Plana, J.M. Lopez Alonso, M. Avila, International Journal of
Multiphase Flow 117 (2019) 14–24.
date_created: 2019-05-13T07:58:35Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2026-04-16T09:49:27Z
day: '01'
department:
- _id: BjHo
doi: 10.1016/j.ijmultiphaseflow.2019.04.027
external_id:
arxiv:
- '1902.07351'
isi:
- '000474496000002'
intvolume: ' 117'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.07351
month: '08'
oa: 1
oa_version: Preprint
page: 14-24
publication: International Journal of Multiphase Flow
publication_identifier:
issn:
- 0301-9322
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Phase-field simulation of core-annular pipe flow
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 117
year: '2019'
...
---
_id: '5790'
abstract:
- lang: eng
text: The partial representation extension problem is a recently introduced generalization
of the recognition problem. A circle graph is an intersection graph of chords
of a circle. We study the partial representation extension problem for circle
graphs, where the input consists of a graph G and a partial representation R′
giving some predrawn chords that represent an induced subgraph of G. The question
is whether one can extend R′ to a representation R of the entire graph G, that
is, whether one can draw the remaining chords into a partially predrawn representation
to obtain a representation of G. Our main result is an O(n3) time algorithm for
partial representation extension of circle graphs, where n is the number of vertices.
To show this, we describe the structure of all representations of a circle graph
using split decomposition. This can be of independent interest.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Steven
full_name: Chaplick, Steven
last_name: Chaplick
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Pavel
full_name: Klavík, Pavel
last_name: Klavík
citation:
ama: Chaplick S, Fulek R, Klavík P. Extending partial representations of circle
graphs. Journal of Graph Theory. 2019;91(4):365-394. doi:10.1002/jgt.22436
apa: Chaplick, S., Fulek, R., & Klavík, P. (2019). Extending partial representations
of circle graphs. Journal of Graph Theory. Wiley. https://doi.org/10.1002/jgt.22436
chicago: Chaplick, Steven, Radoslav Fulek, and Pavel Klavík. “Extending Partial
Representations of Circle Graphs.” Journal of Graph Theory. Wiley, 2019.
https://doi.org/10.1002/jgt.22436.
ieee: S. Chaplick, R. Fulek, and P. Klavík, “Extending partial representations of
circle graphs,” Journal of Graph Theory, vol. 91, no. 4. Wiley, pp. 365–394,
2019.
ista: Chaplick S, Fulek R, Klavík P. 2019. Extending partial representations of
circle graphs. Journal of Graph Theory. 91(4), 365–394.
mla: Chaplick, Steven, et al. “Extending Partial Representations of Circle Graphs.”
Journal of Graph Theory, vol. 91, no. 4, Wiley, 2019, pp. 365–94, doi:10.1002/jgt.22436.
short: S. Chaplick, R. Fulek, P. Klavík, Journal of Graph Theory 91 (2019) 365–394.
date_created: 2018-12-30T22:59:15Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2026-04-16T09:47:19Z
day: '01'
department:
- _id: UlWa
doi: 10.1002/jgt.22436
ec_funded: 1
external_id:
arxiv:
- '1309.2399'
isi:
- '000485392800004'
intvolume: ' 91'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1309.2399
month: '08'
oa: 1
oa_version: Preprint
page: 365-394
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Journal of Graph Theory
publication_identifier:
issn:
- 0364-9024
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extending partial representations of circle graphs
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 91
year: '2019'
...
---
_id: '5857'
abstract:
- lang: eng
text: 'A thrackle is a graph drawn in the plane so that every pair of its edges
meet exactly once: either at a common end vertex or in a proper crossing. We prove
that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are
defined similarly, except that every pair of edges that do not share a vertex
are allowed to cross an odd number of times. It is also shown that the maximum
number of edges of a quasi-thrackle on n vertices is [Formula presented](n−1),
and that this bound is best possible for infinitely many values of n.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: János
full_name: Pach, János
last_name: Pach
citation:
ama: 'Fulek R, Pach J. Thrackles: An improved upper bound. Discrete Applied Mathematics.
2019;259(4):266-231. doi:10.1016/j.dam.2018.12.025'
apa: 'Fulek, R., & Pach, J. (2019). Thrackles: An improved upper bound. Discrete
Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2018.12.025'
chicago: 'Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.”
Discrete Applied Mathematics. Elsevier, 2019. https://doi.org/10.1016/j.dam.2018.12.025.'
ieee: 'R. Fulek and J. Pach, “Thrackles: An improved upper bound,” Discrete Applied
Mathematics, vol. 259, no. 4. Elsevier, pp. 266–231, 2019.'
ista: 'Fulek R, Pach J. 2019. Thrackles: An improved upper bound. Discrete Applied
Mathematics. 259(4), 266–231.'
mla: 'Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete
Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi:10.1016/j.dam.2018.12.025.'
short: R. Fulek, J. Pach, Discrete Applied Mathematics 259 (2019) 266–231.
date_created: 2019-01-20T22:59:17Z
date_published: 2019-04-30T00:00:00Z
date_updated: 2026-04-16T09:48:11Z
day: '30'
department:
- _id: UlWa
doi: 10.1016/j.dam.2018.12.025
external_id:
arxiv:
- '1708.08037'
isi:
- '000466061100020'
intvolume: ' 259'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.08037
month: '04'
oa: 1
oa_version: Preprint
page: 266-231
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication: Discrete Applied Mathematics
publication_identifier:
issn:
- 0166-218X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '433'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'Thrackles: An improved upper bound'
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 259
year: '2019'
...
---
_id: '6430'
abstract:
- lang: eng
text: "A proxy re-encryption (PRE) scheme is a public-key encryption scheme that
allows the holder of a key pk to derive a re-encryption key for any other key
\U0001D45D\U0001D458′. This re-encryption key lets anyone transform ciphertexts
under pk into ciphertexts under \U0001D45D\U0001D458′ without having to know the
underlying message, while transformations from \U0001D45D\U0001D458′ to pk should
not be possible (unidirectional). Security is defined in a multi-user setting
against an adversary that gets the users’ public keys and can ask for re-encryption
keys and can corrupt users by requesting their secret keys. Any ciphertext that
the adversary cannot trivially decrypt given the obtained secret and re-encryption
keys should be secure.\r\n\r\nAll existing security proofs for PRE only show selective
security, where the adversary must first declare the users it wants to corrupt.
This can be lifted to more meaningful adaptive security by guessing the set of
corrupted users among the n users, which loses a factor exponential in Open image
in new window , rendering the result meaningless already for moderate Open image
in new window .\r\n\r\nJafargholi et al. (CRYPTO’17) proposed a framework that
in some cases allows to give adaptive security proofs for schemes which were previously
only known to be selectively secure, while avoiding the exponential loss that
results from guessing the adaptive choices made by an adversary. We apply their
framework to PREs that satisfy some natural additional properties. Concretely,
we give a more fine-grained reduction for several unidirectional PREs, proving
adaptive security at a much smaller loss. The loss depends on the graph of users
whose edges represent the re-encryption keys queried by the adversary. For trees
and chains the loss is quasi-polynomial in the size and for general graphs it
is exponential in their depth and indegree (instead of their size as for previous
reductions). Fortunately, trees and low-depth graphs cover many, if not most,
interesting applications.\r\n\r\nOur results apply e.g. to the bilinear-map based
PRE schemes by Ateniese et al. (NDSS’05 and CT-RSA’09), Gentry’s FHE-based scheme
(STOC’09) and the LWE-based scheme by Chandran et al. (PKC’14)."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
orcid: 0009-0006-6812-7317
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. Adaptively secure proxy
re-encryption. In: Vol 11443. Springer Nature; 2019:317-346. doi:10.1007/978-3-030-17259-6_11'
apa: 'Fuchsbauer, G., Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2019).
Adaptively secure proxy re-encryption (Vol. 11443, pp. 317–346). Presented at
the PKC: Public-Key Cryptograhy, Beijing, China: Springer Nature. https://doi.org/10.1007/978-3-030-17259-6_11'
chicago: Fuchsbauer, Georg, Chethan Kamath Hosdurg, Karen Klein, and Krzysztof Z
Pietrzak. “Adaptively Secure Proxy Re-Encryption,” 11443:317–46. Springer Nature,
2019. https://doi.org/10.1007/978-3-030-17259-6_11.
ieee: 'G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “Adaptively
secure proxy re-encryption,” presented at the PKC: Public-Key Cryptograhy, Beijing,
China, 2019, vol. 11443, pp. 317–346.'
ista: 'Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. 2019. Adaptively secure
proxy re-encryption. PKC: Public-Key Cryptograhy, LNCS, vol. 11443, 317–346.'
mla: Fuchsbauer, Georg, et al. Adaptively Secure Proxy Re-Encryption. Vol.
11443, Springer Nature, 2019, pp. 317–46, doi:10.1007/978-3-030-17259-6_11.
short: G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, Springer
Nature, 2019, pp. 317–346.
conference:
end_date: 2019-04-17
location: Beijing, China
name: 'PKC: Public-Key Cryptograhy'
start_date: 2019-04-14
date_created: 2019-05-13T08:13:46Z
date_published: 2019-04-06T00:00:00Z
date_updated: 2026-04-16T09:52:04Z
day: '06'
department:
- _id: KrPi
doi: 10.1007/978-3-030-17259-6_11
ec_funded: 1
external_id:
isi:
- '001299215500011'
intvolume: ' 11443'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/426
month: '04'
oa: 1
oa_version: Preprint
page: 317-346
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030172589'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '10035'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Adaptively secure proxy re-encryption
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 11443
year: '2019'
...
---
_id: '73'
abstract:
- lang: eng
text: We consider the space of probability measures on a discrete set X, endowed
with a dynamical optimal transport metric. Given two probability measures supported
in a subset Y⊆X, it is natural to ask whether they can be connected by a constant
speed geodesic with support in Y at all times. Our main result answers this question
affirmatively, under a suitable geometric condition on Y introduced in this paper.
The proof relies on an extension result for subsolutions to discrete Hamilton-Jacobi
equations, which is of independent interest.
article_number: '19'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Matthias
full_name: Erbar, Matthias
last_name: Erbar
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Melchior
full_name: Wirth, Melchior
last_name: Wirth
citation:
ama: Erbar M, Maas J, Wirth M. On the geometry of geodesics in discrete optimal
transport. Calculus of Variations and Partial Differential Equations. 2019;58(1).
doi:10.1007/s00526-018-1456-1
apa: Erbar, M., Maas, J., & Wirth, M. (2019). On the geometry of geodesics in
discrete optimal transport. Calculus of Variations and Partial Differential
Equations. Springer. https://doi.org/10.1007/s00526-018-1456-1
chicago: Erbar, Matthias, Jan Maas, and Melchior Wirth. “On the Geometry of Geodesics
in Discrete Optimal Transport.” Calculus of Variations and Partial Differential
Equations. Springer, 2019. https://doi.org/10.1007/s00526-018-1456-1.
ieee: M. Erbar, J. Maas, and M. Wirth, “On the geometry of geodesics in discrete
optimal transport,” Calculus of Variations and Partial Differential Equations,
vol. 58, no. 1. Springer, 2019.
ista: Erbar M, Maas J, Wirth M. 2019. On the geometry of geodesics in discrete optimal
transport. Calculus of Variations and Partial Differential Equations. 58(1), 19.
mla: Erbar, Matthias, et al. “On the Geometry of Geodesics in Discrete Optimal Transport.”
Calculus of Variations and Partial Differential Equations, vol. 58, no.
1, 19, Springer, 2019, doi:10.1007/s00526-018-1456-1.
short: M. Erbar, J. Maas, M. Wirth, Calculus of Variations and Partial Differential
Equations 58 (2019).
date_created: 2018-12-11T11:44:29Z
date_published: 2019-02-01T00:00:00Z
date_updated: 2026-04-16T09:51:42Z
day: '01'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1007/s00526-018-1456-1
ec_funded: 1
external_id:
arxiv:
- '1805.06040'
isi:
- '000452849400001'
file:
- access_level: open_access
checksum: ba05ac2d69de4c58d2cd338b63512798
content_type: application/pdf
creator: dernst
date_created: 2019-01-28T15:37:11Z
date_updated: 2020-07-14T12:47:55Z
file_id: '5895'
file_name: 2018_Calculus_Erbar.pdf
file_size: 645565
relation: main_file
file_date_updated: 2020-07-14T12:47:55Z
has_accepted_license: '1'
intvolume: ' 58'
isi: 1
issue: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: 260482E2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: F06504
name: Taming Complexity in Partial Differential Systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Calculus of Variations and Partial Differential Equations
publication_identifier:
issn:
- 0944-2669
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the geometry of geodesics in discrete optimal transport
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 58
year: '2019'
...
---
OA_place: publisher
_id: '6894'
abstract:
- lang: eng
text: "Hybrid automata combine finite automata and dynamical systems, and model
the interaction of digital with physical systems. Formal analysis that can guarantee
the safety of all behaviors or rigorously witness failures, while unsolvable in
general, has been tackled algorithmically using, e.g., abstraction, bounded model-checking,
assisted theorem proving.\r\nNevertheless, very few methods have addressed the
time-unbounded reachability analysis of hybrid automata and, for current sound
and automatic tools, scalability remains critical. We develop methods for the
polyhedral abstraction of hybrid automata, which construct coarse overapproximations
and tightens them incrementally, in a CEGAR fashion. We use template polyhedra,
i.e., polyhedra whose facets are normal to a given set of directions.\r\nWhile,
previously, directions were given by the user, we introduce (1) the first method\r\nfor
computing template directions from spurious counterexamples, so as to generalize
and\r\neliminate them. The method applies naturally to convex hybrid automata,
i.e., hybrid\r\nautomata with (possibly non-linear) convex constraints on derivatives
only, while for linear\r\nODE requires further abstraction. Specifically, we introduce
(2) the conic abstractions,\r\nwhich, partitioning the state space into appropriate
(possibly non-uniform) cones, divide\r\ncurvy trajectories into relatively straight
sections, suitable for polyhedral abstractions.\r\nFinally, we introduce (3) space-time
interpolation, which, combining interval arithmetic\r\nand template refinement,
computes appropriate (possibly non-uniform) time partitioning\r\nand template
directions along spurious trajectories, so as to eliminate them.\r\nWe obtain
sound and automatic methods for the reachability analysis over dense\r\nand unbounded
time of convex hybrid automata and hybrid automata with linear ODE.\r\nWe build
prototype tools and compare—favorably—our methods against the respective\r\nstate-of-the-art
tools, on several benchmarks."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
citation:
ama: Giacobbe M. Automatic time-unbounded reachability analysis of hybrid systems.
2019. doi:10.15479/AT:ISTA:6894
apa: Giacobbe, M. (2019). Automatic time-unbounded reachability analysis of hybrid
systems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6894
chicago: Giacobbe, Mirco. “Automatic Time-Unbounded Reachability Analysis of Hybrid
Systems.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6894.
ieee: M. Giacobbe, “Automatic time-unbounded reachability analysis of hybrid systems,”
Institute of Science and Technology Austria, 2019.
ista: Giacobbe M. 2019. Automatic time-unbounded reachability analysis of hybrid
systems. Institute of Science and Technology Austria.
mla: Giacobbe, Mirco. Automatic Time-Unbounded Reachability Analysis of Hybrid
Systems. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6894.
short: M. Giacobbe, Automatic Time-Unbounded Reachability Analysis of Hybrid Systems,
Institute of Science and Technology Austria, 2019.
corr_author: '1'
date_created: 2019-09-22T14:08:44Z
date_published: 2019-09-30T00:00:00Z
date_updated: 2026-04-16T09:55:03Z
day: '30'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ToHe
doi: 10.15479/AT:ISTA:6894
file:
- access_level: open_access
checksum: 773beaf4a85dc2acc2c12b578fbe1965
content_type: application/pdf
creator: mgiacobbe
date_created: 2019-09-27T14:15:05Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6916'
file_name: giacobbe_thesis.pdf
file_size: 4100685
relation: main_file
- access_level: closed
checksum: 97f1c3da71feefd27e6e625d32b4c75b
content_type: application/gzip
creator: mgiacobbe
date_created: 2019-09-27T14:22:04Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6917'
file_name: giacobbe_thesis_src.tar.gz
file_size: 7959732
relation: source_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '132'
publication_identifier:
eissn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '647'
relation: part_of_dissertation
status: public
- id: '631'
relation: part_of_dissertation
status: public
- id: '140'
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: Automatic time-unbounded reachability analysis of hybrid systems
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2019'
...
---
_id: '7147'
abstract:
- lang: eng
text: "The expression of a gene is characterised by its transcription factors and
the function processing them. If the transcription factors are not affected by
gene products, the regulating function is often represented as a combinational
logic circuit, where the outputs (product) are determined by current input values
(transcription factors) only, and are hence independent on their relative arrival
times. However, the simultaneous arrival of transcription factors (TFs) in genetic
circuits is a strong assumption, given that the processes of transcription and
translation of a gene into a protein introduce intrinsic time delays and that
there is no global synchronisation among the arrival times of different molecular
species at molecular targets.\r\n\r\nIn this paper, we construct an experimentally
implementable genetic circuit with two inputs and a single output, such that,
in presence of small delays in input arrival, the circuit exhibits qualitatively
distinct observable phenotypes. In particular, these phenotypes are long lived
transients: they all converge to a single value, but so slowly, that they seem
stable for an extended time period, longer than typical experiment duration. We
used rule-based language to prototype our circuit, and we implemented a search
for finding the parameter combinations raising the phenotypes of interest.\r\n\r\nThe
behaviour of our prototype circuit has wide implications. First, it suggests that
GRNs can exploit event timing to create phenotypes. Second, it opens the possibility
that GRNs are using event timing to react to stimuli and memorise events, without
explicit feedback in regulation. From the modelling perspective, our prototype
circuit demonstrates the critical importance of analysing the transient dynamics
at the promoter binding sites of the DNA, before applying rapid equilibrium assumptions."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- 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: Claudia
full_name: Igler, Claudia
id: 46613666-F248-11E8-B48F-1D18A9856A87
last_name: Igler
orcid: 0000-0001-7777-546X
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
citation:
ama: 'Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. Transient memory in gene
regulation. In: 17th International Conference on Computational Methods in Systems
Biology. Vol 11773. Springer Nature; 2019:155-187. doi:10.1007/978-3-030-31304-3_9'
apa: 'Guet, C. C., Henzinger, T. A., Igler, C., Petrov, T., & Sezgin, A. (2019).
Transient memory in gene regulation. In 17th International Conference on Computational
Methods in Systems Biology (Vol. 11773, pp. 155–187). Trieste, Italy: Springer
Nature. https://doi.org/10.1007/978-3-030-31304-3_9'
chicago: Guet, Calin C, Thomas A Henzinger, Claudia Igler, Tatjana Petrov, and Ali
Sezgin. “Transient Memory in Gene Regulation.” In 17th International Conference
on Computational Methods in Systems Biology, 11773:155–87. Springer Nature,
2019. https://doi.org/10.1007/978-3-030-31304-3_9.
ieee: C. C. Guet, T. A. Henzinger, C. Igler, T. Petrov, and A. Sezgin, “Transient
memory in gene regulation,” in 17th International Conference on Computational
Methods in Systems Biology, Trieste, Italy, 2019, vol. 11773, pp. 155–187.
ista: 'Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. 2019. Transient memory
in gene regulation. 17th International Conference on Computational Methods in
Systems Biology. CMSB: Computational Methods in Systems Biology, LNCS, vol. 11773,
155–187.'
mla: Guet, Calin C., et al. “Transient Memory in Gene Regulation.” 17th International
Conference on Computational Methods in Systems Biology, vol. 11773, Springer
Nature, 2019, pp. 155–87, doi:10.1007/978-3-030-31304-3_9.
short: C.C. Guet, T.A. Henzinger, C. Igler, T. Petrov, A. Sezgin, in:, 17th International
Conference on Computational Methods in Systems Biology, Springer Nature, 2019,
pp. 155–187.
conference:
end_date: 2019-09-20
location: Trieste, Italy
name: 'CMSB: Computational Methods in Systems Biology'
start_date: 2019-09-18
date_created: 2019-12-04T16:07:50Z
date_published: 2019-09-17T00:00:00Z
date_updated: 2026-04-16T10:26:49Z
day: '17'
department:
- _id: CaGu
- _id: ToHe
doi: 10.1007/978-3-030-31304-3_9
external_id:
isi:
- '000557875100009'
intvolume: ' 11773'
isi: 1
language:
- iso: eng
month: '09'
oa_version: None
page: 155-187
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 251EE76E-B435-11E9-9278-68D0E5697425
grant_number: '24573'
name: Design principles underlying genetic switch architecture
publication: 17th International Conference on Computational Methods in Systems Biology
publication_identifier:
eisbn:
- '9783030313043'
eissn:
- 1611-3349
isbn:
- '9783030313036'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transient memory in gene regulation
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 11773
year: '2019'
...
---
_id: '6987'
abstract:
- lang: eng
text: Cells are arranged into species-specific patterns during early embryogenesis.
Such cell division patterns are important since they often reflect the distribution
of localized cortical factors from eggs/fertilized eggs to specific cells as well
as the emergence of organismal form. However, it has proven difficult to reveal
the mechanisms that underlie the emergence of cell positioning patterns that underlie
embryonic shape, likely because a systems-level approach is required that integrates
cell biological, genetic, developmental, and mechanical parameters. The choice
of organism to address such questions is also important. Because ascidians display
the most extreme form of invariant cleavage pattern among the metazoans, we have
been analyzing the cell biological mechanisms that underpin three aspects of cell
division (unequal cell division (UCD), oriented cell division (OCD), and asynchronous
cell cycles) which affect the overall shape of the blastula-stage ascidian embryo
composed of 64 cells. In ascidians, UCD creates two small cells at the 16-cell
stage that in turn undergo two further successive rounds of UCD. Starting at the
16-cell stage, the cell cycle becomes asynchronous, whereby the vegetal half divides
before the animal half, thus creating 24-, 32-, 44-, and then 64-cell stages.
Perturbing either UCD or the alternate cell division rhythm perturbs cell position.
We propose that dynamic cell shape changes propagate throughout the embryo via
cell-cell contacts to create the ascidian-specific invariant cleavage pattern.
alternative_title:
- RESULTS
article_processing_charge: No
author:
- first_name: Alex
full_name: McDougall, Alex
last_name: McDougall
- first_name: Janet
full_name: Chenevert, Janet
last_name: Chenevert
- first_name: Benoit G
full_name: Godard, Benoit G
id: 33280250-F248-11E8-B48F-1D18A9856A87
last_name: Godard
- first_name: Remi
full_name: Dumollard, Remi
last_name: Dumollard
citation:
ama: 'McDougall A, Chenevert J, Godard BG, Dumollard R. Emergence of embryo shape
during cleavage divisions. In: Tworzydlo W, Bilinski SM, eds. Evo-Devo: Non-Model
Species in Cell and Developmental Biology. Vol 68. Springer Nature; 2019:127-154.
doi:10.1007/978-3-030-23459-1_6'
apa: 'McDougall, A., Chenevert, J., Godard, B. G., & Dumollard, R. (2019). Emergence
of embryo shape during cleavage divisions. In W. Tworzydlo & S. M. Bilinski
(Eds.), Evo-Devo: Non-model species in cell and developmental biology (Vol.
68, pp. 127–154). Springer Nature. https://doi.org/10.1007/978-3-030-23459-1_6'
chicago: 'McDougall, Alex, Janet Chenevert, Benoit G Godard, and Remi Dumollard.
“Emergence of Embryo Shape during Cleavage Divisions.” In Evo-Devo: Non-Model
Species in Cell and Developmental Biology, edited by Waclaw Tworzydlo and
Szczepan M. Bilinski, 68:127–54. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-23459-1_6.'
ieee: 'A. McDougall, J. Chenevert, B. G. Godard, and R. Dumollard, “Emergence of
embryo shape during cleavage divisions,” in Evo-Devo: Non-model species in
cell and developmental biology, vol. 68, W. Tworzydlo and S. M. Bilinski,
Eds. Springer Nature, 2019, pp. 127–154.'
ista: 'McDougall A, Chenevert J, Godard BG, Dumollard R. 2019.Emergence of embryo
shape during cleavage divisions. In: Evo-Devo: Non-model species in cell and developmental
biology. RESULTS, vol. 68, 127–154.'
mla: 'McDougall, Alex, et al. “Emergence of Embryo Shape during Cleavage Divisions.”
Evo-Devo: Non-Model Species in Cell and Developmental Biology, edited by
Waclaw Tworzydlo and Szczepan M. Bilinski, vol. 68, Springer Nature, 2019, pp.
127–54, doi:10.1007/978-3-030-23459-1_6.'
short: 'A. McDougall, J. Chenevert, B.G. Godard, R. Dumollard, in:, W. Tworzydlo,
S.M. Bilinski (Eds.), Evo-Devo: Non-Model Species in Cell and Developmental Biology,
Springer Nature, 2019, pp. 127–154.'
date_created: 2019-11-04T16:20:19Z
date_published: 2019-10-10T00:00:00Z
date_updated: 2026-04-16T10:26:18Z
day: '10'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.1007/978-3-030-23459-1_6
editor:
- first_name: Waclaw
full_name: Tworzydlo, Waclaw
last_name: Tworzydlo
- first_name: Szczepan M.
full_name: Bilinski, Szczepan M.
last_name: Bilinski
external_id:
pmid:
- '31598855'
file:
- access_level: open_access
checksum: 7f43e1e3706d15061475c5c57efc2786
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T10:09:30Z
date_updated: 2020-07-14T12:47:46Z
file_id: '7829'
file_name: 2019_RESULTS_McDougall.pdf
file_size: 19317348
relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: ' 68'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 127-154
pmid: 1
publication: 'Evo-Devo: Non-model species in cell and developmental biology'
publication_identifier:
eisbn:
- '9783030234591'
eissn:
- 1861-0412
isbn:
- '9783030234584'
issn:
- 0080-1844
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Emergence of embryo shape during cleavage divisions
type: book_chapter
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 68
year: '2019'
...