---
_id: '1221'
abstract:
- lang: eng
text: The Auxin Binding Protein 1 (ABP1) is one of the most studied proteins in
plants. Since decades ago, it has been the prime receptor candidate for the plant
hormone auxin with a plethora of described functions in auxin signaling and development.
The developmental importance of ABP1 has recently been questioned by identification
of Arabidopsis thaliana abp1 knock-out alleles that show no obvious phenotypes
under normal growth conditions. In this study, we examined the contradiction between
the normal growth and development of the abp1 knock-outs and the strong morphological
defects observed in three different ethanol-inducible abp1 knock-down mutants
( abp1-AS, SS12K, SS12S). By analyzing segregating populations of abp1 knock-out
vs. abp1 knock-down crosses we show that the strong morphological defects that
were believed to be the result of conditional down-regulation of ABP1 can be reproduced
also in the absence of the functional ABP1 protein. This data suggests that the
phenotypes in abp1 knock-down lines are due to the off-target effects and asks
for further reflections on the biological function of ABP1 or alternative explanations
for the missing phenotypic defects in the abp1 loss-of-function alleles.
acknowledgement: "This work was supported by ERC Independent Research grant (ERC-2011-StG-20101109-PSDP
to JF). JM internship was supported by the grant “Action Austria – Slovakia”. MG
was supported by the scholarship \"Stipendien der Stipendienstiftung der Republik
Österreich\". Work by EH and CPR were supported by ANR blanc ANR-14-CE11-0018. We
would like to thank Mark Estelle and Yunde Zhao for provid\r\n-\r\ning \r\nabp1-c1\r\n,
\r\nabp1-TD1 \r\nand \r\nabp1-WTc1 \r\nseeds. We thank Emeline \r\nHuault for technical
assistance."
article_number: '86'
article_processing_charge: No
article_type: original
author:
- first_name: Jaroslav
full_name: Michalko, Jaroslav
id: 483727CA-F248-11E8-B48F-1D18A9856A87
last_name: Michalko
- first_name: Matous
full_name: Glanc, Matous
id: 1AE1EA24-02D0-11E9-9BAA-DAF4881429F2
last_name: Glanc
orcid: 0000-0003-0619-7783
- first_name: Catherine
full_name: Perrot Rechenmann, Catherine
last_name: Perrot Rechenmann
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Michalko J, Glanc M, Perrot Rechenmann C, Friml J. Strong morphological defects
in conditional Arabidopsis abp1 knock-down mutants generated in absence of functional
ABP1 protein. F1000 Research . 2016;5. doi:10.12688/f1000research.7654.1
apa: Michalko, J., Glanc, M., Perrot Rechenmann, C., & Friml, J. (2016). Strong
morphological defects in conditional Arabidopsis abp1 knock-down mutants generated
in absence of functional ABP1 protein. F1000 Research . F1000 Research.
https://doi.org/10.12688/f1000research.7654.1
chicago: Michalko, Jaroslav, Matous Glanc, Catherine Perrot Rechenmann, and Jiří
Friml. “Strong Morphological Defects in Conditional Arabidopsis Abp1 Knock-down
Mutants Generated in Absence of Functional ABP1 Protein.” F1000 Research .
F1000 Research, 2016. https://doi.org/10.12688/f1000research.7654.1.
ieee: J. Michalko, M. Glanc, C. Perrot Rechenmann, and J. Friml, “Strong morphological
defects in conditional Arabidopsis abp1 knock-down mutants generated in absence
of functional ABP1 protein,” F1000 Research , vol. 5. F1000 Research, 2016.
ista: Michalko J, Glanc M, Perrot Rechenmann C, Friml J. 2016. Strong morphological
defects in conditional Arabidopsis abp1 knock-down mutants generated in absence
of functional ABP1 protein. F1000 Research . 5, 86.
mla: Michalko, Jaroslav, et al. “Strong Morphological Defects in Conditional Arabidopsis
Abp1 Knock-down Mutants Generated in Absence of Functional ABP1 Protein.” F1000
Research , vol. 5, 86, F1000 Research, 2016, doi:10.12688/f1000research.7654.1.
short: J. Michalko, M. Glanc, C. Perrot Rechenmann, J. Friml, F1000 Research 5
(2016).
date_created: 2018-12-11T11:50:47Z
date_published: 2016-01-20T00:00:00Z
date_updated: 2025-05-07T11:12:30Z
day: '20'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.12688/f1000research.7654.1
ec_funded: 1
file:
- access_level: open_access
checksum: c9e50bb6096a7ba4a832969935820f19
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:33Z
date_updated: 2020-07-14T12:44:39Z
file_id: '5154'
file_name: IST-2016-711-v1+1_770cf1e0-612f-4e85-a500-54b6349fbbab_7654_-_jaroslav_michalko.pdf
file_size: 2990459
relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: ' 5'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: 'F1000 Research '
publication_status: published
publisher: F1000 Research
publist_id: '6113'
pubrep_id: '711'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strong morphological defects in conditional Arabidopsis abp1 knock-down mutants
generated in absence of functional ABP1 protein
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2016'
...
---
_id: '1222'
abstract:
- lang: eng
text: We consider packings of congruent circles on a square flat torus, i.e., periodic
(w.r.t. a square lattice) planar circle packings, with the maximal circle radius.
This problem is interesting due to a practical reason—the problem of “super resolution
of images.” We have found optimal arrangements for N=6, 7 and 8 circles. Surprisingly,
for the case N=7 there are three different optimal arrangements. Our proof is
based on a computer enumeration of toroidal irreducible contact graphs.
acknowledgement: We wish to thank Alexey Tarasov, Vladislav Volkov and Brittany Fasy
for some useful comments and remarks, and especially Thom Sulanke for modifying
surftri to suit our purposes. Oleg R. Musin was partially supported by the NSF Grant
DMS-1400876 and by the RFBR Grant 15-01-99563. Anton V. Nikitenko was supported
by the Chebyshev Laboratory (Department of Mathematics and Mechanics, St. Petersburg
State University) under RF Government Grant 11.G34.31.0026.
author:
- first_name: Oleg
full_name: Musin, Oleg
last_name: Musin
- first_name: Anton
full_name: Nikitenko, Anton
id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87
last_name: Nikitenko
citation:
ama: Musin O, Nikitenko A. Optimal packings of congruent circles on a square flat
torus. Discrete & Computational Geometry. 2016;55(1):1-20. doi:10.1007/s00454-015-9742-6
apa: Musin, O., & Nikitenko, A. (2016). Optimal packings of congruent circles
on a square flat torus. Discrete & Computational Geometry. Springer.
https://doi.org/10.1007/s00454-015-9742-6
chicago: Musin, Oleg, and Anton Nikitenko. “Optimal Packings of Congruent Circles
on a Square Flat Torus.” Discrete & Computational Geometry. Springer,
2016. https://doi.org/10.1007/s00454-015-9742-6.
ieee: O. Musin and A. Nikitenko, “Optimal packings of congruent circles on a square
flat torus,” Discrete & Computational Geometry, vol. 55, no. 1. Springer,
pp. 1–20, 2016.
ista: Musin O, Nikitenko A. 2016. Optimal packings of congruent circles on a square
flat torus. Discrete & Computational Geometry. 55(1), 1–20.
mla: Musin, Oleg, and Anton Nikitenko. “Optimal Packings of Congruent Circles on
a Square Flat Torus.” Discrete & Computational Geometry, vol. 55, no.
1, Springer, 2016, pp. 1–20, doi:10.1007/s00454-015-9742-6.
short: O. Musin, A. Nikitenko, Discrete & Computational Geometry 55 (2016) 1–20.
date_created: 2018-12-11T11:50:48Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:49:11Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/s00454-015-9742-6
intvolume: ' 55'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1212.0649
month: '01'
oa: 1
oa_version: Preprint
page: 1 - 20
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '6111'
quality_controlled: '1'
scopus_import: 1
status: public
title: Optimal packings of congruent circles on a square flat torus
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...
---
_id: '1223'
abstract:
- lang: eng
text: We consider a random Schrödinger operator on the binary tree with a random
potential which is the sum of a random radially symmetric potential, Qr, and a
random transversally periodic potential, κQt, with coupling constant κ. Using
a new one-dimensional dynamical systems approach combined with Jensen's inequality
in hyperbolic space (our key estimate) we obtain a fractional moment estimate
proving localization for small and large κ. Together with a previous result we
therefore obtain a model with two Anderson transitions, from localization to delocalization
and back to localization, when increasing κ. As a by-product we also have a partially
new proof of one-dimensional Anderson localization at any disorder.
author:
- first_name: Richard
full_name: Froese, Richard
last_name: Froese
- first_name: Darrick
full_name: Lee, Darrick
last_name: Lee
- first_name: Christian
full_name: Sadel, Christian
id: 4760E9F8-F248-11E8-B48F-1D18A9856A87
last_name: Sadel
orcid: 0000-0001-8255-3968
- first_name: Wolfgang
full_name: Spitzer, Wolfgang
last_name: Spitzer
- first_name: Günter
full_name: Stolz, Günter
last_name: Stolz
citation:
ama: Froese R, Lee D, Sadel C, Spitzer W, Stolz G. Localization for transversally
periodic random potentials on binary trees. Journal of Spectral Theory.
2016;6(3):557-600. doi:10.4171/JST/132
apa: Froese, R., Lee, D., Sadel, C., Spitzer, W., & Stolz, G. (2016). Localization
for transversally periodic random potentials on binary trees. Journal of Spectral
Theory. European Mathematical Society. https://doi.org/10.4171/JST/132
chicago: Froese, Richard, Darrick Lee, Christian Sadel, Wolfgang Spitzer, and Günter
Stolz. “Localization for Transversally Periodic Random Potentials on Binary Trees.”
Journal of Spectral Theory. European Mathematical Society, 2016. https://doi.org/10.4171/JST/132.
ieee: R. Froese, D. Lee, C. Sadel, W. Spitzer, and G. Stolz, “Localization for transversally
periodic random potentials on binary trees,” Journal of Spectral Theory,
vol. 6, no. 3. European Mathematical Society, pp. 557–600, 2016.
ista: Froese R, Lee D, Sadel C, Spitzer W, Stolz G. 2016. Localization for transversally
periodic random potentials on binary trees. Journal of Spectral Theory. 6(3),
557–600.
mla: Froese, Richard, et al. “Localization for Transversally Periodic Random Potentials
on Binary Trees.” Journal of Spectral Theory, vol. 6, no. 3, European Mathematical
Society, 2016, pp. 557–600, doi:10.4171/JST/132.
short: R. Froese, D. Lee, C. Sadel, W. Spitzer, G. Stolz, Journal of Spectral Theory
6 (2016) 557–600.
date_created: 2018-12-11T11:50:48Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:49:12Z
day: '01'
department:
- _id: LaEr
doi: 10.4171/JST/132
intvolume: ' 6'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1408.3961
month: '01'
oa: 1
oa_version: Preprint
page: 557 - 600
publication: Journal of Spectral Theory
publication_status: published
publisher: European Mathematical Society
publist_id: '6112'
quality_controlled: '1'
scopus_import: 1
status: public
title: Localization for transversally periodic random potentials on binary trees
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2016'
...
---
_id: '1224'
abstract:
- lang: eng
text: Sexual dimorphism in resource allocation is expected to change during the
life cycle of dioecious plants because of temporal differences between the sexes
in reproductive investment. Given the potential for sex-specific differences in
reproductive costs, resource availability may contribute to variation in reproductive
allocation in females and males. Here, we used Rumex hastatulus, a dioecious,
wind-pollinated annual plant, to investigate whether sexual dimorphism varies
with life-history stage and nutrient availability, and determine whether allocation
patterns differ depending on reproductive commitment. To examine if the costs
of reproduction varied between the sexes, reproduction was either allowed or prevented
through bud removal, and biomass allocation was measured at maturity. In a second
experiment to assess variation in sexual dimorphism across the life cycle, and
whether this varied with resource availability, plants were grown in high and
low nutrients and allocation to roots, aboveground vegetative growth and reproduction
were measured at three developmental stages. Males prevented from reproducing
compensated with increased above- and belowground allocation to a much larger
degree than females, suggesting that male reproductive costs reduce vegetative
growth. The proportional allocation to roots, reproductive structures and aboveground
vegetative growth varied between the sexes and among life-cycle stages, but not
with nutrient treatment. Females allocated proportionally more resources to roots
than males at peak flowering, but this pattern was reversed at reproductive maturity
under low-nutrient conditions. Our study illustrates the importance of temporal
dynamics in sex-specific resource allocation and provides support for high male
reproductive costs in wind-pollinated plants.
author:
- first_name: Zachary
full_name: Teitel, Zachary
last_name: Teitel
- first_name: Melinda
full_name: Pickup, Melinda
id: 2C78037E-F248-11E8-B48F-1D18A9856A87
last_name: Pickup
orcid: 0000-0001-6118-0541
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
- first_name: Spencer
full_name: Barrett, Spencer
last_name: Barrett
citation:
ama: Teitel Z, Pickup M, Field D, Barrett S. The dynamics of resource allocation
and costs of reproduction in a sexually dimorphic, wind-pollinated dioecious plant.
Plant Biology. 2016;18(1):98-103. doi:10.1111/plb.12336
apa: Teitel, Z., Pickup, M., Field, D., & Barrett, S. (2016). The dynamics of
resource allocation and costs of reproduction in a sexually dimorphic, wind-pollinated
dioecious plant. Plant Biology. Wiley-Blackwell. https://doi.org/10.1111/plb.12336
chicago: Teitel, Zachary, Melinda Pickup, David Field, and Spencer Barrett. “The
Dynamics of Resource Allocation and Costs of Reproduction in a Sexually Dimorphic,
Wind-Pollinated Dioecious Plant.” Plant Biology. Wiley-Blackwell, 2016.
https://doi.org/10.1111/plb.12336.
ieee: Z. Teitel, M. Pickup, D. Field, and S. Barrett, “The dynamics of resource
allocation and costs of reproduction in a sexually dimorphic, wind-pollinated
dioecious plant,” Plant Biology, vol. 18, no. 1. Wiley-Blackwell, pp. 98–103,
2016.
ista: Teitel Z, Pickup M, Field D, Barrett S. 2016. The dynamics of resource allocation
and costs of reproduction in a sexually dimorphic, wind-pollinated dioecious plant.
Plant Biology. 18(1), 98–103.
mla: Teitel, Zachary, et al. “The Dynamics of Resource Allocation and Costs of Reproduction
in a Sexually Dimorphic, Wind-Pollinated Dioecious Plant.” Plant Biology,
vol. 18, no. 1, Wiley-Blackwell, 2016, pp. 98–103, doi:10.1111/plb.12336.
short: Z. Teitel, M. Pickup, D. Field, S. Barrett, Plant Biology 18 (2016) 98–103.
date_created: 2018-12-11T11:50:48Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:49:12Z
day: '01'
department:
- _id: NiBa
doi: 10.1111/plb.12336
intvolume: ' 18'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 98 - 103
publication: Plant Biology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '6110'
quality_controlled: '1'
scopus_import: 1
status: public
title: The dynamics of resource allocation and costs of reproduction in a sexually
dimorphic, wind-pollinated dioecious plant
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2016'
...
---
_id: '1225'
abstract:
- lang: eng
text: At Crypto 2015 Fuchsbauer, Hanser and Slamanig (FHS) presented the first standard-model
construction of efficient roundoptimal blind signatures that does not require
complexity leveraging. It is conceptually simple and builds on the primitive of
structure-preserving signatures on equivalence classes (SPS-EQ). FHS prove the
unforgeability of their scheme assuming EUF-CMA security of the SPS-EQ scheme
and hardness of a version of the DH inversion problem. Blindness under adversarially
chosen keys is proven under an interactive variant of the DDH assumption. We propose
a variant of their scheme whose blindness can be proven under a non-interactive
assumption, namely a variant of the bilinear DDH assumption. We moreover prove
its unforgeability assuming only unforgeability of the underlying SPS-EQ but no
additional assumptions as needed for the FHS scheme.
alternative_title:
- LNCS
author:
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Christian
full_name: Hanser, Christian
last_name: Hanser
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Daniel
full_name: Slamanig, Daniel
last_name: Slamanig
citation:
ama: 'Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. Practical round-optimal
blind signatures in the standard model from weaker assumptions. In: Vol 9841.
Springer; 2016:391-408. doi:10.1007/978-3-319-44618-9_21'
apa: 'Fuchsbauer, G., Hanser, C., Kamath Hosdurg, C., & Slamanig, D. (2016).
Practical round-optimal blind signatures in the standard model from weaker assumptions
(Vol. 9841, pp. 391–408). Presented at the SCN: Security and Cryptography for
Networks, Amalfi, Italy: Springer. https://doi.org/10.1007/978-3-319-44618-9_21'
chicago: Fuchsbauer, Georg, Christian Hanser, Chethan Kamath Hosdurg, and Daniel
Slamanig. “Practical Round-Optimal Blind Signatures in the Standard Model from
Weaker Assumptions,” 9841:391–408. Springer, 2016. https://doi.org/10.1007/978-3-319-44618-9_21.
ieee: 'G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, and D. Slamanig, “Practical
round-optimal blind signatures in the standard model from weaker assumptions,”
presented at the SCN: Security and Cryptography for Networks, Amalfi, Italy, 2016,
vol. 9841, pp. 391–408.'
ista: 'Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. 2016. Practical round-optimal
blind signatures in the standard model from weaker assumptions. SCN: Security
and Cryptography for Networks, LNCS, vol. 9841, 391–408.'
mla: Fuchsbauer, Georg, et al. Practical Round-Optimal Blind Signatures in the
Standard Model from Weaker Assumptions. Vol. 9841, Springer, 2016, pp. 391–408,
doi:10.1007/978-3-319-44618-9_21.
short: G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, D. Slamanig, in:, Springer,
2016, pp. 391–408.
conference:
end_date: 2016-09-02
location: Amalfi, Italy
name: 'SCN: Security and Cryptography for Networks'
start_date: 2016-08-31
date_created: 2018-12-11T11:50:49Z
date_published: 2016-08-11T00:00:00Z
date_updated: 2023-02-23T10:08:16Z
day: '11'
department:
- _id: KrPi
doi: 10.1007/978-3-319-44618-9_21
ec_funded: 1
intvolume: ' 9841'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/662
month: '08'
oa: 1
oa_version: Submitted Version
page: 391 - 408
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_status: published
publisher: Springer
publist_id: '6109'
quality_controlled: '1'
related_material:
record:
- id: '1647'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Practical round-optimal blind signatures in the standard model from weaker
assumptions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9841
year: '2016'
...
---
_id: '1226'
abstract:
- lang: eng
text: Mitochondrial complex I (also known as NADH:ubiquinone oxidoreductase) contributes
to cellular energy production by transferring electrons from NADH to ubiquinone
coupled to proton translocation across the membrane. It is the largest protein
assembly of the respiratory chain with a total mass of 970 kilodaltons. Here we
present a nearly complete atomic structure of ovine (Ovis aries) mitochondrial
complex I at 3.9 Å resolution, solved by cryo-electron microscopy with cross-linking
and mass-spectrometry mapping experiments. All 14 conserved core subunits and
31 mitochondria-specific supernumerary subunits are resolved within the L-shaped
molecule. The hydrophilic matrix arm comprises flavin mononucleotide and 8 iron-sulfur
clusters involved in electron transfer, and the membrane arm contains 78 transmembrane
helices, mostly contributed by antiporter-like subunits involved in proton translocation.
Supernumerary subunits form an interlinked, stabilizing shell around the conserved
core. Tightly bound lipids (including cardiolipins) further stabilize interactions
between the hydrophobic subunits. Subunits with possible regulatory roles contain
additional cofactors, NADPH and two phosphopantetheine molecules, which are shown
to be involved in inter-subunit interactions. We observe two different conformations
of the complex, which may be related to the conformationally driven coupling mechanism
and to the active-deactive transition of the enzyme. Our structure provides insight
into the mechanism, assembly, maturation and dysfunction of mitochondrial complex
I, and allows detailed molecular analysis of disease-causing mutations.
article_processing_charge: No
article_type: original
author:
- first_name: Karol
full_name: Fiedorczuk, Karol
id: 5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0
last_name: Fiedorczuk
- first_name: James A
full_name: Letts, James A
id: 322DA418-F248-11E8-B48F-1D18A9856A87
last_name: Letts
orcid: 0000-0002-9864-3586
- first_name: Gianluca
full_name: Degliesposti, Gianluca
last_name: Degliesposti
- first_name: Karol
full_name: Kaszuba, Karol
id: 3FDF9472-F248-11E8-B48F-1D18A9856A87
last_name: Kaszuba
- first_name: Mark
full_name: Skehel, Mark
last_name: Skehel
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Fiedorczuk K, Letts JA, Degliesposti G, Kaszuba K, Skehel M, Sazanov LA. Atomic
structure of the entire mammalian mitochondrial complex i. Nature. 2016;538(7625):406-410.
doi:10.1038/nature19794
apa: Fiedorczuk, K., Letts, J. A., Degliesposti, G., Kaszuba, K., Skehel, M., &
Sazanov, L. A. (2016). Atomic structure of the entire mammalian mitochondrial
complex i. Nature. Nature Publishing Group. https://doi.org/10.1038/nature19794
chicago: Fiedorczuk, Karol, James A Letts, Gianluca Degliesposti, Karol Kaszuba,
Mark Skehel, and Leonid A Sazanov. “Atomic Structure of the Entire Mammalian Mitochondrial
Complex I.” Nature. Nature Publishing Group, 2016. https://doi.org/10.1038/nature19794.
ieee: K. Fiedorczuk, J. A. Letts, G. Degliesposti, K. Kaszuba, M. Skehel, and L.
A. Sazanov, “Atomic structure of the entire mammalian mitochondrial complex i,”
Nature, vol. 538, no. 7625. Nature Publishing Group, pp. 406–410, 2016.
ista: Fiedorczuk K, Letts JA, Degliesposti G, Kaszuba K, Skehel M, Sazanov LA. 2016.
Atomic structure of the entire mammalian mitochondrial complex i. Nature. 538(7625),
406–410.
mla: Fiedorczuk, Karol, et al. “Atomic Structure of the Entire Mammalian Mitochondrial
Complex I.” Nature, vol. 538, no. 7625, Nature Publishing Group, 2016,
pp. 406–10, doi:10.1038/nature19794.
short: K. Fiedorczuk, J.A. Letts, G. Degliesposti, K. Kaszuba, M. Skehel, L.A. Sazanov,
Nature 538 (2016) 406–410.
date_created: 2018-12-11T11:50:49Z
date_published: 2016-10-20T00:00:00Z
date_updated: 2021-01-12T06:49:13Z
day: '20'
department:
- _id: LeSa
doi: 10.1038/nature19794
ec_funded: 1
external_id:
pmid:
- '27595392'
intvolume: ' 538'
issue: '7625'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5164932/
month: '10'
oa: 1
oa_version: Submitted Version
page: 406 - 410
pmid: 1
project:
- _id: 2593EBD6-B435-11E9-9278-68D0E5697425
name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes
(FEBS)
- _id: 2590DB08-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '701309'
name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes
(H2020)
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '6108'
quality_controlled: '1'
scopus_import: 1
status: public
title: Atomic structure of the entire mammalian mitochondrial complex i
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 538
year: '2016'
...
---
_id: '1227'
abstract:
- lang: eng
text: Many biological systems can be modeled as multiaffine hybrid systems. Due
to the nonlinearity of multiaffine systems, it is difficult to verify their properties
of interest directly. A common strategy to tackle this problem is to construct
and analyze a discrete overapproximation of the original system. However, the
conservativeness of a discrete abstraction significantly determines the level
of confidence we can have in the properties of the original system. In this paper,
in order to reduce the conservativeness of a discrete abstraction, we propose
a new method based on a sufficient and necessary decision condition for computing
discrete transitions between states in the abstract system. We assume the state
space partition of a multiaffine system to be based on a set of multivariate polynomials.
Hence, a rectangular partition defined in terms of polynomials of the form (xi
− c) is just a simple case of multivariate polynomial partition, and the new decision
condition applies naturally. We analyze and demonstrate the improvement of our
method over the existing methods using some examples.
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23, S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23
(Wittgenstein Award).
alternative_title:
- LNCS
author:
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
- 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: Yu
full_name: Jiang, Yu
last_name: Jiang
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
citation:
ama: 'Kong H, Bartocci E, Bogomolov S, et al. Discrete abstraction of multiaffine
systems. In: Vol 9957. Springer; 2016:128-144. doi:10.1007/978-3-319-47151-8_9'
apa: 'Kong, H., Bartocci, E., Bogomolov, S., Grosu, R., Henzinger, T. A., Jiang,
Y., & Schilling, C. (2016). Discrete abstraction of multiaffine systems (Vol.
9957, pp. 128–144). Presented at the HSB: Hybrid Systems Biology, Grenoble, France:
Springer. https://doi.org/10.1007/978-3-319-47151-8_9'
chicago: Kong, Hui, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, Thomas A Henzinger,
Yu Jiang, and Christian Schilling. “Discrete Abstraction of Multiaffine Systems,”
9957:128–44. Springer, 2016. https://doi.org/10.1007/978-3-319-47151-8_9.
ieee: 'H. Kong et al., “Discrete abstraction of multiaffine systems,” presented
at the HSB: Hybrid Systems Biology, Grenoble, France, 2016, vol. 9957, pp. 128–144.'
ista: 'Kong H, Bartocci E, Bogomolov S, Grosu R, Henzinger TA, Jiang Y, Schilling
C. 2016. Discrete abstraction of multiaffine systems. HSB: Hybrid Systems Biology,
LNCS, vol. 9957, 128–144.'
mla: Kong, Hui, et al. Discrete Abstraction of Multiaffine Systems. Vol.
9957, Springer, 2016, pp. 128–44, doi:10.1007/978-3-319-47151-8_9.
short: H. Kong, E. Bartocci, S. Bogomolov, R. Grosu, T.A. Henzinger, Y. Jiang, C.
Schilling, in:, Springer, 2016, pp. 128–144.
conference:
end_date: 2016-10-21
location: Grenoble, France
name: 'HSB: Hybrid Systems Biology'
start_date: 2016-10-20
date_created: 2018-12-11T11:50:49Z
date_published: 2016-09-25T00:00:00Z
date_updated: 2021-01-12T06:49:13Z
day: '25'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-319-47151-8_9
file:
- access_level: open_access
checksum: 994e164b558c47bacf8dc066dd27c8fc
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:49Z
date_updated: 2020-07-14T12:44:39Z
file_id: '4840'
file_name: IST-2017-781-v1+1_main.pdf
file_size: 683955
relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: ' 9957'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 128 - 144
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '6107'
pubrep_id: '781'
quality_controlled: '1'
scopus_import: 1
status: public
title: Discrete abstraction of multiaffine systems
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9957
year: '2016'
...
---
_id: '1229'
abstract:
- lang: eng
text: Witness encryption (WE) was introduced by Garg et al. [GGSW13]. A WE scheme
is defined for some NP language L and lets a sender encrypt messages relative
to instances x. A ciphertext for x can be decrypted using w witnessing x ∈ L,
but hides the message if x ∈ L. Garg et al. construct WE from multilinear maps
and give another construction [GGH+13b] using indistinguishability obfuscation
(iO) for circuits. Due to the reliance on such heavy tools, WE can cur- rently
hardly be implemented on powerful hardware and will unlikely be realizable on
constrained devices like smart cards any time soon. We construct a WE scheme where
encryption is done by simply computing a Naor-Yung ciphertext (two CPA encryptions
and a NIZK proof). To achieve this, our scheme has a setup phase, which outputs
public parameters containing an obfuscated circuit (only required for decryption),
two encryption keys and a common reference string (used for encryption). This
setup need only be run once, and the parame- ters can be used for arbitrary many
encryptions. Our scheme can also be turned into a functional WE scheme, where
a message is encrypted w.r.t. a statement and a function f, and decryption with
a witness w yields f (m, w). Our construction is inspired by the functional encryption
scheme by Garg et al. and we prove (selective) security assuming iO and statistically
simulation-sound NIZK. We give a construction of the latter in bilinear groups
and combining it with ElGamal encryption, our ciphertexts are of size 1.3 kB at
a 128-bit security level and can be computed on a smart card.
acknowledgement: Research supported by the European Research Council, ERC starting grant
(259668-PSPC) and ERC consolidator grant (682815 - TOCNeT).
alternative_title:
- LNCS
author:
- first_name: Hamza M
full_name: Abusalah, Hamza M
id: 40297222-F248-11E8-B48F-1D18A9856A87
last_name: Abusalah
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- 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: 'Abusalah HM, Fuchsbauer G, Pietrzak KZ. Offline witness encryption. In: Vol
9696. Springer; 2016:285-303. doi:10.1007/978-3-319-39555-5_16'
apa: 'Abusalah, H. M., Fuchsbauer, G., & Pietrzak, K. Z. (2016). Offline witness
encryption (Vol. 9696, pp. 285–303). Presented at the ACNS: Applied Cryptography
and Network Security, Guildford, UK: Springer. https://doi.org/10.1007/978-3-319-39555-5_16'
chicago: Abusalah, Hamza M, Georg Fuchsbauer, and Krzysztof Z Pietrzak. “Offline
Witness Encryption,” 9696:285–303. Springer, 2016. https://doi.org/10.1007/978-3-319-39555-5_16.
ieee: 'H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Offline witness encryption,”
presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK,
2016, vol. 9696, pp. 285–303.'
ista: 'Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Offline witness encryption.
ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696, 285–303.'
mla: Abusalah, Hamza M., et al. Offline Witness Encryption. Vol. 9696, Springer,
2016, pp. 285–303, doi:10.1007/978-3-319-39555-5_16.
short: H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 285–303.
conference:
end_date: 2016-06-22
location: Guildford, UK
name: 'ACNS: Applied Cryptography and Network Security'
start_date: 2016-06-19
date_created: 2018-12-11T11:50:50Z
date_published: 2016-06-09T00:00:00Z
date_updated: 2023-09-07T12:30:22Z
day: '09'
ddc:
- '005'
- '600'
department:
- _id: KrPi
doi: 10.1007/978-3-319-39555-5_16
ec_funded: 1
file:
- access_level: open_access
checksum: 34fa9ce681da845a1ba945ba3dc57867
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:20Z
date_updated: 2020-07-14T12:44:39Z
file_id: '5273'
file_name: IST-2017-765-v1+1_838.pdf
file_size: 515000
relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: ' 9696'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 285 - 303
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_status: published
publisher: Springer
publist_id: '6105'
pubrep_id: '765'
quality_controlled: '1'
related_material:
record:
- id: '83'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Offline witness encryption
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9696
year: '2016'
...
---
_id: '1230'
abstract:
- lang: eng
text: Concolic testing is a promising method for generating test suites for large
programs. However, it suffers from the path-explosion problem and often fails
to find tests that cover difficult-to-reach parts of programs. In contrast, model
checkers based on counterexample-guided abstraction refinement explore programs
exhaustively, while failing to scale on large programs with precision. In this
paper, we present a novel method that iteratively combines concolic testing and
model checking to find a test suite for a given coverage criterion. If concolic
testing fails to cover some test goals, then the model checker refines its program
abstraction to prove more paths infeasible, which reduces the search space for
concolic testing. We have implemented our method on top of the concolictesting
tool Crest and the model checker CpaChecker. We evaluated our tool on a collection
of programs and a category of SvComp benchmarks. In our experiments, we observed
an improvement in branch coverage compared to Crest from 48% to 63% in the best
case, and from 66% to 71% on average.
acknowledgement: "We thank Andrey Kupriyanov for feedback on the manuscript,\r\nand
Michael Tautschnig for help with preparing the experiments. This research was supported
in part by the European Research Council (ERC) under grant 267989 (QUAREM) and by
the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein
Award)."
alternative_title:
- LNCS
author:
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Daca P, Gupta A, Henzinger TA. Abstraction-driven concolic testing. In: Vol
9583. Springer; 2016:328-347. doi:10.1007/978-3-662-49122-5_16'
apa: 'Daca, P., Gupta, A., & Henzinger, T. A. (2016). Abstraction-driven concolic
testing (Vol. 9583, pp. 328–347). Presented at the VMCAI: Verification, Model
Checking and Abstract Interpretation, St. Petersburg, FL, USA: Springer. https://doi.org/10.1007/978-3-662-49122-5_16'
chicago: Daca, Przemyslaw, Ashutosh Gupta, and Thomas A Henzinger. “Abstraction-Driven
Concolic Testing,” 9583:328–47. Springer, 2016. https://doi.org/10.1007/978-3-662-49122-5_16.
ieee: 'P. Daca, A. Gupta, and T. A. Henzinger, “Abstraction-driven concolic testing,”
presented at the VMCAI: Verification, Model Checking and Abstract Interpretation,
St. Petersburg, FL, USA, 2016, vol. 9583, pp. 328–347.'
ista: 'Daca P, Gupta A, Henzinger TA. 2016. Abstraction-driven concolic testing.
VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 9583,
328–347.'
mla: Daca, Przemyslaw, et al. Abstraction-Driven Concolic Testing. Vol. 9583,
Springer, 2016, pp. 328–47, doi:10.1007/978-3-662-49122-5_16.
short: P. Daca, A. Gupta, T.A. Henzinger, in:, Springer, 2016, pp. 328–347.
conference:
end_date: 2016-01-19
location: St. Petersburg, FL, USA
name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
start_date: 2016-01-17
date_created: 2018-12-11T11:50:50Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2023-09-07T11:58:33Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-662-49122-5_16
ec_funded: 1
intvolume: ' 9583'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.02615
month: '01'
oa: 1
oa_version: Preprint
page: 328 - 347
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '6104'
quality_controlled: '1'
related_material:
record:
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Abstraction-driven concolic testing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9583
year: '2016'
...
---
_id: '1231'
abstract:
- lang: eng
text: 'We study the time-and memory-complexities of the problem of computing labels
of (multiple) randomly selected challenge-nodes in a directed acyclic graph. The
w-bit label of a node is the hash of the labels of its parents, and the hash function
is modeled as a random oracle. Specific instances of this problem underlie both
proofs of space [Dziembowski et al. CRYPTO’15] as well as popular memory-hard
functions like scrypt. As our main tool, we introduce the new notion of a probabilistic
parallel entangled pebbling game, a new type of combinatorial pebbling game on
a graph, which is closely related to the labeling game on the same graph. As a
first application of our framework, we prove that for scrypt, when the underlying
hash function is invoked n times, the cumulative memory complexity (CMC) (a notion
recently introduced by Alwen and Serbinenko (STOC’15) to capture amortized memory-hardness
for parallel adversaries) is at least Ω(w · (n/ log(n))2). This bound holds for
adversaries that can store many natural functions of the labels (e.g., linear
combinations), but still not arbitrary functions thereof. We then introduce and
study a combinatorial quantity, and show how a sufficiently small upper bound
on it (which we conjecture) extends our CMC bound for scrypt to hold against arbitrary
adversaries. We also show that such an upper bound solves the main open problem
for proofs-of-space protocols: namely, establishing that the time complexity of
computing the label of a random node in a graph on n nodes (given an initial kw-bit
state) reduces tightly to the time complexity for black pebbling on the same graph
(given an initial k-node pebbling).'
acknowledgement: "Joël Alwen, Chethan Kamath, and Krzysztof Pietrzak’s research is
partially supported by an ERC starting grant (259668-PSPC). Vladimir Kolmogorov
is partially supported by an ERC consolidator grant (616160-DOICV). Binyi Chen was
partially supported by NSF grants CNS-1423566 and CNS-1514526, and a gift from the
Gareatis Foundation. Stefano Tessaro was partially supported by NSF grants CNS-1423566,
CNS-1528178, a Hellman Fellowship, and the Glen and Susanne Culler Chair.\r\n\r\nThis
work was done in part while the authors were visiting the Simons Institute for the
Theory of Computing, supported by the Simons Foundation and by the DIMACS/Simons
Collaboration in Cryptography through NSF grant CNS-1523467."
alternative_title:
- LNCS
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Binyi
full_name: Chen, Binyi
last_name: Chen
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Stefano
full_name: Tessaro, Stefano
last_name: Tessaro
citation:
ama: 'Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S.
On the complexity of scrypt and proofs of space in the parallel random oracle
model. In: Vol 9666. Springer; 2016:358-387. doi:10.1007/978-3-662-49896-5_13'
apa: 'Alwen, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z.,
& Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the
parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT:
Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer.
https://doi.org/10.1007/978-3-662-49896-5_13'
chicago: Alwen, Joel F, Binyi Chen, Chethan Kamath Hosdurg, Vladimir Kolmogorov,
Krzysztof Z Pietrzak, and Stefano Tessaro. “On the Complexity of Scrypt and Proofs
of Space in the Parallel Random Oracle Model,” 9666:358–87. Springer, 2016. https://doi.org/10.1007/978-3-662-49896-5_13.
ieee: 'J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and
S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random
oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic
Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.'
ista: 'Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S.
2016. On the complexity of scrypt and proofs of space in the parallel random oracle
model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol.
9666, 358–387.'
mla: Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in
the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13.
short: J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S.
Tessaro, in:, Springer, 2016, pp. 358–387.
conference:
end_date: 2016-05-12
location: Vienna, Austria
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2016-05-08
date_created: 2018-12-11T11:50:51Z
date_published: 2016-04-28T00:00:00Z
date_updated: 2021-01-12T06:49:15Z
day: '28'
department:
- _id: KrPi
- _id: VlKo
doi: 10.1007/978-3-662-49896-5_13
ec_funded: 1
intvolume: ' 9666'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/100
month: '04'
oa: 1
oa_version: Submitted Version
page: 358 - 387
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_status: published
publisher: Springer
publist_id: '6103'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the complexity of scrypt and proofs of space in the parallel random oracle
model
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9666
year: '2016'
...
---
_id: '1232'
abstract:
- lang: eng
text: Mitochondrial electron transport chain complexes are organized into supercomplexes
responsible for carrying out cellular respiration. Here we present three architectures
of mammalian (ovine) supercomplexes determined by cryo-electron microscopy. We
identify two distinct arrangements of supercomplex CICIII 2 CIV (the respirasome)
- a major 'tight' form and a minor 'loose' form (resolved at the resolution of
5.8 Å and 6.7 Å, respectively), which may represent different stages in supercomplex
assembly or disassembly. We have also determined an architecture of supercomplex
CICIII 2 at 7.8 Å resolution. All observed density can be attributed to the known
80 subunits of the individual complexes, including 132 transmembrane helices.
The individual complexes form tight interactions that vary between the architectures,
with complex IV subunit COX7a switching contact from complex III to complex I.
The arrangement of active sites within the supercomplex may help control reactive
oxygen species production. To our knowledge, these are the first complete architectures
of the dominant, physiologically relevant state of the electron transport chain.
acknowledgement: We thank the MRC LMB Cambridge for the use of the Titan Krios microscope.
Data processing was performed using the IST high-performance computer cluster. J.A.L.
holds a long-term fellowship from FEBS. K.F. is partially funded by a MRC UK PhD
fellowship.
author:
- first_name: James A
full_name: Letts, James A
id: 322DA418-F248-11E8-B48F-1D18A9856A87
last_name: Letts
orcid: 0000-0002-9864-3586
- first_name: Karol
full_name: Fiedorczuk, Karol
id: 5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0
last_name: Fiedorczuk
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Letts JA, Fiedorczuk K, Sazanov LA. The architecture of respiratory supercomplexes.
Nature. 2016;537(7622):644-648. doi:10.1038/nature19774
apa: Letts, J. A., Fiedorczuk, K., & Sazanov, L. A. (2016). The architecture
of respiratory supercomplexes. Nature. Nature Publishing Group. https://doi.org/10.1038/nature19774
chicago: Letts, James A, Karol Fiedorczuk, and Leonid A Sazanov. “The Architecture
of Respiratory Supercomplexes.” Nature. Nature Publishing Group, 2016.
https://doi.org/10.1038/nature19774.
ieee: J. A. Letts, K. Fiedorczuk, and L. A. Sazanov, “The architecture of respiratory
supercomplexes,” Nature, vol. 537, no. 7622. Nature Publishing Group, pp.
644–648, 2016.
ista: Letts JA, Fiedorczuk K, Sazanov LA. 2016. The architecture of respiratory
supercomplexes. Nature. 537(7622), 644–648.
mla: Letts, James A., et al. “The Architecture of Respiratory Supercomplexes.” Nature,
vol. 537, no. 7622, Nature Publishing Group, 2016, pp. 644–48, doi:10.1038/nature19774.
short: J.A. Letts, K. Fiedorczuk, L.A. Sazanov, Nature 537 (2016) 644–648.
date_created: 2018-12-11T11:50:51Z
date_published: 2016-09-29T00:00:00Z
date_updated: 2021-01-12T06:49:16Z
day: '29'
department:
- _id: LeSa
doi: 10.1038/nature19774
intvolume: ' 537'
issue: '7622'
language:
- iso: eng
month: '09'
oa_version: None
page: 644 - 648
project:
- _id: 2593EBD6-B435-11E9-9278-68D0E5697425
name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes
(FEBS)
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '6102'
quality_controlled: '1'
scopus_import: 1
status: public
title: The architecture of respiratory supercomplexes
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 537
year: '2016'
...
---
_id: '1233'
abstract:
- lang: eng
text: About three decades ago it was realized that implementing private channels
between parties which can be adaptively corrupted requires an encryption scheme
that is secure against selective opening attacks. Whether standard (IND-CPA) security
implies security against selective opening attacks has been a major open question
since. The only known reduction from selective opening to IND-CPA security loses
an exponential factor. A polynomial reduction is only known for the very special
case where the distribution considered in the selective opening security experiment
is a product distribution, i.e., the messages are sampled independently from each
other. In this paper we give a reduction whose loss is quantified via the dependence
graph (where message dependencies correspond to edges) of the underlying message
distribution. In particular, for some concrete distributions including Markov
distributions, our reduction is polynomial.
acknowledgement: G. Fuchsbauer and K. Pietrzak are supported by the European Research
Council, ERC Starting Grant (259668-PSPC). F. Heuer is funded by a Sofja Kovalevskaja
Award of the Alexander von Humboldt Foundation and DFG SPP 1736, Algorithms for
BIG DATA. E. Kiltz is supported by a Sofja Kovalevskaja Award of the Alexander von
Humboldt Foundation, the German Israel Foundation, and ERC Project ERCC (FP7/615074).
alternative_title:
- LNCS
author:
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Felix
full_name: Heuer, Felix
last_name: Heuer
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- 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, Heuer F, Kiltz E, Pietrzak KZ. Standard security does imply
security against selective opening for markov distributions. In: Vol 9562. Springer;
2016:282-305. doi:10.1007/978-3-662-49096-9_12'
apa: 'Fuchsbauer, G., Heuer, F., Kiltz, E., & Pietrzak, K. Z. (2016). Standard
security does imply security against selective opening for markov distributions
(Vol. 9562, pp. 282–305). Presented at the TCC: Theory of Cryptography Conference,
Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-662-49096-9_12'
chicago: Fuchsbauer, Georg, Felix Heuer, Eike Kiltz, and Krzysztof Z Pietrzak. “Standard
Security Does Imply Security against Selective Opening for Markov Distributions,”
9562:282–305. Springer, 2016. https://doi.org/10.1007/978-3-662-49096-9_12.
ieee: 'G. Fuchsbauer, F. Heuer, E. Kiltz, and K. Z. Pietrzak, “Standard security
does imply security against selective opening for markov distributions,” presented
at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel, 2016, vol. 9562,
pp. 282–305.'
ista: 'Fuchsbauer G, Heuer F, Kiltz E, Pietrzak KZ. 2016. Standard security does
imply security against selective opening for markov distributions. TCC: Theory
of Cryptography Conference, LNCS, vol. 9562, 282–305.'
mla: Fuchsbauer, Georg, et al. Standard Security Does Imply Security against
Selective Opening for Markov Distributions. Vol. 9562, Springer, 2016, pp.
282–305, doi:10.1007/978-3-662-49096-9_12.
short: G. Fuchsbauer, F. Heuer, E. Kiltz, K.Z. Pietrzak, in:, Springer, 2016, pp.
282–305.
conference:
end_date: 2016-01-13
location: Tel Aviv, Israel
name: 'TCC: Theory of Cryptography Conference'
start_date: 2016-01-10
date_created: 2018-12-11T11:50:51Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:49:16Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-662-49096-9_12
ec_funded: 1
intvolume: ' 9562'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2015/853
month: '01'
oa: 1
oa_version: Submitted Version
page: 282 - 305
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '6100'
quality_controlled: '1'
scopus_import: 1
status: public
title: Standard security does imply security against selective opening for markov
distributions
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9562
year: '2016'
...
---
_id: '1234'
abstract:
- lang: eng
text: We present a new algorithm for the statistical model checking of Markov chains
with respect to unbounded temporal properties, including full linear temporal
logic. The main idea is that we monitor each simulation run on the fly, in order
to detect quickly if a bottom strongly connected component is entered with high
probability, in which case the simulation run can be terminated early. As a result,
our simulation runs are often much shorter than required by termination bounds
that are computed a priori for a desired level of confidence on a large state
space. In comparison to previous algorithms for statistical model checking our
method is not only faster in many cases but also requires less information about
the system, namely, only the minimum transition probability that occurs in the
Markov chain. In addition, our method can be generalised to unbounded quantitative
properties such as mean-payoff bounds.
acknowledgement: "This research was funded in part by the European Research Council
(ERC) under\r\ngrant agreement 267989 (QUAREM), the Austrian Science Fund
\ (FWF) under\r\ngrants project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award),
the Peo-\r\nple Programme (Marie Curie Actions) of the European Union’s Seventh
Framework\r\nProgramme (FP7/2007-2013) REA Grant No 291734, the SNSF Advanced Postdoc.\r\nMobility
Fellowship – grant number P300P2\r\n161067, and the Czech Science Foun-\r\ndation
under grant agreement P202/12/G061."
alternative_title:
- LNCS
author:
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- 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: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
citation:
ama: 'Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking
for unbounded temporal properties. In: Vol 9636. Springer; 2016:112-129. doi:10.1007/978-3-662-49674-9_7'
apa: 'Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2016). Faster
statistical model checking for unbounded temporal properties (Vol. 9636, pp. 112–129).
Presented at the TACAS: Tools and Algorithms for the Construction and Analysis
of Systems, Eindhoven, The Netherlands: Springer. https://doi.org/10.1007/978-3-662-49674-9_7'
chicago: Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov.
“Faster Statistical Model Checking for Unbounded Temporal Properties,” 9636:112–29.
Springer, 2016. https://doi.org/10.1007/978-3-662-49674-9_7.
ieee: 'P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical
model checking for unbounded temporal properties,” presented at the TACAS: Tools
and Algorithms for the Construction and Analysis of Systems, Eindhoven, The Netherlands,
2016, vol. 9636, pp. 112–129.'
ista: 'Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Faster statistical model
checking for unbounded temporal properties. TACAS: Tools and Algorithms for the
Construction and Analysis of Systems, LNCS, vol. 9636, 112–129.'
mla: Daca, Przemyslaw, et al. Faster Statistical Model Checking for Unbounded
Temporal Properties. Vol. 9636, Springer, 2016, pp. 112–29, doi:10.1007/978-3-662-49674-9_7.
short: P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Springer, 2016, pp.
112–129.
conference:
end_date: 2016-04-08
location: Eindhoven, The Netherlands
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2016-04-02
date_created: 2018-12-11T11:50:51Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2023-09-07T11:58:33Z
day: '01'
department:
- _id: ToHe
- _id: CaGu
doi: 10.1007/978-3-662-49674-9_7
ec_funded: 1
intvolume: ' 9636'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.05739
month: '01'
oa: 1
oa_version: Preprint
page: 112 - 129
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Springer
publist_id: '6099'
quality_controlled: '1'
related_material:
record:
- id: '471'
relation: later_version
status: public
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Faster statistical model checking for unbounded temporal properties
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9636
year: '2016'
...
---
_id: '1235'
abstract:
- lang: eng
text: 'A constrained pseudorandom function (CPRF) F: K×X → Y for a family T of subsets
of χ is a function where for any key k ∈ K and set S ∈ T one can efficiently compute
a short constrained key kS, which allows to evaluate F(k, ·) on all inputs x ∈
S, while the outputs on all inputs x /∈ S look random even given kS. Abusalah
et al. recently constructed the first constrained PRF for inputs of arbitrary
length whose sets S are decided by Turing machines. They use their CPRF to build
broadcast encryption and the first ID-based non-interactive key exchange for an
unbounded number of users. Their constrained keys are obfuscated circuits and
are therefore large. In this work we drastically reduce the key size and define
a constrained key for a Turing machine M as a short signature on M. For this,
we introduce a new signature primitive with constrained signing keys that let
one only sign certain messages, while forging a signature on others is hard even
when knowing the coins for key generation.'
acknowledgement: H. Abusalah—Research supported by the European Research Council,
ERC starting grant (259668-PSPC) and ERC consolidator grant (682815 - TOCNeT).
alternative_title:
- LNCS
author:
- first_name: Hamza M
full_name: Abusalah, Hamza M
id: 40297222-F248-11E8-B48F-1D18A9856A87
last_name: Abusalah
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
citation:
ama: 'Abusalah HM, Fuchsbauer G. Constrained PRFs for unbounded inputs with short
keys. In: Vol 9696. Springer; 2016:445-463. doi:10.1007/978-3-319-39555-5_24'
apa: 'Abusalah, H. M., & Fuchsbauer, G. (2016). Constrained PRFs for unbounded
inputs with short keys (Vol. 9696, pp. 445–463). Presented at the ACNS: Applied
Cryptography and Network Security, Guildford, UK: Springer. https://doi.org/10.1007/978-3-319-39555-5_24'
chicago: Abusalah, Hamza M, and Georg Fuchsbauer. “Constrained PRFs for Unbounded
Inputs with Short Keys,” 9696:445–63. Springer, 2016. https://doi.org/10.1007/978-3-319-39555-5_24.
ieee: 'H. M. Abusalah and G. Fuchsbauer, “Constrained PRFs for unbounded inputs
with short keys,” presented at the ACNS: Applied Cryptography and Network Security,
Guildford, UK, 2016, vol. 9696, pp. 445–463.'
ista: 'Abusalah HM, Fuchsbauer G. 2016. Constrained PRFs for unbounded inputs with
short keys. ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696,
445–463.'
mla: Abusalah, Hamza M., and Georg Fuchsbauer. Constrained PRFs for Unbounded
Inputs with Short Keys. Vol. 9696, Springer, 2016, pp. 445–63, doi:10.1007/978-3-319-39555-5_24.
short: H.M. Abusalah, G. Fuchsbauer, in:, Springer, 2016, pp. 445–463.
conference:
end_date: 2016-06-22
location: Guildford, UK
name: 'ACNS: Applied Cryptography and Network Security'
start_date: 2016-06-19
date_created: 2018-12-11T11:50:52Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2023-09-07T12:30:22Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-39555-5_24
ec_funded: 1
intvolume: ' 9696'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/279.pdf
month: '01'
oa: 1
oa_version: Submitted Version
page: 445 - 463
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_status: published
publisher: Springer
publist_id: '6098'
quality_controlled: '1'
related_material:
record:
- id: '83'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Constrained PRFs for unbounded inputs with short keys
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9696
year: '2016'
...
---
_id: '1236'
abstract:
- lang: eng
text: 'A constrained pseudorandom function F: K × X → Y for a family T ⊆ 2X of subsets
of X is a function where for any key k ∈ K and set S ∈ T one can efficiently compute
a constrained key kS which allows to evaluate F (k, ·) on all inputs x ∈ S, while
even given this key, the outputs on all inputs x ∉ S look random. At Asiacrypt’13
Boneh and Waters gave a construction which supports the most general set family
so far. Its keys kc are defined for sets decided by boolean circuits C and enable
evaluation of the PRF on any x ∈ X where C(x) = 1. In their construction the PRF
input length and the size of the circuits C for which constrained keys can be
computed must be fixed beforehand during key generation. We construct a constrained
PRF that has an unbounded input length and whose constrained keys can be defined
for any set recognized by a Turing machine. The only a priori bound we make is
on the description size of the machines. We prove our construction secure assuming
publiccoin differing-input obfuscation. As applications of our constrained PRF
we build a broadcast encryption scheme where the number of potential receivers
need not be fixed at setup (in particular, the length of the keys is independent
of the number of parties) and the first identity-based non-interactive key exchange
protocol with no bound on the number of parties that can agree on a shared key.'
acknowledgement: Supported by the European Research Council, ERC Starting Grant (259668-PSPC).
alternative_title:
- LNCS
author:
- first_name: Hamza M
full_name: Abusalah, Hamza M
id: 40297222-F248-11E8-B48F-1D18A9856A87
last_name: Abusalah
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- 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: 'Abusalah HM, Fuchsbauer G, Pietrzak KZ. Constrained PRFs for unbounded inputs.
In: Vol 9610. Springer; 2016:413-428. doi:10.1007/978-3-319-29485-8_24'
apa: 'Abusalah, H. M., Fuchsbauer, G., & Pietrzak, K. Z. (2016). Constrained
PRFs for unbounded inputs (Vol. 9610, pp. 413–428). Presented at the CT-RSA: Topics
in Cryptology, San Francisco, CA, USA: Springer. https://doi.org/10.1007/978-3-319-29485-8_24'
chicago: Abusalah, Hamza M, Georg Fuchsbauer, and Krzysztof Z Pietrzak. “Constrained
PRFs for Unbounded Inputs,” 9610:413–28. Springer, 2016. https://doi.org/10.1007/978-3-319-29485-8_24.
ieee: 'H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Constrained PRFs for
unbounded inputs,” presented at the CT-RSA: Topics in Cryptology, San Francisco,
CA, USA, 2016, vol. 9610, pp. 413–428.'
ista: 'Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Constrained PRFs for unbounded
inputs. CT-RSA: Topics in Cryptology, LNCS, vol. 9610, 413–428.'
mla: Abusalah, Hamza M., et al. Constrained PRFs for Unbounded Inputs. Vol.
9610, Springer, 2016, pp. 413–28, doi:10.1007/978-3-319-29485-8_24.
short: H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 413–428.
conference:
end_date: 2016-03-04
location: San Francisco, CA, USA
name: 'CT-RSA: Topics in Cryptology'
start_date: 2016-02-29
date_created: 2018-12-11T11:50:52Z
date_published: 2016-02-02T00:00:00Z
date_updated: 2023-09-07T12:30:22Z
day: '02'
ddc:
- '005'
- '600'
department:
- _id: KrPi
doi: 10.1007/978-3-319-29485-8_24
ec_funded: 1
file:
- access_level: open_access
checksum: 3851cee49933ae13b1272e516f213e13
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:05Z
date_updated: 2020-07-14T12:44:41Z
file_id: '4664'
file_name: IST-2017-764-v1+1_279.pdf
file_size: 495176
relation: main_file
file_date_updated: 2020-07-14T12:44:41Z
has_accepted_license: '1'
intvolume: ' 9610'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Submitted Version
page: 413 - 428
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '6097'
pubrep_id: '764'
quality_controlled: '1'
related_material:
record:
- id: '83'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Constrained PRFs for unbounded inputs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9610
year: '2016'
...
---
_id: '1237'
abstract:
- lang: eng
text: 'Bitmap images of arbitrary dimension may be formally perceived as unions
of m-dimensional boxes aligned with respect to a rectangular grid in ℝm. Cohomology
and homology groups are well known topological invariants of such sets. Cohomological
operations, such as the cup product, provide higher-order algebraic topological
invariants, especially important for digital images of dimension higher than 3.
If such an operation is determined at the level of simplicial chains [see e.g.
González-Díaz, Real, Homology, Homotopy Appl, 2003, 83-93], then it is effectively
computable. However, decomposing a cubical complex into a simplicial one deleteriously
affects the efficiency of such an approach. In order to avoid this overhead, a
direct cubical approach was applied in [Pilarczyk, Real, Adv. Comput. Math., 2015,
253-275] for the cup product in cohomology, and implemented in the ChainCon software
package [http://www.pawelpilarczyk.com/chaincon/]. We establish a formula for
the Steenrod square operations [see Steenrod, Annals of Mathematics. Second Series,
1947, 290-320] directly at the level of cubical chains, and we prove the correctness
of this formula. An implementation of this formula is programmed in C++ within
the ChainCon software framework. We provide a few examples and discuss the effectiveness
of this approach. One specific application follows from the fact that Steenrod
squares yield tests for the topological extension problem: Can a given map A →
Sd to a sphere Sd be extended to a given super-complex X of A? In particular,
the ROB-SAT problem, which is to decide for a given function f: X → ℝm and a value
r > 0 whether every g: X → ℝm with ∥g - f ∥∞ ≤ r has a root, reduces to the
extension problem.'
acknowledgement: The research conducted by both authors has received funding from
the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework
Programme (FP7/2007-2013) under REA grant agreements no. 291734 (for M. K.) and
no. 622033 (for P. P.).
alternative_title:
- LNCS
author:
- first_name: Marek
full_name: Krcál, Marek
id: 33E21118-F248-11E8-B48F-1D18A9856A87
last_name: Krcál
- first_name: Pawel
full_name: Pilarczyk, Pawel
id: 3768D56A-F248-11E8-B48F-1D18A9856A87
last_name: Pilarczyk
citation:
ama: 'Krcál M, Pilarczyk P. Computation of cubical Steenrod squares. In: Vol 9667.
Springer; 2016:140-151. doi:10.1007/978-3-319-39441-1_13'
apa: 'Krcál, M., & Pilarczyk, P. (2016). Computation of cubical Steenrod squares
(Vol. 9667, pp. 140–151). Presented at the CTIC: Computational Topology in Image
Context, Marseille, France: Springer. https://doi.org/10.1007/978-3-319-39441-1_13'
chicago: Krcál, Marek, and Pawel Pilarczyk. “Computation of Cubical Steenrod Squares,”
9667:140–51. Springer, 2016. https://doi.org/10.1007/978-3-319-39441-1_13.
ieee: 'M. Krcál and P. Pilarczyk, “Computation of cubical Steenrod squares,” presented
at the CTIC: Computational Topology in Image Context, Marseille, France, 2016,
vol. 9667, pp. 140–151.'
ista: 'Krcál M, Pilarczyk P. 2016. Computation of cubical Steenrod squares. CTIC:
Computational Topology in Image Context, LNCS, vol. 9667, 140–151.'
mla: Krcál, Marek, and Pawel Pilarczyk. Computation of Cubical Steenrod Squares.
Vol. 9667, Springer, 2016, pp. 140–51, doi:10.1007/978-3-319-39441-1_13.
short: M. Krcál, P. Pilarczyk, in:, Springer, 2016, pp. 140–151.
conference:
end_date: 2016-06-17
location: Marseille, France
name: 'CTIC: Computational Topology in Image Context'
start_date: 2016-06-15
date_created: 2018-12-11T11:50:52Z
date_published: 2016-06-02T00:00:00Z
date_updated: 2021-01-12T06:49:18Z
day: '02'
department:
- _id: UlWa
- _id: HeEd
doi: 10.1007/978-3-319-39441-1_13
ec_funded: 1
intvolume: ' 9667'
language:
- iso: eng
month: '06'
oa_version: None
page: 140 - 151
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 255F06BE-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '622033'
name: Persistent Homology - Images, Data and Maps
publication_status: published
publisher: Springer
publist_id: '6096'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computation of cubical Steenrod squares
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9667
year: '2016'
...
---
_id: '1238'
abstract:
- lang: eng
text: The dynamic localization of endosomal compartments labeled with targeted fluorescent
protein tags is routinely followed by time lapse fluorescence microscopy approaches
and single particle tracking algorithms. In this way trajectories of individual
endosomes can be mapped and linked to physiological processes as cell growth.
However, other aspects of dynamic behavior including endosomal interactions are
difficult to follow in this manner. Therefore, we characterized the localization
and dynamic properties of early and late endosomes throughout the entire course
of root hair formation by means of spinning disc time lapse imaging and post-acquisition
automated multitracking and quantitative analysis. Our results show differential
motile behavior of early and late endosomes and interactions of late endosomes
that may be specified to particular root hair domains. Detailed data analysis
revealed a particular transient interaction between late endosomes—termed herein
as dancing-endosomes—which is not concluding to vesicular fusion. Endosomes preferentially
located in the root hair tip interacted as dancing-endosomes and traveled short
distances during this interaction. Finally, sizes of early and late endosomes
were addressed by means of super-resolution structured illumination microscopy
(SIM) to corroborate measurements on the spinning disc. This is a first study
providing quantitative microscopic data on dynamic spatio-temporal interactions
of endosomes during root hair tip growth.
acknowledgement: "This work was supported by National Program for Sustainability I
(grant no. LO1204) provided by the Czech Ministry of Education and by Institutional
Fund of Palacký University Olomouc (GK and OŠ).\r\nWe thank Sabine Fischer for help
with the statistics."
article_number: '1262'
author:
- first_name: Daniel
full_name: Von Wangenheim, Daniel
id: 49E91952-F248-11E8-B48F-1D18A9856A87
last_name: Von Wangenheim
orcid: 0000-0002-6862-1247
- first_name: Amparo
full_name: Rosero, Amparo
last_name: Rosero
- first_name: George
full_name: Komis, George
last_name: Komis
- first_name: Olga
full_name: Šamajová, Olga
last_name: Šamajová
- first_name: Miroslav
full_name: Ovečka, Miroslav
last_name: Ovečka
- first_name: Boris
full_name: Voigt, Boris
last_name: Voigt
- first_name: Jozef
full_name: Šamaj, Jozef
last_name: Šamaj
citation:
ama: von Wangenheim D, Rosero A, Komis G, et al. Endosomal interactions during root
hair growth. Frontiers in Plant Science. 2016;6(JAN2016). doi:10.3389/fpls.2015.01262
apa: von Wangenheim, D., Rosero, A., Komis, G., Šamajová, O., Ovečka, M., Voigt,
B., & Šamaj, J. (2016). Endosomal interactions during root hair growth. Frontiers
in Plant Science. Frontiers Research Foundation. https://doi.org/10.3389/fpls.2015.01262
chicago: Wangenheim, Daniel von, Amparo Rosero, George Komis, Olga Šamajová, Miroslav
Ovečka, Boris Voigt, and Jozef Šamaj. “Endosomal Interactions during Root Hair
Growth.” Frontiers in Plant Science. Frontiers Research Foundation, 2016.
https://doi.org/10.3389/fpls.2015.01262.
ieee: D. von Wangenheim et al., “Endosomal interactions during root hair
growth,” Frontiers in Plant Science, vol. 6, no. JAN2016. Frontiers Research
Foundation, 2016.
ista: von Wangenheim D, Rosero A, Komis G, Šamajová O, Ovečka M, Voigt B, Šamaj
J. 2016. Endosomal interactions during root hair growth. Frontiers in Plant Science.
6(JAN2016), 1262.
mla: von Wangenheim, Daniel, et al. “Endosomal Interactions during Root Hair Growth.”
Frontiers in Plant Science, vol. 6, no. JAN2016, 1262, Frontiers Research
Foundation, 2016, doi:10.3389/fpls.2015.01262.
short: D. von Wangenheim, A. Rosero, G. Komis, O. Šamajová, M. Ovečka, B. Voigt,
J. Šamaj, Frontiers in Plant Science 6 (2016).
date_created: 2018-12-11T11:50:53Z
date_published: 2016-01-29T00:00:00Z
date_updated: 2021-01-12T06:49:18Z
day: '29'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.3389/fpls.2015.01262
file:
- access_level: open_access
checksum: 3127eab844d53564bf47e2b6b42f1ca0
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:36Z
date_updated: 2020-07-14T12:44:41Z
file_id: '4760'
file_name: IST-2016-710-v1+1_fpls-06-01262.pdf
file_size: 1640550
relation: main_file
file_date_updated: 2020-07-14T12:44:41Z
has_accepted_license: '1'
intvolume: ' 6'
issue: JAN2016
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Frontiers in Plant Science
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '6094'
pubrep_id: '710'
quality_controlled: '1'
scopus_import: 1
status: public
title: Endosomal interactions during root hair growth
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2016'
...
---
_id: '1239'
abstract:
- lang: eng
text: Nonadherent polarized cells have been observed to have a pearlike, elongated
shape. Using a minimal model that describes the cell cortex as a thin layer of
contractile active gel, we show that the anisotropy of active stresses, controlled
by cortical viscosity and filament ordering, can account for this morphology.
The predicted shapes can be determined from the flow pattern only; they prove
to be independent of the mechanism at the origin of the cortical flow, and are
only weakly sensitive to the cytoplasmic rheology. In the case of actin flows
resulting from a contractile instability, we propose a phase diagram of three-dimensional
cell shapes that encompasses nonpolarized spherical, elongated, as well as oblate
shapes, all of which have been observed in experiment.
acknowledgement: 'V. R. acknowledges support by the Austrian Science Fund (FWF): (Grant
No. T560-B17).'
article_number: '028102'
author:
- first_name: Andrew
full_name: Callan Jones, Andrew
last_name: Callan Jones
- first_name: Verena
full_name: Ruprecht, Verena
id: 4D71A03A-F248-11E8-B48F-1D18A9856A87
last_name: Ruprecht
orcid: 0000-0003-4088-8633
- first_name: Stefan
full_name: Wieser, Stefan
id: 355AA5A0-F248-11E8-B48F-1D18A9856A87
last_name: Wieser
orcid: 0000-0002-2670-2217
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Raphaël
full_name: Voituriez, Raphaël
last_name: Voituriez
citation:
ama: Callan Jones A, Ruprecht V, Wieser S, Heisenberg C-PJ, Voituriez R. Cortical
flow-driven shapes of nonadherent cells. Physical Review Letters. 2016;116(2).
doi:10.1103/PhysRevLett.116.028102
apa: Callan Jones, A., Ruprecht, V., Wieser, S., Heisenberg, C.-P. J., & Voituriez,
R. (2016). Cortical flow-driven shapes of nonadherent cells. Physical Review
Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.116.028102
chicago: Callan Jones, Andrew, Verena Ruprecht, Stefan Wieser, Carl-Philipp J Heisenberg,
and Raphaël Voituriez. “Cortical Flow-Driven Shapes of Nonadherent Cells.” Physical
Review Letters. American Physical Society, 2016. https://doi.org/10.1103/PhysRevLett.116.028102.
ieee: A. Callan Jones, V. Ruprecht, S. Wieser, C.-P. J. Heisenberg, and R. Voituriez,
“Cortical flow-driven shapes of nonadherent cells,” Physical Review Letters,
vol. 116, no. 2. American Physical Society, 2016.
ista: Callan Jones A, Ruprecht V, Wieser S, Heisenberg C-PJ, Voituriez R. 2016.
Cortical flow-driven shapes of nonadherent cells. Physical Review Letters. 116(2),
028102.
mla: Callan Jones, Andrew, et al. “Cortical Flow-Driven Shapes of Nonadherent Cells.”
Physical Review Letters, vol. 116, no. 2, 028102, American Physical Society,
2016, doi:10.1103/PhysRevLett.116.028102.
short: A. Callan Jones, V. Ruprecht, S. Wieser, C.-P.J. Heisenberg, R. Voituriez,
Physical Review Letters 116 (2016).
date_created: 2018-12-11T11:50:53Z
date_published: 2016-01-15T00:00:00Z
date_updated: 2021-01-12T06:49:19Z
day: '15'
department:
- _id: CaHe
doi: 10.1103/PhysRevLett.116.028102
intvolume: ' 116'
issue: '2'
language:
- iso: eng
month: '01'
oa_version: None
project:
- _id: 2529486C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: T 560-B17
name: Cell- and Tissue Mechanics in Zebrafish Germ Layer Formation
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '6095'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cortical flow-driven shapes of nonadherent cells
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 116
year: '2016'
...
---
_id: '1240'
abstract:
- lang: eng
text: 'Background: Long non-coding RNAs (lncRNAs) are increasingly implicated as
gene regulators and may ultimately be more numerous than protein-coding genes
in the human genome. Despite large numbers of reported lncRNAs, reference annotations
are likely incomplete due to their lower and tighter tissue-specific expression
compared to mRNAs. An unexplored factor potentially confounding lncRNA identification
is inter-individual expression variability. Here, we characterize lncRNA natural
expression variability in human primary granulocytes. Results: We annotate granulocyte
lncRNAs and mRNAs in RNA-seq data from 10 healthy individuals, identifying multiple
lncRNAs absent from reference annotations, and use this to investigate three known
features (higher tissue-specificity, lower expression, and reduced splicing efficiency)
of lncRNAs relative to mRNAs. Expression variability was examined in seven individuals
sampled three times at 1- or more than 1-month intervals. We show that lncRNAs
display significantly more inter-individual expression variability compared to
mRNAs. We confirm this finding in two independent human datasets by analyzing
multiple tissues from the GTEx project and lymphoblastoid cell lines from the
GEUVADIS project. Using the latter dataset we also show that including more human
donors into the transcriptome annotation pipeline allows identification of an
increasing number of lncRNAs, but minimally affects mRNA gene number. Conclusions:
A comprehensive annotation of lncRNAs is known to require an approach that is
sensitive to low and tight tissue-specific expression. Here we show that increased
inter-individual expression variability is an additional general lncRNA feature
to consider when creating a comprehensive annotation of human lncRNAs or proposing
their use as prognostic or disease markers.'
acknowledgement: "This study was partly funded by the Austrian Science Fund (FWF F43-B09,
FWF W1207-B09). PMG is a recipient of a DOC Fellowship of the Austrian Academy of
Sciences.\r\nWe thank Ruth Klement, Tomasz Kulinski, Elisangela Valente, Elisabeth
Salzer,\r\nand Roland Jäger for technical/bioinformatic assistance and advice, the
CeMM\r\nIT department and José Manuel Molero for help and advice on software usage,\r\nthe
Biomedical Sequencing Facility (http://biomedical-sequencing.at/) for\r\nsequencing
and advice, Jacques Colinge, Daniel Andergassen, and Tomasz\r\nKulinski for discussions,
Quanah Hudson and Jörg Menche for reading and\r\ncommenting on the manuscript."
article_number: '14'
author:
- first_name: Aleksandra
full_name: Kornienko, Aleksandra
last_name: Kornienko
- first_name: Christoph
full_name: Dotter, Christoph
id: 4C66542E-F248-11E8-B48F-1D18A9856A87
last_name: Dotter
- first_name: Philipp
full_name: Guenzl, Philipp
last_name: Guenzl
- first_name: Heinz
full_name: Gisslinger, Heinz
last_name: Gisslinger
- first_name: Bettina
full_name: Gisslinger, Bettina
last_name: Gisslinger
- first_name: Ciara
full_name: Cleary, Ciara
last_name: Cleary
- first_name: Robert
full_name: Kralovics, Robert
last_name: Kralovics
- first_name: Florian
full_name: Pauler, Florian
id: 48EA0138-F248-11E8-B48F-1D18A9856A87
last_name: Pauler
- first_name: Denise
full_name: Barlow, Denise
last_name: Barlow
citation:
ama: Kornienko A, Dotter C, Guenzl P, et al. Long non-coding RNAs display higher
natural expression variation than protein-coding genes in healthy humans. Genome
Biology. 2016;17(1). doi:10.1186/s13059-016-0873-8
apa: Kornienko, A., Dotter, C., Guenzl, P., Gisslinger, H., Gisslinger, B., Cleary,
C., … Barlow, D. (2016). Long non-coding RNAs display higher natural expression
variation than protein-coding genes in healthy humans. Genome Biology.
BioMed Central. https://doi.org/10.1186/s13059-016-0873-8
chicago: Kornienko, Aleksandra, Christoph Dotter, Philipp Guenzl, Heinz Gisslinger,
Bettina Gisslinger, Ciara Cleary, Robert Kralovics, Florian Pauler, and Denise
Barlow. “Long Non-Coding RNAs Display Higher Natural Expression Variation than
Protein-Coding Genes in Healthy Humans.” Genome Biology. BioMed Central,
2016. https://doi.org/10.1186/s13059-016-0873-8.
ieee: A. Kornienko et al., “Long non-coding RNAs display higher natural expression
variation than protein-coding genes in healthy humans,” Genome Biology,
vol. 17, no. 1. BioMed Central, 2016.
ista: Kornienko A, Dotter C, Guenzl P, Gisslinger H, Gisslinger B, Cleary C, Kralovics
R, Pauler F, Barlow D. 2016. Long non-coding RNAs display higher natural expression
variation than protein-coding genes in healthy humans. Genome Biology. 17(1),
14.
mla: Kornienko, Aleksandra, et al. “Long Non-Coding RNAs Display Higher Natural
Expression Variation than Protein-Coding Genes in Healthy Humans.” Genome Biology,
vol. 17, no. 1, 14, BioMed Central, 2016, doi:10.1186/s13059-016-0873-8.
short: A. Kornienko, C. Dotter, P. Guenzl, H. Gisslinger, B. Gisslinger, C. Cleary,
R. Kralovics, F. Pauler, D. Barlow, Genome Biology 17 (2016).
date_created: 2018-12-11T11:50:53Z
date_published: 2016-01-29T00:00:00Z
date_updated: 2021-01-12T06:49:20Z
day: '29'
ddc:
- '576'
department:
- _id: GaNo
doi: 10.1186/s13059-016-0873-8
file:
- access_level: open_access
checksum: a268beee1a690801c83ec6729f9ebc5b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:05Z
date_updated: 2020-07-14T12:44:41Z
file_id: '4789'
file_name: IST-2016-709-v1+1_s13059-016-0873-8.pdf
file_size: 2914601
relation: main_file
file_date_updated: 2020-07-14T12:44:41Z
has_accepted_license: '1'
intvolume: ' 17'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Genome Biology
publication_status: published
publisher: BioMed Central
publist_id: '6093'
pubrep_id: '709'
quality_controlled: '1'
scopus_import: 1
status: public
title: Long non-coding RNAs display higher natural expression variation than protein-coding
genes in healthy humans
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2016'
...
---
_id: '1241'
abstract:
- lang: eng
text: 'How likely is it that a population escapes extinction through adaptive evolution?
The answer to this question is of great relevance in conservation biology, where
we aim at species’ rescue and the maintenance of biodiversity, and in agriculture
and medicine, where we seek to hamper the emergence of pesticide or drug resistance.
By reshuffling the genome, recombination has two antagonistic effects on the probability
of evolutionary rescue: It generates and it breaks up favorable gene combinations.
Which of the two effects prevails depends on the fitness effects of mutations
and on the impact of stochasticity on the allele frequencies. In this article,
we analyze a mathematical model for rescue after a sudden environmental change
when adaptation is contingent on mutations at two loci. The analysis reveals a
complex nonlinear dependence of population survival on recombination. We moreover
find that, counterintuitively, a fast eradication of the wild type can promote
rescue in the presence of recombination. The model also shows that two-step rescue
is not unlikely to happen and can even be more likely than single-step rescue
(where adaptation relies on a single mutation), depending on the circumstances.'
acknowledgement: This work was made possible by a “For Women in Science” fellowship
(L’Oréal Österreich in cooperation with the Austrian Commission for the United Nations
Educational, Scientific, and Cultural Organization and the Austrian Academy of Sciences
with financial support from the Federal Ministry for Science and Research Austria)
and European Research Council grant 250152 (to Nick Barton).
author:
- first_name: Hildegard
full_name: Uecker, Hildegard
id: 2DB8F68A-F248-11E8-B48F-1D18A9856A87
last_name: Uecker
orcid: 0000-0001-9435-2813
- first_name: Joachim
full_name: Hermisson, Joachim
last_name: Hermisson
citation:
ama: Uecker H, Hermisson J. The role of recombination in evolutionary rescue. Genetics.
2016;202(2):721-732. doi:10.1534/genetics.115.180299
apa: Uecker, H., & Hermisson, J. (2016). The role of recombination in evolutionary
rescue. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.115.180299
chicago: Uecker, Hildegard, and Joachim Hermisson. “The Role of Recombination in
Evolutionary Rescue.” Genetics. Genetics Society of America, 2016. https://doi.org/10.1534/genetics.115.180299.
ieee: H. Uecker and J. Hermisson, “The role of recombination in evolutionary rescue,”
Genetics, vol. 202, no. 2. Genetics Society of America, pp. 721–732, 2016.
ista: Uecker H, Hermisson J. 2016. The role of recombination in evolutionary rescue.
Genetics. 202(2), 721–732.
mla: Uecker, Hildegard, and Joachim Hermisson. “The Role of Recombination in Evolutionary
Rescue.” Genetics, vol. 202, no. 2, Genetics Society of America, 2016,
pp. 721–32, doi:10.1534/genetics.115.180299.
short: H. Uecker, J. Hermisson, Genetics 202 (2016) 721–732.
date_created: 2018-12-11T11:50:54Z
date_published: 2016-02-01T00:00:00Z
date_updated: 2023-02-21T10:24:19Z
day: '01'
department:
- _id: NiBa
doi: 10.1534/genetics.115.180299
ec_funded: 1
intvolume: ' 202'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://biorxiv.org/content/early/2015/07/06/022020.abstract
month: '02'
oa: 1
oa_version: Preprint
page: 721 - 732
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: 25B67606-B435-11E9-9278-68D0E5697425
name: L'OREAL Fellowship
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '6091'
quality_controlled: '1'
scopus_import: 1
status: public
title: The role of recombination in evolutionary rescue
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2016'
...