---
_id: '5809'
abstract:
- lang: eng
text: A discrete spherical circle is a topologically well-connected 3D circle in
the integer space, which belongs to a discrete sphere as well as a discrete plane.
It is one of the most important 3D geometric primitives, but has not possibly
yet been studied up to its merit. This paper is a maiden exposition of some of
its elementary properties, which indicates a sense of its profound theoretical
prospects in the framework of digital geometry. We have shown how different types
of discretization can lead to forbidden and admissible classes, when one attempts
to define the discretization of a spherical circle in terms of intersection between
a discrete sphere and a discrete plane. Several fundamental theoretical results
have been presented, the algorithm for construction of discrete spherical circles
has been discussed, and some test results have been furnished to demonstrate its
practicality and usefulness.
article_processing_charge: No
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
- first_name: Valentin E.
full_name: Brimkov, Valentin E.
last_name: Brimkov
citation:
ama: 'Biswas R, Bhowmick P, Brimkov VE. On the connectivity and smoothness of discrete
spherical circles. In: Combinatorial Image Analysis. Vol 9448. Cham: Springer
Nature; 2016:86-100. doi:10.1007/978-3-319-26145-4_7'
apa: 'Biswas, R., Bhowmick, P., & Brimkov, V. E. (2016). On the connectivity
and smoothness of discrete spherical circles. In Combinatorial image analysis
(Vol. 9448, pp. 86–100). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-26145-4_7'
chicago: 'Biswas, Ranita, Partha Bhowmick, and Valentin E. Brimkov. “On the Connectivity
and Smoothness of Discrete Spherical Circles.” In Combinatorial Image Analysis,
9448:86–100. Cham: Springer Nature, 2016. https://doi.org/10.1007/978-3-319-26145-4_7.'
ieee: 'R. Biswas, P. Bhowmick, and V. E. Brimkov, “On the connectivity and smoothness
of discrete spherical circles,” in Combinatorial image analysis, vol. 9448,
Cham: Springer Nature, 2016, pp. 86–100.'
ista: 'Biswas R, Bhowmick P, Brimkov VE. 2016.On the connectivity and smoothness
of discrete spherical circles. In: Combinatorial image analysis. vol. 9448, 86–100.'
mla: Biswas, Ranita, et al. “On the Connectivity and Smoothness of Discrete Spherical
Circles.” Combinatorial Image Analysis, vol. 9448, Springer Nature, 2016,
pp. 86–100, doi:10.1007/978-3-319-26145-4_7.
short: R. Biswas, P. Bhowmick, V.E. Brimkov, in:, Combinatorial Image Analysis,
Springer Nature, Cham, 2016, pp. 86–100.
conference:
end_date: 2015-11-27
location: Kolkata, India
name: 'IWCIA: International Workshop on Combinatorial Image Analysis'
start_date: 2015-11-24
date_created: 2019-01-08T20:45:19Z
date_published: 2016-01-06T00:00:00Z
date_updated: 2022-01-28T08:13:03Z
day: '06'
department:
- _id: HeEd
doi: 10.1007/978-3-319-26145-4_7
extern: '1'
intvolume: ' 9448'
language:
- iso: eng
month: '01'
oa_version: None
page: 86-100
place: Cham
publication: Combinatorial image analysis
publication_identifier:
eisbn:
- 978-3-319-26145-4
eissn:
- 1611-3349
isbn:
- 978-3-319-26144-7
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: On the connectivity and smoothness of discrete spherical circles
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9448
year: '2016'
...
---
_id: '1008'
abstract:
- lang: eng
text: Feedback loops in biological networks, among others, enable differentiation
and cell cycle progression, and increase robustness in signal transduction. In
natural networks, feedback loops are often complex and intertwined, making it
challenging to identify which loops are mainly responsible for an observed behavior.
However, minimal synthetic replicas could allow for such identification. Here,
we engineered a synthetic permease-inducer-repressor system in Saccharomyces cerevisiae
to analyze if a transport-mediated positive feedback loop could be a core mechanism
for the switch-like behavior in the regulation of metabolic gene networks such
as the S. cerevisiae GAL system or the Escherichia coli lac operon. We characterized
the synthetic circuit using deterministic and stochastic mathematical models.
Similar to its natural counterparts, our synthetic system shows bistable and hysteretic
behavior, and the inducer concentration range for bistability as well as the switching
rates between the two stable states depend on the repressor concentration. Our
results indicate that a generic permease–inducer–repressor circuit with a single
feedback loop is sufficient to explain the experimentally observed bistable behavior
of the natural systems. We anticipate that the approach of reimplementing natural
systems with orthogonal parts to identify crucial network components is applicable
to other natural systems such as signaling pathways.
acknowledgement: We thank Julio Polaina (Instituto de Agroqu ı ́ mica y Tecnolog ı
́ a de Alimentos, C.S.I.C., Paterna, Spain) for the gift of plasmid pMR4, Gregor
W. Schmidt for provision of and support with the micro fl uidic device, Markus Du
̈ rr for the cell tracking R script, and Lukas Widmer for the script for MEIGO using
“ parfor ” in MATLAB. We acknowledge the members of the Stelling group for discussions,
comments, and support.
author:
- first_name: Robert
full_name: Gnügge, Robert
last_name: Gnügge
- first_name: Lekshmi
full_name: Dharmarajan, Lekshmi
last_name: Dharmarajan
- first_name: Moritz
full_name: Lang, Moritz
id: 29E0800A-F248-11E8-B48F-1D18A9856A87
last_name: Lang
- first_name: Jörg
full_name: Stelling, Jörg
last_name: Stelling
citation:
ama: Gnügge R, Dharmarajan L, Lang M, Stelling J. An orthogonal permease–inducer–repressor
feedback loop shows bistability. ACS Synthetic Biology. 2016;5(10):1098-1107.
doi:10.1021/acssynbio.6b00013
apa: Gnügge, R., Dharmarajan, L., Lang, M., & Stelling, J. (2016). An orthogonal
permease–inducer–repressor feedback loop shows bistability. ACS Synthetic Biology.
American Chemical Society. https://doi.org/10.1021/acssynbio.6b00013
chicago: Gnügge, Robert, Lekshmi Dharmarajan, Moritz Lang, and Jörg Stelling. “An
Orthogonal Permease–Inducer–Repressor Feedback Loop Shows Bistability.” ACS
Synthetic Biology. American Chemical Society, 2016. https://doi.org/10.1021/acssynbio.6b00013.
ieee: R. Gnügge, L. Dharmarajan, M. Lang, and J. Stelling, “An orthogonal permease–inducer–repressor
feedback loop shows bistability,” ACS Synthetic Biology, vol. 5, no. 10.
American Chemical Society, pp. 1098–1107, 2016.
ista: Gnügge R, Dharmarajan L, Lang M, Stelling J. 2016. An orthogonal permease–inducer–repressor
feedback loop shows bistability. ACS Synthetic Biology. 5(10), 1098–1107.
mla: Gnügge, Robert, et al. “An Orthogonal Permease–Inducer–Repressor Feedback Loop
Shows Bistability.” ACS Synthetic Biology, vol. 5, no. 10, American Chemical
Society, 2016, pp. 1098–107, doi:10.1021/acssynbio.6b00013.
short: R. Gnügge, L. Dharmarajan, M. Lang, J. Stelling, ACS Synthetic Biology 5
(2016) 1098–1107.
date_created: 2018-12-11T11:49:40Z
date_published: 2016-05-05T00:00:00Z
date_updated: 2021-01-12T06:47:37Z
day: '05'
department:
- _id: CaGu
doi: 10.1021/acssynbio.6b00013
intvolume: ' 5'
issue: '10'
language:
- iso: eng
month: '05'
oa_version: None
page: 1098 - 1107
publication: ACS Synthetic Biology
publication_status: published
publisher: American Chemical Society
publist_id: '6390'
quality_controlled: '1'
status: public
title: An orthogonal permease–inducer–repressor feedback loop shows bistability
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2016'
...
---
_id: '1068'
abstract:
- lang: eng
text: 'Games on graphs provide the appropriate framework to study several central
problems in computer science, such as verification and synthesis of reactive systems.
One of the most basic objectives for games on graphs is the liveness (or Büchi)
objective that given a target set of vertices requires that some vertex in the
target set is visited infinitely often. We study generalized Büchi objectives
(i.e., conjunction of liveness objectives), and implications between two generalized
Büchi objectives (known as GR(1) objectives), that arise in numerous applications
in computer-aided verification. We present improved algorithms and conditional
super-linear lower bounds based on widely believed assumptions about the complexity
of (A1) combinatorial Boolean matrix multiplication and (A2) CNF-SAT. We consider
graph games with n vertices, m edges, and generalized Büchi objectives with k
conjunctions. First, we present an algorithm with running time O(k*n^2), improving
the previously known O(k*n*m) and O(k^2*n^2) worst-case bounds. Our algorithm
is optimal for dense graphs under (A1). Second, we show that the basic algorithm
for the problem is optimal for sparse graphs when the target sets have constant
size under (A2). Finally, we consider GR(1) objectives, with k_1 conjunctions
in the antecedent and k_2 conjunctions in the consequent, and present an O(k_1
k_2 n^{2.5})-time algorithm, improving the previously known O(k_1*k_2*n*m)-time
algorithm for m > n^{1.5}. '
acknowledgement: K. C., M. H., and W. D. are partially supported by the Vienna Science
and Technology Fund (WWTF) through project ICT15-003. K. C. is partially supported
by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC
Start grant (279307
alternative_title:
- LIPIcs
article_number: '25'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvorák, Wolfgang
last_name: Dvorák
- 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: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Conditionally optimal
algorithms for generalized Büchi Games. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2016. doi:10.4230/LIPIcs.MFCS.2016.25'
apa: 'Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2016).
Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented
at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.25'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika
Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,”
Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.25.
ieee: 'K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Conditionally
optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical
Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58.'
ista: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2016. Conditionally
optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations
of Computer Science (SG), LIPIcs, vol. 58, 25.'
mla: Chatterjee, Krishnendu, et al. Conditionally Optimal Algorithms for Generalized
Büchi Games. Vol. 58, 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016, doi:10.4230/LIPIcs.MFCS.2016.25.
short: K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2016.
conference:
end_date: 2016-08-26
location: Krakow, Poland
name: 'MFCS: Mathematical Foundations of Computer Science (SG)'
start_date: 2016-08-22
date_created: 2018-12-11T11:49:58Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2025-06-02T08:53:50Z
day: '01'
ddc:
- '000'
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2016.25
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:02Z
date_updated: 2018-12-12T10:16:02Z
file_id: '5187'
file_name: IST-2017-779-v1+1_LIPIcs-MFCS-2016-25.pdf
file_size: 632786
relation: main_file
file_date_updated: 2018-12-12T10:16:02Z
has_accepted_license: '1'
intvolume: ' 58'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6317'
pubrep_id: '779'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Conditionally optimal algorithms for generalized Büchi Games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2016'
...
---
_id: '1069'
abstract:
- lang: eng
text: "The Continuous Skolem Problem asks whether a real-valued function satisfying
a linear differen-\r\ntial equation has a zero in a given interval of real numbers.
This is a fundamental reachability\r\nproblem for continuous linear dynamical
systems, such as linear hybrid automata and continuous-\r\ntime Markov chains.
Decidability of the problem is currently open – indeed decidability is open\r\neven
for the sub-problem in which a zero is sought in a bounded interval. In this paper
we show\r\ndecidability of the bounded problem subject to Schanuel’s Conjecture,
a unifying conjecture in\r\ntranscendental number theory. We furthermore analyse
the unbounded problem in terms of the\r\nfrequencies of the differential equation,
that is, the imaginary parts of the characteristic roots.\r\nWe show that the
unbounded problem can be reduced to the bounded problem if there is at most\r\none
rationally linearly independent frequency, or if there are two rationally linearly
independent\r\nfrequencies and all characteristic roots are simple. We complete
the picture by showing that de-\r\ncidability of the unbounded problem in the
case of two (or more) rationally linearly independent\r\nfrequencies would entail
a major new effectiveness result in Diophantine approximation, namely\r\ncomputability
of the Diophantine-approximation types of all real algebraic numbers."
acknowledgement: 'Ventsislav Chonev is supported by Austrian Science Fund (FWF) NFN
Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and ERC
Advanced Grant (267989: QUAREM).'
alternative_title:
- LIPIcs
article_number: '100'
author:
- first_name: Ventsislav K
full_name: Chonev, Ventsislav K
id: 36CBE2E6-F248-11E8-B48F-1D18A9856A87
last_name: Chonev
- first_name: Joël
full_name: Ouaknine, Joël
last_name: Ouaknine
- first_name: James
full_name: Worrell, James
last_name: Worrell
citation:
ama: 'Chonev VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear
dynamical systems. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik;
2016. doi:10.4230/LIPIcs.ICALP.2016.100'
apa: 'Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On the skolem problem
for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata,
Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur
Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.100'
chicago: Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem
Problem for Continuous Linear Dynamical Systems,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.100.
ieee: 'V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous
linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming,
Rome, Italy, 2016, vol. 55.'
ista: 'Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous
linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs,
vol. 55, 100.'
mla: Chonev, Ventsislav K., et al. On the Skolem Problem for Continuous Linear
Dynamical Systems. Vol. 55, 100, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016, doi:10.4230/LIPIcs.ICALP.2016.100.
short: V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik, 2016.
conference:
end_date: 2016-07-15
location: Rome, Italy
name: 'ICALP: Automata, Languages and Programming'
start_date: 2016-07-12
date_created: 2018-12-11T11:49:59Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2021-01-12T06:48:03Z
day: '01'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2016.100
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:26Z
date_updated: 2018-12-12T10:16:26Z
file_id: '5213'
file_name: IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf
file_size: 521415
relation: main_file
file_date_updated: 2018-12-12T10:16:26Z
has_accepted_license: '1'
intvolume: ' 55'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik
publist_id: '6314'
pubrep_id: '778'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the skolem problem for continuous linear dynamical systems
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...
---
_id: '1070'
abstract:
- lang: eng
text: 'We present a logic that extends CTL (Computation Tree Logic) with operators
that express synchronization properties. A property is synchronized in a system
if it holds in all paths of a certain length. The new logic is obtained by using
the same path quantifiers and temporal operators as in CTL, but allowing a different
order of the quantifiers. This small syntactic variation induces a logic that
can express non-regular properties for which known extensions of MSO with equality
of path length are undecidable. We show that our variant of CTL is decidable and
that the model-checking problem is in Delta_3^P = P^{NP^NP}, and is DP-hard. We
analogously consider quantifier exchange in extensions of CTL, and we present
operators defined using basic operators of CTL* that express the occurrence of
infinitely many synchronization points. We show that the model-checking problem
remains in Delta_3^P. The distinguishing power of CTL and of our new logic coincide
if the Next operator is allowed in the logics, thus the classical bisimulation
quotient can be used for state-space reduction before model checking. '
acknowledgement: "This research was partially supported by Austrian Science Fund (FWF)
NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), Vienna
Science and Technology Fund (WWTF) through project ICT15-003, and European project
Cassting (FP7-601148).\r\n\r\nWe thank Stefan Göller and anonymous reviewers for
their insightful\r\ncomments and suggestions.\r\n"
alternative_title:
- LIPIcs
article_number: '98'
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. Computation tree logic for synchronization properties.
In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.98'
apa: 'Chatterjee, K., & Doyen, L. (2016). Computation tree logic for synchronization
properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming,
Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.98'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for
Synchronization Properties,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.98.
ieee: 'K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,”
presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016,
vol. 55.'
ista: 'Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties.
ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Computation Tree Logic for Synchronization
Properties. Vol. 55, 98, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016, doi:10.4230/LIPIcs.ICALP.2016.98.
short: K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016.
conference:
end_date: 2016-07-15
location: Rome, Italy
name: 'ICALP: Automata, Languages and Programming'
start_date: 2016-07-12
date_created: 2018-12-11T11:49:59Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:48:03Z
day: '01'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2016.98
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:52Z
date_updated: 2018-12-12T10:08:52Z
file_id: '4714'
file_name: IST-2017-812-v1+1_LIPIcs-ICALP-2016-98.pdf
file_size: 546133
relation: main_file
file_date_updated: 2018-12-12T10:08:52Z
has_accepted_license: '1'
intvolume: ' 55'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 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: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik
publist_id: '6313'
pubrep_id: '812'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computation tree logic for synchronization properties
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...
---
_id: '1071'
abstract:
- lang: eng
text: 'We consider data-structures for answering reachability and distance queries
on constant-treewidth graphs with n nodes, on the standard RAM computational model
with wordsize W=Theta(log n). Our first contribution is a data-structure that
after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time;
and (2) single-source reachability queries in O(n/log n) time. This is (asymptotically)
optimal and is faster than DFS/BFS when answering more than a constant number
of single-source queries. The data-structure uses at all times O(n) space. Our
second contribution is a space-time tradeoff data-structure for distance queries.
For any epsilon in [1/2,1], we provide a data-structure with polynomial preprocessing
time that allows pair queries in O(n^{1-\epsilon} alpha(n)) time, where alpha
is the inverse of the Ackermann function, and at all times uses O(n^epsilon) space.
The input graph G is not considered in the space complexity. '
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE) and ERC Start grant
(279307: Graph Games).'
alternative_title:
- LIPIcs
article_number: '28'
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
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Optimal reachability and a space
time tradeoff for distance queries in constant treewidth graphs. In: Vol 57. Schloss
Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ESA.2016.28'
apa: 'Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs (Vol.
57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark:
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.28'
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
“Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant
Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.
ieee: 'K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs,”
presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016,
vol. 57.'
ista: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs. ESA:
European Symposium on Algorithms, LIPIcs, vol. 57, 28.'
mla: Chatterjee, Krishnendu, et al. Optimal Reachability and a Space Time Tradeoff
for Distance Queries in Constant Treewidth Graphs. Vol. 57, 28, Schloss Dagstuhl-
Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ESA.2016.28.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik, 2016.
conference:
end_date: 2016-08-24
location: Aarhus, Denmark
name: 'ESA: European Symposium on Algorithms'
start_date: 2016-08-22
date_created: 2018-12-11T11:49:59Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2023-09-07T12:01:58Z
day: '01'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ESA.2016.28
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:31Z
date_updated: 2018-12-12T10:14:31Z
file_id: '5084'
file_name: IST-2017-777-v1+1_LIPIcs-ESA-2016-28.pdf
file_size: 579225
relation: main_file
file_date_updated: 2018-12-12T10:14:31Z
has_accepted_license: '1'
intvolume: ' 57'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik
publist_id: '6312'
pubrep_id: '777'
quality_controlled: '1'
related_material:
record:
- id: '821'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Optimal reachability and a space time tradeoff for distance queries in constant
treewidth graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2016'
...
---
_id: '1081'
abstract:
- lang: eng
text: The asymmetric localization of proteins in the plasma membrane domains of
eukaryotic cells is a fundamental manifestation of cell polarity that is central
to multicellular organization and developmental patterning. In plants, the mechanisms
underlying the polar localization of cargo proteins are still largely unknown
and appear to be fundamentally distinct from those operating in mammals. Here,
we present a systematic, quantitative comparative analysis of the polar delivery
and subcellular localization of proteins that characterize distinct polar plasma
membrane domains in plant cells. The combination of microscopic analyses and computational
modeling revealed a mechanistic framework common to diverse polar cargos and underlying
the establishment and maintenance of apical, basal, and lateral polar domains
in plant cells. This mechanism depends on the polar secretion, constitutive endocytic
recycling, and restricted lateral diffusion of cargos within the plasma membrane.
Moreover, our observations suggest that polar cargo distribution involves the
individual protein potential to form clusters within the plasma membrane and interact
with the extracellular matrix. Our observations provide insights into the shared
cellular mechanisms of polar cargo delivery and polarity maintenance in plant
cells.
acknowledgement: "We thank Bonnie Bartel, Jenny Russinova and Niko Geldner\r\nfor
sharing published material, Martine de Cock and Annick\r\nBleys for help in preparing
the manuscript. This work was\r\nsupported by the European Research Council (project\r\nERC-2011-StG-20101109-PSDP);
Czech Science Foundation\r\nGAČR (GA13-40637S); project CEITEC—Central European\r\nInstitute
of Technology (CZ.1.05/1.1.00/02.0068). SV is a\r\npostdoctoral fellow of the Research
Foundation-Flanders.\r\nSN is a Project Assistant Professor supported by the Japanese\r\nSociety
for the Promotion of Science (JSPS; 30612022 to SN),\r\nthe NC-CARP project of the
Ministry of Education, Culture,\r\nSports, Science and Technology in Japan to SN."
article_number: '16018'
author:
- first_name: Łukasz
full_name: Łangowski, Łukasz
last_name: Łangowski
- 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: Hongjiang
full_name: Li, Hongjiang
id: 33CA54A6-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0001-5039-9660
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Satoshi
full_name: Naramoto, Satoshi
last_name: Naramoto
- first_name: Hirokazu
full_name: Tanaka, Hirokazu
last_name: Tanaka
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Łangowski Ł, Wabnik KT, Li H, et al. Cellular mechanisms for cargo delivery
and polarity maintenance at different polar domains in plant cells. Cell Discovery.
2016;2. doi:10.1038/celldisc.2016.18
apa: Łangowski, Ł., Wabnik, K. T., Li, H., Vanneste, S., Naramoto, S., Tanaka, H.,
& Friml, J. (2016). Cellular mechanisms for cargo delivery and polarity maintenance
at different polar domains in plant cells. Cell Discovery. Nature Publishing
Group. https://doi.org/10.1038/celldisc.2016.18
chicago: Łangowski, Łukasz, Krzysztof T Wabnik, Hongjiang Li, Steffen Vanneste,
Satoshi Naramoto, Hirokazu Tanaka, and Jiří Friml. “Cellular Mechanisms for Cargo
Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.”
Cell Discovery. Nature Publishing Group, 2016. https://doi.org/10.1038/celldisc.2016.18.
ieee: Ł. Łangowski et al., “Cellular mechanisms for cargo delivery and polarity
maintenance at different polar domains in plant cells,” Cell Discovery,
vol. 2. Nature Publishing Group, 2016.
ista: Łangowski Ł, Wabnik KT, Li H, Vanneste S, Naramoto S, Tanaka H, Friml J. 2016.
Cellular mechanisms for cargo delivery and polarity maintenance at different polar
domains in plant cells. Cell Discovery. 2, 16018.
mla: Łangowski, Łukasz, et al. “Cellular Mechanisms for Cargo Delivery and Polarity
Maintenance at Different Polar Domains in Plant Cells.” Cell Discovery,
vol. 2, 16018, Nature Publishing Group, 2016, doi:10.1038/celldisc.2016.18.
short: Ł. Łangowski, K.T. Wabnik, H. Li, S. Vanneste, S. Naramoto, H. Tanaka, J.
Friml, Cell Discovery 2 (2016).
date_created: 2018-12-11T11:50:02Z
date_published: 2016-07-19T00:00:00Z
date_updated: 2021-01-12T06:48:08Z
day: '19'
ddc:
- '580'
department:
- _id: EvBe
- _id: JiFr
doi: 10.1038/celldisc.2016.18
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:33Z
date_updated: 2018-12-12T10:13:33Z
file_id: '5017'
file_name: IST-2017-757-v1+1_celldisc201618.pdf
file_size: 5261671
relation: main_file
file_date_updated: 2018-12-12T10:13:33Z
has_accepted_license: '1'
intvolume: ' 2'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Cell Discovery
publication_status: published
publisher: Nature Publishing Group
publist_id: '6299'
pubrep_id: '757'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cellular mechanisms for cargo delivery and polarity maintenance at different
polar domains in plant 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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2016'
...
---
_id: '10810'
abstract:
- lang: eng
text: "The main goal of the SCP-ECG standard is to address ECG data and related
metadata structuring, semantics and syntax, with the objective of facilitating
interoperability and thus supporting and promoting the exchange of the relevant
information for unary and serial ECG diagnosis. Starting with version V3.0, the
standard now also provides support for the storage of continuous, long-term ECG
recordings and affords a repository for selected ECG sequences and the related
metadata to accommodate stress tests, drug trials and protocol-based ECG recordings.
The global and per-lead measurements sections have been extended and three new
sections have been introduced for storing beat-by-beat and/or spike-by-spike measurements\r\nand
annotations. The used terminology and the provided measurements and annotations
have been harmonized with the ISO/IEEE 11073-10102 Annotated ECG standard. Emphasis
has also been put on harmonizing the Universal Statement Codes with the CDISC
and the categorized AHA statement codes and similarly the drug and implanted devices
codes with the ATC and NASPE/BPEG codes. "
acknowledgement: The authors are thankful to Drs. Roger Abaecherli, Nikus Kjell, Paul
Kligfield, Jay Mason, Patrice Nony, Vito Starc, Anders Thurin and the late Galen
Wagner for their in depth review and constructive comments.
article_processing_charge: No
author:
- first_name: Paul
full_name: Rubel, Paul
last_name: Rubel
- first_name: Danilo
full_name: Pani, Danilo
last_name: Pani
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Jocelyne
full_name: Fayn, Jocelyne
last_name: Fayn
- first_name: Fabio
full_name: Badilini, Fabio
last_name: Badilini
- first_name: Peter
full_name: Macfarlane, Peter
last_name: Macfarlane
- first_name: Alpo
full_name: Varri, Alpo
last_name: Varri
citation:
ama: 'Rubel P, Pani D, Schlögl A, et al. SCP-ECG V3.0: An enhanced standard communication
protocol for computer-assisted electrocardiography. In: 2016 Computing in Cardiology
Conference. Vol 43. Computing in Cardiology; 2016:309-312. doi:10.22489/cinc.2016.090-500'
apa: 'Rubel, P., Pani, D., Schlögl, A., Fayn, J., Badilini, F., Macfarlane, P.,
& Varri, A. (2016). SCP-ECG V3.0: An enhanced standard communication protocol
for computer-assisted electrocardiography. In 2016 Computing in Cardiology
Conference (Vol. 43, pp. 309–312). Vancouver, Canada: Computing in Cardiology.
https://doi.org/10.22489/cinc.2016.090-500'
chicago: 'Rubel, Paul, Danilo Pani, Alois Schlögl, Jocelyne Fayn, Fabio Badilini,
Peter Macfarlane, and Alpo Varri. “SCP-ECG V3.0: An Enhanced Standard Communication
Protocol for Computer-Assisted Electrocardiography.” In 2016 Computing in Cardiology
Conference, 43:309–12. Computing in Cardiology, 2016. https://doi.org/10.22489/cinc.2016.090-500.'
ieee: 'P. Rubel et al., “SCP-ECG V3.0: An enhanced standard communication
protocol for computer-assisted electrocardiography,” in 2016 Computing in Cardiology
Conference, Vancouver, Canada, 2016, vol. 43, pp. 309–312.'
ista: 'Rubel P, Pani D, Schlögl A, Fayn J, Badilini F, Macfarlane P, Varri A. 2016.
SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted
electrocardiography. 2016 Computing in Cardiology Conference. CinC: Computing
in Cardiology vol. 43, 309–312.'
mla: 'Rubel, Paul, et al. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol
for Computer-Assisted Electrocardiography.” 2016 Computing in Cardiology Conference,
vol. 43, Computing in Cardiology, 2016, pp. 309–12, doi:10.22489/cinc.2016.090-500.'
short: P. Rubel, D. Pani, A. Schlögl, J. Fayn, F. Badilini, P. Macfarlane, A. Varri,
in:, 2016 Computing in Cardiology Conference, Computing in Cardiology, 2016, pp.
309–312.
conference:
end_date: 2016-09-14
location: Vancouver, Canada
name: 'CinC: Computing in Cardiology'
start_date: 2016-09-11
date_created: 2022-03-03T10:43:10Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2022-03-04T07:34:45Z
day: '01'
department:
- _id: CampIT
doi: 10.22489/cinc.2016.090-500
intvolume: ' 43'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.22489/cinc.2016.090-500
month: '03'
oa: 1
oa_version: Published Version
page: 309-312
publication: 2016 Computing in Cardiology Conference
publication_identifier:
issn:
- 2325-887X
publication_status: published
publisher: Computing in Cardiology
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted
electrocardiography'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2016'
...
---
_id: '9456'
abstract:
- lang: eng
text: The discovery of introns four decades ago was one of the most unexpected findings
in molecular biology. Introns are sequences interrupting genes that must be removed
as part of messenger RNA production. Genome sequencing projects have shown that
most eukaryotic genes contain at least one intron, and frequently many. Comparison
of these genomes reveals a history of long evolutionary periods during which few
introns were gained, punctuated by episodes of rapid, extensive gain. However,
although several detailed mechanisms for such episodic intron generation have
been proposed, none has been empirically supported on a genomic scale. Here we
show how short, non-autonomous DNA transposons independently generated hundreds
to thousands of introns in the prasinophyte Micromonas pusilla and the pelagophyte
Aureococcus anophagefferens. Each transposon carries one splice site. The other
splice site is co-opted from the gene sequence that is duplicated upon transposon
insertion, allowing perfect splicing out of the RNA. The distributions of sequences
that can be co-opted are biased with respect to codons, and phasing of transposon-generated
introns is similarly biased. These transposons insert between pre-existing nucleosomes,
so that multiple nearby insertions generate nucleosome-sized intervening segments.
Thus, transposon insertion and sequence co-option may explain the intron phase
biases and prevalence of nucleosome-sized exons observed in eukaryotes. Overall,
the two independent examples of proliferating elements illustrate a general DNA
transposon mechanism that can plausibly account for episodes of rapid, extensive
intron gain during eukaryotic evolution.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Jason T.
full_name: Huff, Jason T.
last_name: Huff
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: Scott W.
full_name: Roy, Scott W.
last_name: Roy
citation:
ama: Huff JT, Zilberman D, Roy SW. Mechanism for DNA transposons to generate introns
on genomic scales. Nature. 2016;538(7626):533-536. doi:10.1038/nature20110
apa: Huff, J. T., Zilberman, D., & Roy, S. W. (2016). Mechanism for DNA transposons
to generate introns on genomic scales. Nature. Springer Nature . https://doi.org/10.1038/nature20110
chicago: Huff, Jason T., Daniel Zilberman, and Scott W. Roy. “Mechanism for DNA
Transposons to Generate Introns on Genomic Scales.” Nature. Springer Nature
, 2016. https://doi.org/10.1038/nature20110.
ieee: J. T. Huff, D. Zilberman, and S. W. Roy, “Mechanism for DNA transposons to
generate introns on genomic scales,” Nature, vol. 538, no. 7626. Springer
Nature , pp. 533–536, 2016.
ista: Huff JT, Zilberman D, Roy SW. 2016. Mechanism for DNA transposons to generate
introns on genomic scales. Nature. 538(7626), 533–536.
mla: Huff, Jason T., et al. “Mechanism for DNA Transposons to Generate Introns on
Genomic Scales.” Nature, vol. 538, no. 7626, Springer Nature , 2016, pp.
533–36, doi:10.1038/nature20110.
short: J.T. Huff, D. Zilberman, S.W. Roy, Nature 538 (2016) 533–536.
date_created: 2021-06-04T11:34:55Z
date_published: 2016-10-27T00:00:00Z
date_updated: 2021-12-14T07:55:30Z
day: '27'
department:
- _id: DaZi
doi: 10.1038/nature20110
extern: '1'
external_id:
pmid:
- '27760113'
intvolume: ' 538'
issue: '7626'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5684705/
month: '10'
oa: 1
oa_version: Submitted Version
page: 533-536
pmid: 1
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: 'Springer Nature '
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mechanism for DNA transposons to generate introns on genomic scales
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 538
year: '2016'
...
---
_id: '9473'
abstract:
- lang: eng
text: Cytosine DNA methylation regulates the expression of eukaryotic genes and
transposons. Methylation is copied by methyltransferases after DNA replication,
which results in faithful transmission of methylation patterns during cell division
and, at least in flowering plants, across generations. Transgenerational inheritance
is mediated by a small group of cells that includes gametes and their progenitors.
However, methylation is usually analyzed in somatic tissues that do not contribute
to the next generation, and the mechanisms of transgenerational inheritance are
inferred from such studies. To gain a better understanding of how DNA methylation
is inherited, we analyzed purified Arabidopsis thaliana sperm and vegetative cells-the
cell types that comprise pollen-with mutations in the DRM, CMT2, and CMT3 methyltransferases.
We find that DNA methylation dependency on these enzymes is similar in sperm,
vegetative cells, and somatic tissues, although DRM activity extends into heterochromatin
in vegetative cells, likely reflecting transcription of heterochromatic transposons
in this cell type. We also show that lack of histone H1, which elevates heterochromatic
DNA methylation in somatic tissues, does not have this effect in pollen. Instead,
levels of CG methylation in wild-type sperm and vegetative cells, as well as in
wild-type microspores from which both pollen cell types originate, are substantially
higher than in wild-type somatic tissues and similar to those of H1-depleted roots.
Our results demonstrate that the mechanisms of methylation maintenance are similar
between pollen and somatic cells, but the efficiency of CG methylation is higher
in pollen, allowing methylation patterns to be accurately inherited across generations.
article_processing_charge: No
article_type: original
author:
- first_name: Ping-Hung
full_name: Hsieh, Ping-Hung
last_name: Hsieh
- first_name: Shengbo
full_name: He, Shengbo
last_name: He
- first_name: Toby
full_name: Buttress, Toby
last_name: Buttress
- first_name: Hongbo
full_name: Gao, Hongbo
last_name: Gao
- first_name: Matthew
full_name: Couchman, Matthew
last_name: Couchman
- first_name: Robert L.
full_name: Fischer, Robert L.
last_name: Fischer
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
citation:
ama: Hsieh P-H, He S, Buttress T, et al. Arabidopsis male sexual lineage exhibits
more robust maintenance of CG methylation than somatic tissues. Proceedings
of the National Academy of Sciences. 2016;113(52):15132-15137. doi:10.1073/pnas.1619074114
apa: Hsieh, P.-H., He, S., Buttress, T., Gao, H., Couchman, M., Fischer, R. L.,
… Feng, X. (2016). Arabidopsis male sexual lineage exhibits more robust maintenance
of CG methylation than somatic tissues. Proceedings of the National Academy
of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1619074114
chicago: Hsieh, Ping-Hung, Shengbo He, Toby Buttress, Hongbo Gao, Matthew Couchman,
Robert L. Fischer, Daniel Zilberman, and Xiaoqi Feng. “Arabidopsis Male Sexual
Lineage Exhibits More Robust Maintenance of CG Methylation than Somatic Tissues.”
Proceedings of the National Academy of Sciences. National Academy of Sciences,
2016. https://doi.org/10.1073/pnas.1619074114.
ieee: P.-H. Hsieh et al., “Arabidopsis male sexual lineage exhibits more
robust maintenance of CG methylation than somatic tissues,” Proceedings of
the National Academy of Sciences, vol. 113, no. 52. National Academy of Sciences,
pp. 15132–15137, 2016.
ista: Hsieh P-H, He S, Buttress T, Gao H, Couchman M, Fischer RL, Zilberman D, Feng
X. 2016. Arabidopsis male sexual lineage exhibits more robust maintenance of CG
methylation than somatic tissues. Proceedings of the National Academy of Sciences.
113(52), 15132–15137.
mla: Hsieh, Ping-Hung, et al. “Arabidopsis Male Sexual Lineage Exhibits More Robust
Maintenance of CG Methylation than Somatic Tissues.” Proceedings of the National
Academy of Sciences, vol. 113, no. 52, National Academy of Sciences, 2016,
pp. 15132–37, doi:10.1073/pnas.1619074114.
short: P.-H. Hsieh, S. He, T. Buttress, H. Gao, M. Couchman, R.L. Fischer, D. Zilberman,
X. Feng, Proceedings of the National Academy of Sciences 113 (2016) 15132–15137.
date_created: 2021-06-07T06:21:39Z
date_published: 2016-12-27T00:00:00Z
date_updated: 2023-05-08T11:00:40Z
day: '27'
department:
- _id: DaZi
- _id: XiFe
doi: 10.1073/pnas.1619074114
extern: '1'
external_id:
pmid:
- '27956643'
intvolume: ' 113'
issue: '52'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1073/pnas.1619074114
month: '12'
oa: 1
oa_version: Published Version
page: 15132-15137
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Arabidopsis male sexual lineage exhibits more robust maintenance of CG methylation
than somatic tissues
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2016'
...
---
_id: '9477'
abstract:
- lang: eng
text: Cytosine methylation is a DNA modification with important regulatory functions
in eukaryotes. In flowering plants, sexual reproduction is accompanied by extensive
DNA demethylation, which is required for proper gene expression in the endosperm,
a nutritive extraembryonic seed tissue. Endosperm arises from a fusion of a sperm
cell carried in the pollen and a female central cell. Endosperm DNA demethylation
is observed specifically on the chromosomes inherited from the central cell in
Arabidopsis thaliana, rice, and maize, and requires the DEMETER DNA demethylase
in Arabidopsis. DEMETER is expressed in the central cell before fertilization,
suggesting that endosperm demethylation patterns are inherited from the central
cell. Down-regulation of the MET1 DNA methyltransferase has also been proposed
to contribute to central cell demethylation. However, with the exception of three
maize genes, central cell DNA methylation has not been directly measured, leaving
the origin and mechanism of endosperm demethylation uncertain. Here, we report
genome-wide analysis of DNA methylation in the central cells of Arabidopsis and
rice—species that diverged 150 million years ago—as well as in rice egg cells.
We find that DNA demethylation in both species is initiated in central cells,
which requires DEMETER in Arabidopsis. However, we do not observe a global reduction
of CG methylation that would be indicative of lowered MET1 activity; on the contrary,
CG methylation efficiency is elevated in female gametes compared with nonsexual
tissues. Our results demonstrate that locus-specific, active DNA demethylation
in the central cell is the origin of maternal chromosome hypomethylation in the
endosperm.
article_processing_charge: No
article_type: original
author:
- first_name: Kyunghyuk
full_name: Park, Kyunghyuk
last_name: Park
- first_name: M. Yvonne
full_name: Kim, M. Yvonne
last_name: Kim
- first_name: Martin
full_name: Vickers, Martin
last_name: Vickers
- first_name: Jin-Sup
full_name: Park, Jin-Sup
last_name: Park
- first_name: Youbong
full_name: Hyun, Youbong
last_name: Hyun
- first_name: Takashi
full_name: Okamoto, Takashi
last_name: Okamoto
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: Robert L.
full_name: Fischer, Robert L.
last_name: Fischer
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
- first_name: Yeonhee
full_name: Choi, Yeonhee
last_name: Choi
- first_name: Stefan
full_name: Scholten, Stefan
last_name: Scholten
citation:
ama: Park K, Kim MY, Vickers M, et al. DNA demethylation is initiated in the central
cells of Arabidopsis and rice. Proceedings of the National Academy of Sciences.
2016;113(52):15138-15143. doi:10.1073/pnas.1619047114
apa: Park, K., Kim, M. Y., Vickers, M., Park, J.-S., Hyun, Y., Okamoto, T., … Scholten,
S. (2016). DNA demethylation is initiated in the central cells of Arabidopsis
and rice. Proceedings of the National Academy of Sciences. National Academy
of Sciences. https://doi.org/10.1073/pnas.1619047114
chicago: Park, Kyunghyuk, M. Yvonne Kim, Martin Vickers, Jin-Sup Park, Youbong Hyun,
Takashi Okamoto, Daniel Zilberman, et al. “DNA Demethylation Is Initiated in the
Central Cells of Arabidopsis and Rice.” Proceedings of the National Academy
of Sciences. National Academy of Sciences, 2016. https://doi.org/10.1073/pnas.1619047114.
ieee: K. Park et al., “DNA demethylation is initiated in the central cells
of Arabidopsis and rice,” Proceedings of the National Academy of Sciences,
vol. 113, no. 52. National Academy of Sciences, pp. 15138–15143, 2016.
ista: Park K, Kim MY, Vickers M, Park J-S, Hyun Y, Okamoto T, Zilberman D, Fischer
RL, Feng X, Choi Y, Scholten S. 2016. DNA demethylation is initiated in the central
cells of Arabidopsis and rice. Proceedings of the National Academy of Sciences.
113(52), 15138–15143.
mla: Park, Kyunghyuk, et al. “DNA Demethylation Is Initiated in the Central Cells
of Arabidopsis and Rice.” Proceedings of the National Academy of Sciences,
vol. 113, no. 52, National Academy of Sciences, 2016, pp. 15138–43, doi:10.1073/pnas.1619047114.
short: K. Park, M.Y. Kim, M. Vickers, J.-S. Park, Y. Hyun, T. Okamoto, D. Zilberman,
R.L. Fischer, X. Feng, Y. Choi, S. Scholten, Proceedings of the National Academy
of Sciences 113 (2016) 15138–15143.
date_created: 2021-06-07T07:10:59Z
date_published: 2016-12-27T00:00:00Z
date_updated: 2023-05-08T11:00:07Z
day: '27'
department:
- _id: DaZi
- _id: XiFe
doi: 10.1073/pnas.1619047114
extern: '1'
external_id:
pmid:
- '27956642'
intvolume: ' 113'
issue: '52'
keyword:
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1073/pnas.1619047114
month: '12'
oa: 1
oa_version: Published Version
page: 15138-15143
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: DNA demethylation is initiated in the central cells of Arabidopsis and rice
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2016'
...
---
_id: '948'
abstract:
- lang: eng
text: Experience constantly shapes neural circuits through a variety of plasticity
mechanisms. While the functional roles of some plasticity mechanisms are well-understood,
it remains unclear how changes in neural excitability contribute to learning.
Here, we develop a normative interpretation of intrinsic plasticity (IP) as a
key component of unsupervised learning. We introduce a novel generative mixture
model that accounts for the class-specific statistics of stimulus intensities,
and we derive a neural circuit that learns the input classes and their intensities.
We will analytically show that inference and learning for our generative model
can be achieved by a neural circuit with intensity-sensitive neurons equipped
with a specific form of IP. Numerical experiments verify our analytical derivations
and show robust behavior for artificial and natural stimuli. Our results link
IP to non-trivial input statistics, in particular the statistics of stimulus intensities
for classes to which a neuron is sensitive. More generally, our work paves the
way toward new classification algorithms that are robust to intensity variations.
acknowledgement: DFG Cluster of Excellence EXC 1077/1 (Hearing4all) and LU 1196/5-1
(JL and TM), People Programme (Marie Curie Actions) FP7/2007-2013 grant agreement
no. 291734 (CS)
alternative_title:
- Advances in Neural Information Processing Systems
author:
- first_name: Travis
full_name: Monk, Travis
last_name: Monk
- first_name: Cristina
full_name: Savin, Cristina
id: 3933349E-F248-11E8-B48F-1D18A9856A87
last_name: Savin
- first_name: Jörg
full_name: Lücke, Jörg
last_name: Lücke
citation:
ama: 'Monk T, Savin C, Lücke J. Neurons equipped with intrinsic plasticity learn
stimulus intensity statistics. In: Vol 29. Neural Information Processing Systems;
2016:4285-4293.'
apa: 'Monk, T., Savin, C., & Lücke, J. (2016). Neurons equipped with intrinsic
plasticity learn stimulus intensity statistics (Vol. 29, pp. 4285–4293). Presented
at the NIPS: Neural Information Processing Systems, Barcelona, Spaine: Neural
Information Processing Systems.'
chicago: Monk, Travis, Cristina Savin, and Jörg Lücke. “Neurons Equipped with Intrinsic
Plasticity Learn Stimulus Intensity Statistics,” 29:4285–93. Neural Information
Processing Systems, 2016.
ieee: 'T. Monk, C. Savin, and J. Lücke, “Neurons equipped with intrinsic plasticity
learn stimulus intensity statistics,” presented at the NIPS: Neural Information
Processing Systems, Barcelona, Spaine, 2016, vol. 29, pp. 4285–4293.'
ista: 'Monk T, Savin C, Lücke J. 2016. Neurons equipped with intrinsic plasticity
learn stimulus intensity statistics. NIPS: Neural Information Processing Systems,
Advances in Neural Information Processing Systems, vol. 29, 4285–4293.'
mla: Monk, Travis, et al. Neurons Equipped with Intrinsic Plasticity Learn Stimulus
Intensity Statistics. Vol. 29, Neural Information Processing Systems, 2016,
pp. 4285–93.
short: T. Monk, C. Savin, J. Lücke, in:, Neural Information Processing Systems,
2016, pp. 4285–4293.
conference:
end_date: 2016-12-10
location: Barcelona, Spaine
name: 'NIPS: Neural Information Processing Systems'
start_date: 2016-12-05
date_created: 2018-12-11T11:49:21Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T08:22:08Z
day: '01'
department:
- _id: GaTk
ec_funded: 1
intvolume: ' 29'
language:
- iso: eng
main_file_link:
- url: https://papers.nips.cc/paper/6582-neurons-equipped-with-intrinsic-plasticity-learn-stimulus-intensity-statistics
month: '01'
oa_version: None
page: 4285 - 4293
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '6469'
quality_controlled: '1'
scopus_import: 1
status: public
title: Neurons equipped with intrinsic plasticity learn stimulus intensity statistics
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2016'
...
---
_id: '9704'
abstract:
- lang: eng
text: Emerging infectious diseases (EIDs) have contributed significantly to the
current biodiversity crisis, leading to widespread epidemics and population loss.
Owing to genetic variation in pathogen virulence, a complete understanding of
species decline requires the accurate identification and characterization of EIDs.
We explore this issue in the Western honeybee, where increasing mortality of populations
in the Northern Hemisphere has caused major concern. Specifically, we investigate
the importance of genetic identity of the main suspect in mortality, deformed
wing virus (DWV), in driving honeybee loss. Using laboratory experiments and a
systematic field survey, we demonstrate that an emerging DWV genotype (DWV-B)
is more virulent than the established DWV genotype (DWV-A) and is widespread in
the landscape. Furthermore, we show in a simple model that colonies infected with
DWV-B collapse sooner than colonies infected with DWV-A. We also identify potential
for rapid DWV evolution by revealing extensive genome-wide recombination in vivo.
The emergence of DWV-B in naive honeybee populations, including via recombination
with DWV-A, could be of significant ecological and economic importance. Our findings
emphasize that knowledge of pathogen genetic identity and diversity is critical
to understanding drivers of species decline.
article_processing_charge: No
author:
- first_name: Dino
full_name: Mcmahon, Dino
last_name: Mcmahon
- first_name: Myrsini
full_name: Natsopoulou, Myrsini
last_name: Natsopoulou
- first_name: Vincent
full_name: Doublet, Vincent
last_name: Doublet
- first_name: Matthias
full_name: Fürst, Matthias
id: 393B1196-F248-11E8-B48F-1D18A9856A87
last_name: Fürst
orcid: 0000-0002-3712-925X
- first_name: Silvio
full_name: Weging, Silvio
last_name: Weging
- first_name: Mark
full_name: Brown, Mark
last_name: Brown
- first_name: Andreas
full_name: Gogol Döring, Andreas
last_name: Gogol Döring
- first_name: Robert
full_name: Paxton, Robert
last_name: Paxton
citation:
ama: 'Mcmahon D, Natsopoulou M, Doublet V, et al. Data from: Elevated virulence
of an emerging viral genotype as a driver of honeybee loss. 2016. doi:10.5061/dryad.cq7t1'
apa: 'Mcmahon, D., Natsopoulou, M., Doublet, V., Fürst, M., Weging, S., Brown, M.,
… Paxton, R. (2016). Data from: Elevated virulence of an emerging viral genotype
as a driver of honeybee loss. Dryad. https://doi.org/10.5061/dryad.cq7t1'
chicago: 'Mcmahon, Dino, Myrsini Natsopoulou, Vincent Doublet, Matthias Fürst, Silvio
Weging, Mark Brown, Andreas Gogol Döring, and Robert Paxton. “Data from: Elevated
Virulence of an Emerging Viral Genotype as a Driver of Honeybee Loss.” Dryad,
2016. https://doi.org/10.5061/dryad.cq7t1.'
ieee: 'D. Mcmahon et al., “Data from: Elevated virulence of an emerging viral
genotype as a driver of honeybee loss.” Dryad, 2016.'
ista: 'Mcmahon D, Natsopoulou M, Doublet V, Fürst M, Weging S, Brown M, Gogol Döring
A, Paxton R. 2016. Data from: Elevated virulence of an emerging viral genotype
as a driver of honeybee loss, Dryad, 10.5061/dryad.cq7t1.'
mla: 'Mcmahon, Dino, et al. Data from: Elevated Virulence of an Emerging Viral
Genotype as a Driver of Honeybee Loss. Dryad, 2016, doi:10.5061/dryad.cq7t1.'
short: D. Mcmahon, M. Natsopoulou, V. Doublet, M. Fürst, S. Weging, M. Brown, A.
Gogol Döring, R. Paxton, (2016).
date_created: 2021-07-23T08:30:38Z
date_published: 2016-05-06T00:00:00Z
date_updated: 2023-02-21T16:54:31Z
day: '06'
department:
- _id: SyCr
doi: 10.5061/dryad.cq7t1
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.cq7t1
month: '05'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '1262'
relation: used_in_publication
status: public
status: public
title: 'Data from: Elevated virulence of an emerging viral genotype as a driver of
honeybee loss'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2016'
...
---
_id: '9710'
abstract:
- lang: eng
text: Much of quantitative genetics is based on the ‘infinitesimal model’, under
which selection has a negligible effect on the genetic variance. This is typically
justified by assuming a very large number of loci with additive effects. However,
it applies even when genes interact, provided that the number of loci is large
enough that selection on each of them is weak relative to random drift. In the
long term, directional selection will change allele frequencies, but even then,
the effects of epistasis on the ultimate change in trait mean due to selection
may be modest. Stabilising selection can maintain many traits close to their optima,
even when the underlying alleles are weakly selected. However, the number of traits
that can be optimised is apparently limited to ~4Ne by the ‘drift load’, and this
is hard to reconcile with the apparent complexity of many organisms. Just as for
the mutation load, this limit can be evaded by a particular form of negative epistasis.
A more robust limit is set by the variance in reproductive success. This suggests
that selection accumulates information most efficiently in the infinitesimal regime,
when selection on individual alleles is weak, and comparable with random drift.
A review of evidence on selection strength suggests that although most variance
in fitness may be because of alleles with large Nes, substantial amounts of adaptation
may be because of alleles in the infinitesimal regime, in which epistasis has
modest effects.
article_processing_charge: No
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Barton NH. Data from: How does epistasis influence the response to selection?
2016. doi:10.5061/dryad.s5s7r'
apa: 'Barton, N. H. (2016). Data from: How does epistasis influence the response
to selection? Dryad. https://doi.org/10.5061/dryad.s5s7r'
chicago: 'Barton, Nicholas H. “Data from: How Does Epistasis Influence the Response
to Selection?” Dryad, 2016. https://doi.org/10.5061/dryad.s5s7r.'
ieee: 'N. H. Barton, “Data from: How does epistasis influence the response to selection?”
Dryad, 2016.'
ista: 'Barton NH. 2016. Data from: How does epistasis influence the response to
selection?, Dryad, 10.5061/dryad.s5s7r.'
mla: 'Barton, Nicholas H. Data from: How Does Epistasis Influence the Response
to Selection? Dryad, 2016, doi:10.5061/dryad.s5s7r.'
short: N.H. Barton, (2016).
date_created: 2021-07-23T11:45:47Z
date_published: 2016-09-23T00:00:00Z
date_updated: 2025-05-28T11:57:03Z
day: '23'
department:
- _id: NiBa
doi: 10.5061/dryad.s5s7r
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.s5s7r
month: '09'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '1199'
relation: used_in_publication
status: public
status: public
title: 'Data from: How does epistasis influence the response to selection?'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2016'
...
---
_id: '9720'
abstract:
- lang: eng
text: 'Summary: Declining populations of bee pollinators are a cause of concern,
with major repercussions for biodiversity loss and food security. RNA viruses
associated with honeybees represent a potential threat to other insect pollinators,
but the extent of this threat is poorly understood. This study aims to attain
a detailed understanding of the current and ongoing risk of emerging infectious
disease (EID) transmission between managed and wild pollinator species across
a wide range of RNA viruses. Within a structured large-scale national survey across
26 independent sites, we quantify the prevalence and pathogen loads of multiple
RNA viruses in co-occurring managed honeybee (Apis mellifera) and wild bumblebee
(Bombus spp.) populations. We then construct models that compare virus prevalence
between wild and managed pollinators. Multiple RNA viruses associated with honeybees
are widespread in sympatric wild bumblebee populations. Virus prevalence in honeybees
is a significant predictor of virus prevalence in bumblebees, but we remain cautious
in speculating over the principle direction of pathogen transmission. We demonstrate
species-specific differences in prevalence, indicating significant variation in
disease susceptibility or tolerance. Pathogen loads within individual bumblebees
may be high and in the case of at least one RNA virus, prevalence is higher in
wild bumblebees than in managed honeybee populations. Our findings indicate widespread
transmission of RNA viruses between managed and wild bee pollinators, pointing
to an interconnected network of potential disease pressures within and among pollinator
species. In the context of the biodiversity crisis, our study emphasizes the importance
of targeting a wide range of pathogens and defining host associations when considering
potential drivers of population decline.'
article_processing_charge: No
author:
- first_name: Dino
full_name: Mcmahon, Dino
last_name: Mcmahon
- first_name: Matthias
full_name: Fürst, Matthias
id: 393B1196-F248-11E8-B48F-1D18A9856A87
last_name: Fürst
orcid: 0000-0002-3712-925X
- first_name: Jesicca
full_name: Caspar, Jesicca
last_name: Caspar
- first_name: Panagiotis
full_name: Theodorou, Panagiotis
last_name: Theodorou
- first_name: Mark
full_name: Brown, Mark
last_name: Brown
- first_name: Robert
full_name: Paxton, Robert
last_name: Paxton
citation:
ama: 'Mcmahon D, Fürst M, Caspar J, Theodorou P, Brown M, Paxton R. Data from: A
sting in the spit: widespread cross-infection of multiple RNA viruses across wild
and managed bees. 2016. doi:10.5061/dryad.4b565'
apa: 'Mcmahon, D., Fürst, M., Caspar, J., Theodorou, P., Brown, M., & Paxton,
R. (2016). Data from: A sting in the spit: widespread cross-infection of multiple
RNA viruses across wild and managed bees. Dryad. https://doi.org/10.5061/dryad.4b565'
chicago: 'Mcmahon, Dino, Matthias Fürst, Jesicca Caspar, Panagiotis Theodorou, Mark
Brown, and Robert Paxton. “Data from: A Sting in the Spit: Widespread Cross-Infection
of Multiple RNA Viruses across Wild and Managed Bees.” Dryad, 2016. https://doi.org/10.5061/dryad.4b565.'
ieee: 'D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, and R. Paxton, “Data
from: A sting in the spit: widespread cross-infection of multiple RNA viruses
across wild and managed bees.” Dryad, 2016.'
ista: 'Mcmahon D, Fürst M, Caspar J, Theodorou P, Brown M, Paxton R. 2016. Data
from: A sting in the spit: widespread cross-infection of multiple RNA viruses
across wild and managed bees, Dryad, 10.5061/dryad.4b565.'
mla: 'Mcmahon, Dino, et al. Data from: A Sting in the Spit: Widespread Cross-Infection
of Multiple RNA Viruses across Wild and Managed Bees. Dryad, 2016, doi:10.5061/dryad.4b565.'
short: D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, R. Paxton, (2016).
date_created: 2021-07-26T09:14:19Z
date_published: 2016-01-22T00:00:00Z
date_updated: 2023-02-23T10:17:25Z
day: '22'
department:
- _id: SyCr
doi: 10.5061/dryad.4b565
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.4b565
month: '01'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '1855'
relation: used_in_publication
status: public
status: public
title: 'Data from: A sting in the spit: widespread cross-infection of multiple RNA
viruses across wild and managed bees'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2016'
...
---
_id: '9862'
article_processing_charge: No
author:
- first_name: Camille
full_name: Roux, Camille
last_name: Roux
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: Jonathan
full_name: Romiguier, Jonathan
last_name: Romiguier
- first_name: Youann
full_name: Anciaux, Youann
last_name: Anciaux
- first_name: Nicolas
full_name: Galtier, Nicolas
last_name: Galtier
- first_name: Nicolas
full_name: Bierne, Nicolas
last_name: Bierne
citation:
ama: Roux C, Fraisse C, Romiguier J, Anciaux Y, Galtier N, Bierne N. Simulation
study to test the robustness of ABC in face of recent times of divergence. 2016.
doi:10.1371/journal.pbio.2000234.s016
apa: Roux, C., Fraisse, C., Romiguier, J., Anciaux, Y., Galtier, N., & Bierne,
N. (2016). Simulation study to test the robustness of ABC in face of recent times
of divergence. Public Library of Science. https://doi.org/10.1371/journal.pbio.2000234.s016
chicago: Roux, Camille, Christelle Fraisse, Jonathan Romiguier, Youann Anciaux,
Nicolas Galtier, and Nicolas Bierne. “Simulation Study to Test the Robustness
of ABC in Face of Recent Times of Divergence.” Public Library of Science, 2016.
https://doi.org/10.1371/journal.pbio.2000234.s016.
ieee: C. Roux, C. Fraisse, J. Romiguier, Y. Anciaux, N. Galtier, and N. Bierne,
“Simulation study to test the robustness of ABC in face of recent times of divergence.”
Public Library of Science, 2016.
ista: Roux C, Fraisse C, Romiguier J, Anciaux Y, Galtier N, Bierne N. 2016. Simulation
study to test the robustness of ABC in face of recent times of divergence, Public
Library of Science, 10.1371/journal.pbio.2000234.s016.
mla: Roux, Camille, et al. Simulation Study to Test the Robustness of ABC in
Face of Recent Times of Divergence. Public Library of Science, 2016, doi:10.1371/journal.pbio.2000234.s016.
short: C. Roux, C. Fraisse, J. Romiguier, Y. Anciaux, N. Galtier, N. Bierne, (2016).
date_created: 2021-08-10T08:20:17Z
date_updated: 2023-02-21T16:21:20Z
day: '27'
department:
- _id: BeVi
- _id: NiBa
doi: 10.1371/journal.pbio.2000234.s016
month: '12'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1158'
relation: used_in_publication
status: public
status: public
title: Simulation study to test the robustness of ABC in face of recent times of divergence
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2016'
...
---
_id: '9863'
article_processing_charge: No
author:
- first_name: Camille
full_name: Roux, Camille
last_name: Roux
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: Jonathan
full_name: Romiguier, Jonathan
last_name: Romiguier
- first_name: Youann
full_name: Anciaux, Youann
last_name: Anciaux
- first_name: Nicolas
full_name: Galtier, Nicolas
last_name: Galtier
- first_name: Nicolas
full_name: Bierne, Nicolas
last_name: Bierne
citation:
ama: Roux C, Fraisse C, Romiguier J, Anciaux Y, Galtier N, Bierne N. Accessions
of surveyed individuals, geographic locations and summary statistics. 2016. doi:10.1371/journal.pbio.2000234.s017
apa: Roux, C., Fraisse, C., Romiguier, J., Anciaux, Y., Galtier, N., & Bierne,
N. (2016). Accessions of surveyed individuals, geographic locations and summary
statistics. Public Library of Science. https://doi.org/10.1371/journal.pbio.2000234.s017
chicago: Roux, Camille, Christelle Fraisse, Jonathan Romiguier, Youann Anciaux,
Nicolas Galtier, and Nicolas Bierne. “Accessions of Surveyed Individuals, Geographic
Locations and Summary Statistics.” Public Library of Science, 2016. https://doi.org/10.1371/journal.pbio.2000234.s017.
ieee: C. Roux, C. Fraisse, J. Romiguier, Y. Anciaux, N. Galtier, and N. Bierne,
“Accessions of surveyed individuals, geographic locations and summary statistics.”
Public Library of Science, 2016.
ista: Roux C, Fraisse C, Romiguier J, Anciaux Y, Galtier N, Bierne N. 2016. Accessions
of surveyed individuals, geographic locations and summary statistics, Public Library
of Science, 10.1371/journal.pbio.2000234.s017.
mla: Roux, Camille, et al. Accessions of Surveyed Individuals, Geographic Locations
and Summary Statistics. Public Library of Science, 2016, doi:10.1371/journal.pbio.2000234.s017.
short: C. Roux, C. Fraisse, J. Romiguier, Y. Anciaux, N. Galtier, N. Bierne, (2016).
date_created: 2021-08-10T08:22:52Z
date_updated: 2023-02-21T16:21:20Z
day: '27'
department:
- _id: BeVi
- _id: NiBa
doi: 10.1371/journal.pbio.2000234.s017
month: '12'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1158'
relation: used_in_publication
status: public
status: public
title: Accessions of surveyed individuals, geographic locations and summary statistics
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2016'
...
---
_id: '9864'
abstract:
- lang: eng
text: Viral capsids are structurally constrained by interactions among the amino
acids (AAs) of their constituent proteins. Therefore, epistasis is expected to
evolve among physically interacting sites and to influence the rates of substitution.
To study the evolution of epistasis, we focused on the major structural protein
of the ϕX174 phage family by, first, reconstructing the ancestral protein sequences
of 18 species using a Bayesian statistical framework. The inferred ancestral reconstruction
differed at eight AAs, for a total of 256 possible ancestral haplotypes. For each
ancestral haplotype and the extant species, we estimated, in silico, the distribution
of free energies and epistasis of the capsid structure. We found that free energy
has not significantly increased but epistasis has. We decomposed epistasis up
to fifth order and found that higher-order epistasis sometimes compensates pairwise
interactions making the free energy seem additive. The dN/dS ratio is low, suggesting
strong purifying selection, and that structure is under stabilizing selection.
We synthesized phages carrying ancestral haplotypes of the coat protein gene and
measured their fitness experimentally. Our findings indicate that stabilizing
mutations can have higher fitness, and that fitness optima do not necessarily
coincide with energy minima.
article_processing_charge: No
author:
- first_name: Rodrigo A
full_name: Fernandes Redondo, Rodrigo A
id: 409D5C96-F248-11E8-B48F-1D18A9856A87
last_name: Fernandes Redondo
orcid: 0000-0002-5837-2793
- first_name: Harold
full_name: de Vladar, Harold
id: 2A181218-F248-11E8-B48F-1D18A9856A87
last_name: de Vladar
orcid: 0000-0002-5985-7653
- first_name: Tomasz
full_name: Włodarski, Tomasz
last_name: Włodarski
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
citation:
ama: Fernandes Redondo RA, de Vladar H, Włodarski T, Bollback JP. Data from evolutionary
interplay between structure, energy and epistasis in the coat protein of the ϕX174
phage family. 2016. doi:10.6084/m9.figshare.4315652.v1
apa: Fernandes Redondo, R. A., de Vladar, H., Włodarski, T., & Bollback, J.
P. (2016). Data from evolutionary interplay between structure, energy and epistasis
in the coat protein of the ϕX174 phage family. The Royal Society. https://doi.org/10.6084/m9.figshare.4315652.v1
chicago: Fernandes Redondo, Rodrigo A, Harold de Vladar, Tomasz Włodarski, and Jonathan
P Bollback. “Data from Evolutionary Interplay between Structure, Energy and Epistasis
in the Coat Protein of the ΦX174 Phage Family.” The Royal Society, 2016. https://doi.org/10.6084/m9.figshare.4315652.v1.
ieee: R. A. Fernandes Redondo, H. de Vladar, T. Włodarski, and J. P. Bollback, “Data
from evolutionary interplay between structure, energy and epistasis in the coat
protein of the ϕX174 phage family.” The Royal Society, 2016.
ista: Fernandes Redondo RA, de Vladar H, Włodarski T, Bollback JP. 2016. Data from
evolutionary interplay between structure, energy and epistasis in the coat protein
of the ϕX174 phage family, The Royal Society, 10.6084/m9.figshare.4315652.v1.
mla: Fernandes Redondo, Rodrigo A., et al. Data from Evolutionary Interplay between
Structure, Energy and Epistasis in the Coat Protein of the ΦX174 Phage Family.
The Royal Society, 2016, doi:10.6084/m9.figshare.4315652.v1.
short: R.A. Fernandes Redondo, H. de Vladar, T. Włodarski, J.P. Bollback, (2016).
date_created: 2021-08-10T08:29:47Z
date_published: 2016-12-14T00:00:00Z
date_updated: 2025-05-28T11:57:06Z
day: '14'
department:
- _id: NiBa
- _id: JoBo
doi: 10.6084/m9.figshare.4315652.v1
main_file_link:
- open_access: '1'
url: https://doi.org/10.6084/m9.figshare.4315652.v1
month: '12'
oa: 1
oa_version: Published Version
publisher: The Royal Society
related_material:
record:
- id: '1077'
relation: used_in_publication
status: public
status: public
title: Data from evolutionary interplay between structure, energy and epistasis in
the coat protein of the ϕX174 phage family
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2016'
...
---
_id: '9866'
article_processing_charge: No
author:
- first_name: Marcin P
full_name: Zagórski, Marcin P
id: 343DA0DC-F248-11E8-B48F-1D18A9856A87
last_name: Zagórski
orcid: 0000-0001-7896-7762
- first_name: Zdzisław
full_name: Burda, Zdzisław
last_name: Burda
- first_name: Bartłomiej
full_name: Wacław, Bartłomiej
last_name: Wacław
citation:
ama: Zagórski MP, Burda Z, Wacław B. ZIP-archived directory containing all data
and computer programs. 2016. doi:10.1371/journal.pcbi.1005218.s009
apa: Zagórski, M. P., Burda, Z., & Wacław, B. (2016). ZIP-archived directory
containing all data and computer programs. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005218.s009
chicago: Zagórski, Marcin P, Zdzisław Burda, and Bartłomiej Wacław. “ZIP-Archived
Directory Containing All Data and Computer Programs.” Public Library of Science,
2016. https://doi.org/10.1371/journal.pcbi.1005218.s009.
ieee: M. P. Zagórski, Z. Burda, and B. Wacław, “ZIP-archived directory containing
all data and computer programs.” Public Library of Science, 2016.
ista: Zagórski MP, Burda Z, Wacław B. 2016. ZIP-archived directory containing all
data and computer programs, Public Library of Science, 10.1371/journal.pcbi.1005218.s009.
mla: Zagórski, Marcin P., et al. ZIP-Archived Directory Containing All Data and
Computer Programs. Public Library of Science, 2016, doi:10.1371/journal.pcbi.1005218.s009.
short: M.P. Zagórski, Z. Burda, B. Wacław, (2016).
date_created: 2021-08-10T08:37:20Z
date_published: 2016-12-09T00:00:00Z
date_updated: 2023-02-21T16:24:29Z
day: '09'
department:
- _id: AnKi
doi: 10.1371/journal.pcbi.1005218.s009
month: '12'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1167'
relation: used_in_publication
status: public
status: public
title: ZIP-archived directory containing all data and computer programs
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2016'
...
---
_id: '9867'
abstract:
- lang: eng
text: In the beginning of our experiment, subjects were asked to read a few pages
on their computer screens that would explain the rules of the subsequent game.
Here, we provide these instructions, translated from German.
article_processing_charge: No
author:
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
- first_name: Kristin
full_name: Hagel, Kristin
last_name: Hagel
- first_name: Manfred
full_name: Milinski, Manfred
last_name: Milinski
citation:
ama: Hilbe C, Hagel K, Milinski M. Experimental game instructions. 2016. doi:10.1371/journal.pone.0163867.s008
apa: Hilbe, C., Hagel, K., & Milinski, M. (2016). Experimental game instructions.
Public Library of Science. https://doi.org/10.1371/journal.pone.0163867.s008
chicago: Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Experimental Game
Instructions.” Public Library of Science, 2016. https://doi.org/10.1371/journal.pone.0163867.s008.
ieee: C. Hilbe, K. Hagel, and M. Milinski, “Experimental game instructions.” Public
Library of Science, 2016.
ista: Hilbe C, Hagel K, Milinski M. 2016. Experimental game instructions, Public
Library of Science, 10.1371/journal.pone.0163867.s008.
mla: Hilbe, Christian, et al. Experimental Game Instructions. Public Library
of Science, 2016, doi:10.1371/journal.pone.0163867.s008.
short: C. Hilbe, K. Hagel, M. Milinski, (2016).
date_created: 2021-08-10T08:42:00Z
date_updated: 2023-02-21T16:59:01Z
day: '04'
department:
- _id: KrCh
doi: 10.1371/journal.pone.0163867.s008
month: '10'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1322'
relation: used_in_publication
status: public
status: public
title: Experimental game instructions
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2016'
...