---
_id: '7297'
abstract:
- lang: eng
text: Redox mediators facilitate the oxidation of the highly insulating discharge
product in metal–oxygen batteries during recharge and offer opportunities to achieve
high reversible capacities. Now a design principle for selecting redox mediators
that can recharge the batteries more efficiently is suggested.
article_number: '16074'
article_processing_charge: No
article_type: original
author:
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: 'Freunberger SA. Batteries: Charging ahead rationally. Nature Energy.
2016;1(6). doi:10.1038/nenergy.2016.74'
apa: 'Freunberger, S. A. (2016). Batteries: Charging ahead rationally. Nature
Energy. Springer Nature. https://doi.org/10.1038/nenergy.2016.74'
chicago: 'Freunberger, Stefan Alexander. “Batteries: Charging Ahead Rationally.”
Nature Energy. Springer Nature, 2016. https://doi.org/10.1038/nenergy.2016.74.'
ieee: 'S. A. Freunberger, “Batteries: Charging ahead rationally,” Nature Energy,
vol. 1, no. 6. Springer Nature, 2016.'
ista: 'Freunberger SA. 2016. Batteries: Charging ahead rationally. Nature Energy.
1(6), 16074.'
mla: 'Freunberger, Stefan Alexander. “Batteries: Charging Ahead Rationally.” Nature
Energy, vol. 1, no. 6, 16074, Springer Nature, 2016, doi:10.1038/nenergy.2016.74.'
short: S.A. Freunberger, Nature Energy 1 (2016).
date_created: 2020-01-15T12:16:40Z
date_published: 2016-05-23T00:00:00Z
date_updated: 2021-01-12T08:12:51Z
day: '23'
ddc:
- '540'
- '541'
- '547'
- '546'
doi: 10.1038/nenergy.2016.74
extern: '1'
file:
- access_level: open_access
checksum: d90d675947262f7437b483b251918df2
content_type: application/pdf
creator: sfreunbe
date_created: 2020-06-29T13:41:56Z
date_updated: 2020-07-14T12:47:55Z
file_id: '8047'
file_name: N&V Freunberger final.pdf
file_size: 197375
relation: main_file
file_date_updated: 2020-07-14T12:47:55Z
has_accepted_license: '1'
intvolume: ' 1'
issue: '6'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
publication: Nature Energy
publication_identifier:
issn:
- 2058-7546
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: 'Batteries: Charging ahead rationally'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2016'
...
---
_id: '7599'
abstract:
- lang: eng
text: Normal leaf margin development is important for leaf morphogenesis and contributes
to diverse leaf shapes in higher plants. We here show the crucial roles of an
atypical type II phosphatidylinositol 4-kinase, PI4Kγ5, in Arabidopsis leaf margin
development. PI4Kγ5 presents a dynamics expression pattern along with leaf development
and a T-DNA mutant lacking PI4Kγ5, pi4kγ5–1, presents serrated leaves, which is
resulted from the accelerated cell division and increased auxin concentration
at serration tips. Studies revealed that PI4Kγ5 interacts with and phosphorylates
a membrane-bound NAC transcription factor, ANAC078. Previous studies demonstrated
that membrane-bound transcription factors regulate gene transcription by undergoing
proteolytic process to translocate into nucleus, and ANAC078 undergoes proteolysis
by cleaving off the transmembrane region and carboxyl terminal. Western blot analysis
indeed showed that ANAC078 deleting of carboxyl terminal is significantly reduced
in pi4kγ5–1, indicating that PI4Kγ5 is important for the cleavage of ANAC078.
This is consistent with the subcellular localization observation showing that
fluorescence by GFP-ANAC078 is detected at plasma membrane but not nucleus in
pi4kγ5–1 mutant and that expression of ANAC078 deleting of carboxyl terminal,
driven by PI4Kγ5 promoter, could rescue the leaf serration defects of pi4kγ5–1.
Further analysis showed that ANAC078 suppresses the auxin synthesis by directly
binding and regulating the expression of auxin synthesis-related genes. These
results indicate that PI4Kγ5 interacts with ANAC078 to negatively regulate auxin
synthesis and hence influences cell proliferation and leaf development, providing
informative clues for the regulation of in situ auxin synthesis and cell division,
as well as the cleavage and functional mechanism of membrane-bound transcription
factors.
article_number: e1006252
article_processing_charge: No
article_type: original
author:
- first_name: Yong
full_name: Tang, Yong
last_name: Tang
- first_name: Chun-Yan
full_name: Zhao, Chun-Yan
last_name: Zhao
- first_name: Shutang
full_name: Tan, Shutang
id: 2DE75584-F248-11E8-B48F-1D18A9856A87
last_name: Tan
orcid: 0000-0002-0471-8285
- first_name: Hong-Wei
full_name: Xue, Hong-Wei
last_name: Xue
citation:
ama: Tang Y, Zhao C-Y, Tan S, Xue H-W. Arabidopsis type II phosphatidylinositol
4-kinase PI4Kγ5 regulates auxin biosynthesis and leaf margin development through
interacting with membrane-bound transcription factor ANAC078. PLOS Genetics.
2016;12(8). doi:10.1371/journal.pgen.1006252
apa: Tang, Y., Zhao, C.-Y., Tan, S., & Xue, H.-W. (2016). Arabidopsis type II
phosphatidylinositol 4-kinase PI4Kγ5 regulates auxin biosynthesis and leaf margin
development through interacting with membrane-bound transcription factor ANAC078.
PLOS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1006252
chicago: Tang, Yong, Chun-Yan Zhao, Shutang Tan, and Hong-Wei Xue. “Arabidopsis
Type II Phosphatidylinositol 4-Kinase PI4Kγ5 Regulates Auxin Biosynthesis and
Leaf Margin Development through Interacting with Membrane-Bound Transcription
Factor ANAC078.” PLOS Genetics. Public Library of Science, 2016. https://doi.org/10.1371/journal.pgen.1006252.
ieee: Y. Tang, C.-Y. Zhao, S. Tan, and H.-W. Xue, “Arabidopsis type II phosphatidylinositol
4-kinase PI4Kγ5 regulates auxin biosynthesis and leaf margin development through
interacting with membrane-bound transcription factor ANAC078,” PLOS Genetics,
vol. 12, no. 8. Public Library of Science, 2016.
ista: Tang Y, Zhao C-Y, Tan S, Xue H-W. 2016. Arabidopsis type II phosphatidylinositol
4-kinase PI4Kγ5 regulates auxin biosynthesis and leaf margin development through
interacting with membrane-bound transcription factor ANAC078. PLOS Genetics. 12(8),
e1006252.
mla: Tang, Yong, et al. “Arabidopsis Type II Phosphatidylinositol 4-Kinase PI4Kγ5
Regulates Auxin Biosynthesis and Leaf Margin Development through Interacting with
Membrane-Bound Transcription Factor ANAC078.” PLOS Genetics, vol. 12, no.
8, e1006252, Public Library of Science, 2016, doi:10.1371/journal.pgen.1006252.
short: Y. Tang, C.-Y. Zhao, S. Tan, H.-W. Xue, PLOS Genetics 12 (2016).
date_created: 2020-03-21T16:08:33Z
date_published: 2016-08-16T00:00:00Z
date_updated: 2021-01-12T08:14:25Z
day: '16'
ddc:
- '580'
doi: 10.1371/journal.pgen.1006252
extern: '1'
file:
- access_level: open_access
checksum: ff0ab9a6bed11cda800a6e59820866a0
content_type: application/pdf
creator: dernst
date_created: 2020-03-23T12:15:31Z
date_updated: 2020-07-14T12:48:01Z
file_id: '7612'
file_name: 2016_PlosGenetics_Tang.PDF
file_size: 3266119
relation: main_file
file_date_updated: 2020-07-14T12:48:01Z
has_accepted_license: '1'
intvolume: ' 12'
issue: '8'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: PLOS Genetics
publication_identifier:
issn:
- 1553-7404
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
status: public
title: Arabidopsis type II phosphatidylinositol 4-kinase PI4Kγ5 regulates auxin biosynthesis
and leaf margin development through interacting with membrane-bound transcription
factor ANAC078
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: 12
year: '2016'
...
---
_id: '7737'
abstract:
- lang: eng
text: Genome-wide association studies (GWAS) have identified thousands of genetic
variants associated with human complex traits. However, the genes or functional
DNA elements through which these variants exert their effects on the traits are
often unknown. We propose a method (called SMR) that integrates summary-level
data from GWAS with data from expression quantitative trait locus (eQTL) studies
to identify genes whose expression levels are associated with a complex trait
because of pleiotropy. We apply the method to five human complex traits using
GWAS data on up to 339,224 individuals and eQTL data on 5,311 individuals, and
we prioritize 126 genes (for example, TRAF1 and ANKRD55 for rheumatoid arthritis
and SNX19 and NMRAL1 for schizophrenia), of which 25 genes are new candidates;
77 genes are not the nearest annotated gene to the top associated GWAS SNP. These
genes provide important leads to design future functional studies to understand
the mechanism whereby DNA variation leads to complex trait variation.
article_processing_charge: No
article_type: original
author:
- first_name: Zhihong
full_name: Zhu, Zhihong
last_name: Zhu
- first_name: Futao
full_name: Zhang, Futao
last_name: Zhang
- first_name: Han
full_name: Hu, Han
last_name: Hu
- first_name: Andrew
full_name: Bakshi, Andrew
last_name: Bakshi
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
- first_name: Joseph E
full_name: Powell, Joseph E
last_name: Powell
- first_name: Grant W
full_name: Montgomery, Grant W
last_name: Montgomery
- first_name: Michael E
full_name: Goddard, Michael E
last_name: Goddard
- first_name: Naomi R
full_name: Wray, Naomi R
last_name: Wray
- first_name: Peter M
full_name: Visscher, Peter M
last_name: Visscher
- first_name: Jian
full_name: Yang, Jian
last_name: Yang
citation:
ama: Zhu Z, Zhang F, Hu H, et al. Integration of summary data from GWAS and eQTL
studies predicts complex trait gene targets. Nature Genetics. 2016;48(5):481-487.
doi:10.1038/ng.3538
apa: Zhu, Z., Zhang, F., Hu, H., Bakshi, A., Robinson, M. R., Powell, J. E., … Yang,
J. (2016). Integration of summary data from GWAS and eQTL studies predicts complex
trait gene targets. Nature Genetics. Springer Nature. https://doi.org/10.1038/ng.3538
chicago: Zhu, Zhihong, Futao Zhang, Han Hu, Andrew Bakshi, Matthew Richard Robinson,
Joseph E Powell, Grant W Montgomery, et al. “Integration of Summary Data from
GWAS and EQTL Studies Predicts Complex Trait Gene Targets.” Nature Genetics.
Springer Nature, 2016. https://doi.org/10.1038/ng.3538.
ieee: Z. Zhu et al., “Integration of summary data from GWAS and eQTL studies
predicts complex trait gene targets,” Nature Genetics, vol. 48, no. 5.
Springer Nature, pp. 481–487, 2016.
ista: Zhu Z, Zhang F, Hu H, Bakshi A, Robinson MR, Powell JE, Montgomery GW, Goddard
ME, Wray NR, Visscher PM, Yang J. 2016. Integration of summary data from GWAS
and eQTL studies predicts complex trait gene targets. Nature Genetics. 48(5),
481–487.
mla: Zhu, Zhihong, et al. “Integration of Summary Data from GWAS and EQTL Studies
Predicts Complex Trait Gene Targets.” Nature Genetics, vol. 48, no. 5,
Springer Nature, 2016, pp. 481–87, doi:10.1038/ng.3538.
short: Z. Zhu, F. Zhang, H. Hu, A. Bakshi, M.R. Robinson, J.E. Powell, G.W. Montgomery,
M.E. Goddard, N.R. Wray, P.M. Visscher, J. Yang, Nature Genetics 48 (2016) 481–487.
date_created: 2020-04-30T10:50:26Z
date_published: 2016-03-28T00:00:00Z
date_updated: 2021-01-12T08:15:11Z
day: '28'
doi: 10.1038/ng.3538
extern: '1'
intvolume: ' 48'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1038/ng.3538
month: '03'
oa: 1
oa_version: Published Version
page: 481-487
publication: Nature Genetics
publication_identifier:
issn:
- 1061-4036
- 1546-1718
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Integration of summary data from GWAS and eQTL studies predicts complex trait
gene targets
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2016'
...
---
_id: '460'
abstract:
- lang: eng
text: NF-κB signaling is a central pathway of immunity and integrates signal transduction
upon a wide array of inflammatory stimuli. Noncanonical NF-κB signaling is activated
by a small subset of TNF family receptors and characterized by NF-κB2/p52 transcriptional
activity. The medical relevance of this pathway has recently re-emerged from the
discovery of primary immunodeficiency patients that have loss-of-function mutations
in the MAP3K14 gene encoding NIK. Nevertheless, knowledge of protein interactions
that regulate noncanonical NF-κB signaling is sparse. Here we report a detailed
state-of-the-art mass spectrometry-based protein–protein interaction network including
the noncanonical NF-κB signaling nodes TRAF2, TRAF3, IKKα, NIK, and NF-κB2/p100.
The value of the data set was confirmed by the identification of interactions
already known to regulate this pathway. In addition, a remarkable number of novel
interactors were identified. We provide validation of the novel NIK and IKKα interactor
FKBP8, which may regulate processes downstream of noncanonical NF-κB signaling.
To understand perturbed noncanonical NF-κB signaling in the context of misregulated
NIK in disease, we also provide a differential interactome of NIK mutants that
cause immunodeficiency. Altogether, this data set not only provides critical insight
into how protein–protein interactions can regulate immune signaling but also offers
a novel resource on noncanonical NF-κB signaling.
acknowledgement: "Austrian Science Fund (FWF) Lise Meitner Program Fellowship (FWF
M-1809, to K.L.W.), FWF Infect-ERA framework (I-1620_B22, to S.K.), European Research
Council (ERC StG 310857, to K.B.)\nWe thank Jacques Colinge, André C. Müller, and
Peter Májek for fruitful discussions and Elisabeth Salzer and Kate G. Ackermann
for critically reading the manuscript. We thank Giulio Superti-Furga for providing
pTO-SII-HA-GW plasmids. \n\n"
author:
- first_name: Katharina
full_name: Willmann, Katharina L
last_name: Willmann
- first_name: Roberto
full_name: Roberto Sacco
id: 42C9F57E-F248-11E8-B48F-1D18A9856A87
last_name: Sacco
- first_name: Rui
full_name: Martins, Rui
last_name: Martins
- first_name: Wojciech
full_name: Garncarz, Wojciech
last_name: Garncarz
- first_name: Ana
full_name: Krolo, Ana
last_name: Krolo
- first_name: Sylvia
full_name: Knapp, Sylvia
last_name: Knapp
- first_name: Keiryn
full_name: Bennett, Keiryn L
last_name: Bennett
- first_name: Kaan
full_name: Boztug, Kaan
last_name: Boztug
citation:
ama: Willmann K, Sacco R, Martins R, et al. Expanding the interactome of the noncanonical
NF-κB signaling pathway. Journal of Proteome Research. 2016;15(9):2900-2909.
doi:10.1021/acs.jproteome.5b01004
apa: Willmann, K., Sacco, R., Martins, R., Garncarz, W., Krolo, A., Knapp, S., …
Boztug, K. (2016). Expanding the interactome of the noncanonical NF-κB signaling
pathway. Journal of Proteome Research. American Chemical Society. https://doi.org/10.1021/acs.jproteome.5b01004
chicago: Willmann, Katharina, Roberto Sacco, Rui Martins, Wojciech Garncarz, Ana
Krolo, Sylvia Knapp, Keiryn Bennett, and Kaan Boztug. “Expanding the Interactome
of the Noncanonical NF-ΚB Signaling Pathway.” Journal of Proteome Research.
American Chemical Society, 2016. https://doi.org/10.1021/acs.jproteome.5b01004.
ieee: K. Willmann et al., “Expanding the interactome of the noncanonical
NF-κB signaling pathway,” Journal of Proteome Research, vol. 15, no. 9.
American Chemical Society, pp. 2900–2909, 2016.
ista: Willmann K, Sacco R, Martins R, Garncarz W, Krolo A, Knapp S, Bennett K, Boztug
K. 2016. Expanding the interactome of the noncanonical NF-κB signaling pathway.
Journal of Proteome Research. 15(9), 2900–2909.
mla: Willmann, Katharina, et al. “Expanding the Interactome of the Noncanonical
NF-ΚB Signaling Pathway.” Journal of Proteome Research, vol. 15, no. 9,
American Chemical Society, 2016, pp. 2900–09, doi:10.1021/acs.jproteome.5b01004.
short: K. Willmann, R. Sacco, R. Martins, W. Garncarz, A. Krolo, S. Knapp, K. Bennett,
K. Boztug, Journal of Proteome Research 15 (2016) 2900–2909.
date_created: 2018-12-11T11:46:36Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2021-01-12T08:00:24Z
day: '15'
doi: 10.1021/acs.jproteome.5b01004
extern: 1
intvolume: ' 15'
issue: '9'
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5295629/
month: '07'
oa: 1
page: 2900 - 2909
publication: Journal of Proteome Research
publication_status: published
publisher: American Chemical Society
publist_id: '7361'
quality_controlled: 0
status: public
title: Expanding the interactome of the noncanonical NF-κB signaling pathway
type: journal_article
volume: 15
year: '2016'
...
---
_id: '478'
abstract:
- lang: eng
text: 'Magic: the Gathering is a game about magical combat for any number of players.
Formally it is a zero-sum, imperfect information stochastic game that consists
of a potentially unbounded number of steps. We consider the problem of deciding
if a move is legal in a given single step of Magic. We show that the problem is
(a) coNP-complete in general; and (b) in P if either of two small sets of cards
are not used. Our lower bound holds even for single-player Magic games. The significant
aspects of our results are as follows: First, in most real-life game problems,
the task of deciding whether a given move is legal in a single step is trivial,
and the computationally hard task is to find the best sequence of legal moves
in the presence of multiple players. In contrast, quite uniquely our hardness
result holds for single step and with only one-player. Second, we establish efficient
algorithms for important special cases of Magic.'
alternative_title:
- Frontiers in Artificial Intelligence and Applications
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: 'Chatterjee K, Ibsen-Jensen R. The complexity of deciding legality of a single
step of magic: The gathering. In: Vol 285. IOS Press; 2016:1432-1439. doi:10.3233/978-1-61499-672-9-1432'
apa: 'Chatterjee, K., & Ibsen-Jensen, R. (2016). The complexity of deciding
legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented
at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands:
IOS Press. https://doi.org/10.3233/978-1-61499-672-9-1432'
chicago: 'Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding
Legality of a Single Step of Magic: The Gathering,” 285:1432–39. IOS Press, 2016.
https://doi.org/10.3233/978-1-61499-672-9-1432.'
ieee: 'K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of
a single step of magic: The gathering,” presented at the ECAI: European Conference
on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.'
ista: 'Chatterjee K, Ibsen-Jensen R. 2016. The complexity of deciding legality of
a single step of magic: The gathering. ECAI: European Conference on Artificial
Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285,
1432–1439.'
mla: 'Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Deciding
Legality of a Single Step of Magic: The Gathering. Vol. 285, IOS Press, 2016,
pp. 1432–39, doi:10.3233/978-1-61499-672-9-1432.'
short: K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.
conference:
end_date: 2016-09-02
location: The Hague, Netherlands
name: 'ECAI: European Conference on Artificial Intelligence'
start_date: 2016-08-29
date_created: 2018-12-11T11:46:41Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T08:00:54Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.3233/978-1-61499-672-9-1432
file:
- access_level: open_access
checksum: 848043c812ace05e459579c923f3d3cf
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:59Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4658'
file_name: IST-2018-950-v1+1_2016_Chatterjee_The_complexity.pdf
file_size: 2116225
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 285'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 1432 - 1439
publication_status: published
publisher: IOS Press
publist_id: '7342'
pubrep_id: '950'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'The complexity of deciding legality of a single step of magic: The gathering'
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: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 285
year: '2016'
...
---
_id: '480'
abstract:
- lang: eng
text: Graph games provide the foundation for modeling and synthesizing reactive
processes. In the synthesis of stochastic reactive processes, the traditional
model is perfect-information stochastic games, where some transitions of the game
graph are controlled by two adversarial players, and the other transitions are
executed probabilistically. We consider such games where the objective is the
conjunction of several quantitative objectives (specified as mean-payoff conditions),
which we refer to as generalized mean-payoff objectives. The basic decision problem
asks for the existence of a finite-memory strategy for a player that ensures the
generalized mean-payoff objective be satisfied with a desired probability against
all strategies of the opponent. A special case of the decision problem is the
almost-sure problem where the desired probability is 1. Previous results presented
a semi-decision procedure for -approximations of the almost-sure problem. In this
work, we show that both the almost-sure problem as well as the general basic decision
problem are coNP-complete, significantly improving the previous results. Moreover,
we show that in the case of 1-player stochastic games, randomized memoryless strategies
are sufficient and the problem can be solved in polynomial time. In contrast,
in two-player stochastic games, we show that even with randomized strategies exponential
memory is required in general, and present a matching exponential upper bound.
We also study the basic decision problem with infinite-memory strategies and present
computational complexity results for the problem. Our results are relevant in
the synthesis of stochastic reactive systems with multiple quantitative requirements.
alternative_title:
- Proceedings Symposium on Logic in Computer Science
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Perfect-information stochastic games with generalized
mean-payoff objectives. In: Vol 05-08-July-2016. IEEE; 2016:247-256. doi:10.1145/2933575.2934513'
apa: 'Chatterjee, K., & Doyen, L. (2016). Perfect-information stochastic games
with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented
at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934513'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic
Games with Generalized Mean-Payoff Objectives,” 05-08-July-2016:247–56. IEEE,
2016. https://doi.org/10.1145/2933575.2934513.
ieee: 'K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized
mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New
York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.'
ista: 'Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized
mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium
on Logic in Computer Science, vol. 05-08-July-2016, 247–256.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Perfect-Information Stochastic
Games with Generalized Mean-Payoff Objectives. Vol. 05-08-July-2016, IEEE,
2016, pp. 247–56, doi:10.1145/2933575.2934513.
short: K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.
conference:
end_date: 2016-07-08
location: New York, NY, USA
name: 'LICS: Logic in Computer Science'
start_date: 2016-07-05
date_created: 2018-12-11T11:46:42Z
date_published: 2016-07-05T00:00:00Z
date_updated: 2021-01-12T08:00:56Z
day: '05'
department:
- _id: KrCh
doi: 10.1145/2933575.2934513
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.06376
month: '07'
oa: 1
oa_version: Preprint
page: 247 - 256
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: IEEE
publist_id: '7340'
quality_controlled: '1'
scopus_import: 1
status: public
title: Perfect-information stochastic games with generalized mean-payoff objectives
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 05-08-July-2016
year: '2016'
...
---
_id: '510'
abstract:
- lang: eng
text: 'The CLE (CLAVATA3/Embryo Surrounding Region-related) peptides are small secreted
signaling peptides that are primarily involved in the regulation of stem cell
homeostasis in different plant meristems. Particularly, the characterization of
the CLE41-PXY/TDR signaling pathway has greatly advanced our understanding on
the potential roles of CLE peptides in vascular development and wood formation.
Nevertheless, our knowledge on this gene family in a tree species is limited.
In a recent study, we reported on a systematically investigation of the CLE gene
family in Populus trichocarpa . The potential roles of PtCLE genes were studied
by comparative analysis and transcriptional pro fi ling. Among fi fty PtCLE members,
many PtCLE proteins share identical CLE motifs or contain the same CLE motif as
that of AtCLEs, while PtCLE genes exhibited either comparable or distinct expression
patterns comparing to their Arabidopsis counterparts. These fi ndings indicate
the existence of both functional conservation and functional divergence between
PtCLEs and their AtCLE orthologues. Our results provide valuable resources for
future functional investigations of these critical signaling molecules in woody
plants. '
acknowledgement: 'We are grateful to Dr. Long (Laboratoire de Reproduction et Developpement
des Plantes,CNRS,INRA,ENSLyon,UCBL,Universite de Lyon,France)for critical reading
of the article. Work in our group is supported by the National Natural Science Foundation
of China (31271575; 31200902), the Fundamental Research Funds for the Central Univ
ersities (GK201103005), the Specialized Research Fund for the Doctoral Program of
Higher Education from the Ministry of Education of China (20120202120009), the Scientific
Research Foundation for the Returned Overseas Chinese Scholars, State Education
Ministry, and the Natural Science Basic Research Plan in Shaanxi Province of China
(2014JM3064). '
article_number: e1191734
article_processing_charge: No
author:
- first_name: Zhijun
full_name: Liu, Zhijun
last_name: Liu
- first_name: 'Nan'
full_name: Yang, Nan
last_name: Yang
- first_name: Yanting
full_name: Lv, Yanting
last_name: Lv
- first_name: Lixia
full_name: Pan, Lixia
last_name: Pan
- first_name: Shuo
full_name: Lv, Shuo
last_name: Lv
- first_name: Huibin
full_name: Han, Huibin
id: 31435098-F248-11E8-B48F-1D18A9856A87
last_name: Han
- first_name: Guodong
full_name: Wang, Guodong
last_name: Wang
citation:
ama: Liu Z, Yang N, Lv Y, et al. The CLE gene family in Populus trichocarpa. Plant
Signaling & Behavior. 2016;11(6). doi:10.1080/15592324.2016.1191734
apa: Liu, Z., Yang, N., Lv, Y., Pan, L., Lv, S., Han, H., & Wang, G. (2016).
The CLE gene family in Populus trichocarpa. Plant Signaling & Behavior.
Taylor & Francis. https://doi.org/10.1080/15592324.2016.1191734
chicago: Liu, Zhijun, Nan Yang, Yanting Lv, Lixia Pan, Shuo Lv, Huibin Han, and
Guodong Wang. “The CLE Gene Family in Populus Trichocarpa.” Plant Signaling
& Behavior. Taylor & Francis, 2016. https://doi.org/10.1080/15592324.2016.1191734.
ieee: Z. Liu et al., “The CLE gene family in Populus trichocarpa,” Plant
Signaling & Behavior, vol. 11, no. 6. Taylor & Francis, 2016.
ista: Liu Z, Yang N, Lv Y, Pan L, Lv S, Han H, Wang G. 2016. The CLE gene family
in Populus trichocarpa. Plant Signaling & Behavior. 11(6), e1191734.
mla: Liu, Zhijun, et al. “The CLE Gene Family in Populus Trichocarpa.” Plant
Signaling & Behavior, vol. 11, no. 6, e1191734, Taylor & Francis,
2016, doi:10.1080/15592324.2016.1191734.
short: Z. Liu, N. Yang, Y. Lv, L. Pan, S. Lv, H. Han, G. Wang, Plant Signaling &
Behavior 11 (2016).
date_created: 2018-12-11T11:46:53Z
date_published: 2016-06-02T00:00:00Z
date_updated: 2023-10-17T11:13:40Z
day: '02'
department:
- _id: JiFr
doi: 10.1080/15592324.2016.1191734
intvolume: ' 11'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4973754/
month: '06'
oa: 1
oa_version: Submitted Version
publication: Plant Signaling & Behavior
publication_status: published
publisher: Taylor & Francis
publist_id: '7308'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The CLE gene family in Populus trichocarpa
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2016'
...
---
_id: '5445'
abstract:
- lang: eng
text: 'We consider the quantitative analysis problem for interprocedural control-flow
graphs (ICFGs). The input consists of an ICFG, a positive weight function that
assigns every transition a positive integer-valued number, and a labelling of
the transitions (events) as good, bad, and neutral events. The weight function
assigns to each transition a numerical value that represents ameasure of how good
or bad an event is. The quantitative analysis problem asks whether there is a
run of the ICFG where the ratio of the sum of the numerical weights of good events
versus the sum of weights of bad events in the long-run is at least a given threshold
(or equivalently, to compute the maximal ratio among all valid paths in the ICFG).
The quantitative analysis problem for ICFGs can be solved in polynomial time,
and we present an efficient and practical algorithm for the problem. We show that
several problems relevant for static program analysis, such as estimating the
worst-case execution time of a program or the average energy consumption of a
mobile application, can be modeled in our framework. We have implemented our algorithm
as a tool in the Java Soot framework. We demonstrate the effectiveness of our
approach with two case studies. First, we show that our framework provides a sound
approach (no false positives) for the analysis of inefficiently-used containers.
Second, we show that our approach can also be used for static profiling of programs
which reasons about methods that are frequently invoked. Our experimental results
show that our tool scales to relatively large benchmarks, and discovers relevant
and useful information that can be used to optimize performance of the programs. '
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Pavlogiannis A, Velner Y. Quantitative Interprocedural Analysis.
IST Austria; 2016. doi:10.15479/AT:IST-2016-523-v1-1
apa: Chatterjee, K., Pavlogiannis, A., & Velner, Y. (2016). Quantitative
interprocedural analysis. IST Austria. https://doi.org/10.15479/AT:IST-2016-523-v1-1
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. Quantitative
Interprocedural Analysis. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-523-v1-1.
ieee: K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural
analysis. IST Austria, 2016.
ista: Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural
analysis, IST Austria, 33p.
mla: Chatterjee, Krishnendu, et al. Quantitative Interprocedural Analysis.
IST Austria, 2016, doi:10.15479/AT:IST-2016-523-v1-1.
short: K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis,
IST Austria, 2016.
date_created: 2018-12-12T11:39:22Z
date_published: 2016-03-31T00:00:00Z
date_updated: 2023-02-23T10:06:22Z
day: '31'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-523-v1-1
file:
- access_level: open_access
checksum: cef516fa091925b5868813e355268fb4
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:52Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5513'
file_name: IST-2016-523-v1+1_main.pdf
file_size: 1012204
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '523'
related_material:
record:
- id: '1604'
relation: later_version
status: public
status: public
title: Quantitative interprocedural analysis
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5446'
abstract:
- lang: eng
text: "We study the problem of developing efficient approaches for proving termination
of recursive programs with one-dimensional arrays. Ranking functions serve as
a sound and complete approach for proving termination of non-recursive programs
without array operations. First, we generalize ranking functions to the notion
of measure functions, and prove that measure functions (i) provide a sound method
to prove termination of recursive programs (with one-dimensional arrays), and
(ii) is both sound and complete over recursive programs without array operations.
Our second contribution is the synthesis of measure functions of specific forms
in polynomial time. More precisely, we prove that (i) polynomial measure functions
over recursive programs can be synthesized in polynomial time through Farkas’
Lemma and Handelman’s Theorem, and (ii) measure functions involving logarithm
and exponentiation can be synthesized in polynomial time through abstraction of
logarithmic or exponential terms and Handelman’s Theorem. A key application of
our method is the worst-case analysis of recursive programs. While previous methods
obtain worst-case polynomial bounds of the form O(n^k), where k is an integer,
our polynomial time methods can synthesize bounds of the form O(n log n), as well
as O(n^x), where x is not an integer. We show the applicability of our automated
technique to obtain worst-case complexity of classical recursive algorithms such
as (i) Merge-Sort, the divideand-\r\nconquer algorithm for the Closest-Pair problem,
where we obtain O(n log n) worst-case bound, and (ii) Karatsuba’s algorithm for
polynomial multiplication and Strassen’s algorithm for matrix multiplication,
where we obtain O(n^x) bound, where x is not an integer and close to the best-known
bounds for the respective algorithms. Finally, we present experimental results
to demonstrate the\r\neffectiveness of our approach."
alternative_title:
- IST Austria Technical Report
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3. Termination and Worst-Case Analysis
of Recursive Programs. IST Austria; 2016.
apa: Anonymous, 1, Anonymous, 2, & Anonymous, 3. (2016). Termination and
worst-case analysis of recursive programs. IST Austria.
chicago: Anonymous, 1, 2 Anonymous, and 3 Anonymous. Termination and Worst-Case
Analysis of Recursive Programs. IST Austria, 2016.
ieee: 1 Anonymous, 2 Anonymous, and 3 Anonymous, Termination and worst-case analysis
of recursive programs. IST Austria, 2016.
ista: Anonymous 1, Anonymous 2, Anonymous 3. 2016. Termination and worst-case analysis
of recursive programs, IST Austria, 26p.
mla: Anonymous, 1, et al. Termination and Worst-Case Analysis of Recursive Programs.
IST Austria, 2016.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, Termination and Worst-Case Analysis
of Recursive Programs, IST Austria, 2016.
date_created: 2018-12-12T11:39:23Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2020-07-14T23:05:05Z
day: '15'
ddc:
- '000'
file:
- access_level: open_access
checksum: 689069a7abbb34b21516164cbee9e0df
content_type: application/pdf
creator: dernst
date_created: 2019-05-10T13:27:24Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6403'
file_name: popl2017a.pdf
file_size: 686241
relation: main_file
- access_level: closed
checksum: fc08022bfbaac07bac047a9407c0bbb3
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:27:31Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6404'
file_name: author_names.txt
file_size: 258
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '26'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '618'
status: public
title: Termination and worst-case analysis of recursive programs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5447'
abstract:
- lang: eng
text: "We consider the problem of developing automated techniques to aid the average-case
complexity analysis of programs. Several classical textbook algorithms have quite
efficient average-case complexity, whereas the corresponding worst-case bounds
are either inefficient (e.g., QUICK-SORT), or completely ineffective (e.g., COUPONCOLLECTOR).
Since the main focus of average-case analysis is to obtain efficient bounds, we
consider bounds that are either logarithmic,\r\nlinear, or almost-linear (O(log
n), O(n), O(n · log n),\r\nrespectively, where n represents the size of the input).
Our main contribution is a sound approach for deriving such average-case bounds
for randomized recursive programs. Our approach is efficient (a simple linear-time
algorithm), and it is based on (a) the analysis of recurrence relations induced
by randomized algorithms, and (b) a guess-and-check technique. Our approach can
infer the asymptotically optimal average-case bounds for classical randomized
algorithms, including RANDOMIZED-SEARCH, QUICKSORT, QUICK-SELECT, COUPON-COLLECTOR,
where the worstcase\r\nbounds are either inefficient (such as linear as compared
to logarithmic of average-case, or quadratic as compared to linear or almost-linear
of average-case), or ineffective. We have implemented our approach, and the experimental
results show that we obtain the bounds efficiently for various classical algorithms."
alternative_title:
- IST Austria Technical Report
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
citation:
ama: 'Anonymous 1, Anonymous 2, Anonymous 3. Average-Case Analysis of Programs:
Automated Recurrence Analysis for Almost-Linear Bounds. IST Austria; 2016.'
apa: 'Anonymous, 1, Anonymous, 2, & Anonymous, 3. (2016). Average-case analysis
of programs: Automated recurrence analysis for almost-linear bounds. IST Austria.'
chicago: 'Anonymous, 1, 2 Anonymous, and 3 Anonymous. Average-Case Analysis of
Programs: Automated Recurrence Analysis for Almost-Linear Bounds. IST Austria,
2016.'
ieee: '1 Anonymous, 2 Anonymous, and 3 Anonymous, Average-case analysis of programs:
Automated recurrence analysis for almost-linear bounds. IST Austria, 2016.'
ista: 'Anonymous 1, Anonymous 2, Anonymous 3. 2016. Average-case analysis of programs:
Automated recurrence analysis for almost-linear bounds, IST Austria, 20p.'
mla: 'Anonymous, 1, et al. Average-Case Analysis of Programs: Automated Recurrence
Analysis for Almost-Linear Bounds. IST Austria, 2016.'
short: '1 Anonymous, 2 Anonymous, 3 Anonymous, Average-Case Analysis of Programs:
Automated Recurrence Analysis for Almost-Linear Bounds, IST Austria, 2016.'
date_created: 2018-12-12T11:39:23Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2020-07-14T23:05:06Z
day: '15'
ddc:
- '000'
file:
- access_level: closed
checksum: cf53cdb6d092e68db0b4a0a1506ef8fb
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:32:16Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6406'
file_name: listofauthors.txt
file_size: 281
relation: main_file
- access_level: open_access
checksum: 7bdd94ba13aa0dec9c46887fcf13870b
content_type: application/pdf
creator: dernst
date_created: 2019-05-10T13:32:16Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6407'
file_name: popl2017b.pdf
file_size: 563642
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '619'
status: public
title: 'Average-case analysis of programs: Automated recurrence analysis for almost-linear
bounds'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5448'
abstract:
- lang: eng
text: "We present a new dynamic partial-order reduction method for stateless model
checking of concurrent programs. A common approach for exploring program behaviors
relies on enumerating the traces of the program, without storing the visited states
(aka stateless exploration). As the number of distinct traces grows exponentially,
dynamic partial-order reduction (DPOR) techniques have been successfully used
to partition the space of traces into equivalence classes (Mazurkiewicz partitioning),
with the goal of exploring only few representative traces from each class.\r\nWe
introduce a new equivalence on traces under sequential consistency semantics,
which we call the observation equivalence. Two traces are observationally equivalent
if every read event observes the same write event in both traces. While the traditional
Mazurkiewicz equivalence is control-centric, our new definition is data-centric.
We show that our observation equivalence is coarser than the Mazurkiewicz equivalence,
and in many cases even exponentially coarser. We devise a DPOR exploration of
the trace space, called data-centric DPOR, based on the observation equivalence.\r\n1.
For acyclic architectures, our algorithm is guaranteed to explore exactly one
representative trace from each observation class, while spending polynomial time
per class. Hence, our algorithm is optimal wrt the observation equivalence, and
in several cases explores exponentially fewer traces than any enumerative method
based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider
an equivalence between traces which is finer than the observation equivalence;
but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially
coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence.
\r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based
DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show
a significant reduction in both running time and the number of explored equivalence
classes."
alternative_title:
- IST Austria Technical Report
arxiv: 1
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
- first_name: '4'
full_name: Anonymous, 4
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. Data-Centric Dynamic
Partial Order Reduction. IST Austria; 2016.
apa: Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2016). Data-centric
dynamic partial order reduction. IST Austria.
chicago: Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. Data-Centric
Dynamic Partial Order Reduction. IST Austria, 2016.
ieee: 1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Data-centric dynamic
partial order reduction. IST Austria, 2016.
ista: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2016. Data-centric dynamic
partial order reduction, IST Austria, 20p.
mla: Anonymous, 1, et al. Data-Centric Dynamic Partial Order Reduction. IST
Austria, 2016.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Data-Centric Dynamic
Partial Order Reduction, IST Austria, 2016.
date_created: 2018-12-12T11:39:23Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2023-02-23T12:27:16Z
day: '15'
ddc:
- '000'
external_id:
arxiv:
- '1610.01188'
file:
- access_level: open_access
checksum: 1d69252d66bcdf782615ddfb911d2957
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:45Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5506'
file_name: IST-2016-620-v1+1_main.pdf
file_size: 538881
relation: main_file
- access_level: closed
checksum: deabb0eb8f237cae4f9542b28b0b6eb2
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:30:40Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6405'
file_name: authornames.txt
file_size: 121
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '620'
related_material:
record:
- id: '10417'
relation: later_version
status: public
- id: '5456'
relation: later_version
status: public
status: public
title: Data-centric dynamic partial order reduction
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5449'
abstract:
- lang: eng
text: "The fixation probability is the probability that a new mutant introduced
in a homogeneous population eventually takes over the entire population.\r\nThe
fixation probability is a fundamental quantity of natural selection, and known
to depend on the population structure.\r\nAmplifiers of natural selection are
population structures which increase the fixation probability of advantageous
mutants, as compared to the baseline case of well-mixed populations. In this work
we focus on symmetric population structures represented as undirected graphs.
In the regime of undirected graphs, the strongest amplifier known has been the
Star graph, and the existence of undirected graphs with stronger amplification
properties has remained open for over a decade.\r\nIn this work we present the
Comet and Comet-swarm families of undirected graphs. We show that for a range
of fitness values of the mutants, the Comet and Comet-swarm graphs have fixation
probability strictly larger than the fixation probability of the Star graph, for
fixed population size and at the limit of large populations, respectively."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- 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: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on Undirected
Population Structures: Comets Beat Stars. IST Austria; 2016. doi:10.15479/AT:IST-2016-648-v1-1'
apa: 'Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Amplification
on undirected population structures: Comets beat stars. IST Austria. https://doi.org/10.15479/AT:IST-2016-648-v1-1'
chicago: 'Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Amplification on Undirected Population Structures: Comets Beat Stars.
IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-648-v1-1.'
ieee: 'A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification
on undirected population structures: Comets beat stars. IST Austria, 2016.'
ista: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on
undirected population structures: Comets beat stars, IST Austria, 22p.'
mla: 'Pavlogiannis, Andreas, et al. Amplification on Undirected Population Structures:
Comets Beat Stars. IST Austria, 2016, doi:10.15479/AT:IST-2016-648-v1-1.'
short: 'A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected
Population Structures: Comets Beat Stars, IST Austria, 2016.'
date_created: 2018-12-12T11:39:24Z
date_published: 2016-11-09T00:00:00Z
date_updated: 2023-02-23T12:22:21Z
day: '09'
ddc:
- '519'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-648-v1-1
file:
- access_level: open_access
checksum: 8345a8c1e7d7f0cd92516d182b7fc59e
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:07Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5529'
file_name: IST-2016-648-v1+1_tr.pdf
file_size: 1264221
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Updated Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '648'
related_material:
record:
- id: '512'
relation: later_version
status: public
status: public
title: 'Amplification on undirected population structures: Comets beat stars'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5451'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- 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: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Strong Amplifiers of Natural
Selection. IST Austria; 2016. doi:10.15479/AT:IST-2016-728-v1-1
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Strong
amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2016-728-v1-1
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-728-v1-1.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers
of natural selection. IST Austria, 2016.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers
of natural selection, IST Austria, 34p.
mla: Pavlogiannis, Andreas, et al. Strong Amplifiers of Natural Selection.
IST Austria, 2016, doi:10.15479/AT:IST-2016-728-v1-1.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of
Natural Selection, IST Austria, 2016.
date_created: 2018-12-12T11:39:24Z
date_published: 2016-12-30T00:00:00Z
date_updated: 2023-02-23T12:27:05Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-728-v1-1
file:
- access_level: open_access
checksum: 7b8bb17c322c0556acba6ac169fa71c1
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:04Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5465'
file_name: IST-2016-728-v1+1_main.pdf
file_size: 1014732
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '34'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '728'
status: public
title: Strong amplifiers of natural selection
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5452'
alternative_title:
- IST Austria Technical Report
article_processing_charge: No
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- 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: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Arbitrarily Strong Amplifiers
of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-728-v2-1
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily
strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-728-v2-1
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria,
2016. https://doi.org/10.15479/AT:IST-2017-728-v2-1.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong
amplifiers of natural selection. IST Austria, 2016.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong
amplifiers of natural selection, IST Austria, 32p.
mla: Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection.
IST Austria, 2016, doi:10.15479/AT:IST-2017-728-v2-1.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong
Amplifiers of Natural Selection, IST Austria, 2016.
date_created: 2018-12-12T11:39:25Z
date_published: 2016-12-30T00:00:00Z
date_updated: 2024-02-21T13:48:42Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2017-728-v2-1
ec_funded: 1
file:
- access_level: open_access
checksum: 58e895f26c82f560c0f0989bf8b08599
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:52:59Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5460'
file_name: IST-2017-728-v2+1_main.pdf
file_size: 811558
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '32'
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '750'
related_material:
record:
- id: '5453'
relation: later_version
status: public
- id: '5559'
relation: popular_science
status: public
status: public
title: Arbitrarily strong amplifiers of natural selection
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5453'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- 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: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Arbitrarily Strong Amplifiers
of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-749-v3-1
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily
strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-749-v3-1
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria,
2016. https://doi.org/10.15479/AT:IST-2017-749-v3-1.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong
amplifiers of natural selection. IST Austria, 2016.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong
amplifiers of natural selection, IST Austria, 34p.
mla: Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection.
IST Austria, 2016, doi:10.15479/AT:IST-2017-749-v3-1.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong
Amplifiers of Natural Selection, IST Austria, 2016.
date_created: 2018-12-12T11:39:25Z
date_published: 2016-12-30T00:00:00Z
date_updated: 2023-02-23T12:27:07Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2017-749-v3-1
file:
- access_level: open_access
checksum: 83b0313dab3bff4bdb6ac38695026fda
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:13Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5474'
file_name: IST-2017-749-v3+1_main.pdf
file_size: 1015647
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '34'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '755'
related_material:
record:
- id: '5452'
relation: earlier_version
status: public
status: public
title: Arbitrarily strong amplifiers of natural selection
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5550'
abstract:
- lang: eng
text: "We collected flower colour information on species in the tribe Antirrhineae
from taxonomic literature. We also retreived molecular data from GenBank for as
many of these species as possible to estimate phylogenetic relationships among
these taxa. We then used the R package 'diversitree' to examine patterns of evolutionary
transitions between anthocyanin and yellow pigmentation across the phylogeny.\r\n\r\nFor
full details of the methods see:\r\nEllis TJ and Field DL \"Repeated gains in
yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae”,
Annals of Botany (in press)"
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ellis, Thomas
id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
last_name: Ellis
orcid: 0000-0002-8511-0254
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
citation:
ama: Ellis T, Field D. Flower colour data and phylogeny (NEXUS) files. 2016. doi:10.15479/AT:ISTA:34
apa: Ellis, T., & Field, D. (2016). Flower colour data and phylogeny (NEXUS)
files. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:34
chicago: Ellis, Thomas, and David Field. “Flower Colour Data and Phylogeny (NEXUS)
Files.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:34.
ieee: T. Ellis and D. Field, “Flower colour data and phylogeny (NEXUS) files.” Institute
of Science and Technology Austria, 2016.
ista: Ellis T, Field D. 2016. Flower colour data and phylogeny (NEXUS) files, Institute
of Science and Technology Austria, 10.15479/AT:ISTA:34.
mla: Ellis, Thomas, and David Field. Flower Colour Data and Phylogeny (NEXUS)
Files. Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:34.
short: T. Ellis, D. Field, (2016).
datarep_id: '34'
date_created: 2018-12-12T12:31:29Z
date_published: 2016-02-19T00:00:00Z
date_updated: 2024-02-21T13:49:54Z
day: '19'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:34
file:
- access_level: open_access
checksum: 950f85b80427d357bfeff09608ba02e9
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:27Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5594'
file_name: IST-2016-34-v1+1_tellis_flower_colour_data.zip
file_size: 4468543
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
publist_id: '5828'
related_material:
record:
- id: '1382'
relation: research_paper
status: public
status: public
title: Flower colour data and phylogeny (NEXUS) files
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5551'
abstract:
- lang: eng
text: "Data from array experiments investigating pollinator behaviour on snapdragons
in controlled conditions, and their effect on plant mating. Data were collected
as part of Tom Ellis' PhD thesis , submitted February 2016.\r\n\r\nWe placed a
total of 36 plants in a grid inside a closed organza tent, with a single hive
of commercially bred bumblebees (Bombus hortorum). We used only the yellow-flowered
Antirrhinum majus striatum and the magenta-flowered Antirrhinum majus pseudomajus,
at ratios of 6:36, 12:24, 18:18, 24:12 and 30:6.\r\n\r\nAfter 24 hours to learn
how to deal with snapdragons, I observed pollinators foraging on plants, and recorded
the transitions between plants. Thereafter seeds on plants were allowed to develops.
A sample of these were grown to maturity when their flower colour could be determined,
and they were scored as yellow, magenta, or hybrid."
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ellis, Thomas
id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
last_name: Ellis
orcid: 0000-0002-8511-0254
citation:
ama: Ellis T. Data on pollinator observations and offpsring phenotypes. 2016. doi:10.15479/AT:ISTA:35
apa: Ellis, T. (2016). Data on pollinator observations and offpsring phenotypes.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:35
chicago: Ellis, Thomas. “Data on Pollinator Observations and Offpsring Phenotypes.”
Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:35.
ieee: T. Ellis, “Data on pollinator observations and offpsring phenotypes.” Institute
of Science and Technology Austria, 2016.
ista: Ellis T. 2016. Data on pollinator observations and offpsring phenotypes, Institute
of Science and Technology Austria, 10.15479/AT:ISTA:35.
mla: Ellis, Thomas. Data on Pollinator Observations and Offpsring Phenotypes.
Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:35.
short: T. Ellis, (2016).
contributor:
- first_name: David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
- first_name: Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
datarep_id: '35'
date_created: 2018-12-12T12:31:29Z
date_published: 2016-02-19T00:00:00Z
date_updated: 2024-02-21T13:51:27Z
day: '19'
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:35
file:
- access_level: open_access
checksum: aa3eb85d52b110cd192aa23147c4d4f3
content_type: application/zip
creator: system
date_created: 2018-12-12T13:05:12Z
date_updated: 2020-07-14T12:47:01Z
file_id: '5640'
file_name: IST-2016-35-v1+1_array_data.zip
file_size: 32775
relation: main_file
file_date_updated: 2020-07-14T12:47:01Z
has_accepted_license: '1'
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '1398'
relation: research_paper
status: public
status: public
title: Data on pollinator observations and offpsring phenotypes
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5552'
abstract:
- lang: eng
text: "Data on pollinator visitation to wild snapdragons in a natural hybrid zone,
collected as part of Tom Ellis' PhD thesis (submitted February 2016).\r\n\r\nSnapdragon
flowers have a mouth-like structure which pollinators must open to access nectar.
We placed 5mm cellophane tags in these mouths, which are held in place by the
pressure of the flower until a pollinator visits. When she opens the flower, the
tag drops out, and one can infer a visit. We surveyed plants over multiple days
in 2010, 2011 and 2012.\r\n\r\nAlso included are data on phenotypic and demographic
variables which may be explanatory variables for pollinator visitation."
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ellis, Thomas
id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
last_name: Ellis
orcid: 0000-0002-8511-0254
citation:
ama: Ellis T. Pollinator visitation data for wild Antirrhinum majus plants, with
phenotypic and frequency data. 2016. doi:10.15479/AT:ISTA:36
apa: Ellis, T. (2016). Pollinator visitation data for wild Antirrhinum majus plants,
with phenotypic and frequency data. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:36
chicago: Ellis, Thomas. “Pollinator Visitation Data for Wild Antirrhinum Majus Plants,
with Phenotypic and Frequency Data.” Institute of Science and Technology Austria,
2016. https://doi.org/10.15479/AT:ISTA:36.
ieee: T. Ellis, “Pollinator visitation data for wild Antirrhinum majus plants, with
phenotypic and frequency data.” Institute of Science and Technology Austria, 2016.
ista: Ellis T. 2016. Pollinator visitation data for wild Antirrhinum majus plants,
with phenotypic and frequency data., Institute of Science and Technology Austria,
10.15479/AT:ISTA:36.
mla: Ellis, Thomas. Pollinator Visitation Data for Wild Antirrhinum Majus Plants,
with Phenotypic and Frequency Data. Institute of Science and Technology Austria,
2016, doi:10.15479/AT:ISTA:36.
short: T. Ellis, (2016).
contributor:
- first_name: David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
- first_name: Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
datarep_id: '36'
date_created: 2018-12-12T12:31:30Z
date_published: 2016-02-19T00:00:00Z
date_updated: 2024-02-21T13:51:40Z
day: '19'
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:36
file:
- access_level: open_access
checksum: cbc61b523d4d475a04a737d50dc470ef
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:07Z
date_updated: 2020-07-14T12:47:01Z
file_id: '5625'
file_name: IST-2016-36-v1+1_tag_assay_archive.zip
file_size: 44905
relation: main_file
file_date_updated: 2020-07-14T12:47:01Z
has_accepted_license: '1'
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '1398'
relation: research_paper
status: public
status: public
title: Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic
and frequency data.
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5553'
abstract:
- lang: eng
text: "Genotypic, phenotypic and demographic data for 2128 wild snapdragons and
1127 open-pollinated progeny from a natural hybrid zone, collected as part of
Tom Ellis' PhD thesis (submitted) February 2016).\r\n\r\nTissue samples were sent
to LGC Genomics in Berlin for DNA extraction, and genotyping at 70 SNP markers
by KASPR genotyping. 29 of these SNPs failed to amplify reliably, and have been
removed from this dataset.\r\n\r\nOther data were retreived from an online database
of this population at www.antspec.org."
article_processing_charge: No
author:
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
- first_name: Thomas
full_name: Ellis, Thomas
id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
last_name: Ellis
orcid: 0000-0002-8511-0254
citation:
ama: Field D, Ellis T. Inference of mating patterns among wild snapdragons in a
natural hybrid zone in 2012. 2016. doi:10.15479/AT:ISTA:37
apa: Field, D., & Ellis, T. (2016). Inference of mating patterns among wild
snapdragons in a natural hybrid zone in 2012. Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:37
chicago: Field, David, and Thomas Ellis. “Inference of Mating Patterns among Wild
Snapdragons in a Natural Hybrid Zone in 2012.” Institute of Science and Technology
Austria, 2016. https://doi.org/10.15479/AT:ISTA:37.
ieee: D. Field and T. Ellis, “Inference of mating patterns among wild snapdragons
in a natural hybrid zone in 2012.” Institute of Science and Technology Austria,
2016.
ista: Field D, Ellis T. 2016. Inference of mating patterns among wild snapdragons
in a natural hybrid zone in 2012, Institute of Science and Technology Austria,
10.15479/AT:ISTA:37.
mla: Field, David, and Thomas Ellis. Inference of Mating Patterns among Wild
Snapdragons in a Natural Hybrid Zone in 2012. Institute of Science and Technology
Austria, 2016, doi:10.15479/AT:ISTA:37.
short: D. Field, T. Ellis, (2016).
contributor:
- contributor_type: project_manager
first_name: Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
datarep_id: '37'
date_created: 2018-12-12T12:31:30Z
date_published: 2016-02-19T00:00:00Z
date_updated: 2024-02-21T13:51:14Z
day: '19'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:37
file:
- access_level: open_access
checksum: 4ae751b1fa4897fa216241f975a57313
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:02Z
date_updated: 2020-07-14T12:47:01Z
file_id: '5620'
file_name: IST-2016-37-v1+1_paternity_archive.zip
file_size: 132808
relation: main_file
file_date_updated: 2020-07-14T12:47:01Z
has_accepted_license: '1'
keyword:
- paternity assignment
- pedigree
- matting patterns
- assortative mating
- Antirrhinum majus
- frequency-dependent selection
- plant-pollinator interaction
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '1398'
relation: research_paper
status: public
status: public
title: Inference of mating patterns among wild snapdragons in a natural hybrid zone
in 2012
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5554'
abstract:
- lang: eng
text: "The data stored here is used in Murat Tugrul's PhD thesis (Chapter 3), which
is related to the evolution of bacterial RNA polymerase binding.\r\nMagdalena
Steinrueck (PhD Student in Calin Guet's group at IST Austria) performed the experiments
and created the data on de novo promoter evolution. Fabienne Jesse (PhD Student
in Jon Bollback's group at IST Austria) performed the experiments and created
the data on lac promoter evolution."
article_processing_charge: No
author:
- first_name: Murat
full_name: Tugrul, Murat
id: 37C323C6-F248-11E8-B48F-1D18A9856A87
last_name: Tugrul
orcid: 0000-0002-8523-0758
citation:
ama: Tugrul M. Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase.
2016. doi:10.15479/AT:ISTA:43
apa: Tugrul, M. (2016). Experimental Data for Binding Site Evolution of Bacterial
RNA Polymerase. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:43
chicago: Tugrul, Murat. “Experimental Data for Binding Site Evolution of Bacterial
RNA Polymerase.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:43.
ieee: M. Tugrul, “Experimental Data for Binding Site Evolution of Bacterial RNA
Polymerase.” Institute of Science and Technology Austria, 2016.
ista: Tugrul M. 2016. Experimental Data for Binding Site Evolution of Bacterial
RNA Polymerase, Institute of Science and Technology Austria, 10.15479/AT:ISTA:43.
mla: Tugrul, Murat. Experimental Data for Binding Site Evolution of Bacterial
RNA Polymerase. Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:43.
short: M. Tugrul, (2016).
contributor:
- contributor_type: researcher
first_name: Magdalena
id: 2C023F40-F248-11E8-B48F-1D18A9856A87
last_name: Steinrück
- contributor_type: researcher
first_name: Fabienne
id: 4C8C26A4-F248-11E8-B48F-1D18A9856A87
last_name: Jesse
datarep_id: '43'
date_created: 2018-12-12T12:31:30Z
date_published: 2016-05-12T00:00:00Z
date_updated: 2024-02-21T13:50:34Z
day: '12'
department:
- _id: NiBa
- _id: JoBo
doi: 10.15479/AT:ISTA:43
file:
- access_level: open_access
checksum: 1fc0a10bb7ce110fcb5e1fbe3cf0c4e2
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:08Z
date_updated: 2020-07-14T12:47:01Z
file_id: '5626'
file_name: IST-2016-43-v1+1_DATA_MTugrul_PhDThesis_Chapter3.zip
file_size: 1123495
relation: main_file
file_date_updated: 2020-07-14T12:47:01Z
has_accepted_license: '1'
keyword:
- RNAP binding
- de novo promoter evolution
- lac promoter
month: '05'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '1131'
relation: used_in_publication
status: public
status: public
title: Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...