---
_id: '2253'
abstract:
- lang: eng
text: Plant growth is achieved predominantly by cellular elongation, which is thought
to be controlled on several levels by apoplastic auxin. Auxin export into the
apoplast is achieved by plasma membrane efflux catalysts of the PIN-FORMED (PIN)
and ATP-binding cassette protein subfamily B/phosphor- glycoprotein (ABCB/PGP)
classes; the latter were shown to depend on interaction with the FKBP42, TWISTED
DWARF1 (TWD1). Here by using a transgenic approach in combination with phenotypical,
biochemical and cell biological analyses we demonstrate the importance of a putative
C-terminal in-plane membrane anchor of TWD1 in the regulation of ABCB-mediated
auxin transport. In contrast with dwarfed twd1 loss-of-function alleles, TWD1
gain-of-function lines that lack a putative in-plane membrane anchor (HA-TWD1-Ct)
show hypermorphic plant architecture, characterized by enhanced stem length and
leaf surface but reduced shoot branching. Greater hypocotyl length is the result
of enhanced cell elongation that correlates with reduced polar auxin transport
capacity for HA-TWD1-Ct. As a consequence, HA-TWD1-Ct displays higher hypocotyl
auxin accumulation, which is shown to result in elevated auxin-induced cell elongation
rates. Our data highlight the importance of C-terminal membrane anchoring for
TWD1 action, which is required for specific regulation of ABCB-mediated auxin
transport. These data support a model in which TWD1 controls lateral ABCB1-mediated
export into the apoplast, which is required for auxin-mediated cell elongation.
article_processing_charge: No
article_type: original
author:
- first_name: Aurélien
full_name: Bailly, Aurélien
last_name: Bailly
- first_name: Bangjun
full_name: Wang, Bangjun
last_name: Wang
- first_name: Marta
full_name: Zwiewka, Marta
last_name: Zwiewka
- first_name: Stephan
full_name: Pollmann, Stephan
last_name: Pollmann
- first_name: Daniel
full_name: Schenck, Daniel
last_name: Schenck
- first_name: Hartwig
full_name: Lüthen, Hartwig
last_name: Lüthen
- first_name: Alexander
full_name: Schulz, Alexander
last_name: Schulz
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Markus
full_name: Geisler, Markus
last_name: Geisler
citation:
ama: Bailly A, Wang B, Zwiewka M, et al. Expression of TWISTED DWARF1 lacking its
in-plane membrane anchor leads to increased cell elongation and hypermorphic growth.
Plant Journal. 2014;77(1):108-118. doi:10.1111/tpj.12369
apa: Bailly, A., Wang, B., Zwiewka, M., Pollmann, S., Schenck, D., Lüthen, H., …
Geisler, M. (2014). Expression of TWISTED DWARF1 lacking its in-plane membrane
anchor leads to increased cell elongation and hypermorphic growth. Plant Journal.
Wiley-Blackwell. https://doi.org/10.1111/tpj.12369
chicago: Bailly, Aurélien, Bangjun Wang, Marta Zwiewka, Stephan Pollmann, Daniel
Schenck, Hartwig Lüthen, Alexander Schulz, Jiří Friml, and Markus Geisler. “Expression
of TWISTED DWARF1 Lacking Its In-Plane Membrane Anchor Leads to Increased Cell
Elongation and Hypermorphic Growth.” Plant Journal. Wiley-Blackwell, 2014.
https://doi.org/10.1111/tpj.12369.
ieee: A. Bailly et al., “Expression of TWISTED DWARF1 lacking its in-plane
membrane anchor leads to increased cell elongation and hypermorphic growth,” Plant
Journal, vol. 77, no. 1. Wiley-Blackwell, pp. 108–118, 2014.
ista: Bailly A, Wang B, Zwiewka M, Pollmann S, Schenck D, Lüthen H, Schulz A, Friml
J, Geisler M. 2014. Expression of TWISTED DWARF1 lacking its in-plane membrane
anchor leads to increased cell elongation and hypermorphic growth. Plant Journal.
77(1), 108–118.
mla: Bailly, Aurélien, et al. “Expression of TWISTED DWARF1 Lacking Its In-Plane
Membrane Anchor Leads to Increased Cell Elongation and Hypermorphic Growth.” Plant
Journal, vol. 77, no. 1, Wiley-Blackwell, 2014, pp. 108–18, doi:10.1111/tpj.12369.
short: A. Bailly, B. Wang, M. Zwiewka, S. Pollmann, D. Schenck, H. Lüthen, A. Schulz,
J. Friml, M. Geisler, Plant Journal 77 (2014) 108–118.
date_created: 2018-12-11T11:56:35Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:18Z
day: '01'
department:
- _id: JiFr
doi: 10.1111/tpj.12369
intvolume: ' 77'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1111/tpj.12369
month: '01'
oa: 1
oa_version: Published Version
page: 108 - 118
project:
- _id: 256BDAB0-B435-11E9-9278-68D0E5697425
name: Innovationsförderung in der Grenzregion Österreich – Tschechische Republik
durch die Schaffung von Synergien im Bereich der Forschungsinfrastruktur
publication: Plant Journal
publication_identifier:
issn:
- '09607412'
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4694'
quality_controlled: '1'
scopus_import: 1
status: public
title: Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to
increased cell elongation and hypermorphic growth
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2014'
...
---
_id: '2254'
abstract:
- lang: eng
text: Theta-gamma network oscillations are thought to represent key reference signals
for information processing in neuronal ensembles, but the underlying synaptic
mechanisms remain unclear. To address this question, we performed whole-cell (WC)
patch-clamp recordings from mature hippocampal granule cells (GCs) in vivo in
the dentate gyrus of anesthetized and awake rats. GCs in vivo fired action potentials
at low frequency, consistent with sparse coding in the dentate gyrus. GCs were
exposed to barrages of fast AMPAR-mediated excitatory postsynaptic currents (EPSCs),
primarily relayed from the entorhinal cortex, and inhibitory postsynaptic currents
(IPSCs), presumably generated by local interneurons. EPSCs exhibited coherence
with the field potential predominantly in the theta frequency band, whereas IPSCs
showed coherence primarily in the gamma range. Action potentials in GCs were phase
locked to network oscillations. Thus, theta-gamma-modulated synaptic currents
may provide a framework for sparse temporal coding of information in the dentate
gyrus.
author:
- first_name: Alejandro
full_name: Pernia-Andrade, Alejandro
id: 36963E98-F248-11E8-B48F-1D18A9856A87
last_name: Pernia-Andrade
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Pernia-Andrade A, Jonas PM. Theta-gamma-modulated synaptic currents in hippocampal
granule cells in vivo define a mechanism for network oscillations. Neuron.
2014;81(1):140-152. doi:10.1016/j.neuron.2013.09.046
apa: Pernia-Andrade, A., & Jonas, P. M. (2014). Theta-gamma-modulated synaptic
currents in hippocampal granule cells in vivo define a mechanism for network oscillations.
Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2013.09.046
chicago: Pernia-Andrade, Alejandro, and Peter M Jonas. “Theta-Gamma-Modulated Synaptic
Currents in Hippocampal Granule Cells in Vivo Define a Mechanism for Network Oscillations.”
Neuron. Elsevier, 2014. https://doi.org/10.1016/j.neuron.2013.09.046.
ieee: A. Pernia-Andrade and P. M. Jonas, “Theta-gamma-modulated synaptic currents
in hippocampal granule cells in vivo define a mechanism for network oscillations,”
Neuron, vol. 81, no. 1. Elsevier, pp. 140–152, 2014.
ista: Pernia-Andrade A, Jonas PM. 2014. Theta-gamma-modulated synaptic currents
in hippocampal granule cells in vivo define a mechanism for network oscillations.
Neuron. 81(1), 140–152.
mla: Pernia-Andrade, Alejandro, and Peter M. Jonas. “Theta-Gamma-Modulated Synaptic
Currents in Hippocampal Granule Cells in Vivo Define a Mechanism for Network Oscillations.”
Neuron, vol. 81, no. 1, Elsevier, 2014, pp. 140–52, doi:10.1016/j.neuron.2013.09.046.
short: A. Pernia-Andrade, P.M. Jonas, Neuron 81 (2014) 140–152.
date_created: 2018-12-11T11:56:35Z
date_published: 2014-01-08T00:00:00Z
date_updated: 2021-01-12T06:56:19Z
day: '08'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1016/j.neuron.2013.09.046
ec_funded: 1
file:
- access_level: open_access
checksum: 438547cfcd9045a22f065f2019f07849
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:48Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4773'
file_name: IST-2016-422-v1+1_1-s2.0-S0896627313009227-main.pdf
file_size: 4373072
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 81'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 140 - 152
project:
- _id: 25C0F108-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '268548'
name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons
- _id: 25C26B1E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P24909-B24
name: Mechanisms of transmitter release at GABAergic synapses
publication: Neuron
publication_identifier:
issn:
- '08966273'
publication_status: published
publisher: Elsevier
publist_id: '4692'
pubrep_id: '422'
quality_controlled: '1'
scopus_import: 1
status: public
title: Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo
define a mechanism for network oscillations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 81
year: '2014'
...
---
_id: '2255'
abstract:
- lang: eng
text: Motivated by applications in biology, we present an algorithm for estimating
the length of tube-like shapes in 3-dimensional Euclidean space. In a first step,
we combine the tube formula of Weyl with integral geometric methods to obtain
an integral representation of the length, which we approximate using a variant
of the Koksma-Hlawka Theorem. In a second step, we use tools from computational
topology to decrease the dependence on small perturbations of the shape. We present
computational experiments that shed light on the stability and the convergence
rate of our algorithm.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Florian
full_name: Pausinger, Florian
id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87
last_name: Pausinger
orcid: 0000-0002-8379-3768
citation:
ama: Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. Journal
of Mathematical Imaging and Vision. 2014;50(1):164-177. doi:10.1007/s10851-013-0468-x
apa: Edelsbrunner, H., & Pausinger, F. (2014). Stable length estimates of tube-like
shapes. Journal of Mathematical Imaging and Vision. Springer. https://doi.org/10.1007/s10851-013-0468-x
chicago: Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates
of Tube-like Shapes.” Journal of Mathematical Imaging and Vision. Springer,
2014. https://doi.org/10.1007/s10851-013-0468-x.
ieee: H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,”
Journal of Mathematical Imaging and Vision, vol. 50, no. 1. Springer, pp.
164–177, 2014.
ista: Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes.
Journal of Mathematical Imaging and Vision. 50(1), 164–177.
mla: Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like
Shapes.” Journal of Mathematical Imaging and Vision, vol. 50, no. 1, Springer,
2014, pp. 164–77, doi:10.1007/s10851-013-0468-x.
short: H. Edelsbrunner, F. Pausinger, Journal of Mathematical Imaging and Vision
50 (2014) 164–177.
date_created: 2018-12-11T11:56:36Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2023-09-07T11:41:25Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/s10851-013-0468-x
ec_funded: 1
file:
- access_level: open_access
checksum: 2f93f3e63a38a85cd4404d7953913b14
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:18Z
date_updated: 2020-07-14T12:45:35Z
file_id: '5204'
file_name: IST-2016-549-v1+1_2014-J-06-LengthEstimate.pdf
file_size: 3941391
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 50'
issue: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 164 - 177
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Journal of Mathematical Imaging and Vision
publication_identifier:
issn:
- '09249907'
publication_status: published
publisher: Springer
publist_id: '4691'
pubrep_id: '549'
quality_controlled: '1'
related_material:
record:
- id: '2843'
relation: earlier_version
status: public
- id: '1399'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Stable length estimates of tube-like shapes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2014'
...
---
_id: '2257'
abstract:
- lang: eng
text: 'Maximum entropy models are the least structured probability distributions
that exactly reproduce a chosen set of statistics measured in an interacting network.
Here we use this principle to construct probabilistic models which describe the
correlated spiking activity of populations of up to 120 neurons in the salamander
retina as it responds to natural movies. Already in groups as small as 10 neurons,
interactions between spikes can no longer be regarded as small perturbations in
an otherwise independent system; for 40 or more neurons pairwise interactions
need to be supplemented by a global interaction that controls the distribution
of synchrony in the population. Here we show that such “K-pairwise” models—being
systematic extensions of the previously used pairwise Ising models—provide an
excellent account of the data. We explore the properties of the neural vocabulary
by: 1) estimating its entropy, which constrains the population''s capacity to
represent visual information; 2) classifying activity patterns into a small set
of metastable collective modes; 3) showing that the neural codeword ensembles
are extremely inhomogenous; 4) demonstrating that the state of individual neurons
is highly predictable from the rest of the population, allowing the capacity for
error correction.'
acknowledgement: "\r\n\r\n\r\n\r\nThis work was funded by NSF grant IIS-0613435, NSF
grant PHY-0957573, NSF grant CCF-0939370, NIH grant R01 EY14196, NIH grant P50 GM071508,
the Fannie and John Hertz Foundation, the Swartz Foundation, the WM Keck Foundation,
ANR Optima and the French State program “Investissements d'Avenir” [LIFESENSES:
ANR-10-LABX-65], and the Austrian Research Foundation FWF P25651."
article_number: e1003408
author:
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Dario
full_name: Amodei, Dario
last_name: Amodei
- first_name: Elad
full_name: Schneidman, Elad
last_name: Schneidman
- first_name: William
full_name: Bialek, William
last_name: Bialek
- first_name: Michael
full_name: Berry, Michael
last_name: Berry
citation:
ama: Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. Searching for
collective behavior in a large network of sensory neurons. PLoS Computational
Biology. 2014;10(1). doi:10.1371/journal.pcbi.1003408
apa: Tkačik, G., Marre, O., Amodei, D., Schneidman, E., Bialek, W., & Berry,
M. (2014). Searching for collective behavior in a large network of sensory neurons.
PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1003408
chicago: Tkačik, Gašper, Olivier Marre, Dario Amodei, Elad Schneidman, William Bialek,
and Michael Berry. “Searching for Collective Behavior in a Large Network of Sensory
Neurons.” PLoS Computational Biology. Public Library of Science, 2014.
https://doi.org/10.1371/journal.pcbi.1003408.
ieee: G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, and M. Berry, “Searching
for collective behavior in a large network of sensory neurons,” PLoS Computational
Biology, vol. 10, no. 1. Public Library of Science, 2014.
ista: Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. 2014. Searching
for collective behavior in a large network of sensory neurons. PLoS Computational
Biology. 10(1), e1003408.
mla: Tkačik, Gašper, et al. “Searching for Collective Behavior in a Large Network
of Sensory Neurons.” PLoS Computational Biology, vol. 10, no. 1, e1003408,
Public Library of Science, 2014, doi:10.1371/journal.pcbi.1003408.
short: G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, M. Berry, PLoS
Computational Biology 10 (2014).
date_created: 2018-12-11T11:56:36Z
date_published: 2014-01-02T00:00:00Z
date_updated: 2024-02-21T13:46:14Z
day: '02'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1003408
file:
- access_level: open_access
checksum: c720222c5e924a4acb17f23b9381a6ca
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:46Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4965'
file_name: IST-2016-436-v1+1_journal.pcbi.1003408.pdf
file_size: 2194790
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 10'
issue: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
main_file_link:
- open_access: '1'
url: http://repository.ist.ac.at/id/eprint/436
month: '01'
oa: 1
oa_version: Published Version
publication: PLoS Computational Biology
publication_identifier:
issn:
- 1553734X
publication_status: published
publisher: Public Library of Science
publist_id: '4689'
pubrep_id: '436'
quality_controlled: '1'
related_material:
record:
- id: '5562'
relation: popular_science
status: public
scopus_import: 1
status: public
title: Searching for collective behavior in a large network of sensory neurons
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: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2014'
...
---
_id: '2261'
abstract:
- lang: eng
text: To reveal the full potential of human pluripotent stem cells, new methods
for rapid, site-specific genomic engineering are needed. Here, we describe a system
for precise genetic modification of human embryonic stem cells (ESCs) and induced
pluripotent stem cells (iPSCs). We identified a novel human locus, H11, located
in a safe, intergenic, transcriptionally active region of chromosome 22, as the
recipient site, to provide robust, ubiquitous expression of inserted genes. Recipient
cell lines were established by site-specific placement of a ‘landing pad’ cassette
carrying attP sites for phiC31 and Bxb1 integrases at the H11 locus by spontaneous
or TALEN-assisted homologous recombination. Dual integrase cassette exchange (DICE)
mediated by phiC31 and Bxb1 integrases was used to insert genes of interest flanked
by phiC31 and Bxb1 attB sites at the H11 locus, replacing the landing pad. This
system provided complete control over content, direction and copy number of inserted
genes, with a specificity of 100%. A series of genes, including mCherry and various
combinations of the neural transcription factors LMX1a, FOXA2 and OTX2, were inserted
in recipient cell lines derived from H9 ESC, as well as iPSC lines derived from
a Parkinson’s disease patient and a normal sibling control. The DICE system offers
rapid, efficient and precise gene insertion in ESC and iPSC and is particularly
well suited for repeated modifications of the same locus.
acknowledgement: "California Institute for Regenerative Medicine [RT2-01880 and TR2-01756].
Funding for open access charge: California Institute for Regenerative Medicine [RT2-01880
and TR2-01756]\r\nCC BY 3,0"
article_number: e34
author:
- first_name: Fangfang
full_name: Zhu, Fangfang
last_name: Zhu
- first_name: Matthew
full_name: Gamboa, Matthew
last_name: Gamboa
- first_name: Alfonso
full_name: Farruggio, Alfonso
last_name: Farruggio
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Bosiljka
full_name: Tasic, Bosiljka
last_name: Tasic
- first_name: Birgitt
full_name: Schüle, Birgitt
last_name: Schüle
- first_name: Yanru
full_name: Chen Tsai, Yanru
last_name: Chen Tsai
- first_name: Michele
full_name: Calos, Michele
last_name: Calos
citation:
ama: Zhu F, Gamboa M, Farruggio A, et al. DICE, an efficient system for iterative
genomic editing in human pluripotent stem cells. Nucleic Acids Research.
2014;42(5). doi:10.1093/nar/gkt1290
apa: Zhu, F., Gamboa, M., Farruggio, A., Hippenmeyer, S., Tasic, B., Schüle, B.,
… Calos, M. (2014). DICE, an efficient system for iterative genomic editing in
human pluripotent stem cells. Nucleic Acids Research. Oxford University
Press. https://doi.org/10.1093/nar/gkt1290
chicago: Zhu, Fangfang, Matthew Gamboa, Alfonso Farruggio, Simon Hippenmeyer, Bosiljka
Tasic, Birgitt Schüle, Yanru Chen Tsai, and Michele Calos. “DICE, an Efficient
System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” Nucleic
Acids Research. Oxford University Press, 2014. https://doi.org/10.1093/nar/gkt1290.
ieee: F. Zhu et al., “DICE, an efficient system for iterative genomic editing
in human pluripotent stem cells,” Nucleic Acids Research, vol. 42, no.
5. Oxford University Press, 2014.
ista: Zhu F, Gamboa M, Farruggio A, Hippenmeyer S, Tasic B, Schüle B, Chen Tsai
Y, Calos M. 2014. DICE, an efficient system for iterative genomic editing in human
pluripotent stem cells. Nucleic Acids Research. 42(5), e34.
mla: Zhu, Fangfang, et al. “DICE, an Efficient System for Iterative Genomic Editing
in Human Pluripotent Stem Cells.” Nucleic Acids Research, vol. 42, no.
5, e34, Oxford University Press, 2014, doi:10.1093/nar/gkt1290.
short: F. Zhu, M. Gamboa, A. Farruggio, S. Hippenmeyer, B. Tasic, B. Schüle, Y.
Chen Tsai, M. Calos, Nucleic Acids Research 42 (2014).
date_created: 2018-12-11T11:56:38Z
date_published: 2014-03-05T00:00:00Z
date_updated: 2021-01-12T06:56:22Z
day: '05'
ddc:
- '571'
- '610'
department:
- _id: SiHi
doi: 10.1093/nar/gkt1290
file:
- access_level: open_access
checksum: e9268f5f96a820f04d7ebbf85927c3cb
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:15Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4738'
file_name: IST-2018-961-v1+1_2014_Hippenmeyer_DICE.pdf
file_size: 11044478
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 42'
issue: '5'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Preprint
publication: Nucleic Acids Research
publication_status: published
publisher: Oxford University Press
publist_id: '4684'
pubrep_id: '961'
quality_controlled: '1'
scopus_import: 1
status: public
title: DICE, an efficient system for iterative genomic editing in human pluripotent
stem 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: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 42
year: '2014'
...
---
_id: '2265'
abstract:
- lang: eng
text: Coordinated migration of newly-born neurons to their target territories is
essential for correct neuronal circuit assembly in the developing brain. Although
a cohort of signaling pathways has been implicated in the regulation of cortical
projection neuron migration, the precise molecular mechanisms and how a balanced
interplay of cell-autonomous and non-autonomous functions of candidate signaling
molecules controls the discrete steps in the migration process, are just being
revealed. In this chapter, I will focally review recent advances that improved
our understanding of the cell-autonomous and possible cell-nonautonomous functions
of the evolutionarily conserved LIS1/NDEL1-complex in regulating the sequential
steps of cortical projection neuron migration. I will then elaborate on the emerging
concept that the Reelin signaling pathway, acts exactly at precise stages in the
course of cortical projection neuron migration. Lastly, I will discuss how finely
tuned transcriptional programs and downstream effectors govern particular aspects
in driving radial migration at discrete stages and how they regulate the precise
positioning of cortical projection neurons in the developing cerebral cortex.
alternative_title:
- Advances in Experimental Medicine and Biology
author:
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: 'Hippenmeyer S. Molecular pathways controlling the sequential steps of cortical
projection neuron migration. In: Nguyen L, ed. Cellular and Molecular Control
of Neuronal Migration. Vol 800. Springer; 2014:1-24. doi:10.1007/978-94-007-7687-6_1'
apa: Hippenmeyer, S. (2014). Molecular pathways controlling the sequential steps
of cortical projection neuron migration. In L. Nguyen (Ed.), Cellular and
Molecular Control of Neuronal Migration (Vol. 800, pp. 1–24). Springer. https://doi.org/10.1007/978-94-007-7687-6_1
chicago: Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps
of Cortical Projection Neuron Migration.” In Cellular and Molecular Control
of Neuronal Migration, edited by Laurent Nguyen, 800:1–24. Springer, 2014.
https://doi.org/10.1007/978-94-007-7687-6_1.
ieee: S. Hippenmeyer, “Molecular pathways controlling the sequential steps of cortical
projection neuron migration,” in Cellular and Molecular Control of Neuronal
Migration, vol. 800, L. Nguyen, Ed. Springer, 2014, pp. 1–24.
ista: 'Hippenmeyer S. 2014.Molecular pathways controlling the sequential steps of
cortical projection neuron migration. In: Cellular and Molecular Control of Neuronal
Migration. Advances in Experimental Medicine and Biology, vol. 800, 1–24.'
mla: Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of
Cortical Projection Neuron Migration.” Cellular and Molecular Control of Neuronal
Migration, edited by Laurent Nguyen, vol. 800, Springer, 2014, pp. 1–24, doi:10.1007/978-94-007-7687-6_1.
short: S. Hippenmeyer, in:, L. Nguyen (Ed.), Cellular and Molecular Control of
Neuronal Migration, Springer, 2014, pp. 1–24.
date_created: 2018-12-11T11:56:39Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:23Z
day: '01'
department:
- _id: SiHi
doi: 10.1007/978-94-007-7687-6_1
editor:
- first_name: Laurent
full_name: Nguyen, Laurent
last_name: Nguyen
intvolume: ' 800'
language:
- iso: eng
month: '01'
oa_version: None
page: 1 - 24
publication: ' Cellular and Molecular Control of Neuronal Migration'
publication_status: published
publisher: Springer
publist_id: '4679'
quality_controlled: '1'
scopus_import: 1
status: public
title: Molecular pathways controlling the sequential steps of cortical projection
neuron migration
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 800
year: '2014'
...
---
_id: '2275'
abstract:
- lang: eng
text: "Energies with high-order non-submodular interactions have been shown to be
very useful in vision due to their high modeling power. Optimization of such energies,
however, is generally NP-hard. A naive approach that works for small problem instances
is exhaustive search, that is, enumeration of all possible labelings of the underlying
graph. We propose a general minimization approach for large graphs based on enumeration
of labelings of certain small patches. \r\nThis partial enumeration technique
reduces complex high-order energy formulations to pairwise Constraint Satisfaction
Problems with unary costs (uCSP), which can be efficiently solved using standard
methods like TRW-S. Our approach outperforms a number of existing state-of-the-art
algorithms on well known difficult problems (e.g. curvature regularization, stereo,
deconvolution); it gives near global minimum and better speed. \r\nOur main application
of interest is curvature regularization. In the context of segmentation, our partial
enumeration technique allows to evaluate curvature directly on small patches using
a novel integral geometry approach.\r\n"
author:
- first_name: Carl
full_name: Olsson, Carl
last_name: Olsson
- first_name: Johannes
full_name: Ulen, Johannes
last_name: Ulen
- first_name: Yuri
full_name: Boykov, Yuri
last_name: Boykov
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Olsson C, Ulen J, Boykov Y, Kolmogorov V. Partial enumeration and curvature
regularization. In: IEEE; 2014:2936-2943. doi:10.1109/ICCV.2013.365'
apa: 'Olsson, C., Ulen, J., Boykov, Y., & Kolmogorov, V. (2014). Partial enumeration
and curvature regularization (pp. 2936–2943). Presented at the ICCV: International
Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.365'
chicago: Olsson, Carl, Johannes Ulen, Yuri Boykov, and Vladimir Kolmogorov. “Partial
Enumeration and Curvature Regularization,” 2936–43. IEEE, 2014. https://doi.org/10.1109/ICCV.2013.365.
ieee: 'C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and
curvature regularization,” presented at the ICCV: International Conference on
Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.'
ista: 'Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature
regularization. ICCV: International Conference on Computer Vision, 2936–2943.'
mla: Olsson, Carl, et al. Partial Enumeration and Curvature Regularization.
IEEE, 2014, pp. 2936–43, doi:10.1109/ICCV.2013.365.
short: C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943.
conference:
end_date: 2013-12-08
location: Sydney, Australia
name: 'ICCV: International Conference on Computer Vision'
start_date: 2013-12-01
date_created: 2018-12-11T11:56:42Z
date_published: 2014-03-03T00:00:00Z
date_updated: 2021-01-12T06:56:28Z
day: '03'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1109/ICCV.2013.365
file:
- access_level: open_access
checksum: 4a74b5c92d6dcd2348c2c10ec8dd18bf
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:30Z
date_updated: 2020-07-14T12:45:36Z
file_id: '4754'
file_name: IST-2016-566-v1+1_iccv13_part_enumeration.pdf
file_size: 378601
relation: main_file
file_date_updated: 2020-07-14T12:45:36Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 2936 - 2943
publication_status: published
publisher: IEEE
publist_id: '4669'
pubrep_id: '566'
quality_controlled: '1'
scopus_import: 1
status: public
title: Partial enumeration and curvature regularization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2281'
abstract:
- lang: eng
text: We consider two-dimensional Bose-Einstein condensates with attractive interaction,
described by the Gross-Pitaevskii functional. Minimizers of this functional exist
only if the interaction strength a satisfies {Mathematical expression}, where
Q is the unique positive radial solution of {Mathematical expression} in {Mathematical
expression}. We present a detailed analysis of the behavior of minimizers as a
approaches a*, where all the mass concentrates at a global minimum of the trapping
potential.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Yujin
full_name: Guo, Yujin
last_name: Guo
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Guo Y, Seiringer R. On the mass concentration for Bose-Einstein condensates
with attractive interactions. Letters in Mathematical Physics. 2014;104(2):141-156.
doi:10.1007/s11005-013-0667-9
apa: Guo, Y., & Seiringer, R. (2014). On the mass concentration for Bose-Einstein
condensates with attractive interactions. Letters in Mathematical Physics.
Springer. https://doi.org/10.1007/s11005-013-0667-9
chicago: Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein
Condensates with Attractive Interactions.” Letters in Mathematical Physics.
Springer, 2014. https://doi.org/10.1007/s11005-013-0667-9.
ieee: Y. Guo and R. Seiringer, “On the mass concentration for Bose-Einstein condensates
with attractive interactions,” Letters in Mathematical Physics, vol. 104,
no. 2. Springer, pp. 141–156, 2014.
ista: Guo Y, Seiringer R. 2014. On the mass concentration for Bose-Einstein condensates
with attractive interactions. Letters in Mathematical Physics. 104(2), 141–156.
mla: Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein
Condensates with Attractive Interactions.” Letters in Mathematical Physics,
vol. 104, no. 2, Springer, 2014, pp. 141–56, doi:10.1007/s11005-013-0667-9.
short: Y. Guo, R. Seiringer, Letters in Mathematical Physics 104 (2014) 141–156.
date_created: 2018-12-11T11:56:44Z
date_published: 2014-02-01T00:00:00Z
date_updated: 2024-02-14T12:19:42Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s11005-013-0667-9
external_id:
arxiv:
- '1301.5682'
intvolume: ' 104'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1301.5682
month: '02'
oa: 1
oa_version: Preprint
page: 141 - 156
publication: Letters in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4653'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the mass concentration for Bose-Einstein condensates with attractive interactions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 104
year: '2014'
...
---
_id: '2285'
abstract:
- lang: eng
text: GABAergic inhibitory interneurons control fundamental aspects of neuronal
network function. Their functional roles are assumed to be defined by the identity
of their input synapses, the architecture of their dendritic tree, the passive
and active membrane properties and finally the nature of their postsynaptic targets.
Indeed, interneurons display a high degree of morphological and physiological
heterogeneity. However, whether their morphological and physiological characteristics
are correlated and whether interneuron diversity can be described by a continuum
of GABAergic cell types or by distinct classes has remained unclear. Here we perform
a detailed morphological and physiological characterization of GABAergic cells
in the dentate gyrus, the input region of the hippocampus. To achieve an unbiased
and efficient sampling and classification we used knock-in mice expressing the
enhanced green fluorescent protein (eGFP) in glutamate decarboxylase 67 (GAD67)-positive
neurons and performed cluster analysis. We identified five interneuron classes,
each of them characterized by a distinct set of anatomical and physiological parameters.
Cross-correlation analysis further revealed a direct relation between morphological
and physiological properties indicating that dentate gyrus interneurons fall into
functionally distinct classes which may differentially control neuronal network
activity.
acknowledgement: 'Funded by Deutsche Forschungsgemeinschaft. Grant Numbers: SFB 505,
SFB 780, BA1582/2-1 Excellence Initiative of the German Research Foundation (Spemann
Graduate School). Grant Number: GSC-4 Lichtenberg Professorship-Award (VW-Foundation);
Schram-Foundation; Excellence Initiative Brain Links-Brain Tools. The authors thank
Drs. Jonas-Frederic Sauer and Claudio Elgueta for critically reading the manuscript.
They also thank Karin Winterhalter, Margit Northemann and Ulrich Nöller for technical
assistance.'
author:
- first_name: Jonas
full_name: Hosp, Jonas
last_name: Hosp
- first_name: Michael
full_name: Strüber, Michael
last_name: Strüber
- first_name: Yuchio
full_name: Yanagawa, Yuchio
last_name: Yanagawa
- first_name: Kunihiko
full_name: Obata, Kunihiko
last_name: Obata
- first_name: Imre
full_name: Vida, Imre
last_name: Vida
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Marlene
full_name: Bartos, Marlene
last_name: Bartos
citation:
ama: Hosp J, Strüber M, Yanagawa Y, et al. Morpho-physiological criteria divide
dentate gyrus interneurons into classes. Hippocampus. 2014;23(2):189-203.
doi:10.1002/hipo.22214
apa: Hosp, J., Strüber, M., Yanagawa, Y., Obata, K., Vida, I., Jonas, P. M., &
Bartos, M. (2014). Morpho-physiological criteria divide dentate gyrus interneurons
into classes. Hippocampus. Wiley-Blackwell. https://doi.org/10.1002/hipo.22214
chicago: Hosp, Jonas, Michael Strüber, Yuchio Yanagawa, Kunihiko Obata, Imre Vida,
Peter M Jonas, and Marlene Bartos. “Morpho-Physiological Criteria Divide Dentate
Gyrus Interneurons into Classes.” Hippocampus. Wiley-Blackwell, 2014. https://doi.org/10.1002/hipo.22214.
ieee: J. Hosp et al., “Morpho-physiological criteria divide dentate gyrus
interneurons into classes,” Hippocampus, vol. 23, no. 2. Wiley-Blackwell,
pp. 189–203, 2014.
ista: Hosp J, Strüber M, Yanagawa Y, Obata K, Vida I, Jonas PM, Bartos M. 2014.
Morpho-physiological criteria divide dentate gyrus interneurons into classes.
Hippocampus. 23(2), 189–203.
mla: Hosp, Jonas, et al. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons
into Classes.” Hippocampus, vol. 23, no. 2, Wiley-Blackwell, 2014, pp.
189–203, doi:10.1002/hipo.22214.
short: J. Hosp, M. Strüber, Y. Yanagawa, K. Obata, I. Vida, P.M. Jonas, M. Bartos,
Hippocampus 23 (2014) 189–203.
date_created: 2018-12-11T11:56:46Z
date_published: 2014-02-01T00:00:00Z
date_updated: 2021-01-12T06:56:32Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1002/hipo.22214
file:
- access_level: open_access
checksum: ff6bc75a79dbc985a2e31b79253e6444
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:54Z
date_updated: 2020-07-14T12:45:37Z
file_id: '5178'
file_name: IST-2016-461-v1+1_Hosp_et_al-2014-Hippocampus.pdf
file_size: 801589
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 23'
issue: '2'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '02'
oa: 1
oa_version: Published Version
page: 189 - 203
publication: Hippocampus
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4646'
pubrep_id: '461'
quality_controlled: '1'
scopus_import: 1
status: public
title: Morpho-physiological criteria divide dentate gyrus interneurons into classes
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2014'
...
---
_id: '2699'
abstract:
- lang: eng
text: "We prove the universality of the β-ensembles with convex analytic potentials
and for any β >\r\n0, i.e. we show that the spacing distributions of log-gases
at any inverse temperature β coincide with those of the Gaussian β-ensembles."
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Paul
full_name: Bourgade, Paul
last_name: Bourgade
- first_name: Horng
full_name: Yau, Horng
last_name: Yau
citation:
ama: Erdös L, Bourgade P, Yau H. Universality of general β-ensembles. Duke Mathematical
Journal. 2014;163(6):1127-1190. doi:10.1215/00127094-2649752
apa: Erdös, L., Bourgade, P., & Yau, H. (2014). Universality of general β-ensembles.
Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2649752
chicago: Erdös, László, Paul Bourgade, and Horng Yau. “Universality of General β-Ensembles.”
Duke Mathematical Journal. Duke University Press, 2014. https://doi.org/10.1215/00127094-2649752.
ieee: L. Erdös, P. Bourgade, and H. Yau, “Universality of general β-ensembles,”
Duke Mathematical Journal, vol. 163, no. 6. Duke University Press, pp.
1127–1190, 2014.
ista: Erdös L, Bourgade P, Yau H. 2014. Universality of general β-ensembles. Duke
Mathematical Journal. 163(6), 1127–1190.
mla: Erdös, László, et al. “Universality of General β-Ensembles.” Duke Mathematical
Journal, vol. 163, no. 6, Duke University Press, 2014, pp. 1127–90, doi:10.1215/00127094-2649752.
short: L. Erdös, P. Bourgade, H. Yau, Duke Mathematical Journal 163 (2014) 1127–1190.
date_created: 2018-12-11T11:59:08Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2021-01-12T06:59:07Z
day: '01'
department:
- _id: LaEr
doi: 10.1215/00127094-2649752
intvolume: ' 163'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.2272
month: '04'
oa: 1
oa_version: Preprint
page: 1127 - 1190
publication: Duke Mathematical Journal
publication_status: published
publisher: Duke University Press
publist_id: '4197'
quality_controlled: '1'
scopus_import: 1
status: public
title: Universality of general β-ensembles
type: journal_article
user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 163
year: '2014'
...
---
_id: '2716'
abstract:
- lang: eng
text: Multi-dimensional mean-payoff and energy games provide the mathematical foundation
for the quantitative study of reactive systems, and play a central role in the
emerging quantitative theory of verification and synthesis. In this work, we study
the strategy synthesis problem for games with such multi-dimensional objectives
along with a parity condition, a canonical way to express ω ω -regular conditions.
While in general, the winning strategies in such games may require infinite memory,
for synthesis the most relevant problem is the construction of a finite-memory
winning strategy (if one exists). Our main contributions are as follows. First,
we show a tight exponential bound (matching upper and lower bounds) on the memory
required for finite-memory winning strategies in both multi-dimensional mean-payoff
and energy games along with parity objectives. This significantly improves the
triple exponential upper bound for multi energy games (without parity) that could
be derived from results in literature for games on vector addition systems with
states. Second, we present an optimal symbolic and incremental algorithm to compute
a finite-memory winning strategy (if one exists) in such games. Finally, we give
a complete characterization of when finite memory of strategies can be traded
off for randomness. In particular, we show that for one-dimension mean-payoff
parity games, randomized memoryless strategies are as powerful as their pure finite-memory
counterparts.
acknowledgement: "Krishnendu Chatterjee is supported by Austrian Science Fund (FWF)
Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307:
Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS.
fellowship. \r\nJean-François Raskin is supported by ERC Starting Grant (279499:
inVEST).Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary
draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful
to the anonymous reviewers for their insightful comments. "
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Mickael
full_name: Randour, Mickael
last_name: Randour
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
citation:
ama: Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional
quantitative objectives. Acta Informatica. 2014;51(3-4):129-163. doi:10.1007/s00236-013-0182-6
apa: Chatterjee, K., Randour, M., & Raskin, J. (2014). Strategy synthesis for
multi-dimensional quantitative objectives. Acta Informatica. Springer.
https://doi.org/10.1007/s00236-013-0182-6
chicago: Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis
for Multi-Dimensional Quantitative Objectives.” Acta Informatica. Springer,
2014. https://doi.org/10.1007/s00236-013-0182-6.
ieee: K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional
quantitative objectives,” Acta Informatica, vol. 51, no. 3–4. Springer,
pp. 129–163, 2014.
ista: Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional
quantitative objectives. Acta Informatica. 51(3–4), 129–163.
mla: Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative
Objectives.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 129–63,
doi:10.1007/s00236-013-0182-6.
short: K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.
date_created: 2018-12-11T11:59:14Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2023-02-21T16:06:56Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/s00236-013-0182-6
external_id:
arxiv:
- '1201.5073'
intvolume: ' 51'
issue: 3-4
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1201.5073
month: '06'
oa: 1
oa_version: Preprint
page: 129 - 163
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Acta Informatica
publication_status: published
publisher: Springer
publist_id: '4176'
quality_controlled: '1'
related_material:
record:
- id: '10904'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Strategy synthesis for multi-dimensional quantitative objectives
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2014'
...
---
_id: '2852'
abstract:
- lang: eng
text: A robust combiner for hash functions takes two candidate implementations and
constructs a hash function which is secure as long as at least one of the candidates
is secure. So far, hash function combiners only aim at preserving a single property
such as collision-resistance or pseudorandomness. However, when hash functions
are used in protocols like TLS they are often required to provide several properties
simultaneously. We therefore put forward the notion of robust multi-property combiners
and elaborate on different definitions for such combiners. We then propose a combiner
that provably preserves (target) collision-resistance, pseudorandomness, and being
a secure message authentication code. This combiner satisfies the strongest notion
we propose, which requires that the combined function satisfies every security
property which is satisfied by at least one of the underlying hash function. If
the underlying hash functions have output length n, the combiner has output length
2 n. This basically matches a known lower bound for black-box combiners for collision-resistance
only, thus the other properties can be achieved without penalizing the length
of the hash values. We then propose a combiner which also preserves the property
of being indifferentiable from a random oracle, slightly increasing the output
length to 2 n+ω(log n). Moreover, we show how to augment our constructions in
order to make them also robust for the one-wayness property, but in this case
require an a priory upper bound on the input length.
author:
- first_name: Marc
full_name: Fischlin, Marc
last_name: Fischlin
- first_name: Anja
full_name: Lehmann, Anja
last_name: Lehmann
- 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: Fischlin M, Lehmann A, Pietrzak KZ. Robust multi-property combiners for hash
functions. Journal of Cryptology. 2014;27(3):397-428. doi:10.1007/s00145-013-9148-7
apa: Fischlin, M., Lehmann, A., & Pietrzak, K. Z. (2014). Robust multi-property
combiners for hash functions. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-013-9148-7
chicago: Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi-Property
Combiners for Hash Functions.” Journal of Cryptology. Springer, 2014. https://doi.org/10.1007/s00145-013-9148-7.
ieee: M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners
for hash functions,” Journal of Cryptology, vol. 27, no. 3. Springer, pp.
397–428, 2014.
ista: Fischlin M, Lehmann A, Pietrzak KZ. 2014. Robust multi-property combiners
for hash functions. Journal of Cryptology. 27(3), 397–428.
mla: Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.”
Journal of Cryptology, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:10.1007/s00145-013-9148-7.
short: M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428.
date_created: 2018-12-11T11:59:56Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2023-02-23T11:17:53Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/s00145-013-9148-7
intvolume: ' 27'
issue: '3'
language:
- iso: eng
month: '07'
oa_version: None
page: 397 - 428
publication: Journal of Cryptology
publication_status: published
publisher: Springer
publist_id: '3940'
quality_controlled: '1'
related_material:
record:
- id: '3225'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Robust multi-property combiners for hash functions
type: journal_article
user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2014'
...
---
_id: '2905'
abstract:
- lang: eng
text: "Persistent homology is a recent grandchild of homology that has found use
in\r\nscience and engineering as well as in mathematics. This paper surveys the
method as well\r\nas the applications, neglecting completeness in favor of highlighting
ideas and directions."
acknowledgement: This research is partially supported by NSF under grant DBI-0820624,
by ESF under the Research Networking Programme, and by the Russian Government Project
11.G34.31.0053.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Dmitriy
full_name: Morozovy, Dmitriy
last_name: Morozovy
citation:
ama: 'Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In:
European Mathematical Society Publishing House; 2014:31-50. doi:10.4171/120-1/3'
apa: 'Edelsbrunner, H., & Morozovy, D. (2014). Persistent homology: Theory and
practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics,
Kraków, Poland: European Mathematical Society Publishing House. https://doi.org/10.4171/120-1/3'
chicago: 'Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory
and Practice,” 31–50. European Mathematical Society Publishing House, 2014. https://doi.org/10.4171/120-1/3.'
ieee: 'H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,”
presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014,
pp. 31–50.'
ista: 'Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice.
ECM: European Congress of Mathematics, 31–50.'
mla: 'Edelsbrunner, Herbert, and Dmitriy Morozovy. Persistent Homology: Theory
and Practice. European Mathematical Society Publishing House, 2014, pp. 31–50,
doi:10.4171/120-1/3.'
short: H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society Publishing
House, 2014, pp. 31–50.
conference:
end_date: 2012-07-07
location: Kraków, Poland
name: 'ECM: European Congress of Mathematics'
start_date: 2012-07-02
date_created: 2018-12-11T12:00:16Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:36Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.4171/120-1/3
file:
- access_level: open_access
checksum: 1d4a046f1af945c407c5c4d411d4c5e4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:43Z
date_updated: 2020-07-14T12:45:52Z
file_id: '5232'
file_name: IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf
file_size: 435320
relation: main_file
file_date_updated: 2020-07-14T12:45:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 31 - 50
publication_status: published
publisher: European Mathematical Society Publishing House
publist_id: '3842'
pubrep_id: '544'
quality_controlled: '1'
status: public
title: 'Persistent homology: Theory and practice'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '3263'
abstract:
- lang: eng
text: Adaptation in the retina is thought to optimize the encoding of natural light
signals into sequences of spikes sent to the brain. While adaptive changes in
retinal processing to the variations of the mean luminance level and second-order
stimulus statistics have been documented before, no such measurements have been
performed when higher-order moments of the light distribution change. We therefore
measured the ganglion cell responses in the tiger salamander retina to controlled
changes in the second (contrast), third (skew) and fourth (kurtosis) moments of
the light intensity distribution of spatially uniform temporally independent stimuli.
The skew and kurtosis of the stimuli were chosen to cover the range observed in
natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear
models that capture well the retinal encoding properties across all stimuli. We
found that the encoding properties of retinal ganglion cells change only marginally
when higher-order statistics change, compared to the changes observed in response
to the variation in contrast. By analyzing optimal coding in LN-type models, we
showed that neurons can maintain a high information rate without large dynamic
adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli,
spatio-temporal summation within the receptive field averages away non-gaussian
aspects of the light intensity distribution.
acknowledgement: "This work was supported by The Israel Science Foundation and The
Human Frontiers Science Program.\r\nWe thank the referees for helping significantly
improve this paper. We also thank Vijay Balasubramanian, Kristina Simmons, and Jason
Prentice for stimulating discussions. GT wishes to thank the faculty and students
of the “Methods in Computational Neuroscience” course at Marine Biological Laboratory,
Woods Hole.\r\n"
article_number: e85841
author:
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Anandamohan
full_name: Ghosh, Anandamohan
last_name: Ghosh
- first_name: Elad
full_name: Schneidman, Elad
last_name: Schneidman
- first_name: Ronen
full_name: Segev, Ronen
last_name: Segev
citation:
ama: Tkačik G, Ghosh A, Schneidman E, Segev R. Adaptation to changes in higher-order
stimulus statistics in the salamander retina. PLoS One. 2014;9(1). doi:10.1371/journal.pone.0085841
apa: Tkačik, G., Ghosh, A., Schneidman, E., & Segev, R. (2014). Adaptation to
changes in higher-order stimulus statistics in the salamander retina. PLoS
One. Public Library of Science. https://doi.org/10.1371/journal.pone.0085841
chicago: Tkačik, Gašper, Anandamohan Ghosh, Elad Schneidman, and Ronen Segev. “Adaptation
to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” PLoS
One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0085841.
ieee: G. Tkačik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in
higher-order stimulus statistics in the salamander retina,” PLoS One, vol.
9, no. 1. Public Library of Science, 2014.
ista: Tkačik G, Ghosh A, Schneidman E, Segev R. 2014. Adaptation to changes in higher-order
stimulus statistics in the salamander retina. PLoS One. 9(1), e85841.
mla: Tkačik, Gašper, et al. “Adaptation to Changes in Higher-Order Stimulus Statistics
in the Salamander Retina.” PLoS One, vol. 9, no. 1, e85841, Public Library
of Science, 2014, doi:10.1371/journal.pone.0085841.
short: G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014).
date_created: 2018-12-11T12:02:20Z
date_published: 2014-01-21T00:00:00Z
date_updated: 2021-01-12T07:42:14Z
day: '21'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pone.0085841
file:
- access_level: open_access
checksum: 1d5816b343abe5eadc3eb419bcece971
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:28Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5011'
file_name: IST-2016-432-v1+1_journal.pone.0085841.pdf
file_size: 1568524
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '3385'
pubrep_id: '432'
quality_controlled: '1'
scopus_import: 1
status: public
title: Adaptation to changes in higher-order stimulus statistics in the salamander
retina
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: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2014'
...
---
_id: '475'
abstract:
- lang: eng
text: 'First cycle games (FCG) are played on a finite graph by two players who push
a token along the edges until a vertex is repeated, and a simple cycle is formed.
The winner is determined by some fixed property Y of the sequence of labels of
the edges (or nodes) forming this cycle. These games are traditionally of interest
because of their connection with infinite-duration games such as parity and mean-payoff
games. We study the memory requirements for winning strategies of FCGs and certain
associated infinite duration games. We exhibit a simple FCG that is not memoryless
determined (this corrects a mistake in Memoryless determinacy of parity and mean
payoff games: a simple proof by Bj⋯orklund, Sandberg, Vorobyov (2004) that claims
that FCGs for which Y is closed under cyclic permutations are memoryless determined).
We show that θ (n)! memory (where n is the number of nodes in the graph), which
is always sufficient, may be necessary to win some FCGs. On the other hand, we
identify easy to check conditions on Y (i.e., Y is closed under cyclic permutations,
and both Y and its complement are closed under concatenation) that are sufficient
to ensure that the corresponding FCGs and their associated infinite duration games
are memoryless determined. We demonstrate that many games considered in the literature,
such as mean-payoff, parity, energy, etc., satisfy these conditions. On the complexity
side, we show (for efficiently computable Y) that while solving FCGs is in PSPACE,
solving some families of FCGs is PSPACE-hard. '
alternative_title:
- EPTCS
author:
- first_name: Benjamin
full_name: Aminof, Benjamin
id: 4A55BD00-F248-11E8-B48F-1D18A9856A87
last_name: Aminof
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Aminof B, Rubin S. First cycle games. In: Electronic Proceedings in Theoretical
Computer Science, EPTCS. Vol 146. Open Publishing Association; 2014:83-90.
doi:10.4204/EPTCS.146.11'
apa: 'Aminof, B., & Rubin, S. (2014). First cycle games. In Electronic Proceedings
in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France:
Open Publishing Association. https://doi.org/10.4204/EPTCS.146.11'
chicago: Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” In Electronic
Proceedings in Theoretical Computer Science, EPTCS, 146:83–90. Open Publishing
Association, 2014. https://doi.org/10.4204/EPTCS.146.11.
ieee: B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings
in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146,
pp. 83–90.
ista: 'Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical
Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.'
mla: Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” Electronic Proceedings
in Theoretical Computer Science, EPTCS, vol. 146, Open Publishing Association,
2014, pp. 83–90, doi:10.4204/EPTCS.146.11.
short: B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer
Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.
conference:
end_date: 2014-04-06
location: Grenoble, France
name: 'SR: Strategic Reasoning'
start_date: 2014-04-05
date_created: 2018-12-11T11:46:41Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2021-01-12T08:00:53Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4204/EPTCS.146.11
ec_funded: 1
file:
- access_level: open_access
checksum: 4d7b4ab82980cca2b96ac7703992a8c8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:08Z
date_updated: 2020-07-14T12:46:35Z
file_id: '5260'
file_name: IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf
file_size: 100115
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 146'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 83 - 90
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Electronic Proceedings in Theoretical Computer Science, EPTCS
publication_status: published
publisher: Open Publishing Association
publist_id: '7345'
pubrep_id: '952'
quality_controlled: '1'
scopus_import: 1
status: public
title: First cycle games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 146
year: '2014'
...
---
_id: '535'
abstract:
- lang: eng
text: Energy games belong to a class of turn-based two-player infinite-duration
games played on a weighted directed graph. It is one of the rare and intriguing
combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The
existence of polynomial-time algorithms has been a major open problem for decades
and apart from pseudopolynomial algorithms there is no algorithm that solves any
non-trivial subclass in polynomial time. In this paper, we give several results
based on the weight structures of the graph. First, we identify a notion of penalty
and present a polynomial-time algorithm when the penalty is large. Our algorithm
is the first polynomial-time algorithm on a large class of weighted graphs. It
includes several worst-case instances on which previous algorithms, such as value
iteration and random facet algorithms, require at least sub-exponential time.
Our main technique is developing the first non-trivial approximation algorithm
and showing how to convert it to an exact algorithm. Moreover, we show that in
a practical case in verification where weights are clustered around a constant
number of values, the energy game problem can be solved in polynomial time. We
also show that the problem is still as hard as in general when the clique-width
is bounded or the graph is strongly ergodic, suggesting that restricting the graph
structure does not necessarily help.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms
for energy games with special weight structures. Algorithmica. 2014;70(3):457-492.
doi:10.1007/s00453-013-9843-7
apa: Chatterjee, K., Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014).
Polynomial-time algorithms for energy games with special weight structures. Algorithmica.
Springer. https://doi.org/10.1007/s00453-013-9843-7
chicago: Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon
Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”
Algorithmica. Springer, 2014. https://doi.org/10.1007/s00453-013-9843-7.
ieee: K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time
algorithms for energy games with special weight structures,” Algorithmica,
vol. 70, no. 3. Springer, pp. 457–492, 2014.
ista: Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2014. Polynomial-time
algorithms for energy games with special weight structures. Algorithmica. 70(3),
457–492.
mla: Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games
with Special Weight Structures.” Algorithmica, vol. 70, no. 3, Springer,
2014, pp. 457–92, doi:10.1007/s00453-013-9843-7.
short: K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica
70 (2014) 457–492.
date_created: 2018-12-11T11:47:01Z
date_published: 2014-11-01T00:00:00Z
date_updated: 2023-09-05T14:09:29Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/s00453-013-9843-7
ec_funded: 1
external_id:
arxiv:
- '1604.08234'
intvolume: ' 70'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.08234
month: '11'
oa: 1
oa_version: Preprint
page: 457 - 492
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Algorithmica
publication_status: published
publisher: Springer
publist_id: '7282'
quality_controlled: '1'
related_material:
record:
- id: '10905'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Polynomial-time algorithms for energy games with special weight structures
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 70
year: '2014'
...
---
_id: '537'
abstract:
- lang: eng
text: Transgenerational effects are broader than only parental relationships. Despite
mounting evidence that multigenerational effects alter phenotypic and life-history
traits, our understanding of how they combine to determine fitness is not well
developed because of the added complexity necessary to study them. Here, we derive
a quantitative genetic model of adaptation to an extraordinary new environment
by an additive genetic component, phenotypic plasticity, maternal and grandmaternal
effects. We show how, at equilibrium, negative maternal and negative grandmaternal
effects maximize expected population mean fitness. We define negative transgenerational
effects as those that have a negative effect on trait expression in the subsequent
generation, that is, they slow, or potentially reverse, the expected evolutionary
dynamic. When maternal effects are positive, negative grandmaternal effects are
preferred. As expected under Mendelian inheritance, the grandmaternal effects
have a lower impact on fitness than the maternal effects, but this dual inheritance
model predicts a more complex relationship between maternal and grandmaternal
effects to constrain phenotypic variance and so maximize expected population mean
fitness in the offspring.
author:
- first_name: Roshan
full_name: Prizak, Roshan
id: 4456104E-F248-11E8-B48F-1D18A9856A87
last_name: Prizak
- first_name: Thomas
full_name: Ezard, Thomas
last_name: Ezard
- first_name: Rebecca
full_name: Hoyle, Rebecca
last_name: Hoyle
citation:
ama: Prizak R, Ezard T, Hoyle R. Fitness consequences of maternal and grandmaternal
effects. Ecology and Evolution. 2014;4(15):3139-3145. doi:10.1002/ece3.1150
apa: Prizak, R., Ezard, T., & Hoyle, R. (2014). Fitness consequences of maternal
and grandmaternal effects. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.1150
chicago: Prizak, Roshan, Thomas Ezard, and Rebecca Hoyle. “Fitness Consequences
of Maternal and Grandmaternal Effects.” Ecology and Evolution. Wiley-Blackwell,
2014. https://doi.org/10.1002/ece3.1150.
ieee: R. Prizak, T. Ezard, and R. Hoyle, “Fitness consequences of maternal and grandmaternal
effects,” Ecology and Evolution, vol. 4, no. 15. Wiley-Blackwell, pp. 3139–3145,
2014.
ista: Prizak R, Ezard T, Hoyle R. 2014. Fitness consequences of maternal and grandmaternal
effects. Ecology and Evolution. 4(15), 3139–3145.
mla: Prizak, Roshan, et al. “Fitness Consequences of Maternal and Grandmaternal
Effects.” Ecology and Evolution, vol. 4, no. 15, Wiley-Blackwell, 2014,
pp. 3139–45, doi:10.1002/ece3.1150.
short: R. Prizak, T. Ezard, R. Hoyle, Ecology and Evolution 4 (2014) 3139–3145.
date_created: 2018-12-11T11:47:02Z
date_published: 2014-07-19T00:00:00Z
date_updated: 2021-01-12T08:01:30Z
day: '19'
ddc:
- '530'
- '571'
department:
- _id: NiBa
- _id: GaTk
doi: 10.1002/ece3.1150
file:
- access_level: open_access
checksum: e32abf75a248e7a11811fd7f60858769
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:31Z
date_updated: 2020-07-14T12:46:38Z
file_id: '4886'
file_name: IST-2018-934-v1+1_Prizak_et_al-2014-Ecology_and_Evolution.pdf
file_size: 621582
relation: main_file
file_date_updated: 2020-07-14T12:46:38Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '15'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 3139 - 3145
publication: Ecology and Evolution
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7280'
pubrep_id: '934'
scopus_import: 1
status: public
title: Fitness consequences of maternal and grandmaternal effects
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: 4
year: '2014'
...
---
_id: '827'
abstract:
- lang: eng
text: As sessile organisms, plants have to be able to adapt to a continuously changing
environment. Plants that perceive some of these changes as stress signals activate
signaling pathways to modulate their development and to enable them to survive.
The complex responses to environmental cues are to a large extent mediated by
plant hormones that together orchestrate the final plant response. The phytohormone
cytokinin is involved in many plant developmental processes. Recently, it has
been established that cytokinin plays an important role in stress responses, but
does not act alone. Indeed, the hormonal control of plant development and stress
adaptation is the outcome of a complex network of multiple synergistic and antagonistic
interactions between various hormones. Here, we review the recent findings on
the cytokinin function as part of this hormonal network. We focus on the importance
of the crosstalk between cytokinin and other hormones, such as abscisic acid,
jasmonate, salicylic acid, ethylene, and auxin in the modulation of plant development
and stress adaptation. Finally, the impact of the current research in the biotechnological
industry will be discussed.
article_number: '451'
author:
- first_name: José
full_name: O'Brien, José
last_name: O'Brien
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: O’Brien J, Benková E. Cytokinin cross talking during biotic and abiotic stress
responses. Frontiers in Plant Science. 2013;4. doi:10.3389/fpls.2013.00451
apa: O’Brien, J., & Benková, E. (2013). Cytokinin cross talking during biotic
and abiotic stress responses. Frontiers in Plant Science. Frontiers Research
Foundation. https://doi.org/10.3389/fpls.2013.00451
chicago: O’Brien, José, and Eva Benková. “Cytokinin Cross Talking during Biotic
and Abiotic Stress Responses.” Frontiers in Plant Science. Frontiers Research
Foundation, 2013. https://doi.org/10.3389/fpls.2013.00451.
ieee: J. O’Brien and E. Benková, “Cytokinin cross talking during biotic and abiotic
stress responses,” Frontiers in Plant Science, vol. 4. Frontiers Research
Foundation, 2013.
ista: O’Brien J, Benková E. 2013. Cytokinin cross talking during biotic and abiotic
stress responses. Frontiers in Plant Science. 4, 451.
mla: O’Brien, José, and Eva Benková. “Cytokinin Cross Talking during Biotic and
Abiotic Stress Responses.” Frontiers in Plant Science, vol. 4, 451, Frontiers
Research Foundation, 2013, doi:10.3389/fpls.2013.00451.
short: J. O’Brien, E. Benková, Frontiers in Plant Science 4 (2013).
date_created: 2018-12-11T11:48:43Z
date_published: 2013-11-19T00:00:00Z
date_updated: 2021-01-12T08:17:50Z
day: '19'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.3389/fpls.2013.00451
ec_funded: 1
file:
- access_level: open_access
checksum: fdc25ddd1bf9a99b99f662cdbafeddd4
content_type: application/pdf
creator: dernst
date_created: 2019-01-31T10:40:38Z
date_updated: 2020-07-14T12:48:11Z
file_id: '5903'
file_name: 2013_FrontiersPlant_OBrien.pdf
file_size: 953299
relation: main_file
file_date_updated: 2020-07-14T12:48:11Z
has_accepted_license: '1'
intvolume: ' 4'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 253FCA6A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '207362'
name: Hormonal cross-talk in plant organogenesis
publication: Frontiers in Plant Science
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '6821'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cytokinin cross talking during biotic and abiotic stress responses
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: 4
year: '2013'
...
---
_id: '828'
abstract:
- lang: eng
text: The plant root system is essential for providing anchorage to the soil, supplying
minerals and water, and synthesizing metabolites. It is a dynamic organ modulated
by external cues such as environmental signals, water and nutrients availability,
salinity and others. Lateral roots (LRs) are initiated from the primary root post-embryonically,
after which they progress through discrete developmental stages which can be independently
controlled, providing a high level of plasticity during root system formation.
Within this review, main contributions are presented, from the classical forward
genetic screens to the more recent high-throughput approaches, combined with computer
model predictions, dissecting how LRs and thereby root system architecture is
established and developed.
article_number: '537'
author:
- first_name: Candela
full_name: Cuesta, Candela
id: 33A3C818-F248-11E8-B48F-1D18A9856A87
last_name: Cuesta
orcid: 0000-0003-1923-2410
- first_name: Krzysztof T
full_name: Wabnik, Krzysztof T
id: 4DE369A4-F248-11E8-B48F-1D18A9856A87
last_name: Wabnik
orcid: 0000-0001-7263-0560
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Cuesta C, Wabnik KT, Benková E. Systems approaches to study root architecture
dynamics. Frontiers in Plant Science. 2013;4. doi:10.3389/fpls.2013.00537
apa: Cuesta, C., Wabnik, K. T., & Benková, E. (2013). Systems approaches to
study root architecture dynamics. Frontiers in Plant Science. Frontiers
Research Foundation. https://doi.org/10.3389/fpls.2013.00537
chicago: Cuesta, Candela, Krzysztof T Wabnik, and Eva Benková. “Systems Approaches
to Study Root Architecture Dynamics.” Frontiers in Plant Science. Frontiers
Research Foundation, 2013. https://doi.org/10.3389/fpls.2013.00537.
ieee: C. Cuesta, K. T. Wabnik, and E. Benková, “Systems approaches to study root
architecture dynamics,” Frontiers in Plant Science, vol. 4. Frontiers Research
Foundation, 2013.
ista: Cuesta C, Wabnik KT, Benková E. 2013. Systems approaches to study root architecture
dynamics. Frontiers in Plant Science. 4, 537.
mla: Cuesta, Candela, et al. “Systems Approaches to Study Root Architecture Dynamics.”
Frontiers in Plant Science, vol. 4, 537, Frontiers Research Foundation,
2013, doi:10.3389/fpls.2013.00537.
short: C. Cuesta, K.T. Wabnik, E. Benková, Frontiers in Plant Science 4 (2013).
date_created: 2018-12-11T11:48:43Z
date_published: 2013-12-26T00:00:00Z
date_updated: 2021-01-12T08:17:52Z
day: '26'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.3389/fpls.2013.00537
ec_funded: 1
file:
- access_level: open_access
checksum: 0185b3c4d7df9a94bd3ce5a66d213506
content_type: application/pdf
creator: dernst
date_created: 2019-01-31T10:36:43Z
date_updated: 2020-07-14T12:48:11Z
file_id: '5902'
file_name: 2013_FrontiersPlant_Cuesta.pdf
file_size: 710835
relation: main_file
file_date_updated: 2020-07-14T12:48:11Z
has_accepted_license: '1'
intvolume: ' 4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 253FCA6A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '207362'
name: Hormonal cross-talk in plant organogenesis
publication: Frontiers in Plant Science
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '6820'
quality_controlled: '1'
scopus_import: 1
status: public
title: Systems approaches to study root architecture dynamics
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: 4
year: '2013'
...
---
_id: '2000'
abstract:
- lang: eng
text: In this work we present a flexible tool for tumor progression, which simulates
the evolutionary dynamics of cancer. Tumor progression implements a multi-type
branching process where the key parameters are the fitness landscape, the mutation
rate, and the average time of cell division. The fitness of a cancer cell depends
on the mutations it has accumulated. The input to our tool could be any fitness
landscape, mutation rate, and cell division time, and the tool produces the growth
dynamics and all relevant statistics.
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: 'Reiter J, Božić I, Chatterjee K, Nowak M. TTP: Tool for tumor progression.
In: Proceedings of 25th Int. Conf. on Computer Aided Verification. Vol
8044. Lecture Notes in Computer Science. Springer; 2013:101-106. doi:10.1007/978-3-642-39799-8_6'
apa: 'Reiter, J., Božić, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for
tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification
(Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_6'
chicago: 'Reiter, Johannes, Ivana Božić, Krishnendu Chatterjee, and Martin Nowak.
“TTP: Tool for Tumor Progression.” In Proceedings of 25th Int. Conf. on Computer
Aided Verification, 8044:101–6. Lecture Notes in Computer Science. Springer,
2013. https://doi.org/10.1007/978-3-642-39799-8_6.'
ieee: 'J. Reiter, I. Božić, K. Chatterjee, and M. Nowak, “TTP: Tool for tumor progression,”
in Proceedings of 25th Int. Conf. on Computer Aided Verification, St. Petersburg,
Russia, 2013, vol. 8044, pp. 101–106.'
ista: 'Reiter J, Božić I, Chatterjee K, Nowak M. 2013. TTP: Tool for tumor progression.
Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided
VerificationLecture Notes in Computer Science, LNCS, vol. 8044, 101–106.'
mla: 'Reiter, Johannes, et al. “TTP: Tool for Tumor Progression.” Proceedings
of 25th Int. Conf. on Computer Aided Verification, vol. 8044, Springer, 2013,
pp. 101–06, doi:10.1007/978-3-642-39799-8_6.'
short: J. Reiter, I. Božić, K. Chatterjee, M. Nowak, in:, Proceedings of 25th Int.
Conf. on Computer Aided Verification, Springer, 2013, pp. 101–106.
conference:
end_date: 2013-07-19
location: St. Petersburg, Russia
name: 'CAV: Computer Aided Verification'
start_date: 2013-07-13
date_created: 2018-12-11T11:55:08Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-39799-8_6
ec_funded: 1
external_id:
arxiv:
- '1303.5251'
intvolume: ' 8044'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1303.5251
month: '01'
oa: 1
oa_version: Preprint
page: 101 - 106
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of 25th Int. Conf. on Computer Aided Verification
publication_status: published
publisher: Springer
publist_id: '5077'
quality_controlled: '1'
related_material:
record:
- id: '5399'
relation: earlier_version
status: public
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: 'TTP: Tool for tumor progression'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8044
year: '2013'
...