---
_id: '10417'
abstract:
- lang: eng
text: "We present a new dynamic partial-order reduction method for stateless model
checking of concurrent programs. A common approach for exploring program behaviors
relies on enumerating the traces of the program, without storing the visited states
(aka stateless exploration). As the number of distinct traces grows exponentially,
dynamic partial-order reduction (DPOR) techniques have been successfully used
to partition the space of traces into equivalence classes (Mazurkiewicz partitioning),
with the goal of exploring only few representative traces from each class.\r\n\r\nWe
introduce a new equivalence on traces under sequential consistency semantics,
which we call the observation equivalence. Two traces are observationally equivalent
if every read event observes the same write event in both traces. While the traditional
Mazurkiewicz equivalence is control-centric, our new definition is data-centric.
We show that our observation equivalence is coarser than the Mazurkiewicz equivalence,
and in many cases even exponentially coarser. We devise a DPOR exploration of
the trace space, called data-centric DPOR, based on the observation equivalence."
acknowledgement: "The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499- N23, FWF\r\nNFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant
(279307: Graph Games), and Czech\r\nScience Foundation grant GBP202/12/G061."
article_number: '31'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Marek
full_name: Chalupa, Marek
last_name: Chalupa
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Nishant
full_name: Sinha, Nishant
last_name: Sinha
- first_name: Kapil
full_name: Vaidya, Kapil
last_name: Vaidya
citation:
ama: Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic
partial order reduction. Proceedings of the ACM on Programming Languages.
2017;2(POPL). doi:10.1145/3158119
apa: 'Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K.
(2017). Data-centric dynamic partial order reduction. Proceedings of the ACM
on Programming Languages. Los Angeles, CA, United States: Association for
Computing Machinery. https://doi.org/10.1145/3158119'
chicago: Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha,
and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” Proceedings
of the ACM on Programming Languages. Association for Computing Machinery,
2017. https://doi.org/10.1145/3158119.
ieee: M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric
dynamic partial order reduction,” Proceedings of the ACM on Programming Languages,
vol. 2, no. POPL. Association for Computing Machinery, 2017.
ista: Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric
dynamic partial order reduction. Proceedings of the ACM on Programming Languages.
2(POPL), 31.
mla: Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.” Proceedings
of the ACM on Programming Languages, vol. 2, no. POPL, 31, Association for
Computing Machinery, 2017, doi:10.1145/3158119.
short: M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings
of the ACM on Programming Languages 2 (2017).
conference:
end_date: 2018-01-13
location: Los Angeles, CA, United States
name: 'POPL: Programming Languages'
start_date: 2018-01-07
date_created: 2021-12-05T23:01:49Z
date_published: 2017-12-27T00:00:00Z
date_updated: 2023-02-23T12:27:16Z
day: '27'
department:
- _id: KrCh
doi: 10.1145/3158119
ec_funded: 1
external_id:
arxiv:
- '1610.01188'
intvolume: ' 2'
issue: POPL
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/doi/10.1145/3158119
month: '12'
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: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '5448'
relation: earlier_version
status: public
- id: '5456'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Data-centric dynamic partial order reduction
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 2
year: '2017'
...
---
_id: '10418'
abstract:
- lang: eng
text: We present a new proof rule for proving almost-sure termination of probabilistic
programs, including those that contain demonic non-determinism. An important question
for a probabilistic program is whether the probability mass of all its diverging
runs is zero, that is that it terminates "almost surely". Proving that can be
hard, and this paper presents a new method for doing so. It applies directly to
the program's source code, even if the program contains demonic choice. Like others,
we use variant functions (a.k.a. "super-martingales") that are real-valued and
decrease randomly on each loop iteration; but our key innovation is that the amount
as well as the probability of the decrease are parametric. We prove the soundness
of the new rule, indicate where its applicability goes beyond existing rules,
and explain its connection to classical results on denumerable (non-demonic) Markov
chains.
acknowledgement: "McIver and Morgan are grateful to David Basin and the Information
Security Group at ETH Zürich for hosting a six-month stay in Switzerland, during
part of which this work began. And thanks particularly to Andreas Lochbihler, who
shared with us the probabilistic termination problem that led to it. They acknowledge
the support of ARC grant DP140101119. Part of this work was carried out during the
Workshop on Probabilistic Programming Semantics\r\nat McGill University’s Bellairs
Research Institute on Barbados organised by Alexandra Silva and\r\nPrakash Panangaden.
Kaminski and Katoen are grateful to Sebastian Junges for spotting a flaw in §5.4."
article_number: '33'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Annabelle
full_name: Mciver, Annabelle
last_name: Mciver
- first_name: Carroll
full_name: Morgan, Carroll
last_name: Morgan
- first_name: Benjamin Lucien
full_name: Kaminski, Benjamin Lucien
last_name: Kaminski
- first_name: Joost P
full_name: Katoen, Joost P
id: 4524F760-F248-11E8-B48F-1D18A9856A87
last_name: Katoen
citation:
ama: Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure
termination. Proceedings of the ACM on Programming Languages. 2017;2(POPL).
doi:10.1145/3158121
apa: 'Mciver, A., Morgan, C., Kaminski, B. L., & Katoen, J. P. (2017). A new
proof rule for almost-sure termination. Proceedings of the ACM on Programming
Languages. Los Angeles, CA, United States: Association for Computing Machinery.
https://doi.org/10.1145/3158121'
chicago: Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost
P Katoen. “A New Proof Rule for Almost-Sure Termination.” Proceedings of the
ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158121.
ieee: A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule
for almost-sure termination,” Proceedings of the ACM on Programming Languages,
vol. 2, no. POPL. Association for Computing Machinery, 2017.
ista: Mciver A, Morgan C, Kaminski BL, Katoen JP. 2017. A new proof rule for almost-sure
termination. Proceedings of the ACM on Programming Languages. 2(POPL), 33.
mla: Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” Proceedings
of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for
Computing Machinery, 2017, doi:10.1145/3158121.
short: A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM
on Programming Languages 2 (2017).
conference:
end_date: 2018-01-13
location: Los Angeles, CA, United States
name: 'POPL: Programming Languages'
start_date: 2018-01-07
date_created: 2021-12-05T23:01:49Z
date_published: 2017-12-07T00:00:00Z
date_updated: 2021-12-07T08:04:14Z
day: '07'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/3158121
external_id:
arxiv:
- '1711.03588'
intvolume: ' 2'
issue: POPL
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/doi/10.1145/3158121
month: '12'
oa: 1
oa_version: Published Version
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: A new proof rule for almost-sure termination
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 2
year: '2017'
...
---
_id: '1063'
abstract:
- lang: eng
text: Severe environmental change can drive a population extinct unless the population
adapts in time to the new conditions (“evolutionary rescue”). How does biparental
sexual reproduction influence the chances of population persistence compared to
clonal reproduction or selfing? In this article, we set up a one‐locus two‐allele
model for adaptation in diploid species, where rescue is contingent on the establishment
of the mutant homozygote. Reproduction can occur by random mating, selfing, or
clonally. Random mating generates and destroys the rescue mutant; selfing is efficient
at generating it but at the same time depletes the heterozygote, which can lead
to a low mutant frequency in the standing genetic variation. Due to these (and
other) antagonistic effects, we find a nontrivial dependence of population survival
on the rate of sex/selfing, which is strongly influenced by the dominance coefficient
of the mutation before and after the environmental change. Importantly, since
mating with the wild‐type breaks the mutant homozygote up, a slow decay of the
wild‐type population size can impede rescue in randomly mating populations.
article_processing_charge: No
author:
- first_name: Hildegard
full_name: Uecker, Hildegard
id: 2DB8F68A-F248-11E8-B48F-1D18A9856A87
last_name: Uecker
orcid: 0000-0001-9435-2813
citation:
ama: Uecker H. Evolutionary rescue in randomly mating, selfing, and clonal populations.
Evolution. 2017;71(4):845-858. doi:10.1111/evo.13191
apa: Uecker, H. (2017). Evolutionary rescue in randomly mating, selfing, and clonal
populations. Evolution. Wiley-Blackwell. https://doi.org/10.1111/evo.13191
chicago: Uecker, Hildegard. “Evolutionary Rescue in Randomly Mating, Selfing, and
Clonal Populations.” Evolution. Wiley-Blackwell, 2017. https://doi.org/10.1111/evo.13191.
ieee: H. Uecker, “Evolutionary rescue in randomly mating, selfing, and clonal populations,”
Evolution, vol. 71, no. 4. Wiley-Blackwell, pp. 845–858, 2017.
ista: Uecker H. 2017. Evolutionary rescue in randomly mating, selfing, and clonal
populations. Evolution. 71(4), 845–858.
mla: Uecker, Hildegard. “Evolutionary Rescue in Randomly Mating, Selfing, and Clonal
Populations.” Evolution, vol. 71, no. 4, Wiley-Blackwell, 2017, pp. 845–58,
doi:10.1111/evo.13191.
short: H. Uecker, Evolution 71 (2017) 845–858.
date_created: 2018-12-11T11:49:57Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2025-05-28T11:42:51Z
day: '01'
department:
- _id: NiBa
doi: 10.1111/evo.13191
ec_funded: 1
external_id:
isi:
- '000398545200003'
intvolume: ' 71'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://biorxiv.org/content/early/2016/10/14/081042
month: '04'
oa: 1
oa_version: Submitted Version
page: 845 - 858
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Evolution
publication_identifier:
issn:
- '00143820'
publication_status: published
publisher: Wiley-Blackwell
publist_id: '6327'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolutionary rescue in randomly mating, selfing, and clonal populations
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 71
year: '2017'
...
---
_id: '1065'
abstract:
- lang: eng
text: 'We consider the problem of reachability in pushdown graphs. We study the
problem for pushdown graphs with constant treewidth. Even for pushdown graphs
with treewidth 1, for the reachability problem we establish the following: (i)
the problem is PTIME-complete, and (ii) any subcubic algorithm for the problem
would contradict the k-clique conjecture and imply faster combinatorial algorithms
for cliques in graphs.'
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: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
orcid: 0000-0002-8882-5116
citation:
ama: Chatterjee K, Osang GF. Pushdown reachability with constant treewidth. Information
Processing Letters. 2017;122:25-29. doi:10.1016/j.ipl.2017.02.003
apa: Chatterjee, K., & Osang, G. F. (2017). Pushdown reachability with constant
treewidth. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2017.02.003
chicago: Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with
Constant Treewidth.” Information Processing Letters. Elsevier, 2017. https://doi.org/10.1016/j.ipl.2017.02.003.
ieee: K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,”
Information Processing Letters, vol. 122. Elsevier, pp. 25–29, 2017.
ista: Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth.
Information Processing Letters. 122, 25–29.
mla: Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant
Treewidth.” Information Processing Letters, vol. 122, Elsevier, 2017, pp.
25–29, doi:10.1016/j.ipl.2017.02.003.
short: K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.
date_created: 2018-12-11T11:49:57Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-09-20T12:08:18Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
- _id: HeEd
doi: 10.1016/j.ipl.2017.02.003
ec_funded: 1
external_id:
isi:
- '000399506600005'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:17Z
date_updated: 2019-10-15T07:44:51Z
file_id: '4998'
file_name: IST-2018-991-v1+2_2018_Chatterjee_Pushdown_PREPRINT.pdf
file_size: 247657
relation: main_file
file_date_updated: 2019-10-15T07:44:51Z
has_accepted_license: '1'
intvolume: ' 122'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 25 - 29
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Information Processing Letters
publication_identifier:
issn:
- '00200190'
publication_status: published
publisher: Elsevier
publist_id: '6323'
pubrep_id: '991'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Pushdown reachability with constant treewidth
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 122
year: '2017'
...
---
_id: '1066'
abstract:
- lang: eng
text: "Simulation is an attractive alternative to language inclusion for automata
as it is an under-approximation of language inclusion, but usually has much lower
complexity. Simulation has also been extended in two orthogonal directions, namely,
(1) fair simulation, for simulation over specified set of infinite runs; and (2)
quantitative simulation, for simulation between weighted automata. While fair
trace inclusion is PSPACE-complete, fair simulation can be computed in polynomial
time. For weighted automata, the (quantitative) language inclusion problem is
undecidable in general, whereas the (quantitative) simulation reduces to quantitative
games, which admit pseudo-polynomial time algorithms.\r\n\r\nIn this work, we
study (quantitative) simulation for weighted automata with Büchi acceptance conditions,
i.e., we generalize fair simulation from non-weighted automata to weighted automata.
We show that imposing Büchi acceptance conditions on weighted automata changes
many fundamental properties of the simulation games, yet they still admit pseudo-polynomial
time algorithms."
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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative fair simulation
games. Information and Computation. 2017;254(2):143-166. doi:10.1016/j.ic.2016.10.006
apa: Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2017). Quantitative
fair simulation games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2016.10.006
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner.
“Quantitative Fair Simulation Games.” Information and Computation. Elsevier,
2017. https://doi.org/10.1016/j.ic.2016.10.006.
ieee: K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair
simulation games,” Information and Computation, vol. 254, no. 2. Elsevier,
pp. 143–166, 2017.
ista: Chatterjee K, Henzinger TA, Otop J, Velner Y. 2017. Quantitative fair simulation
games. Information and Computation. 254(2), 143–166.
mla: Chatterjee, Krishnendu, et al. “Quantitative Fair Simulation Games.” Information
and Computation, vol. 254, no. 2, Elsevier, 2017, pp. 143–66, doi:10.1016/j.ic.2016.10.006.
short: K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Information and Computation
254 (2017) 143–166.
date_created: 2018-12-11T11:49:58Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-09-20T12:07:48Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.ic.2016.10.006
ec_funded: 1
external_id:
isi:
- '000402025600002'
intvolume: ' 254'
isi: 1
issue: '2'
language:
- iso: eng
month: '06'
oa_version: None
page: 143 - 166
project:
- _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
- _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: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '6322'
quality_controlled: '1'
related_material:
record:
- id: '5428'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Quantitative fair simulation games
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 254
year: '2017'
...
---
_id: '1067'
abstract:
- lang: eng
text: Embryo morphogenesis relies on highly coordinated movements of different tissues.
However, remarkably little is known about how tissues coordinate their movements
to shape the embryo. In zebrafish embryogenesis, coordinated tissue movements
first become apparent during “doming,” when the blastoderm begins to spread over
the yolk sac, a process involving coordinated epithelial surface cell layer expansion
and mesenchymal deep cell intercalations. Here, we find that active surface cell
expansion represents the key process coordinating tissue movements during doming.
By using a combination of theory and experiments, we show that epithelial surface
cells not only trigger blastoderm expansion by reducing tissue surface tension,
but also drive blastoderm thinning by inducing tissue contraction through radial
deep cell intercalations. Thus, coordinated tissue expansion and thinning during
doming relies on surface cells simultaneously controlling tissue surface tension
and radial tissue contraction.
acknowledged_ssus:
- _id: PreCl
article_processing_charge: No
author:
- first_name: Hitoshi
full_name: Morita, Hitoshi
id: 4C6E54C6-F248-11E8-B48F-1D18A9856A87
last_name: Morita
- first_name: Silvia
full_name: Grigolon, Silvia
last_name: Grigolon
- first_name: Martin
full_name: Bock, Martin
last_name: Bock
- first_name: Gabriel
full_name: Krens, Gabriel
id: 2B819732-F248-11E8-B48F-1D18A9856A87
last_name: Krens
orcid: 0000-0003-4761-5996
- first_name: Guillaume
full_name: Salbreux, Guillaume
last_name: Salbreux
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Morita H, Grigolon S, Bock M, Krens G, Salbreux G, Heisenberg C-PJ. The physical
basis of coordinated tissue spreading in zebrafish gastrulation. Developmental
Cell. 2017;40(4):354-366. doi:10.1016/j.devcel.2017.01.010
apa: Morita, H., Grigolon, S., Bock, M., Krens, G., Salbreux, G., & Heisenberg,
C.-P. J. (2017). The physical basis of coordinated tissue spreading in zebrafish
gastrulation. Developmental Cell. Cell Press. https://doi.org/10.1016/j.devcel.2017.01.010
chicago: Morita, Hitoshi, Silvia Grigolon, Martin Bock, Gabriel Krens, Guillaume
Salbreux, and Carl-Philipp J Heisenberg. “The Physical Basis of Coordinated Tissue
Spreading in Zebrafish Gastrulation.” Developmental Cell. Cell Press, 2017.
https://doi.org/10.1016/j.devcel.2017.01.010.
ieee: H. Morita, S. Grigolon, M. Bock, G. Krens, G. Salbreux, and C.-P. J. Heisenberg,
“The physical basis of coordinated tissue spreading in zebrafish gastrulation,”
Developmental Cell, vol. 40, no. 4. Cell Press, pp. 354–366, 2017.
ista: Morita H, Grigolon S, Bock M, Krens G, Salbreux G, Heisenberg C-PJ. 2017.
The physical basis of coordinated tissue spreading in zebrafish gastrulation.
Developmental Cell. 40(4), 354–366.
mla: Morita, Hitoshi, et al. “The Physical Basis of Coordinated Tissue Spreading
in Zebrafish Gastrulation.” Developmental Cell, vol. 40, no. 4, Cell Press,
2017, pp. 354–66, doi:10.1016/j.devcel.2017.01.010.
short: H. Morita, S. Grigolon, M. Bock, G. Krens, G. Salbreux, C.-P.J. Heisenberg,
Developmental Cell 40 (2017) 354–366.
date_created: 2018-12-11T11:49:58Z
date_published: 2017-02-27T00:00:00Z
date_updated: 2023-09-20T12:06:27Z
day: '27'
ddc:
- '572'
- '597'
department:
- _id: CaHe
doi: 10.1016/j.devcel.2017.01.010
ec_funded: 1
external_id:
isi:
- '000395368300007'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:57Z
date_updated: 2018-12-12T10:10:57Z
file_id: '4849'
file_name: IST-2017-869-v1+1_1-s2.0-S1534580717300370-main.pdf
file_size: 6866187
relation: main_file
file_date_updated: 2018-12-12T10:10:57Z
has_accepted_license: '1'
intvolume: ' 40'
isi: 1
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '02'
oa: 1
oa_version: Published Version
page: 354 - 366
project:
- _id: 2524F500-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '201439'
name: Developing High-Throughput Bioassays for Human Cancers in Zebrafish
publication: Developmental Cell
publication_identifier:
issn:
- '15345807'
publication_status: published
publisher: Cell Press
publist_id: '6320'
pubrep_id: '869'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The physical basis of coordinated tissue spreading in zebrafish gastrulation
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: 40
year: '2017'
...
---
_id: '1072'
abstract:
- lang: eng
text: Given a finite set of points in Rn and a radius parameter, we study the Čech,
Delaunay–Čech, Delaunay (or alpha), and Wrap complexes in the light of generalized
discrete Morse theory. Establishing the Čech and Delaunay complexes as sublevel
sets of generalized discrete Morse functions, we prove that the four complexes
are simple-homotopy equivalent by a sequence of simplicial collapses, which are
explicitly described by a single discrete gradient field.
acknowledgement: This research has been supported by the EU project Toposys(FP7-ICT-318493-STREP),
by ESF under the ACAT Research Network Programme, by the Russian Government under
mega project 11.G34.31.0053, and by the DFG Collaborative Research Center SFB/TRR
109 “Discretization in Geometry and Dynamics”.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Bauer U, Edelsbrunner H. The Morse theory of Čech and delaunay complexes. Transactions
of the American Mathematical Society. 2017;369(5):3741-3762. doi:10.1090/tran/6991
apa: Bauer, U., & Edelsbrunner, H. (2017). The Morse theory of Čech and delaunay
complexes. Transactions of the American Mathematical Society. American
Mathematical Society. https://doi.org/10.1090/tran/6991
chicago: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and
Delaunay Complexes.” Transactions of the American Mathematical Society.
American Mathematical Society, 2017. https://doi.org/10.1090/tran/6991.
ieee: U. Bauer and H. Edelsbrunner, “The Morse theory of Čech and delaunay complexes,”
Transactions of the American Mathematical Society, vol. 369, no. 5. American
Mathematical Society, pp. 3741–3762, 2017.
ista: Bauer U, Edelsbrunner H. 2017. The Morse theory of Čech and delaunay complexes.
Transactions of the American Mathematical Society. 369(5), 3741–3762.
mla: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay
Complexes.” Transactions of the American Mathematical Society, vol. 369,
no. 5, American Mathematical Society, 2017, pp. 3741–62, doi:10.1090/tran/6991.
short: U. Bauer, H. Edelsbrunner, Transactions of the American Mathematical Society
369 (2017) 3741–3762.
date_created: 2018-12-11T11:49:59Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2023-09-20T12:05:56Z
day: '01'
department:
- _id: HeEd
doi: 10.1090/tran/6991
ec_funded: 1
external_id:
arxiv:
- '1312.1231'
isi:
- '000398030400024'
intvolume: ' 369'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1312.1231
month: '05'
oa: 1
oa_version: Preprint
page: 3741 - 3762
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Transactions of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
publist_id: '6311'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Morse theory of Čech and delaunay complexes
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 369
year: '2017'
...
---
_id: '1073'
abstract:
- lang: eng
text: Let X and Y be finite simplicial sets (e.g. finite simplicial complexes),
both equipped with a free simplicial action of a finite group G. Assuming that
Y is d-connected and dimX≤2d, for some d≥1, we provide an algorithm that computes
the set of all equivariant homotopy classes of equivariant continuous maps |X|→|Y|;
the existence of such a map can be decided even for dimX≤2d+1. This yields the
first algorithm for deciding topological embeddability of a k-dimensional finite
simplicial complex into Rn under the condition k≤23n−1. More generally, we present
an algorithm that, given a lifting-extension problem satisfying an appropriate
stability assumption, computes the set of all homotopy classes of solutions. This
result is new even in the non-equivariant situation.
article_processing_charge: No
author:
- first_name: Martin
full_name: Čadek, Martin
last_name: Čadek
- first_name: Marek
full_name: Krcál, Marek
id: 33E21118-F248-11E8-B48F-1D18A9856A87
last_name: Krcál
- first_name: Lukáš
full_name: Vokřínek, Lukáš
last_name: Vokřínek
citation:
ama: Čadek M, Krcál M, Vokřínek L. Algorithmic solvability of the lifting extension
problem. Discrete & Computational Geometry. 2017;54(4):915-965. doi:10.1007/s00454-016-9855-6
apa: Čadek, M., Krcál, M., & Vokřínek, L. (2017). Algorithmic solvability of
the lifting extension problem. Discrete & Computational Geometry. Springer.
https://doi.org/10.1007/s00454-016-9855-6
chicago: Čadek, Martin, Marek Krcál, and Lukáš Vokřínek. “Algorithmic Solvability
of the Lifting Extension Problem.” Discrete & Computational Geometry.
Springer, 2017. https://doi.org/10.1007/s00454-016-9855-6.
ieee: M. Čadek, M. Krcál, and L. Vokřínek, “Algorithmic solvability of the lifting
extension problem,” Discrete & Computational Geometry, vol. 54, no.
4. Springer, pp. 915–965, 2017.
ista: Čadek M, Krcál M, Vokřínek L. 2017. Algorithmic solvability of the lifting
extension problem. Discrete & Computational Geometry. 54(4), 915–965.
mla: Čadek, Martin, et al. “Algorithmic Solvability of the Lifting Extension Problem.”
Discrete & Computational Geometry, vol. 54, no. 4, Springer, 2017,
pp. 915–65, doi:10.1007/s00454-016-9855-6.
short: M. Čadek, M. Krcál, L. Vokřínek, Discrete & Computational Geometry 54
(2017) 915–965.
date_created: 2018-12-11T11:50:00Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-09-20T12:01:28Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-016-9855-6
external_id:
isi:
- '000400072700008'
intvolume: ' 54'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1307.6444
month: '06'
oa: 1
oa_version: Submitted Version
page: 915 - 965
publication: Discrete & Computational Geometry
publication_identifier:
issn:
- '01795376'
publication_status: published
publisher: Springer
publist_id: '6309'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithmic solvability of the lifting extension problem
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 54
year: '2017'
...
---
_id: '1074'
abstract:
- lang: eng
text: Recently it has become feasible to detect long blocks of nearly identical
sequence shared between pairs of genomes. These IBD blocks are direct traces of
recent coalescence events and, as such, contain ample signal to infer recent demography.
Here, we examine sharing of such blocks in two-dimensional populations with local
migration. Using a diffusion approximation to trace genetic ancestry, we derive
analytical formulae for patterns of isolation by distance of IBD blocks, which
can also incorporate recent population density changes. We introduce an inference
scheme that uses a composite likelihood approach to fit these formulae. We then
extensively evaluate our theory and inference method on a range of scenarios using
simulated data. We first validate the diffusion approximation by showing that
the theoretical results closely match the simulated block sharing patterns. We
then demonstrate that our inference scheme can accurately and robustly infer dispersal
rate and effective density, as well as bounds on recent dynamics of population
density. To demonstrate an application, we use our estimation scheme to explore
the fit of a diffusion model to Eastern European samples in the POPRES data set.
We show that ancestry diffusing with a rate of σ ≈ 50–100 km/√gen during the last
centuries, combined with accelerating population growth, can explain the observed
exponential decay of block sharing with increasing pairwise sample distance.
article_processing_charge: No
author:
- first_name: Harald
full_name: Ringbauer, Harald
id: 417FCFF4-F248-11E8-B48F-1D18A9856A87
last_name: Ringbauer
orcid: 0000-0002-4884-9682
- first_name: Graham
full_name: Coop, Graham
last_name: Coop
- 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: Ringbauer H, Coop G, Barton NH. Inferring recent demography from isolation
by distance of long shared sequence blocks. Genetics. 2017;205(3):1335-1351.
doi:10.1534/genetics.116.196220
apa: Ringbauer, H., Coop, G., & Barton, N. H. (2017). Inferring recent demography
from isolation by distance of long shared sequence blocks. Genetics. Genetics
Society of America. https://doi.org/10.1534/genetics.116.196220
chicago: Ringbauer, Harald, Graham Coop, and Nicholas H Barton. “Inferring Recent
Demography from Isolation by Distance of Long Shared Sequence Blocks.” Genetics.
Genetics Society of America, 2017. https://doi.org/10.1534/genetics.116.196220.
ieee: H. Ringbauer, G. Coop, and N. H. Barton, “Inferring recent demography from
isolation by distance of long shared sequence blocks,” Genetics, vol. 205,
no. 3. Genetics Society of America, pp. 1335–1351, 2017.
ista: Ringbauer H, Coop G, Barton NH. 2017. Inferring recent demography from isolation
by distance of long shared sequence blocks. Genetics. 205(3), 1335–1351.
mla: Ringbauer, Harald, et al. “Inferring Recent Demography from Isolation by Distance
of Long Shared Sequence Blocks.” Genetics, vol. 205, no. 3, Genetics Society
of America, 2017, pp. 1335–51, doi:10.1534/genetics.116.196220.
short: H. Ringbauer, G. Coop, N.H. Barton, Genetics 205 (2017) 1335–1351.
date_created: 2018-12-11T11:50:00Z
date_published: 2017-03-01T00:00:00Z
date_updated: 2025-05-28T11:42:51Z
day: '01'
department:
- _id: NiBa
doi: 10.1534/genetics.116.196220
ec_funded: 1
external_id:
isi:
- '000395807200023'
intvolume: ' 205'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.biorxiv.org/content/early/2016/09/23/076810
month: '03'
oa: 1
oa_version: Preprint
page: 1335 - 1351
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Genetics
publication_identifier:
issn:
- '00166731'
publication_status: published
publisher: Genetics Society of America
publist_id: '6307'
quality_controlled: '1'
related_material:
record:
- id: '200'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Inferring recent demography from isolation by distance of long shared sequence
blocks
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 205
year: '2017'
...
---
_id: '1076'
abstract:
- lang: eng
text: Signatures of the Coulomb corrections in the photoelectron momentum distribution
during laser-induced ionization of atoms or ions in tunneling and multiphoton
regimes are investigated analytically in the case of a one-dimensional problem.
A high-order Coulomb-corrected strong-field approximation is applied, where the
exact continuum state in the S matrix is approximated by the eikonal Coulomb-Volkov
state including the second-order corrections to the eikonal. Although without
high-order corrections our theory coincides with the known analytical R-matrix
(ARM) theory, we propose a simplified procedure for the matrix element derivation.
Rather than matching the eikonal Coulomb-Volkov wave function with the bound state
as in the ARM theory to remove the Coulomb singularity, we calculate the matrix
element via the saddle-point integration method by time as well as by coordinate,
and in this way avoiding the Coulomb singularity. The momentum shift in the photoelectron
momentum distribution with respect to the ARM theory due to high-order corrections
is analyzed for tunneling and multiphoton regimes. The relation of the quantum
corrections to the tunneling delay time is discussed.
article_number: '023403'
article_processing_charge: No
author:
- first_name: Michael
full_name: Klaiber, Michael
last_name: Klaiber
- first_name: Jiří
full_name: Daněk, Jiří
last_name: Daněk
- first_name: Enderalp
full_name: Yakaboylu, Enderalp
id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
last_name: Yakaboylu
orcid: 0000-0001-5973-0874
- first_name: Karen
full_name: Hatsagortsyan, Karen
last_name: Hatsagortsyan
- first_name: Christoph
full_name: Keitel, Christoph
last_name: Keitel
citation:
ama: Klaiber M, Daněk J, Yakaboylu E, Hatsagortsyan K, Keitel C. Strong-field ionization
via a high-order Coulomb-corrected strong-field approximation. Physical Review
A - Atomic, Molecular, and Optical Physics. 2017;95(2). doi:10.1103/PhysRevA.95.023403
apa: Klaiber, M., Daněk, J., Yakaboylu, E., Hatsagortsyan, K., & Keitel, C.
(2017). Strong-field ionization via a high-order Coulomb-corrected strong-field
approximation. Physical Review A - Atomic, Molecular, and Optical Physics.
American Physical Society. https://doi.org/10.1103/PhysRevA.95.023403
chicago: Klaiber, Michael, Jiří Daněk, Enderalp Yakaboylu, Karen Hatsagortsyan,
and Christoph Keitel. “Strong-Field Ionization via a High-Order Coulomb-Corrected
Strong-Field Approximation.” Physical Review A - Atomic, Molecular, and Optical
Physics. American Physical Society, 2017. https://doi.org/10.1103/PhysRevA.95.023403.
ieee: M. Klaiber, J. Daněk, E. Yakaboylu, K. Hatsagortsyan, and C. Keitel, “Strong-field
ionization via a high-order Coulomb-corrected strong-field approximation,”
Physical Review A - Atomic, Molecular, and Optical Physics, vol. 95, no. 2.
American Physical Society, 2017.
ista: Klaiber M, Daněk J, Yakaboylu E, Hatsagortsyan K, Keitel C. 2017. Strong-field
ionization via a high-order Coulomb-corrected strong-field approximation. Physical
Review A - Atomic, Molecular, and Optical Physics. 95(2), 023403.
mla: Klaiber, Michael, et al. “Strong-Field Ionization via a High-Order Coulomb-Corrected
Strong-Field Approximation.” Physical Review A - Atomic, Molecular, and Optical
Physics, vol. 95, no. 2, 023403, American Physical Society, 2017, doi:10.1103/PhysRevA.95.023403.
short: M. Klaiber, J. Daněk, E. Yakaboylu, K. Hatsagortsyan, C. Keitel, Physical
Review A - Atomic, Molecular, and Optical Physics 95 (2017).
date_created: 2018-12-11T11:50:01Z
date_published: 2017-02-01T00:00:00Z
date_updated: 2023-09-20T11:57:23Z
day: '01'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.95.023403
ec_funded: 1
external_id:
isi:
- '000400571700011'
intvolume: ' 95'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1609.07018
month: '02'
oa: 1
oa_version: Submitted Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: ' Physical Review A - Atomic, Molecular, and Optical Physics'
publication_identifier:
issn:
- '24699926'
publication_status: published
publisher: American Physical Society
publist_id: '6305'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strong-field ionization via a high-order Coulomb-corrected strong-field approximation
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 95
year: '2017'
...
---
_id: '1077'
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 fX174 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_number: '20160139'
article_processing_charge: Yes (in subscription journal)
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: Vladar, Harold
id: 2A181218-F248-11E8-B48F-1D18A9856A87
last_name: 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. Evolutionary interplay
between structure, energy and epistasis in the coat protein of the ϕX174 phage
family. Journal of the Royal Society Interface. 2017;14(126). doi:10.1098/rsif.2016.0139
apa: Fernandes Redondo, R. A., de Vladar, H., Włodarski, T., & Bollback, J.
P. (2017). Evolutionary interplay between structure, energy and epistasis in the
coat protein of the ϕX174 phage family. Journal of the Royal Society Interface.
Royal Society of London. https://doi.org/10.1098/rsif.2016.0139
chicago: Fernandes Redondo, Rodrigo A, Harold de Vladar, Tomasz Włodarski, and Jonathan
P Bollback. “Evolutionary Interplay between Structure, Energy and Epistasis in
the Coat Protein of the ΦX174 Phage Family.” Journal of the Royal Society Interface.
Royal Society of London, 2017. https://doi.org/10.1098/rsif.2016.0139.
ieee: R. A. Fernandes Redondo, H. de Vladar, T. Włodarski, and J. P. Bollback, “Evolutionary
interplay between structure, energy and epistasis in the coat protein of the ϕX174
phage family,” Journal of the Royal Society Interface, vol. 14, no. 126.
Royal Society of London, 2017.
ista: Fernandes Redondo RA, de Vladar H, Włodarski T, Bollback JP. 2017. Evolutionary
interplay between structure, energy and epistasis in the coat protein of the ϕX174
phage family. Journal of the Royal Society Interface. 14(126), 20160139.
mla: Fernandes Redondo, Rodrigo A., et al. “Evolutionary Interplay between Structure,
Energy and Epistasis in the Coat Protein of the ΦX174 Phage Family.” Journal
of the Royal Society Interface, vol. 14, no. 126, 20160139, Royal Society
of London, 2017, doi:10.1098/rsif.2016.0139.
short: R.A. Fernandes Redondo, H. de Vladar, T. Włodarski, J.P. Bollback, Journal
of the Royal Society Interface 14 (2017).
date_created: 2018-12-11T11:50:01Z
date_published: 2017-01-04T00:00:00Z
date_updated: 2025-05-28T11:42:51Z
day: '04'
ddc:
- '570'
department:
- _id: NiBa
- _id: JoBo
doi: 10.1098/rsif.2016.0139
ec_funded: 1
external_id:
isi:
- '000393380400001'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T09:14:02Z
date_updated: 2019-01-18T09:14:02Z
file_id: '5843'
file_name: 2017_JRSI_Redondo.pdf
file_size: 1092015
relation: main_file
success: 1
file_date_updated: 2019-01-18T09:14:02Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
issue: '126'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: 2578D616-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '648440'
name: Selective Barriers to Horizontal Gene Transfer
publication: Journal of the Royal Society Interface
publication_identifier:
issn:
- '17425689'
publication_status: published
publisher: Royal Society of London
publist_id: '6303'
quality_controlled: '1'
related_material:
record:
- id: '9864'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Evolutionary interplay between structure, energy and epistasis in the coat
protein of the ϕX174 phage family
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: 14
year: '2017'
...
---
_id: '1078'
abstract:
- lang: eng
text: 'One of the key questions in understanding plant development is how single
cells behave in a larger context of the tissue. Therefore, it requires the observation
of the whole organ with a high spatial- as well as temporal resolution over prolonged
periods of time, which may cause photo-toxic effects. This protocol shows a plant
sample preparation method for light-sheet microscopy, which is characterized by
mounting the plant vertically on the surface of a gel. The plant is mounted in
such a way that the roots are submerged in a liquid medium while the leaves remain
in the air. In order to ensure photosynthetic activity of the plant, a custom-made
lighting system illuminates the leaves. To keep the roots in darkness the water
surface is covered with sheets of black plastic foil. This method allows long-term
imaging of plant organ development in standardized conditions. '
acknowledged_ssus:
- _id: M-Shop
- _id: Bio
article_number: e55044
article_processing_charge: No
author:
- first_name: Daniel
full_name: Von Wangenheim, Daniel
id: 49E91952-F248-11E8-B48F-1D18A9856A87
last_name: Von Wangenheim
orcid: 0000-0002-6862-1247
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: von Wangenheim D, Hauschild R, Friml J. Light sheet fluorescence microscopy
of plant roots growing on the surface of a gel. Journal of visualized experiments
JoVE. 2017;2017(119). doi:10.3791/55044
apa: von Wangenheim, D., Hauschild, R., & Friml, J. (2017). Light sheet fluorescence
microscopy of plant roots growing on the surface of a gel. Journal of Visualized
Experiments JoVE. Journal of Visualized Experiments. https://doi.org/10.3791/55044
chicago: Wangenheim, Daniel von, Robert Hauschild, and Jiří Friml. “Light Sheet
Fluorescence Microscopy of Plant Roots Growing on the Surface of a Gel.” Journal
of Visualized Experiments JoVE. Journal of Visualized Experiments, 2017. https://doi.org/10.3791/55044.
ieee: D. von Wangenheim, R. Hauschild, and J. Friml, “Light sheet fluorescence microscopy
of plant roots growing on the surface of a gel,” Journal of visualized experiments
JoVE, vol. 2017, no. 119. Journal of Visualized Experiments, 2017.
ista: von Wangenheim D, Hauschild R, Friml J. 2017. Light sheet fluorescence microscopy
of plant roots growing on the surface of a gel. Journal of visualized experiments
JoVE. 2017(119), e55044.
mla: von Wangenheim, Daniel, et al. “Light Sheet Fluorescence Microscopy of Plant
Roots Growing on the Surface of a Gel.” Journal of Visualized Experiments JoVE,
vol. 2017, no. 119, e55044, Journal of Visualized Experiments, 2017, doi:10.3791/55044.
short: D. von Wangenheim, R. Hauschild, J. Friml, Journal of Visualized Experiments
JoVE 2017 (2017).
date_created: 2018-12-11T11:50:01Z
date_published: 2017-01-18T00:00:00Z
date_updated: 2025-05-07T11:12:33Z
day: '18'
ddc:
- '580'
department:
- _id: JiFr
- _id: Bio
doi: 10.3791/55044
ec_funded: 1
external_id:
isi:
- '000397847200041'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:31Z
date_updated: 2018-12-12T10:16:31Z
file_id: '5219'
file_name: IST-2017-808-v1+1_2017_VWangenheim_list.pdf
file_size: 57678
relation: main_file
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:32Z
date_updated: 2018-12-12T10:16:32Z
file_id: '5220'
file_name: IST-2017-808-v1+2_2017_VWangenheim_article.pdf
file_size: 1317820
relation: main_file
file_date_updated: 2018-12-12T10:16:32Z
has_accepted_license: '1'
intvolume: ' 2017'
isi: 1
issue: '119'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Journal of visualized experiments JoVE
publication_status: published
publisher: Journal of Visualized Experiments
publist_id: '6302'
pubrep_id: '808'
related_material:
record:
- id: '5565'
relation: popular_science
status: public
scopus_import: '1'
status: public
title: Light sheet fluorescence microscopy of plant roots growing on the surface of
a gel
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2017
year: '2017'
...
---
_id: '1079'
abstract:
- lang: eng
text: We study the ionization problem in the Thomas-Fermi-Dirac-von Weizsäcker theory
for atoms and molecules. We prove the nonexistence of minimizers for the energy
functional when the number of electrons is large and the total nuclear charge
is small. This nonexistence result also applies to external potentials decaying
faster than the Coulomb potential. In the case of arbitrary nuclear charges, we
obtain the nonexistence of stable minimizers and radial minimizers.
article_number: '6'
article_processing_charge: No
author:
- first_name: Phan
full_name: Nam, Phan
id: 404092F4-F248-11E8-B48F-1D18A9856A87
last_name: Nam
- first_name: Hanne
full_name: Van Den Bosch, Hanne
last_name: Van Den Bosch
citation:
ama: Nam P, Van Den Bosch H. Nonexistence in Thomas Fermi-Dirac-von Weizsäcker theory
with small nuclear charges. Mathematical Physics, Analysis and Geometry.
2017;20(2). doi:10.1007/s11040-017-9238-0
apa: Nam, P., & Van Den Bosch, H. (2017). Nonexistence in Thomas Fermi-Dirac-von
Weizsäcker theory with small nuclear charges. Mathematical Physics, Analysis
and Geometry. Springer. https://doi.org/10.1007/s11040-017-9238-0
chicago: Nam, Phan, and Hanne Van Den Bosch. “Nonexistence in Thomas Fermi-Dirac-von
Weizsäcker Theory with Small Nuclear Charges.” Mathematical Physics, Analysis
and Geometry. Springer, 2017. https://doi.org/10.1007/s11040-017-9238-0.
ieee: P. Nam and H. Van Den Bosch, “Nonexistence in Thomas Fermi-Dirac-von Weizsäcker
theory with small nuclear charges,” Mathematical Physics, Analysis and Geometry,
vol. 20, no. 2. Springer, 2017.
ista: Nam P, Van Den Bosch H. 2017. Nonexistence in Thomas Fermi-Dirac-von Weizsäcker
theory with small nuclear charges. Mathematical Physics, Analysis and Geometry.
20(2), 6.
mla: Nam, Phan, and Hanne Van Den Bosch. “Nonexistence in Thomas Fermi-Dirac-von
Weizsäcker Theory with Small Nuclear Charges.” Mathematical Physics, Analysis
and Geometry, vol. 20, no. 2, 6, Springer, 2017, doi:10.1007/s11040-017-9238-0.
short: P. Nam, H. Van Den Bosch, Mathematical Physics, Analysis and Geometry 20
(2017).
date_created: 2018-12-11T11:50:02Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-09-20T11:53:35Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s11040-017-9238-0
external_id:
isi:
- '000401270000004'
intvolume: ' 20'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1603.07368
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: Mathematical Physics, Analysis and Geometry
publication_identifier:
issn:
- '13850172'
publication_status: published
publisher: Springer
publist_id: '6300'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nonexistence in Thomas Fermi-Dirac-von Weizsäcker theory with small nuclear
charges
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 20
year: '2017'
...
---
_id: '1080'
abstract:
- lang: eng
text: Reconstructing the evolutionary history of metastases is critical for understanding
their basic biological principles and has profound clinical implications. Genome-wide
sequencing data has enabled modern phylogenomic methods to accurately dissect
subclones and their phylogenies from noisy and impure bulk tumour samples at unprecedented
depth. However, existing methods are not designed to infer metastatic seeding
patterns. Here we develop a tool, called Treeomics, to reconstruct the phylogeny
of metastases and map subclones to their anatomic locations. Treeomics infers
comprehensive seeding patterns for pancreatic, ovarian, and prostate cancers.
Moreover, Treeomics correctly disambiguates true seeding patterns from sequencing
artifacts; 7% of variants were misclassified by conventional statistical methods.
These artifacts can skew phylogenies by creating illusory tumour heterogeneity
among distinct samples. In silico benchmarking on simulated tumour phylogenies
across a wide range of sample purities (15–95%) and sequencing depths (25-800
× ) demonstrates the accuracy of Treeomics compared with existing methods.
article_number: '14114'
article_processing_charge: No
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Alvin
full_name: Makohon Moore, Alvin
last_name: Makohon Moore
- first_name: Jeffrey
full_name: Gerold, Jeffrey
last_name: Gerold
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Christine
full_name: Iacobuzio Donahue, Christine
last_name: Iacobuzio Donahue
- first_name: Bert
full_name: Vogelstein, Bert
last_name: Vogelstein
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Reiter J, Makohon Moore A, Gerold J, et al. Reconstructing metastatic seeding
patterns of human cancers. Nature Communications. 2017;8. doi:10.1038/ncomms14114
apa: Reiter, J., Makohon Moore, A., Gerold, J., Božić, I., Chatterjee, K., Iacobuzio
Donahue, C., … Nowak, M. (2017). Reconstructing metastatic seeding patterns of
human cancers. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14114
chicago: Reiter, Johannes, Alvin Makohon Moore, Jeffrey Gerold, Ivana Božić, Krishnendu
Chatterjee, Christine Iacobuzio Donahue, Bert Vogelstein, and Martin Nowak. “Reconstructing
Metastatic Seeding Patterns of Human Cancers.” Nature Communications. Nature
Publishing Group, 2017. https://doi.org/10.1038/ncomms14114.
ieee: J. Reiter et al., “Reconstructing metastatic seeding patterns of human
cancers,” Nature Communications, vol. 8. Nature Publishing Group, 2017.
ista: Reiter J, Makohon Moore A, Gerold J, Božić I, Chatterjee K, Iacobuzio Donahue
C, Vogelstein B, Nowak M. 2017. Reconstructing metastatic seeding patterns of
human cancers. Nature Communications. 8, 14114.
mla: Reiter, Johannes, et al. “Reconstructing Metastatic Seeding Patterns of Human
Cancers.” Nature Communications, vol. 8, 14114, Nature Publishing Group,
2017, doi:10.1038/ncomms14114.
short: J. Reiter, A. Makohon Moore, J. Gerold, I. Božić, K. Chatterjee, C. Iacobuzio
Donahue, B. Vogelstein, M. Nowak, Nature Communications 8 (2017).
date_created: 2018-12-11T11:50:02Z
date_published: 2017-01-31T00:00:00Z
date_updated: 2023-09-20T11:55:31Z
day: '31'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.1038/ncomms14114
ec_funded: 1
external_id:
isi:
- '000393096600001'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:15Z
date_updated: 2018-12-12T10:15:15Z
file_id: '5133'
file_name: IST-2017-786-v1+1_ncomms14114.pdf
file_size: 897050
relation: main_file
file_date_updated: 2018-12-12T10:15:15Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Nature Communications
publication_identifier:
issn:
- '20411723'
publication_status: published
publisher: Nature Publishing Group
publist_id: '6301'
pubrep_id: '786'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reconstructing metastatic seeding patterns of human cancers
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: 8
year: '2017'
...
---
_id: '941'
abstract:
- lang: eng
text: 'Recently there has been a proliferation of automated program repair (APR)
techniques, targeting various programming languages. Such techniques can be generally
classified into two families: syntactic- and semantics-based. Semantics-based
APR, on which we focus, typically uses symbolic execution to infer semantic constraints
and then program synthesis to construct repairs conforming to them. While syntactic-based
APR techniques have been shown successful on bugs in real-world programs written
in both C and Java, semantics-based APR techniques mostly target C programs. This
leaves empirical comparisons of the APR families not fully explored, and developers
without a Java-based semantics APR technique. We present JFix, a semantics-based
APR framework that targets Java, and an associated Eclipse plugin. JFix is implemented
atop Symbolic PathFinder, a well-known symbolic execution engine for Java programs.
It extends one particular APR technique (Angelix), and is designed to be sufficiently
generic to support a variety of such techniques. We demonstrate that semantics-based
APR can indeed efficiently and effectively repair a variety of classes of bugs
in large real-world Java programs. This supports our claim that the framework
can both support developers seeking semantics-based repair of bugs in Java programs,
as well as enable larger scale empirical studies comparing syntactic- and semantics-based
APR targeting Java. The demonstration of our tool is available via the project
website at: https://xuanbachle.github.io/semanticsrepair/ '
author:
- first_name: Xuan
full_name: Le, Xuan
last_name: Le
- first_name: Duc Hiep
full_name: Chu, Duc Hiep
id: 3598E630-F248-11E8-B48F-1D18A9856A87
last_name: Chu
- first_name: David
full_name: Lo, David
last_name: Lo
- first_name: Claire
full_name: Le Goues, Claire
last_name: Le Goues
- first_name: Willem
full_name: Visser, Willem
last_name: Visser
citation:
ama: 'Le X, Chu DH, Lo D, Le Goues C, Visser W. JFIX: Semantics-based repair of
Java programs via symbolic PathFinder. In: Proceedings of the 26th ACM SIGSOFT
International Symposium on Software Testing and Analysis. ACM; 2017:376-379.
doi:10.1145/3092703.3098225'
apa: 'Le, X., Chu, D. H., Lo, D., Le Goues, C., & Visser, W. (2017). JFIX: Semantics-based
repair of Java programs via symbolic PathFinder. In Proceedings of the 26th
ACM SIGSOFT International Symposium on Software Testing and Analysis (pp.
376–379). Santa Barbara, CA, United States: ACM. https://doi.org/10.1145/3092703.3098225'
chicago: 'Le, Xuan, Duc Hiep Chu, David Lo, Claire Le Goues, and Willem Visser.
“JFIX: Semantics-Based Repair of Java Programs via Symbolic PathFinder.” In Proceedings
of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis,
376–79. ACM, 2017. https://doi.org/10.1145/3092703.3098225.'
ieee: 'X. Le, D. H. Chu, D. Lo, C. Le Goues, and W. Visser, “JFIX: Semantics-based
repair of Java programs via symbolic PathFinder,” in Proceedings of the 26th
ACM SIGSOFT International Symposium on Software Testing and Analysis, Santa
Barbara, CA, United States, 2017, pp. 376–379.'
ista: 'Le X, Chu DH, Lo D, Le Goues C, Visser W. 2017. JFIX: Semantics-based repair
of Java programs via symbolic PathFinder. Proceedings of the 26th ACM SIGSOFT
International Symposium on Software Testing and Analysis. ISSTA: International
Symposium on Software Testing and Analysis, 376–379.'
mla: 'Le, Xuan, et al. “JFIX: Semantics-Based Repair of Java Programs via Symbolic
PathFinder.” Proceedings of the 26th ACM SIGSOFT International Symposium on
Software Testing and Analysis, ACM, 2017, pp. 376–79, doi:10.1145/3092703.3098225.'
short: X. Le, D.H. Chu, D. Lo, C. Le Goues, W. Visser, in:, Proceedings of the 26th
ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2017,
pp. 376–379.
conference:
end_date: 2017-07-14
location: Santa Barbara, CA, United States
name: 'ISSTA: International Symposium on Software Testing and Analysis'
start_date: 2017-07-10
date_created: 2018-12-11T11:49:19Z
date_published: 2017-07-10T00:00:00Z
date_updated: 2021-01-12T08:22:05Z
day: '10'
department:
- _id: ToHe
doi: 10.1145/3092703.3098225
language:
- iso: eng
month: '07'
oa_version: None
page: '376 - 379 '
project:
- _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: Proceedings of the 26th ACM SIGSOFT International Symposium on Software
Testing and Analysis
publication_status: published
publisher: ACM
publist_id: '6478'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'JFIX: Semantics-based repair of Java programs via symbolic PathFinder'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '942'
abstract:
- lang: eng
text: 'A notable class of techniques for automatic program repair is known as semantics-based.
Such techniques, e.g., Angelix, infer semantic specifications via symbolic execution,
and then use program synthesis to construct new code that satisfies those inferred
specifications. However, the obtained specifications are naturally incomplete,
leaving the synthesis engine with a difficult task of synthesizing a general solution
from a sparse space of many possible solutions that are consistent with the provided
specifications but that do not necessarily generalize. We present S3, a new repair
synthesis engine that leverages programming-by-examples methodology to synthesize
high-quality bug repairs. The novelty in S3 that allows it to tackle the sparse
search space to create more general repairs is three-fold: (1) A systematic way
to customize and constrain the syntactic search space via a domain-specific language,
(2) An efficient enumeration-based search strategy over the constrained search
space, and (3) A number of ranking features based on measures of the syntactic
and semantic distances between candidate solutions and the original buggy program.
We compare S3’s repair effectiveness with state-of-the-art synthesis engines Angelix,
Enumerative, and CVC4. S3 can successfully and correctly fix at least three times
more bugs than the best baseline on datasets of 52 bugs in small programs, and
100 bugs in real-world large programs. '
article_processing_charge: No
author:
- first_name: Xuan
full_name: Le, Xuan
last_name: Le
- first_name: Duc Hiep
full_name: Chu, Duc Hiep
id: 3598E630-F248-11E8-B48F-1D18A9856A87
last_name: Chu
- first_name: David
full_name: Lo, David
last_name: Lo
- first_name: Claire
full_name: Le Goues, Claire
last_name: Le Goues
- first_name: Willem
full_name: Visser, Willem
last_name: Visser
citation:
ama: 'Le X, Chu DH, Lo D, Le Goues C, Visser W. S3: Syntax- and semantic-guided
repair synthesis via programming by examples. In: Vol F130154. ACM; 2017:593-604.
doi:10.1145/3106237.3106309'
apa: 'Le, X., Chu, D. H., Lo, D., Le Goues, C., & Visser, W. (2017). S3: Syntax-
and semantic-guided repair synthesis via programming by examples (Vol. F130154,
pp. 593–604). Presented at the FSE: Foundations of Software Engineering, Paderborn,
Germany: ACM. https://doi.org/10.1145/3106237.3106309'
chicago: 'Le, Xuan, Duc Hiep Chu, David Lo, Claire Le Goues, and Willem Visser.
“S3: Syntax- and Semantic-Guided Repair Synthesis via Programming by Examples,”
F130154:593–604. ACM, 2017. https://doi.org/10.1145/3106237.3106309.'
ieee: 'X. Le, D. H. Chu, D. Lo, C. Le Goues, and W. Visser, “S3: Syntax- and semantic-guided
repair synthesis via programming by examples,” presented at the FSE: Foundations
of Software Engineering, Paderborn, Germany, 2017, vol. F130154, pp. 593–604.'
ista: 'Le X, Chu DH, Lo D, Le Goues C, Visser W. 2017. S3: Syntax- and semantic-guided
repair synthesis via programming by examples. FSE: Foundations of Software Engineering
vol. F130154, 593–604.'
mla: 'Le, Xuan, et al. S3: Syntax- and Semantic-Guided Repair Synthesis via Programming
by Examples. Vol. F130154, ACM, 2017, pp. 593–604, doi:10.1145/3106237.3106309.'
short: X. Le, D.H. Chu, D. Lo, C. Le Goues, W. Visser, in:, ACM, 2017, pp. 593–604.
conference:
end_date: 2017-09-08
location: Paderborn, Germany
name: 'FSE: Foundations of Software Engineering'
start_date: 2017-09-04
date_created: 2018-12-11T11:49:19Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-09-26T15:38:36Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/3106237.3106309
external_id:
isi:
- '000414279300055'
isi: 1
language:
- iso: eng
month: '09'
oa_version: None
page: 593 - 604
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_identifier:
isbn:
- 978-145035105-8
publication_status: published
publisher: ACM
publist_id: '6477'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'S3: Syntax- and semantic-guided repair synthesis via programming by examples'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: F130154
year: '2017'
...
---
_id: '943'
abstract:
- lang: eng
text: Like many developing tissues, the vertebrate neural tube is patterned by antiparallel
morphogen gradients. To understand how these inputs are interpreted, we measured
morphogen signaling and target gene expression in mouse embryos and chick ex vivo
assays. From these data, we derived and validated a characteristic decoding map
that relates morphogen input to the positional identity of neural progenitors.
Analysis of the observed responses indicates that the underlying interpretation
strategy minimizes patterning errors in response to the joint input of noisy opposing
gradients. We reverse-engineered a transcriptional network that provides a mechanistic
basis for the observed cell fate decisions and accounts for the precision and
dynamics of pattern formation. Together, our data link opposing gradient dynamics
in a growing tissue to precise pattern formation.
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: Yoji
full_name: Tabata, Yoji
last_name: Tabata
- first_name: Nathalie
full_name: Brandenberg, Nathalie
last_name: Brandenberg
- first_name: Matthias
full_name: Lutolf, Matthias
last_name: Lutolf
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Tobias
full_name: Bollenbach, Tobias
last_name: Bollenbach
- first_name: James
full_name: Briscoe, James
last_name: Briscoe
- first_name: Anna
full_name: Kicheva, Anna
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
citation:
ama: Zagórski MP, Tabata Y, Brandenberg N, et al. Decoding of position in the developing
neural tube from antiparallel morphogen gradients. Science. 2017;356(6345):1379-1383.
doi:10.1126/science.aam5887
apa: Zagórski, M. P., Tabata, Y., Brandenberg, N., Lutolf, M., Tkačik, G., Bollenbach,
T., … Kicheva, A. (2017). Decoding of position in the developing neural tube from
antiparallel morphogen gradients. Science. American Association for the
Advancement of Science. https://doi.org/10.1126/science.aam5887
chicago: Zagórski, Marcin P, Yoji Tabata, Nathalie Brandenberg, Matthias Lutolf,
Gašper Tkačik, Tobias Bollenbach, James Briscoe, and Anna Kicheva. “Decoding of
Position in the Developing Neural Tube from Antiparallel Morphogen Gradients.”
Science. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/science.aam5887.
ieee: M. P. Zagórski et al., “Decoding of position in the developing neural
tube from antiparallel morphogen gradients,” Science, vol. 356, no. 6345.
American Association for the Advancement of Science, pp. 1379–1383, 2017.
ista: Zagórski MP, Tabata Y, Brandenberg N, Lutolf M, Tkačik G, Bollenbach T, Briscoe
J, Kicheva A. 2017. Decoding of position in the developing neural tube from antiparallel
morphogen gradients. Science. 356(6345), 1379–1383.
mla: Zagórski, Marcin P., et al. “Decoding of Position in the Developing Neural
Tube from Antiparallel Morphogen Gradients.” Science, vol. 356, no. 6345,
American Association for the Advancement of Science, 2017, pp. 1379–83, doi:10.1126/science.aam5887.
short: M.P. Zagórski, Y. Tabata, N. Brandenberg, M. Lutolf, G. Tkačik, T. Bollenbach,
J. Briscoe, A. Kicheva, Science 356 (2017) 1379–1383.
date_created: 2018-12-11T11:49:20Z
date_published: 2017-06-30T00:00:00Z
date_updated: 2023-09-26T15:38:05Z
day: '30'
department:
- _id: AnKi
- _id: GaTk
doi: 10.1126/science.aam5887
ec_funded: 1
external_id:
isi:
- '000404351500036'
pmid:
- '28663499'
intvolume: ' 356'
isi: 1
issue: '6345'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5568706/
month: '06'
oa: 1
oa_version: Submitted Version
page: 1379 - 1383
pmid: 1
project:
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
- _id: B6FC0238-B512-11E9-945C-1524E6697425
call_identifier: H2020
grant_number: '680037'
name: Coordination of Patterning And Growth In the Spinal Cord
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 2524F500-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '201439'
name: Developing High-Throughput Bioassays for Human Cancers in Zebrafish
publication: Science
publication_identifier:
issn:
- '00368075'
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '6474'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Decoding of position in the developing neural tube from antiparallel morphogen
gradients
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 356
year: '2017'
...
---
_id: '944'
abstract:
- lang: eng
text: The concerted production of neurons and glia by neural stem cells (NSCs) is
essential for neural circuit assembly. In the developing cerebral cortex, radial
glia progenitors (RGPs) generate nearly all neocortical neurons and certain glia
lineages. RGP proliferation behavior shows a high degree of non-stochasticity,
thus a deterministic characteristic of neuron and glia production. However, the
cellular and molecular mechanisms controlling RGP behavior and proliferation dynamics
in neurogenesis and glia generation remain unknown. By using mosaic analysis with
double markers (MADM)-based genetic paradigms enabling the sparse and global knockout
with unprecedented single-cell resolution, we identified Lgl1 as a critical regulatory
component. We uncover Lgl1-dependent tissue-wide community effects required for
embryonic cortical neurogenesis and novel cell-autonomous Lgl1 functions controlling
RGP-mediated glia genesis and postnatal NSC behavior. These results suggest that
NSC-mediated neuron and glia production is tightly regulated through the concerted
interplay of sequential Lgl1-dependent global and cell intrinsic mechanisms.
acknowledged_ssus:
- _id: Bio
- _id: PreCl
article_processing_charge: No
author:
- first_name: Robert J
full_name: Beattie, Robert J
id: 2E26DF60-F248-11E8-B48F-1D18A9856A87
last_name: Beattie
orcid: 0000-0002-8483-8753
- first_name: Maria P
full_name: Postiglione, Maria P
id: 2C67902A-F248-11E8-B48F-1D18A9856A87
last_name: Postiglione
- first_name: Laura
full_name: Burnett, Laura
id: 3B717F68-F248-11E8-B48F-1D18A9856A87
last_name: Burnett
orcid: 0000-0002-8937-410X
- first_name: Susanne
full_name: Laukoter, Susanne
id: 2D6B7A9A-F248-11E8-B48F-1D18A9856A87
last_name: Laukoter
orcid: 0000-0002-7903-3010
- first_name: Carmen
full_name: Streicher, Carmen
id: 36BCB99C-F248-11E8-B48F-1D18A9856A87
last_name: Streicher
- first_name: Florian
full_name: Pauler, Florian
id: 48EA0138-F248-11E8-B48F-1D18A9856A87
last_name: Pauler
orcid: 0000-0002-7462-0048
- first_name: Guanxi
full_name: Xiao, Guanxi
last_name: Xiao
- first_name: Olga
full_name: Klezovitch, Olga
last_name: Klezovitch
- first_name: Valeri
full_name: Vasioukhin, Valeri
last_name: Vasioukhin
- first_name: Troy
full_name: Ghashghaei, Troy
last_name: Ghashghaei
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: Beattie RJ, Postiglione MP, Burnett L, et al. Mosaic analysis with double markers
reveals distinct sequential functions of Lgl1 in neural stem cells. Neuron.
2017;94(3):517-533.e3. doi:10.1016/j.neuron.2017.04.012
apa: Beattie, R. J., Postiglione, M. P., Burnett, L., Laukoter, S., Streicher, C.,
Pauler, F., … Hippenmeyer, S. (2017). Mosaic analysis with double markers reveals
distinct sequential functions of Lgl1 in neural stem cells. Neuron. Cell
Press. https://doi.org/10.1016/j.neuron.2017.04.012
chicago: Beattie, Robert J, Maria P Postiglione, Laura Burnett, Susanne Laukoter,
Carmen Streicher, Florian Pauler, Guanxi Xiao, et al. “Mosaic Analysis with Double
Markers Reveals Distinct Sequential Functions of Lgl1 in Neural Stem Cells.” Neuron.
Cell Press, 2017. https://doi.org/10.1016/j.neuron.2017.04.012.
ieee: R. J. Beattie et al., “Mosaic analysis with double markers reveals
distinct sequential functions of Lgl1 in neural stem cells,” Neuron, vol.
94, no. 3. Cell Press, p. 517–533.e3, 2017.
ista: Beattie RJ, Postiglione MP, Burnett L, Laukoter S, Streicher C, Pauler F,
Xiao G, Klezovitch O, Vasioukhin V, Ghashghaei T, Hippenmeyer S. 2017. Mosaic
analysis with double markers reveals distinct sequential functions of Lgl1 in
neural stem cells. Neuron. 94(3), 517–533.e3.
mla: Beattie, Robert J., et al. “Mosaic Analysis with Double Markers Reveals Distinct
Sequential Functions of Lgl1 in Neural Stem Cells.” Neuron, vol. 94, no.
3, Cell Press, 2017, p. 517–533.e3, doi:10.1016/j.neuron.2017.04.012.
short: R.J. Beattie, M.P. Postiglione, L. Burnett, S. Laukoter, C. Streicher, F.
Pauler, G. Xiao, O. Klezovitch, V. Vasioukhin, T. Ghashghaei, S. Hippenmeyer,
Neuron 94 (2017) 517–533.e3.
date_created: 2018-12-11T11:49:20Z
date_published: 2017-05-03T00:00:00Z
date_updated: 2023-09-26T15:37:02Z
day: '03'
department:
- _id: SiHi
- _id: MaJö
doi: 10.1016/j.neuron.2017.04.012
ec_funded: 1
external_id:
isi:
- '000400466700011'
intvolume: ' 94'
isi: 1
issue: '3'
language:
- iso: eng
month: '05'
oa_version: None
page: 517 - 533.e3
project:
- _id: 25D61E48-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618444'
name: Molecular Mechanisms of Cerebral Cortex Development
- _id: 25D7962E-B435-11E9-9278-68D0E5697425
grant_number: RGP0053/2014
name: Quantitative Structure-Function Analysis of Cerebral Cortex Assembly at Clonal
Level
publication: Neuron
publication_identifier:
issn:
- '08966273'
publication_status: published
publisher: Cell Press
publist_id: '6473'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mosaic analysis with double markers reveals distinct sequential functions of
Lgl1 in neural stem cells
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 94
year: '2017'
...
---
_id: '9445'
abstract:
- lang: eng
text: Cytosine methylation regulates essential genome functions across eukaryotes,
but the fundamental question of whether nucleosomal or naked DNA is the preferred
substrate of plant and animal methyltransferases remains unresolved. Here, we
show that genetic inactivation of a single DDM1/Lsh family nucleosome remodeler
biases methylation toward inter-nucleosomal linker DNA in Arabidopsis thaliana
and mouse. We find that DDM1 enables methylation of DNA bound to the nucleosome,
suggesting that nucleosome-free DNA is the preferred substrate of eukaryotic methyltransferases
in vivo. Furthermore, we show that simultaneous mutation of DDM1 and linker histone
H1 in Arabidopsis reproduces the strong linker-specific methylation patterns of
species that diverged from flowering plants and animals over a billion years ago.
Our results indicate that in the absence of remodeling, nucleosomes are strong
barriers to DNA methyltransferases. Linker-specific methylation can evolve simply
by breaking the connection between nucleosome remodeling and DNA methylation.
article_number: e30674
article_processing_charge: No
article_type: original
author:
- first_name: David B
full_name: Lyons, David B
last_name: Lyons
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Lyons DB, Zilberman D. DDM1 and Lsh remodelers allow methylation of DNA wrapped
in nucleosomes. eLife. 2017;6. doi:10.7554/elife.30674
apa: Lyons, D. B., & Zilberman, D. (2017). DDM1 and Lsh remodelers allow methylation
of DNA wrapped in nucleosomes. ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.30674
chicago: Lyons, David B, and Daniel Zilberman. “DDM1 and Lsh Remodelers Allow Methylation
of DNA Wrapped in Nucleosomes.” ELife. eLife Sciences Publications, 2017.
https://doi.org/10.7554/elife.30674.
ieee: D. B. Lyons and D. Zilberman, “DDM1 and Lsh remodelers allow methylation of
DNA wrapped in nucleosomes,” eLife, vol. 6. eLife Sciences Publications,
2017.
ista: Lyons DB, Zilberman D. 2017. DDM1 and Lsh remodelers allow methylation of
DNA wrapped in nucleosomes. eLife. 6, e30674.
mla: Lyons, David B., and Daniel Zilberman. “DDM1 and Lsh Remodelers Allow Methylation
of DNA Wrapped in Nucleosomes.” ELife, vol. 6, e30674, eLife Sciences Publications,
2017, doi:10.7554/elife.30674.
short: D.B. Lyons, D. Zilberman, ELife 6 (2017).
date_created: 2021-06-02T14:28:58Z
date_published: 2017-11-15T00:00:00Z
date_updated: 2021-12-14T07:54:36Z
day: '15'
ddc:
- '570'
department:
- _id: DaZi
doi: 10.7554/elife.30674
extern: '1'
external_id:
pmid:
- '29140247'
file:
- access_level: open_access
checksum: 4cfcdd67511ae4aed3d993550e46e146
content_type: application/pdf
creator: cziletti
date_created: 2021-06-02T14:33:36Z
date_updated: 2021-06-02T14:33:36Z
file_id: '9446'
file_name: 2017_eLife_Lyons.pdf
file_size: 1603102
relation: main_file
success: 1
file_date_updated: 2021-06-02T14:33:36Z
has_accepted_license: '1'
intvolume: ' 6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: eLife
publication_identifier:
eissn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: DDM1 and Lsh remodelers allow methylation of DNA wrapped in nucleosomes
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 6
year: '2017'
...
---
_id: '945'
abstract:
- lang: eng
text: While chromosome-wide dosage compensation of the X chromosome has been found
in many species, studies in ZW clades have indicated that compensation of the
Z is more localized and/or incomplete. In the ZW Lepidoptera, some species show
complete compensation of the Z chromosome, while others lack full equalization,
but what drives these inconsistencies is unclear. Here, we compare patterns of
male and female gene expression on the Z chromosome of two closely related butterfly
species, Papilio xuthus and Papilio machaon, and in multiple tissues of two moths
species, Plodia interpunctella and Bombyx mori, which were previously found to
differ in the extent to which they equalize Z-linked gene expression between the
sexes. We find that, while some species and tissues seem to have incomplete dosage
compensation, this is in fact due to the accumulation of male-biased genes and
the depletion of female-biased genes on the Z chromosome. Once this is accounted
for, the Z chromosome is fully compensated in all four species, through the up-regulation
of Z expression in females and in some cases additional down-regulation in males.
We further find that both sex-biased genes and Z-linked genes have increased rates
of expression divergence in this clade, and that this can lead to fast shifts
in patterns of gene expression even between closely related species. Taken together,
these results show that the uneven distribution of sex-biased genes on sex chromosomes
can confound conclusions about dosage compensation and that Z chromosome-wide
dosage compensation is not only possible but ubiquitous among Lepidoptera.
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Ann K
full_name: Huylmans, Ann K
id: 4C0A3874-F248-11E8-B48F-1D18A9856A87
last_name: Huylmans
orcid: 0000-0001-8871-4961
- first_name: Ariana
full_name: Macon, Ariana
id: 2A0848E2-F248-11E8-B48F-1D18A9856A87
last_name: Macon
- first_name: Beatriz
full_name: Vicoso, Beatriz
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
citation:
ama: Huylmans AK, Macon A, Vicoso B. Global dosage compensation is ubiquitous in
Lepidoptera, but counteracted by the masculinization of the Z chromosome. Molecular
Biology and Evolution. 2017;34(10):2637-2649. doi:10.1093/molbev/msx190
apa: Huylmans, A. K., Macon, A., & Vicoso, B. (2017). Global dosage compensation
is ubiquitous in Lepidoptera, but counteracted by the masculinization of the Z
chromosome. Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1093/molbev/msx190
chicago: Huylmans, Ann K, Ariana Macon, and Beatriz Vicoso. “Global Dosage Compensation
Is Ubiquitous in Lepidoptera, but Counteracted by the Masculinization of the Z
Chromosome.” Molecular Biology and Evolution. Oxford University Press,
2017. https://doi.org/10.1093/molbev/msx190.
ieee: A. K. Huylmans, A. Macon, and B. Vicoso, “Global dosage compensation is ubiquitous
in Lepidoptera, but counteracted by the masculinization of the Z chromosome,”
Molecular Biology and Evolution, vol. 34, no. 10. Oxford University Press,
pp. 2637–2649, 2017.
ista: Huylmans AK, Macon A, Vicoso B. 2017. Global dosage compensation is ubiquitous
in Lepidoptera, but counteracted by the masculinization of the Z chromosome. Molecular
Biology and Evolution. 34(10), 2637–2649.
mla: Huylmans, Ann K., et al. “Global Dosage Compensation Is Ubiquitous in Lepidoptera,
but Counteracted by the Masculinization of the Z Chromosome.” Molecular Biology
and Evolution, vol. 34, no. 10, Oxford University Press, 2017, pp. 2637–49,
doi:10.1093/molbev/msx190.
short: A.K. Huylmans, A. Macon, B. Vicoso, Molecular Biology and Evolution 34 (2017)
2637–2649.
date_created: 2018-12-11T11:49:20Z
date_published: 2017-07-06T00:00:00Z
date_updated: 2023-09-26T15:36:34Z
day: '06'
ddc:
- '570'
- '576'
department:
- _id: BeVi
doi: 10.1093/molbev/msx190
external_id:
isi:
- '000411814800016'
file:
- access_level: open_access
checksum: 009fd68043211d645ceb9d1de28274f2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:23Z
date_updated: 2020-07-14T12:48:15Z
file_id: '4810'
file_name: IST-2017-848-v1+1_2017_Vicoso_GlobalDosage.pdf
file_size: 462863
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 34'
isi: 1
issue: '10'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 2637 - 2649
project:
- _id: 250ED89C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28842-B22
name: Sex chromosome evolution under male- and female- heterogamety
publication: Molecular Biology and Evolution
publication_identifier:
issn:
- '07374038'
publication_status: published
publisher: Oxford University Press
publist_id: '6472'
pubrep_id: '848'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Global dosage compensation is ubiquitous in Lepidoptera, but counteracted by
the masculinization of the Z chromosome
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: 34
year: '2017'
...