---
_id: '5787'
abstract:
- lang: eng
text: "Branching morphogenesis remains a subject of abiding interest. Although
\ much is \r\nknown about the gene regulatory programs and signaling pathways
that operate at \r\nthe cellular scale, it has remained unclear how the macroscopic
features of branched \r\norgans, including their size, network topology and
\ spatial patterning, are encoded. \r\nLately, it has been proposed that,
these features can be explained quantitatively in \r\nseveral organs within a
single unifying framework. Based on large-\r\nscale organ recon\r\n-\r\nstructions
\ and cell lineage tracing, it has been argued that morphogenesis follows
\ \r\nfrom the collective dynamics of sublineage- \r\nrestricted self- \r\nrenewing
progenitor cells, \r\nlocalized at ductal tips, that act cooperatively to drive
a serial process of ductal elon\r\n-\r\ngation and stochastic tip bifurcation.
By correlating differentiation or cell cycle exit \r\nwith proximity to maturing
ducts, this dynamic results in the specification of a com-\r\nplex network of
\ defined density and statistical organization. These results suggest \r\nthat,
for several mammalian tissues, branched epithelial structures develop as a self-
\r\norganized process, reliant upon a strikingly simple, but generic,
\ set of local rules, \r\nwithout recourse to a rigid and deterministic
\ sequence of genetically programmed \r\nevents. Here, we review the basis
of these findings and discuss their implications."
article_processing_charge: No
author:
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Benjamin D.
full_name: Simons, Benjamin D.
last_name: Simons
citation:
ama: Hannezo EB, Simons BD. Statistical theory of branching morphogenesis. Development
Growth and Differentiation. 2018;60(9):512-521. doi:10.1111/dgd.12570
apa: Hannezo, E. B., & Simons, B. D. (2018). Statistical theory of branching
morphogenesis. Development Growth and Differentiation. Wiley. https://doi.org/10.1111/dgd.12570
chicago: Hannezo, Edouard B, and Benjamin D. Simons. “Statistical Theory of Branching
Morphogenesis.” Development Growth and Differentiation. Wiley, 2018. https://doi.org/10.1111/dgd.12570.
ieee: E. B. Hannezo and B. D. Simons, “Statistical theory of branching morphogenesis,”
Development Growth and Differentiation, vol. 60, no. 9. Wiley, pp. 512–521,
2018.
ista: Hannezo EB, Simons BD. 2018. Statistical theory of branching morphogenesis.
Development Growth and Differentiation. 60(9), 512–521.
mla: Hannezo, Edouard B., and Benjamin D. Simons. “Statistical Theory of Branching
Morphogenesis.” Development Growth and Differentiation, vol. 60, no. 9,
Wiley, 2018, pp. 512–21, doi:10.1111/dgd.12570.
short: E.B. Hannezo, B.D. Simons, Development Growth and Differentiation 60 (2018)
512–521.
date_created: 2018-12-30T22:59:14Z
date_published: 2018-12-09T00:00:00Z
date_updated: 2023-09-19T09:32:49Z
day: '09'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.1111/dgd.12570
external_id:
isi:
- '000453555100002'
file:
- access_level: open_access
checksum: a6d30b0785db902c734a84fecb2eadd9
content_type: application/pdf
creator: dernst
date_created: 2019-02-06T10:40:46Z
date_updated: 2020-07-14T12:47:11Z
file_id: '5933'
file_name: 2018_DevGrowh_Hannezo.pdf
file_size: 1313606
relation: main_file
file_date_updated: 2020-07-14T12:47:11Z
has_accepted_license: '1'
intvolume: ' 60'
isi: 1
issue: '9'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 512-521
publication: Development Growth and Differentiation
publication_identifier:
issn:
- '00121592'
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Statistical theory of branching morphogenesis
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 60
year: '2018'
...
---
_id: '297'
abstract:
- lang: eng
text: Graph games played by two players over finite-state graphs are central in
many problems in computer science. In particular, graph games with ω -regular
winning conditions, specified as parity objectives, which can express properties
such as safety, liveness, fairness, are the basic framework for verification and
synthesis of reactive systems. The decisions for a player at various states of
the graph game are represented as strategies. While the algorithmic problem for
solving graph games with parity objectives has been widely studied, the most prominent
data-structure for strategy representation in graph games has been binary decision
diagrams (BDDs). However, due to the bit-level representation, BDDs do not retain
the inherent flavor of the decisions of strategies, and are notoriously hard to
minimize to obtain succinct representation. In this work we propose decision trees
for strategy representation in graph games. Decision trees retain the flavor of
decisions of strategies and allow entropy-based minimization to obtain succinct
trees. However, decision trees work in settings (e.g., probabilistic models) where
errors are allowed, and overfitting of data is typically avoided. In contrast,
for strategies in graph games no error is allowed, and the decision tree must
represent the entire strategy. We develop new techniques to extend decision trees
to overcome the above obstacles, while retaining the entropy-based techniques
to obtain succinct trees. We have implemented our techniques to extend the existing
decision tree solvers. We present experimental results for problems in reactive
synthesis to show that decision trees provide a much more efficient data-structure
for strategy representation as compared to BDDs.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Brázdil T, Chatterjee K, Kretinsky J, Toman V. Strategy representation by
decision trees in reactive synthesis. In: Vol 10805. Springer; 2018:385-407. doi:10.1007/978-3-319-89960-2_21'
apa: 'Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy
representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407).
Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis
of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21'
chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman.
“Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407.
Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21.
ieee: 'T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation
by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and
Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece,
2018, vol. 10805, pp. 385–407.'
ista: 'Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation
by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for
the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407.'
mla: Brázdil, Tomáš, et al. Strategy Representation by Decision Trees in Reactive
Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21.
short: T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp.
385–407.
conference:
end_date: 2018-04-20
location: Thessaloniki, Greece
name: 'TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2018-04-14
date_created: 2018-12-11T11:45:41Z
date_published: 2018-04-12T00:00:00Z
date_updated: 2023-09-19T09:57:08Z
day: '12'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-89960-2_21
ec_funded: 1
external_id:
isi:
- '000546326300021'
file:
- access_level: open_access
checksum: b13874ffb114932ad9cc2586b7469db4
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:29:08Z
date_updated: 2020-07-14T12:45:57Z
file_id: '5723'
file_name: 2018_LNCS_Brazdil.pdf
file_size: 1829940
relation: main_file
file_date_updated: 2020-07-14T12:45:57Z
has_accepted_license: '1'
intvolume: ' 10805'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 385 - 407
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'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_status: published
publisher: Springer
publist_id: '7584'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strategy representation by decision trees in reactive synthesis
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10805
year: '2018'
...
---
_id: '141'
abstract:
- lang: eng
text: 'Given a model and a specification, the fundamental model-checking problem
asks for algorithmic verification of whether the model satisfies the specification.
We consider graphs and Markov decision processes (MDPs), which are fundamental
models for reactive systems. One of the very basic specifications that arise in
verification of reactive systems is the strong fairness (aka Streett) objective.
Given different types of requests and corresponding grants, the objective requires
that for each type, if the request event happens infinitely often, then the corresponding
grant event must also happen infinitely often. All ω -regular objectives can be
expressed as Streett objectives and hence they are canonical in verification.
To handle the state-space explosion, symbolic algorithms are required that operate
on a succinct implicit representation of the system rather than explicitly accessing
the system. While explicit algorithms for graphs and MDPs with Streett objectives
have been widely studied, there has been no improvement of the basic symbolic
algorithms. The worst-case numbers of symbolic steps required for the basic symbolic
algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work
we present the first sub-quadratic symbolic algorithm for graphs with Streett
objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic
insights we present an implementation of the new symbolic approach and show that
it improves the existing approach on several academic benchmark examples.'
acknowledgement: 'Acknowledgements. K. C. and M. H. are partially supported by the
Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported
by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant
(279307: Graph Games). V. T. is partially supported by the European Union’s Horizon
2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement
No. 665385.'
alternative_title:
- LNCS
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: 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
- first_name: Simin
full_name: Oraee, Simin
last_name: Oraee
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms
for graphs and Markov decision processes with fairness objectives. In: Vol 10982.
Springer; 2018:178-197. doi:10.1007/978-3-319-96142-2_13'
apa: 'Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., & Toman,
V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness
objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification,
Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13'
chicago: Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin
Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes
with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13.
ieee: 'K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman,
“Symbolic algorithms for graphs and Markov decision processes with fairness objectives,”
presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018,
vol. 10982, pp. 178–197.'
ista: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic
algorithms for graphs and Markov decision processes with fairness objectives.
CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.'
mla: Chatterjee, Krishnendu, et al. Symbolic Algorithms for Graphs and Markov
Decision Processes with Fairness Objectives. Vol. 10982, Springer, 2018, pp.
178–97, doi:10.1007/978-3-319-96142-2_13.
short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:,
Springer, 2018, pp. 178–197.
conference:
end_date: 2018-07-17
location: Oxford, United Kingdom
name: 'CAV: Computer Aided Verification'
start_date: 2018-07-14
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2023-09-19T09:59:55Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-319-96142-2_13
ec_funded: 1
external_id:
isi:
- '000491469700013'
file:
- access_level: open_access
checksum: 1a6ffa4febe8bb8ac28be3adb3eafebc
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T08:52:38Z
date_updated: 2020-07-14T12:44:53Z
file_id: '5737'
file_name: 2018_LNCS_Chatterjee.pdf
file_size: 675606
relation: main_file
file_date_updated: 2020-07-14T12:44:53Z
has_accepted_license: '1'
intvolume: ' 10982'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 178-197
project:
- _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
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_status: published
publisher: Springer
publist_id: '7782'
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Symbolic algorithms for graphs and Markov decision processes with fairness
objectives
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10982
year: '2018'
...
---
_id: '298'
abstract:
- lang: eng
text: "Memory-hard functions (MHF) are functions whose evaluation cost is dominated
by memory cost. MHFs are egalitarian, in the sense that evaluating them on dedicated
hardware (like FPGAs or ASICs) is not much cheaper than on off-the-shelf hardware
(like x86 CPUs). MHFs have interesting cryptographic applications, most notably
to password hashing and securing blockchains.\r\n\r\nAlwen and Serbinenko [STOC’15]
define the cumulative memory complexity (cmc) of a function as the sum (over all
time-steps) of the amount of memory required to compute the function. They advocate
that a good MHF must have high cmc. Unlike previous notions, cmc takes into account
that dedicated hardware might exploit amortization and parallelism. Still, cmc
has been critizised as insufficient, as it fails to capture possible time-memory
trade-offs; as memory cost doesn’t scale linearly, functions with the same cmc
could still have very different actual hardware cost.\r\n\r\nIn this work we address
this problem, and introduce the notion of sustained-memory complexity, which requires
that any algorithm evaluating the function must use a large amount of memory for
many steps. We construct functions (in the parallel random oracle model) whose
sustained-memory complexity is almost optimal: our function can be evaluated using
n steps and O(n/log(n)) memory, in each step making one query to the (fixed-input
length) random oracle, while any algorithm that can make arbitrary many parallel
queries to the random oracle, still needs Ω(n/log(n)) memory for Ω(n) steps.\r\n\r\nAs
has been done for various notions (including cmc) before, we reduce the task of
constructing an MHFs with high sustained-memory complexity to proving pebbling
lower bounds on DAGs. Our main technical contribution is the construction is a
family of DAGs on n nodes with constant indegree with high “sustained-space complexity”,
meaning that any parallel black-pebbling strategy requires Ω(n/log(n)) pebbles
for at least Ω(n) steps.\r\n\r\nAlong the way we construct a family of maximally
“depth-robust” DAGs with maximum indegree O(logn) , improving upon the construction
of Mahmoody et al. [ITCS’13] which had maximum indegree O(log2n⋅"
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Jeremiah
full_name: Blocki, Jeremiah
last_name: Blocki
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Alwen JF, Blocki J, Pietrzak KZ. Sustained space complexity. In: Vol 10821.
Springer; 2018:99-130. doi:10.1007/978-3-319-78375-8_4'
apa: 'Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2018). Sustained space complexity
(Vol. 10821, pp. 99–130). Presented at the Eurocrypt 2018: Advances in Cryptology,
Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78375-8_4'
chicago: Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Sustained Space
Complexity,” 10821:99–130. Springer, 2018. https://doi.org/10.1007/978-3-319-78375-8_4.
ieee: 'J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Sustained space complexity,”
presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel, 2018,
vol. 10821, pp. 99–130.'
ista: 'Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt
2018: Advances in Cryptology, LNCS, vol. 10821, 99–130.'
mla: Alwen, Joel F., et al. Sustained Space Complexity. Vol. 10821, Springer,
2018, pp. 99–130, doi:10.1007/978-3-319-78375-8_4.
short: J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
conference:
end_date: 2018-05-03
location: Tel Aviv, Israel
name: 'Eurocrypt 2018: Advances in Cryptology'
start_date: 2018-04-29
date_created: 2018-12-11T11:45:41Z
date_published: 2018-03-31T00:00:00Z
date_updated: 2023-09-19T09:59:30Z
day: '31'
department:
- _id: KrPi
doi: 10.1007/978-3-319-78375-8_4
ec_funded: 1
external_id:
arxiv:
- '1705.05313'
isi:
- '000517098700004'
intvolume: ' 10821'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.05313
month: '03'
oa: 1
oa_version: Preprint
page: 99 - 130
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_status: published
publisher: Springer
publist_id: '7583'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sustained space complexity
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10821
year: '2018'
...
---
_id: '36'
abstract:
- lang: eng
text: Wheat (Triticum ssp.) is one of the most important human food sources. However,
this crop is very sensitive to temperature changes. Specifically, processes during
wheat leaf, flower, and seed development and photosynthesis, which all contribute
to the yield of this crop, are affected by high temperature. While this has to
some extent been investigated on physiological, developmental, and molecular levels,
very little is known about early signalling events associated with an increase
in temperature. Phosphorylation-mediated signalling mechanisms, which are quick
and dynamic, are associated with plant growth and development, also under abiotic
stress conditions. Therefore, we probed the impact of a short-term and mild increase
in temperature on the wheat leaf and spikelet phosphoproteome. In total, 3822
(containing 5178 phosphosites) and 5581 phosphopeptides (containing 7023 phosphosites)
were identified in leaf and spikelet samples, respectively. Following statistical
analysis, the resulting data set provides the scientific community with a first
large-scale plant phosphoproteome under the control of higher ambient temperature.
This community resource on the high temperature-mediated wheat phosphoproteome
will be valuable for future studies. Our analyses also revealed a core set of
common proteins between leaf and spikelet, suggesting some level of conserved
regulatory mechanisms. Furthermore, we observed temperature-regulated interconversion
of phosphoforms, which probably impacts protein activity.
acknowledgement: TZ is supported by a grant from the Chinese Scholarship Council.
article_processing_charge: No
author:
- first_name: Lam
full_name: Vu, Lam
last_name: Vu
- first_name: Tingting
full_name: Zhu, Tingting
last_name: Zhu
- first_name: Inge
full_name: Verstraeten, Inge
id: 362BF7FE-F248-11E8-B48F-1D18A9856A87
last_name: Verstraeten
orcid: 0000-0001-7241-2328
- first_name: Brigitte
full_name: Van De Cotte, Brigitte
last_name: Van De Cotte
- first_name: Kris
full_name: Gevaert, Kris
last_name: Gevaert
- first_name: Ive
full_name: De Smet, Ive
last_name: De Smet
citation:
ama: Vu L, Zhu T, Verstraeten I, Van De Cotte B, Gevaert K, De Smet I. Temperature-induced
changes in the wheat phosphoproteome reveal temperature-regulated interconversion
of phosphoforms. Journal of Experimental Botany. 2018;69(19):4609-4624.
doi:10.1093/jxb/ery204
apa: Vu, L., Zhu, T., Verstraeten, I., Van De Cotte, B., Gevaert, K., & De Smet,
I. (2018). Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated
interconversion of phosphoforms. Journal of Experimental Botany. Oxford
University Press. https://doi.org/10.1093/jxb/ery204
chicago: Vu, Lam, Tingting Zhu, Inge Verstraeten, Brigitte Van De Cotte, Kris Gevaert,
and Ive De Smet. “Temperature-Induced Changes in the Wheat Phosphoproteome Reveal
Temperature-Regulated Interconversion of Phosphoforms.” Journal of Experimental
Botany. Oxford University Press, 2018. https://doi.org/10.1093/jxb/ery204.
ieee: L. Vu, T. Zhu, I. Verstraeten, B. Van De Cotte, K. Gevaert, and I. De Smet,
“Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated
interconversion of phosphoforms,” Journal of Experimental Botany, vol.
69, no. 19. Oxford University Press, pp. 4609–4624, 2018.
ista: Vu L, Zhu T, Verstraeten I, Van De Cotte B, Gevaert K, De Smet I. 2018. Temperature-induced
changes in the wheat phosphoproteome reveal temperature-regulated interconversion
of phosphoforms. Journal of Experimental Botany. 69(19), 4609–4624.
mla: Vu, Lam, et al. “Temperature-Induced Changes in the Wheat Phosphoproteome Reveal
Temperature-Regulated Interconversion of Phosphoforms.” Journal of Experimental
Botany, vol. 69, no. 19, Oxford University Press, 2018, pp. 4609–24, doi:10.1093/jxb/ery204.
short: L. Vu, T. Zhu, I. Verstraeten, B. Van De Cotte, K. Gevaert, I. De Smet, Journal
of Experimental Botany 69 (2018) 4609–4624.
date_created: 2018-12-11T11:44:17Z
date_published: 2018-08-31T00:00:00Z
date_updated: 2023-09-19T10:00:46Z
day: '31'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.1093/jxb/ery204
external_id:
isi:
- '000443568700010'
file:
- access_level: open_access
checksum: 34cb0a1611588b75bd6f4913fb4e30f1
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:47:51Z
date_updated: 2020-07-14T12:46:13Z
file_id: '5741'
file_name: 2018_JournalExperimBotany_Vu.pdf
file_size: 3359316
relation: main_file
file_date_updated: 2020-07-14T12:46:13Z
has_accepted_license: '1'
intvolume: ' 69'
isi: 1
issue: '19'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 4609 - 4624
publication: Journal of Experimental Botany
publication_status: published
publisher: Oxford University Press
publist_id: '8019'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated
interconversion of phosphoforms
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 69
year: '2018'
...
---
_id: '326'
abstract:
- lang: eng
text: Three-dimensional (3D) super-resolution microscopy technique structured illumination
microscopy (SIM) imaging of dendritic spines along the dendrite has not been previously
performed in fixed tissues, mainly due to deterioration of the stripe pattern
of the excitation laser induced by light scattering and optical aberrations. To
address this issue and solve these optical problems, we applied a novel clearing
reagent, LUCID, to fixed brains. In SIM imaging, the penetration depth and the
spatial resolution were improved in LUCID-treated slices, and 160-nm spatial resolution
was obtained in a large portion of the imaging volume on a single apical dendrite.
Furthermore, in a morphological analysis of spine heads of layer V pyramidal neurons
(L5PNs) in the medial prefrontal cortex (mPFC) of chronic dexamethasone (Dex)-treated
mice, SIM imaging revealed an altered distribution of spine forms that could not
be detected by high-NA confocal imaging. Thus, super-resolution SIM imaging represents
a promising high-throughput method for revealing spine morphologies in single
dendrites.
acknowledged_ssus:
- _id: EM-Fac
article_processing_charge: No
author:
- first_name: Kazuaki
full_name: Sawada, Kazuaki
last_name: Sawada
- first_name: Ryosuke
full_name: Kawakami, Ryosuke
last_name: Kawakami
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Tomomi
full_name: Nemoto, Tomomi
last_name: Nemoto
citation:
ama: Sawada K, Kawakami R, Shigemoto R, Nemoto T. Super resolution structural analysis
of dendritic spines using three-dimensional structured illumination microscopy
in cleared mouse brain slices. European Journal of Neuroscience. 2018;47(9):1033-1042.
doi:10.1111/ejn.13901
apa: Sawada, K., Kawakami, R., Shigemoto, R., & Nemoto, T. (2018). Super resolution
structural analysis of dendritic spines using three-dimensional structured illumination
microscopy in cleared mouse brain slices. European Journal of Neuroscience.
Wiley. https://doi.org/10.1111/ejn.13901
chicago: Sawada, Kazuaki, Ryosuke Kawakami, Ryuichi Shigemoto, and Tomomi Nemoto.
“Super Resolution Structural Analysis of Dendritic Spines Using Three-Dimensional
Structured Illumination Microscopy in Cleared Mouse Brain Slices.” European
Journal of Neuroscience. Wiley, 2018. https://doi.org/10.1111/ejn.13901.
ieee: K. Sawada, R. Kawakami, R. Shigemoto, and T. Nemoto, “Super resolution structural
analysis of dendritic spines using three-dimensional structured illumination microscopy
in cleared mouse brain slices,” European Journal of Neuroscience, vol.
47, no. 9. Wiley, pp. 1033–1042, 2018.
ista: Sawada K, Kawakami R, Shigemoto R, Nemoto T. 2018. Super resolution structural
analysis of dendritic spines using three-dimensional structured illumination microscopy
in cleared mouse brain slices. European Journal of Neuroscience. 47(9), 1033–1042.
mla: Sawada, Kazuaki, et al. “Super Resolution Structural Analysis of Dendritic
Spines Using Three-Dimensional Structured Illumination Microscopy in Cleared Mouse
Brain Slices.” European Journal of Neuroscience, vol. 47, no. 9, Wiley,
2018, pp. 1033–42, doi:10.1111/ejn.13901.
short: K. Sawada, R. Kawakami, R. Shigemoto, T. Nemoto, European Journal of Neuroscience
47 (2018) 1033–1042.
date_created: 2018-12-11T11:45:50Z
date_published: 2018-03-07T00:00:00Z
date_updated: 2023-09-19T09:58:40Z
day: '07'
ddc:
- '570'
department:
- _id: RySh
doi: 10.1111/ejn.13901
external_id:
isi:
- '000431496400001'
file:
- access_level: open_access
checksum: 98e901d8229e44aa8f3b51d248dedd09
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:16:50Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5721'
file_name: 2018_EJN_Sawada.pdf
file_size: 4850261
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 47'
isi: 1
issue: '9'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 1033 - 1042
publication: European Journal of Neuroscience
publication_status: published
publisher: Wiley
publist_id: '7539'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Super resolution structural analysis of dendritic spines using three-dimensional
structured illumination microscopy in cleared mouse brain slices
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 47
year: '2018'
...
---
_id: '5770'
abstract:
- lang: eng
text: Retroviruses assemble and bud from infected cells in an immature form and
require proteolytic maturation for infectivity. The CA (capsid) domains of the
Gag polyproteins assemble a protein lattice as a truncated sphere in the immature
virion. Proteolytic cleavage of Gag induces dramatic structural rearrangements;
a subset of cleaved CA subsequently assembles into the mature core, whose architecture
varies among retroviruses. Murine leukemia virus (MLV) is the prototypical γ-retrovirus
and serves as the basis of retroviral vectors, but the structure of the MLV CA
layer is unknown. Here we have combined X-ray crystallography with cryoelectron
tomography to determine the structures of immature and mature MLV CA layers within
authentic viral particles. This reveals the structural changes associated with
maturation, and, by comparison with HIV-1, uncovers conserved and variable features.
In contrast to HIV-1, most MLV CA is used for assembly of the mature core, which
adopts variable, multilayered morphologies and does not form a closed structure.
Unlike in HIV-1, there is similarity between protein–protein interfaces in the
immature MLV CA layer and those in the mature CA layer, and structural maturation
of MLV could be achieved through domain rotations that largely maintain hexameric
interactions. Nevertheless, the dramatic architectural change on maturation indicates
that extensive disassembly and reassembly are required for mature core growth.
The core morphology suggests that wrapping of the genome in CA sheets may be sufficient
to protect the MLV ribonucleoprotein during cell entry.
article_processing_charge: No
author:
- first_name: Kun
full_name: Qu, Kun
last_name: Qu
- first_name: Bärbel
full_name: Glass, Bärbel
last_name: Glass
- first_name: Michal
full_name: Doležal, Michal
last_name: Doležal
- first_name: Florian
full_name: Schur, Florian
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
- first_name: Brice
full_name: Murciano, Brice
last_name: Murciano
- first_name: Alan
full_name: Rein, Alan
last_name: Rein
- first_name: Michaela
full_name: Rumlová, Michaela
last_name: Rumlová
- first_name: Tomáš
full_name: Ruml, Tomáš
last_name: Ruml
- first_name: Hans-Georg
full_name: Kräusslich, Hans-Georg
last_name: Kräusslich
- first_name: John A. G.
full_name: Briggs, John A. G.
last_name: Briggs
citation:
ama: Qu K, Glass B, Doležal M, et al. Structure and architecture of immature and
mature murine leukemia virus capsids. Proceedings of the National Academy of
Sciences. 2018;115(50):E11751-E11760. doi:10.1073/pnas.1811580115
apa: Qu, K., Glass, B., Doležal, M., Schur, F. K., Murciano, B., Rein, A., … Briggs,
J. A. G. (2018). Structure and architecture of immature and mature murine leukemia
virus capsids. Proceedings of the National Academy of Sciences. Proceedings
of the National Academy of Sciences. https://doi.org/10.1073/pnas.1811580115
chicago: Qu, Kun, Bärbel Glass, Michal Doležal, Florian KM Schur, Brice Murciano,
Alan Rein, Michaela Rumlová, Tomáš Ruml, Hans-Georg Kräusslich, and John A. G.
Briggs. “Structure and Architecture of Immature and Mature Murine Leukemia Virus
Capsids.” Proceedings of the National Academy of Sciences. Proceedings
of the National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1811580115.
ieee: K. Qu et al., “Structure and architecture of immature and mature murine
leukemia virus capsids,” Proceedings of the National Academy of Sciences,
vol. 115, no. 50. Proceedings of the National Academy of Sciences, pp. E11751–E11760,
2018.
ista: Qu K, Glass B, Doležal M, Schur FK, Murciano B, Rein A, Rumlová M, Ruml T,
Kräusslich H-G, Briggs JAG. 2018. Structure and architecture of immature and mature
murine leukemia virus capsids. Proceedings of the National Academy of Sciences.
115(50), E11751–E11760.
mla: Qu, Kun, et al. “Structure and Architecture of Immature and Mature Murine Leukemia
Virus Capsids.” Proceedings of the National Academy of Sciences, vol. 115,
no. 50, Proceedings of the National Academy of Sciences, 2018, pp. E11751–60,
doi:10.1073/pnas.1811580115.
short: K. Qu, B. Glass, M. Doležal, F.K. Schur, B. Murciano, A. Rein, M. Rumlová,
T. Ruml, H.-G. Kräusslich, J.A.G. Briggs, Proceedings of the National Academy
of Sciences 115 (2018) E11751–E11760.
date_created: 2018-12-20T21:09:37Z
date_published: 2018-12-11T00:00:00Z
date_updated: 2023-09-19T09:57:45Z
day: '11'
department:
- _id: FlSc
doi: 10.1073/pnas.1811580115
external_id:
isi:
- '000452866000022'
pmid:
- '30478053'
intvolume: ' 115'
isi: 1
issue: '50'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/30478053
month: '12'
oa: 1
oa_version: Submitted Version
page: E11751-E11760
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
issn:
- '00278424'
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structure and architecture of immature and mature murine leukemia virus capsids
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 115
year: '2018'
...
---
_id: '608'
abstract:
- lang: eng
text: Synthesis is the automated construction of a system from its specification.
In real life, hardware and software systems are rarely constructed from scratch.
Rather, a system is typically constructed from a library of components. Lustig
and Vardi formalized this intuition and studied LTL synthesis from component libraries.
In real life, designers seek optimal systems. In this paper we add optimality
considerations to the setting. We distinguish between quality considerations (for
example, size - the smaller a system is, the better it is), and pricing (for example,
the payment to the company who manufactured the component). We study the problem
of designing systems with minimal quality-cost and price. A key point is that
while the quality cost is individual - the choices of a designer are independent
of choices made by other designers that use the same library, pricing gives rise
to a resource-allocation game - designers that use the same component share its
price, with the share being proportional to the number of uses (a component can
be used several times in a design). We study both closed and open settings, and
in both we solve the problem of finding an optimal design. In a setting with multiple
designers, we also study the game-theoretic problems of the induced resource-allocation
game.
article_processing_charge: No
article_type: original
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Avni G, Kupferman O. Synthesis from component libraries with costs. Theoretical
Computer Science. 2018;712:50-72. doi:10.1016/j.tcs.2017.11.001
apa: Avni, G., & Kupferman, O. (2018). Synthesis from component libraries with
costs. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2017.11.001
chicago: Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with
Costs.” Theoretical Computer Science. Elsevier, 2018. https://doi.org/10.1016/j.tcs.2017.11.001.
ieee: G. Avni and O. Kupferman, “Synthesis from component libraries with costs,”
Theoretical Computer Science, vol. 712. Elsevier, pp. 50–72, 2018.
ista: Avni G, Kupferman O. 2018. Synthesis from component libraries with costs.
Theoretical Computer Science. 712, 50–72.
mla: Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.”
Theoretical Computer Science, vol. 712, Elsevier, 2018, pp. 50–72, doi:10.1016/j.tcs.2017.11.001.
short: G. Avni, O. Kupferman, Theoretical Computer Science 712 (2018) 50–72.
date_created: 2018-12-11T11:47:28Z
date_published: 2018-02-15T00:00:00Z
date_updated: 2023-09-19T10:00:21Z
day: '15'
department:
- _id: ToHe
doi: 10.1016/j.tcs.2017.11.001
ec_funded: 1
external_id:
isi:
- '000424959200003'
intvolume: ' 712'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.4529
month: '02'
oa: 1
oa_version: Published Version
page: 50 - 72
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '7197'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Synthesis from component libraries with costs
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 712
year: '2018'
...
---
_id: '705'
abstract:
- lang: eng
text: Although dopamine receptors D1 and D2 play key roles in hippocampal function,
their synaptic localization within the hippocampus has not been fully elucidated.
In order to understand precise functions of pre- or postsynaptic dopamine receptors
(DRs), the development of protocols to differentiate pre- and postsynaptic DRs
is essential. So far, most studies on determination and quantification of DRs
did not discriminate between subsynaptic localization. Therefore, the aim of the
study was to generate a robust workflow for the localization of DRs. This work
provides the basis for future work on hippocampal DRs, in light that DRs may have
different functions at pre- or postsynaptic sites. Synaptosomes from rat hippocampi
isolated by a sucrose gradient protocol were prepared for super-resolution direct
stochastic optical reconstruction microscopy (dSTORM) using Bassoon as a presynaptic
zone and Homer1 as postsynaptic density marker. Direct labeling of primary validated
antibodies against dopamine receptors D1 (D1R) and D2 (D2R) with Alexa Fluor 594
enabled unequivocal assignment of D1R and D2R to both, pre- and postsynaptic sites.
D1R immunoreactivity clusters were observed within the presynaptic active zone
as well as at perisynaptic sites at the edge of the presynaptic active zone. The
results may be useful for the interpretation of previous studies and the design
of future work on DRs in the hippocampus. Moreover, the reduction of the complexity
of brain tissue by the use of synaptosomal preparations and dSTORM technology
may represent a useful tool for synaptic localization of brain proteins.
article_processing_charge: No
author:
- first_name: Andras
full_name: Miklosi, Andras
last_name: Miklosi
- first_name: Giorgia
full_name: Del Favero, Giorgia
last_name: Del Favero
- first_name: Tanja
full_name: Bulat, Tanja
last_name: Bulat
- first_name: Harald
full_name: Höger, Harald
last_name: Höger
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Doris
full_name: Marko, Doris
last_name: Marko
- first_name: Gert
full_name: Lubec, Gert
last_name: Lubec
citation:
ama: Miklosi A, Del Favero G, Bulat T, et al. Super resolution microscopical localization
of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology.
2018;55(6):4857 – 4869. doi:10.1007/s12035-017-0688-y
apa: Miklosi, A., Del Favero, G., Bulat, T., Höger, H., Shigemoto, R., Marko, D.,
& Lubec, G. (2018). Super resolution microscopical localization of dopamine
receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology.
Springer. https://doi.org/10.1007/s12035-017-0688-y
chicago: Miklosi, Andras, Giorgia Del Favero, Tanja Bulat, Harald Höger, Ryuichi
Shigemoto, Doris Marko, and Gert Lubec. “Super Resolution Microscopical Localization
of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology.
Springer, 2018. https://doi.org/10.1007/s12035-017-0688-y.
ieee: A. Miklosi et al., “Super resolution microscopical localization of
dopamine receptors 1 and 2 in rat hippocampal synaptosomes,” Molecular Neurobiology,
vol. 55, no. 6. Springer, pp. 4857 – 4869, 2018.
ista: Miklosi A, Del Favero G, Bulat T, Höger H, Shigemoto R, Marko D, Lubec G.
2018. Super resolution microscopical localization of dopamine receptors 1 and
2 in rat hippocampal synaptosomes. Molecular Neurobiology. 55(6), 4857 – 4869.
mla: Miklosi, Andras, et al. “Super Resolution Microscopical Localization of Dopamine
Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology,
vol. 55, no. 6, Springer, 2018, pp. 4857 – 4869, doi:10.1007/s12035-017-0688-y.
short: A. Miklosi, G. Del Favero, T. Bulat, H. Höger, R. Shigemoto, D. Marko, G.
Lubec, Molecular Neurobiology 55 (2018) 4857 – 4869.
date_created: 2018-12-11T11:48:02Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-19T09:58:11Z
day: '01'
department:
- _id: RySh
doi: 10.1007/s12035-017-0688-y
external_id:
isi:
- '000431991500025'
intvolume: ' 55'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 4857 – 4869
publication: Molecular Neurobiology
publication_status: published
publisher: Springer
publist_id: '6991'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Super resolution microscopical localization of dopamine receptors 1 and 2 in
rat hippocampal synaptosomes
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 55
year: '2018'
...
---
_id: '148'
abstract:
- lang: eng
text: 'Land plants evolved from charophytic algae, among which Charophyceae possess
the most complex body plans. We present the genome of Chara braunii; comparison
of the genome to those of land plants identified evolutionary novelties for plant
terrestrialization and land plant heritage genes. C. braunii employs unique xylan
synthases for cell wall biosynthesis, a phragmoplast (cell separation) mechanism
similar to that of land plants, and many phytohormones. C. braunii plastids are
controlled via land-plant-like retrograde signaling, and transcriptional regulation
is more elaborate than in other algae. The morphological complexity of this organism
may result from expanded gene families, with three cases of particular note: genes
effecting tolerance to reactive oxygen species (ROS), LysM receptor-like kinases,
and transcription factors (TFs). Transcriptomic analysis of sexual reproductive
structures reveals intricate control by TFs, activity of the ROS gene network,
and the ancestral use of plant-like storage and stress protection proteins in
the zygote.'
acknowledgement: In-Data-Review
article_processing_charge: No
author:
- first_name: Tomoaki
full_name: Nishiyama, Tomoaki
last_name: Nishiyama
- first_name: Hidetoshi
full_name: Sakayama, Hidetoshi
last_name: Sakayama
- first_name: Jan
full_name: De Vries, Jan
last_name: De Vries
- first_name: Henrik
full_name: Buschmann, Henrik
last_name: Buschmann
- first_name: Denis
full_name: Saint Marcoux, Denis
last_name: Saint Marcoux
- first_name: Kristian
full_name: Ullrich, Kristian
last_name: Ullrich
- first_name: Fabian
full_name: Haas, Fabian
last_name: Haas
- first_name: Lisa
full_name: Vanderstraeten, Lisa
last_name: Vanderstraeten
- first_name: Dirk
full_name: Becker, Dirk
last_name: Becker
- first_name: Daniel
full_name: Lang, Daniel
last_name: Lang
- first_name: Stanislav
full_name: Vosolsobě, Stanislav
last_name: Vosolsobě
- first_name: Stephane
full_name: Rombauts, Stephane
last_name: Rombauts
- first_name: Per
full_name: Wilhelmsson, Per
last_name: Wilhelmsson
- first_name: Philipp
full_name: Janitza, Philipp
last_name: Janitza
- first_name: Ramona
full_name: Kern, Ramona
last_name: Kern
- first_name: Alexander
full_name: Heyl, Alexander
last_name: Heyl
- first_name: Florian
full_name: Rümpler, Florian
last_name: Rümpler
- first_name: Luz
full_name: Calderón Villalobos, Luz
last_name: Calderón Villalobos
- first_name: John
full_name: Clay, John
last_name: Clay
- first_name: Roman
full_name: Skokan, Roman
last_name: Skokan
- first_name: Atsushi
full_name: Toyoda, Atsushi
last_name: Toyoda
- first_name: Yutaka
full_name: Suzuki, Yutaka
last_name: Suzuki
- first_name: Hiroshi
full_name: Kagoshima, Hiroshi
last_name: Kagoshima
- first_name: Elio
full_name: Schijlen, Elio
last_name: Schijlen
- first_name: Navindra
full_name: Tajeshwar, Navindra
last_name: Tajeshwar
- first_name: Bruno
full_name: Catarino, Bruno
last_name: Catarino
- first_name: Alexander
full_name: Hetherington, Alexander
last_name: Hetherington
- first_name: Assia
full_name: Saltykova, Assia
last_name: Saltykova
- first_name: Clemence
full_name: Bonnot, Clemence
last_name: Bonnot
- first_name: Holger
full_name: Breuninger, Holger
last_name: Breuninger
- first_name: Aikaterini
full_name: Symeonidi, Aikaterini
last_name: Symeonidi
- first_name: Guru
full_name: Radhakrishnan, Guru
last_name: Radhakrishnan
- first_name: Filip
full_name: Van Nieuwerburgh, Filip
last_name: Van Nieuwerburgh
- first_name: Dieter
full_name: Deforce, Dieter
last_name: Deforce
- first_name: Caren
full_name: Chang, Caren
last_name: Chang
- first_name: Kenneth
full_name: Karol, Kenneth
last_name: Karol
- first_name: Rainer
full_name: Hedrich, Rainer
last_name: Hedrich
- first_name: Peter
full_name: Ulvskov, Peter
last_name: Ulvskov
- first_name: Gernot
full_name: Glöckner, Gernot
last_name: Glöckner
- first_name: Charles
full_name: Delwiche, Charles
last_name: Delwiche
- first_name: Jan
full_name: Petrášek, Jan
last_name: Petrášek
- first_name: Yves
full_name: Van De Peer, Yves
last_name: Van De Peer
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Mary
full_name: Beilby, Mary
last_name: Beilby
- first_name: Liam
full_name: Dolan, Liam
last_name: Dolan
- first_name: Yuji
full_name: Kohara, Yuji
last_name: Kohara
- first_name: Sumio
full_name: Sugano, Sumio
last_name: Sugano
- first_name: Asao
full_name: Fujiyama, Asao
last_name: Fujiyama
- first_name: Pierre Marc
full_name: Delaux, Pierre Marc
last_name: Delaux
- first_name: Marcel
full_name: Quint, Marcel
last_name: Quint
- first_name: Gunter
full_name: Theissen, Gunter
last_name: Theissen
- first_name: Martin
full_name: Hagemann, Martin
last_name: Hagemann
- first_name: Jesper
full_name: Harholt, Jesper
last_name: Harholt
- first_name: Christophe
full_name: Dunand, Christophe
last_name: Dunand
- first_name: Sabine
full_name: Zachgo, Sabine
last_name: Zachgo
- first_name: Jane
full_name: Langdale, Jane
last_name: Langdale
- first_name: Florian
full_name: Maumus, Florian
last_name: Maumus
- first_name: Dominique
full_name: Van Der Straeten, Dominique
last_name: Van Der Straeten
- first_name: Sven B
full_name: Gould, Sven B
last_name: Gould
- first_name: Stefan
full_name: Rensing, Stefan
last_name: Rensing
citation:
ama: 'Nishiyama T, Sakayama H, De Vries J, et al. The Chara genome: Secondary complexity
and implications for plant terrestrialization. Cell. 2018;174(2):448-464.e24.
doi:10.1016/j.cell.2018.06.033'
apa: 'Nishiyama, T., Sakayama, H., De Vries, J., Buschmann, H., Saint Marcoux, D.,
Ullrich, K., … Rensing, S. (2018). The Chara genome: Secondary complexity and
implications for plant terrestrialization. Cell. Cell Press. https://doi.org/10.1016/j.cell.2018.06.033'
chicago: 'Nishiyama, Tomoaki, Hidetoshi Sakayama, Jan De Vries, Henrik Buschmann,
Denis Saint Marcoux, Kristian Ullrich, Fabian Haas, et al. “The Chara Genome:
Secondary Complexity and Implications for Plant Terrestrialization.” Cell.
Cell Press, 2018. https://doi.org/10.1016/j.cell.2018.06.033.'
ieee: 'T. Nishiyama et al., “The Chara genome: Secondary complexity and implications
for plant terrestrialization,” Cell, vol. 174, no. 2. Cell Press, p. 448–464.e24,
2018.'
ista: 'Nishiyama T, Sakayama H, De Vries J, Buschmann H, Saint Marcoux D, Ullrich
K, Haas F, Vanderstraeten L, Becker D, Lang D, Vosolsobě S, Rombauts S, Wilhelmsson
P, Janitza P, Kern R, Heyl A, Rümpler F, Calderón Villalobos L, Clay J, Skokan
R, Toyoda A, Suzuki Y, Kagoshima H, Schijlen E, Tajeshwar N, Catarino B, Hetherington
A, Saltykova A, Bonnot C, Breuninger H, Symeonidi A, Radhakrishnan G, Van Nieuwerburgh
F, Deforce D, Chang C, Karol K, Hedrich R, Ulvskov P, Glöckner G, Delwiche C,
Petrášek J, Van De Peer Y, Friml J, Beilby M, Dolan L, Kohara Y, Sugano S, Fujiyama
A, Delaux PM, Quint M, Theissen G, Hagemann M, Harholt J, Dunand C, Zachgo S,
Langdale J, Maumus F, Van Der Straeten D, Gould SB, Rensing S. 2018. The Chara
genome: Secondary complexity and implications for plant terrestrialization. Cell.
174(2), 448–464.e24.'
mla: 'Nishiyama, Tomoaki, et al. “The Chara Genome: Secondary Complexity and Implications
for Plant Terrestrialization.” Cell, vol. 174, no. 2, Cell Press, 2018,
p. 448–464.e24, doi:10.1016/j.cell.2018.06.033.'
short: T. Nishiyama, H. Sakayama, J. De Vries, H. Buschmann, D. Saint Marcoux, K.
Ullrich, F. Haas, L. Vanderstraeten, D. Becker, D. Lang, S. Vosolsobě, S. Rombauts,
P. Wilhelmsson, P. Janitza, R. Kern, A. Heyl, F. Rümpler, L. Calderón Villalobos,
J. Clay, R. Skokan, A. Toyoda, Y. Suzuki, H. Kagoshima, E. Schijlen, N. Tajeshwar,
B. Catarino, A. Hetherington, A. Saltykova, C. Bonnot, H. Breuninger, A. Symeonidi,
G. Radhakrishnan, F. Van Nieuwerburgh, D. Deforce, C. Chang, K. Karol, R. Hedrich,
P. Ulvskov, G. Glöckner, C. Delwiche, J. Petrášek, Y. Van De Peer, J. Friml, M.
Beilby, L. Dolan, Y. Kohara, S. Sugano, A. Fujiyama, P.M. Delaux, M. Quint, G.
Theissen, M. Hagemann, J. Harholt, C. Dunand, S. Zachgo, J. Langdale, F. Maumus,
D. Van Der Straeten, S.B. Gould, S. Rensing, Cell 174 (2018) 448–464.e24.
date_created: 2018-12-11T11:44:53Z
date_published: 2018-07-12T00:00:00Z
date_updated: 2023-09-19T10:02:47Z
day: '12'
department:
- _id: JiFr
doi: 10.1016/j.cell.2018.06.033
ec_funded: 1
external_id:
isi:
- '000438482800019'
pmid:
- '30007417'
intvolume: ' 174'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/30007417
month: '07'
oa: 1
oa_version: Published Version
page: 448 - 464.e24
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: Cell
publication_status: published
publisher: Cell Press
publist_id: '7774'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The Chara genome: Secondary complexity and implications for plant terrestrialization'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 174
year: '2018'
...