---
_id: '11081'
abstract:
- lang: eng
text: In eukaryotic cells the nuclear genome is enclosed by the nuclear envelope
(NE). In metazoans, the NE breaks down in mitosis and it has been assumed that
the physical barrier separating nucleoplasm and cytoplasm remains intact during
the rest of the cell cycle and cell differentiation. However, recent studies suggest
that nonmitotic NE remodeling plays a critical role in development, virus infection,
laminopathies, and cancer. Although the mechanisms underlying these NE restructuring
events are currently being defined, one common theme is activation of protein
kinase C family members in the interphase nucleus to disrupt the nuclear lamina,
demonstrating the importance of the lamina in maintaining nuclear integrity.
article_processing_charge: No
article_type: review
author:
- first_name: Emily
full_name: Hatch, Emily
last_name: Hatch
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Hatch E, Hetzer M. Breaching the nuclear envelope in development and disease.
Journal of Cell Biology. 2014;205(2):133-141. doi:10.1083/jcb.201402003
apa: Hatch, E., & Hetzer, M. (2014). Breaching the nuclear envelope in development
and disease. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.201402003
chicago: Hatch, Emily, and Martin Hetzer. “Breaching the Nuclear Envelope in Development
and Disease.” Journal of Cell Biology. Rockefeller University Press, 2014.
https://doi.org/10.1083/jcb.201402003.
ieee: E. Hatch and M. Hetzer, “Breaching the nuclear envelope in development and
disease,” Journal of Cell Biology, vol. 205, no. 2. Rockefeller University
Press, pp. 133–141, 2014.
ista: Hatch E, Hetzer M. 2014. Breaching the nuclear envelope in development and
disease. Journal of Cell Biology. 205(2), 133–141.
mla: Hatch, Emily, and Martin Hetzer. “Breaching the Nuclear Envelope in Development
and Disease.” Journal of Cell Biology, vol. 205, no. 2, Rockefeller University
Press, 2014, pp. 133–41, doi:10.1083/jcb.201402003.
short: E. Hatch, M. Hetzer, Journal of Cell Biology 205 (2014) 133–141.
date_created: 2022-04-07T07:50:13Z
date_published: 2014-04-21T00:00:00Z
date_updated: 2024-10-14T11:23:23Z
day: '21'
doi: 10.1083/jcb.201402003
extern: '1'
external_id:
pmid:
- '24751535'
intvolume: ' 205'
issue: '2'
keyword:
- Cell Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1083/jcb.201402003
month: '04'
oa: 1
oa_version: Published Version
page: 133-141
pmid: 1
publication: Journal of Cell Biology
publication_identifier:
issn:
- 1540-8140
- 0021-9525
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Breaching the nuclear envelope in development and disease
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 205
year: '2014'
...
---
_id: '11082'
abstract:
- lang: eng
text: The nuclear pore complex (NPC) plays a critical role in gene expression by
mediating import of transcription regulators into the nucleus and export of RNA
transcripts to the cytoplasm. Emerging evidence suggests that in addition to mediating
transport, a subset of nucleoporins (Nups) engage in transcriptional activation
and elongation at genomic loci that are not associated with NPCs. The underlying
mechanism and regulation of Nup mobility on and off nuclear pores remain unclear.
Here we show that Nup50 is a mobile Nup with a pronounced presence both at the
NPC and in the nucleoplasm that can move between these different localizations.
Strikingly, the dynamic behavior of Nup50 in both locations is dependent on active
transcription by RNA polymerase II and requires the N-terminal half of the protein,
which contains importin α– and Nup153-binding domains. However, Nup50 dynamics
are independent of importin α, Nup153, and Nup98, even though the latter two proteins
also exhibit transcription-dependent mobility. Of interest, depletion of Nup50
from C2C12 myoblasts does not affect cell proliferation but inhibits differentiation
into myotubes. Taken together, our results suggest a transport-independent role
for Nup50 in chromatin biology that occurs away from the NPC.
article_processing_charge: No
article_type: original
author:
- first_name: Abigail L.
full_name: Buchwalter, Abigail L.
last_name: Buchwalter
- first_name: Yun
full_name: Liang, Yun
last_name: Liang
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Buchwalter AL, Liang Y, Hetzer M. Nup50 is required for cell differentiation
and exhibits transcription-dependent dynamics. Molecular Biology of the Cell.
2014;25(16):2472-2484. doi:10.1091/mbc.e14-04-0865
apa: Buchwalter, A. L., Liang, Y., & Hetzer, M. (2014). Nup50 is required for
cell differentiation and exhibits transcription-dependent dynamics. Molecular
Biology of the Cell. American Society for Cell Biology. https://doi.org/10.1091/mbc.e14-04-0865
chicago: Buchwalter, Abigail L., Yun Liang, and Martin Hetzer. “Nup50 Is Required
for Cell Differentiation and Exhibits Transcription-Dependent Dynamics.” Molecular
Biology of the Cell. American Society for Cell Biology, 2014. https://doi.org/10.1091/mbc.e14-04-0865.
ieee: A. L. Buchwalter, Y. Liang, and M. Hetzer, “Nup50 is required for cell differentiation
and exhibits transcription-dependent dynamics,” Molecular Biology of the Cell,
vol. 25, no. 16. American Society for Cell Biology, pp. 2472–2484, 2014.
ista: Buchwalter AL, Liang Y, Hetzer M. 2014. Nup50 is required for cell differentiation
and exhibits transcription-dependent dynamics. Molecular Biology of the Cell.
25(16), 2472–2484.
mla: Buchwalter, Abigail L., et al. “Nup50 Is Required for Cell Differentiation
and Exhibits Transcription-Dependent Dynamics.” Molecular Biology of the Cell,
vol. 25, no. 16, American Society for Cell Biology, 2014, pp. 2472–84, doi:10.1091/mbc.e14-04-0865.
short: A.L. Buchwalter, Y. Liang, M. Hetzer, Molecular Biology of the Cell 25 (2014)
2472–2484.
date_created: 2022-04-07T07:50:24Z
date_published: 2014-08-15T00:00:00Z
date_updated: 2024-10-14T11:23:34Z
day: '15'
doi: 10.1091/mbc.e14-04-0865
extern: '1'
intvolume: ' 25'
issue: '16'
keyword:
- Cell Biology
- Molecular Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1091/mbc.e14-04-0865
month: '08'
oa: 1
oa_version: Published Version
page: 2472-2484
publication: Molecular Biology of the Cell
publication_identifier:
issn:
- 1059-1524
- 1939-4586
publication_status: published
publisher: American Society for Cell Biology
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nup50 is required for cell differentiation and exhibits transcription-dependent
dynamics
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2014'
...
---
_id: '10382'
abstract:
- lang: eng
text: 'Protein oligomers have been implicated as toxic agents in a wide range of
amyloid-related diseases. However, it has remained unsolved whether the oligomers
are a necessary step in the formation of amyloid fibrils or just a dangerous byproduct.
Analogously, it has not been resolved if the amyloid nucleation process is a classical
one-step nucleation process or a two-step process involving prenucleation clusters.
We use coarse-grained computer simulations to study the effect of nonspecific
attractions between peptides on the primary nucleation process underlying amyloid
fibrillization. We find that, for peptides that do not attract, the classical
one-step nucleation mechanism is possible but only at nonphysiologically high
peptide concentrations. At low peptide concentrations, which mimic the physiologically
relevant regime, attractive interpeptide interactions are essential for fibril
formation. Nucleation then inevitably takes place through a two-step mechanism
involving prefibrillar oligomers. We show that oligomers not only help peptides
meet each other but also, create an environment that facilitates the conversion
of monomers into the β-sheet–rich form characteristic of fibrils. Nucleation typically
does not proceed through the most prevalent oligomers but through an oligomer
size that is only observed in rare fluctuations, which is why such aggregates
might be hard to capture experimentally. Finally, we find that the nucleation
of amyloid fibrils cannot be described by classical nucleation theory: in the
two-step mechanism, the critical nucleus size increases with increases in both
concentration and interpeptide interactions, which is in direct contrast with
predictions from classical nucleation theory.'
acknowledgement: We thank Michele Vendruscolo, Iskra Staneva, and William M. Jacobs,
for helpful discussions. A.Š. acknowledges support from the Human Frontier Science
Program and Emmanuel College. Y.C.C. and D.F. are supported by Engineering and Physical
Sciences Research Council Programme Grant EP/I001352/1. T.P.J.K. acknowledges the
Frances and Augustus Newman Foundation, the European Research Council, and the Biotechnology
and Biological Sciences Research Council. D.F. acknowledges European Research Council
Advanced Grant 227758.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Yassmine C.
full_name: Chebaro, Yassmine C.
last_name: Chebaro
- first_name: Tuomas P. J.
full_name: Knowles, Tuomas P. J.
last_name: Knowles
- first_name: Daan
full_name: Frenkel, Daan
last_name: Frenkel
citation:
ama: Šarić A, Chebaro YC, Knowles TPJ, Frenkel D. Crucial role of nonspecific interactions
in amyloid nucleation. Proceedings of the National Academy of Sciences.
2014;111(50):17869-17874. doi:10.1073/pnas.1410159111
apa: Šarić, A., Chebaro, Y. C., Knowles, T. P. J., & Frenkel, D. (2014). Crucial
role of nonspecific interactions in amyloid nucleation. Proceedings of the
National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1410159111
chicago: Šarić, Anđela, Yassmine C. Chebaro, Tuomas P. J. Knowles, and Daan Frenkel.
“Crucial Role of Nonspecific Interactions in Amyloid Nucleation.” Proceedings
of the National Academy of Sciences. National Academy of Sciences, 2014. https://doi.org/10.1073/pnas.1410159111.
ieee: A. Šarić, Y. C. Chebaro, T. P. J. Knowles, and D. Frenkel, “Crucial role of
nonspecific interactions in amyloid nucleation,” Proceedings of the National
Academy of Sciences, vol. 111, no. 50. National Academy of Sciences, pp. 17869–17874,
2014.
ista: Šarić A, Chebaro YC, Knowles TPJ, Frenkel D. 2014. Crucial role of nonspecific
interactions in amyloid nucleation. Proceedings of the National Academy of Sciences.
111(50), 17869–17874.
mla: Šarić, Anđela, et al. “Crucial Role of Nonspecific Interactions in Amyloid
Nucleation.” Proceedings of the National Academy of Sciences, vol. 111,
no. 50, National Academy of Sciences, 2014, pp. 17869–74, doi:10.1073/pnas.1410159111.
short: A. Šarić, Y.C. Chebaro, T.P.J. Knowles, D. Frenkel, Proceedings of the National
Academy of Sciences 111 (2014) 17869–17874.
date_created: 2021-11-29T13:09:53Z
date_published: 2014-12-01T00:00:00Z
date_updated: 2021-11-29T13:29:05Z
day: '01'
doi: 10.1073/pnas.1410159111
extern: '1'
external_id:
arxiv:
- '1412.0897'
pmid:
- '25453085'
intvolume: ' 111'
issue: '50'
keyword:
- multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.pnas.org/content/111/50/17869
month: '12'
oa: 1
oa_version: Published Version
page: 17869-17874
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Crucial role of nonspecific interactions in amyloid nucleation
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 111
year: '2014'
...
---
_id: '10383'
abstract:
- lang: eng
text: We use numerical simulations to compute the equation of state of a suspension
of spherical self-propelled nanoparticles in two and three dimensions. We study
in detail the effect of excluded volume interactions and confinement as a function
of the system's temperature, concentration, and strength of the propulsion. We
find a striking nonmonotonic dependence of the pressure on the temperature and
provide simple scaling arguments to predict and explain the occurrence of such
anomalous behavior. We explicitly show how our results have important implications
for the effective forces on passive components suspended in a bath of active particles.
article_number: '052303'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: S. A.
full_name: Mallory, S. A.
last_name: Mallory
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: C.
full_name: Valeriani, C.
last_name: Valeriani
- first_name: A.
full_name: Cacciuto, A.
last_name: Cacciuto
citation:
ama: Mallory SA, Šarić A, Valeriani C, Cacciuto A. Anomalous thermomechanical properties
of a self-propelled colloidal fluid. Physical Review E. 2014;89(5). doi:10.1103/physreve.89.052303
apa: Mallory, S. A., Šarić, A., Valeriani, C., & Cacciuto, A. (2014). Anomalous
thermomechanical properties of a self-propelled colloidal fluid. Physical Review
E. American Physical Society. https://doi.org/10.1103/physreve.89.052303
chicago: Mallory, S. A., Anđela Šarić, C. Valeriani, and A. Cacciuto. “Anomalous
Thermomechanical Properties of a Self-Propelled Colloidal Fluid.” Physical
Review E. American Physical Society, 2014. https://doi.org/10.1103/physreve.89.052303.
ieee: S. A. Mallory, A. Šarić, C. Valeriani, and A. Cacciuto, “Anomalous thermomechanical
properties of a self-propelled colloidal fluid,” Physical Review E, vol.
89, no. 5. American Physical Society, 2014.
ista: Mallory SA, Šarić A, Valeriani C, Cacciuto A. 2014. Anomalous thermomechanical
properties of a self-propelled colloidal fluid. Physical Review E. 89(5), 052303.
mla: Mallory, S. A., et al. “Anomalous Thermomechanical Properties of a Self-Propelled
Colloidal Fluid.” Physical Review E, vol. 89, no. 5, 052303, American Physical
Society, 2014, doi:10.1103/physreve.89.052303.
short: S.A. Mallory, A. Šarić, C. Valeriani, A. Cacciuto, Physical Review E 89 (2014).
date_created: 2021-11-29T13:10:33Z
date_published: 2014-05-06T00:00:00Z
date_updated: 2021-11-29T13:29:01Z
day: '06'
doi: 10.1103/physreve.89.052303
extern: '1'
external_id:
arxiv:
- '1310.0826'
pmid:
- '25353796'
intvolume: ' 89'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1310.0826
month: '05'
oa: 1
oa_version: Preprint
pmid: 1
publication: Physical Review E
publication_identifier:
eissn:
- 1550-2376
issn:
- 1539-3755
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anomalous thermomechanical properties of a self-propelled colloidal fluid
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 89
year: '2014'
...
---
_id: '2083'
abstract:
- lang: eng
text: Understanding the effects of sex and migration on adaptation to novel environments
remains a key problem in evolutionary biology. Using a single-cell alga Chlamydomonas
reinhardtii, we investigated how sex and migration affected rates of evolutionary
rescue in a sink environment, and subsequent changes in fitness following evolutionary
rescue. We show that sex and migration affect both the rate of evolutionary rescue
and subsequent adaptation. However, their combined effects change as the populations
adapt to a sink habitat. Both sex and migration independently increased rates
of evolutionary rescue, but the effect of sex on subsequent fitness improvements,
following initial rescue, changed with migration, as sex was beneficial in the
absence of migration but constraining adaptation when combined with migration.
These results suggest that sex and migration are beneficial during the initial
stages of adaptation, but can become detrimental as the population adapts to its
environment.
acknowledgement: The authors are grateful to the Leverhulme Trust (F/00 215/AW) for
funding this work.
article_processing_charge: No
article_type: original
author:
- first_name: Mato
full_name: Lagator, Mato
id: 345D25EC-F248-11E8-B48F-1D18A9856A87
last_name: Lagator
- first_name: Andrew
full_name: Morgan, Andrew
last_name: Morgan
- first_name: Paul
full_name: Neve, Paul
last_name: Neve
- first_name: Nick
full_name: Colegrave, Nick
last_name: Colegrave
citation:
ama: Lagator M, Morgan A, Neve P, Colegrave N. Role of sex and migration in adaptation
to sink environments. Evolution. 2014;68(8):2296-2305. doi:10.1111/evo.12440
apa: Lagator, M., Morgan, A., Neve, P., & Colegrave, N. (2014). Role of sex
and migration in adaptation to sink environments. Evolution. Wiley. https://doi.org/10.1111/evo.12440
chicago: Lagator, Mato, Andrew Morgan, Paul Neve, and Nick Colegrave. “Role of Sex
and Migration in Adaptation to Sink Environments.” Evolution. Wiley, 2014.
https://doi.org/10.1111/evo.12440.
ieee: M. Lagator, A. Morgan, P. Neve, and N. Colegrave, “Role of sex and migration
in adaptation to sink environments,” Evolution, vol. 68, no. 8. Wiley,
pp. 2296–2305, 2014.
ista: Lagator M, Morgan A, Neve P, Colegrave N. 2014. Role of sex and migration
in adaptation to sink environments. Evolution. 68(8), 2296–2305.
mla: Lagator, Mato, et al. “Role of Sex and Migration in Adaptation to Sink Environments.”
Evolution, vol. 68, no. 8, Wiley, 2014, pp. 2296–305, doi:10.1111/evo.12440.
short: M. Lagator, A. Morgan, P. Neve, N. Colegrave, Evolution 68 (2014) 2296–2305.
corr_author: '1'
date_created: 2018-12-11T11:55:36Z
date_published: 2014-04-25T00:00:00Z
date_updated: 2025-09-29T11:46:47Z
day: '25'
ddc:
- '570'
department:
- _id: CaGu
doi: 10.1111/evo.12440
external_id:
isi:
- '000340470600012'
file:
- access_level: open_access
checksum: 8d459b07e4a11bb5fde92d969184fe48
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T16:40:31Z
date_updated: 2020-07-14T12:45:28Z
file_id: '7845'
file_name: 2014_Evolution_Lagator.pdf
file_size: 467254
relation: main_file
file_date_updated: 2020-07-14T12:45:28Z
has_accepted_license: '1'
intvolume: ' 68'
isi: 1
issue: '8'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 2296 - 2305
publication: Evolution
publication_status: published
publisher: Wiley
publist_id: '4954'
quality_controlled: '1'
related_material:
record:
- id: '9747'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Role of sex and migration in adaptation to sink environments
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 68
year: '2014'
...
---
_id: '2086'
abstract:
- lang: eng
text: Pathogens may gain a fitness advantage through manipulation of the behaviour
of their hosts. Likewise, host behavioural changes can be a defence mechanism,
counteracting the impact of pathogens on host fitness. We apply harmonic radar
technology to characterize the impact of an emerging pathogen - Nosema ceranae
(Microsporidia) - on honeybee (Apis mellifera) flight and orientation performance
in the field. Honeybees are the most important commercial pollinators. Emerging
diseases have been proposed to play a prominent role in colony decline, partly
through sub-lethal behavioural manipulation of their hosts. We found that homing
success was significantly reduced in diseased (65.8%) versus healthy foragers
(92.5%). Although lost bees had significantly reduced continuous flight times
and prolonged resting times, other flight characteristics and navigational abilities
showed no significant difference between infected and non-infected bees. Our results
suggest that infected bees express normal flight characteristics but are constrained
in their homing ability, potentially compromising the colony by reducing its resource
inputs, but also counteracting the intra-colony spread of infection. We provide
the first high-resolution analysis of sub-lethal effects of an emerging disease
on insect flight behaviour. The potential causes and the implications for both
host and parasite are discussed.
acknowledgement: This study was funded jointly by a grant from BBSRC, Defra, NERC,
the Scottish Government and the Wellcome Trust, under the Insect Pollinators Initiative
(grant numbers BB/I00097/1 and BB/I000100/1). Rothamsted Research is a national
institute of bioscience strategically funded by the UK Biotechnology and Biological
Sciences Research Council (BBSRC).
article_number: e103989
article_processing_charge: No
author:
- first_name: Stephan
full_name: Wolf, Stephan
last_name: Wolf
- first_name: Dino
full_name: Mcmahon, Dino
last_name: Mcmahon
- first_name: Ka
full_name: Lim, Ka
last_name: Lim
- first_name: Christopher
full_name: Pull, Christopher
id: 3C7F4840-F248-11E8-B48F-1D18A9856A87
last_name: Pull
orcid: 0000-0003-1122-3982
- first_name: Suzanne
full_name: Clark, Suzanne
last_name: Clark
- first_name: Robert
full_name: Paxton, Robert
last_name: Paxton
- first_name: Juliet
full_name: Osborne, Juliet
last_name: Osborne
citation:
ama: 'Wolf S, Mcmahon D, Lim K, et al. So near and yet so far: Harmonic radar reveals
reduced homing ability of Nosema infected honeybees. PLoS One. 2014;9(8).
doi:10.1371/journal.pone.0103989'
apa: 'Wolf, S., Mcmahon, D., Lim, K., Pull, C., Clark, S., Paxton, R., & Osborne,
J. (2014). So near and yet so far: Harmonic radar reveals reduced homing ability
of Nosema infected honeybees. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0103989'
chicago: 'Wolf, Stephan, Dino Mcmahon, Ka Lim, Christopher Pull, Suzanne Clark,
Robert Paxton, and Juliet Osborne. “So near and yet so Far: Harmonic Radar Reveals
Reduced Homing Ability of Nosema Infected Honeybees.” PLoS One. Public
Library of Science, 2014. https://doi.org/10.1371/journal.pone.0103989.'
ieee: 'S. Wolf et al., “So near and yet so far: Harmonic radar reveals reduced
homing ability of Nosema infected honeybees,” PLoS One, vol. 9, no. 8.
Public Library of Science, 2014.'
ista: 'Wolf S, Mcmahon D, Lim K, Pull C, Clark S, Paxton R, Osborne J. 2014. So
near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected
honeybees. PLoS One. 9(8), e103989.'
mla: 'Wolf, Stephan, et al. “So near and yet so Far: Harmonic Radar Reveals Reduced
Homing Ability of Nosema Infected Honeybees.” PLoS One, vol. 9, no. 8,
e103989, Public Library of Science, 2014, doi:10.1371/journal.pone.0103989.'
short: S. Wolf, D. Mcmahon, K. Lim, C. Pull, S. Clark, R. Paxton, J. Osborne, PLoS
One 9 (2014).
date_created: 2018-12-11T11:55:37Z
date_published: 2014-08-06T00:00:00Z
date_updated: 2025-09-29T11:45:41Z
day: '06'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.1371/journal.pone.0103989
external_id:
isi:
- '000339995100042'
file:
- access_level: open_access
checksum: 2fc62c6739eada4bddf026afbae669db
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:55Z
date_updated: 2020-07-14T12:45:28Z
file_id: '5042'
file_name: IST-2016-437-v1+1_journal.pone.0103989.pdf
file_size: 1013386
relation: main_file
file_date_updated: 2020-07-14T12:45:28Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '8'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '4949'
pubrep_id: '437'
quality_controlled: '1'
related_material:
record:
- id: '9888'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema
infected honeybees'
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9
year: '2014'
...
---
OA_place: publisher
OA_type: free access
_id: '21102'
abstract:
- lang: eng
text: Racemates increase the chances of crystallization by allowing molecular contacts
to be formed in a greater number of ways. With the advent of protein synthesis,
the production of protein racemates and racemic‐protein crystallography are now
possible. Curiously, racemic DNA crystallography had not been investigated despite
the commercial availability of L- and D‐deoxyribo‐oligonucleotides. Here, we report
a study into racemic DNA crystallography showing the strong propensity of racemic
DNA mixtures to form racemic crystals. We describe racemic crystal structures
of various DNA sequences and folded conformations, including duplexes, quadruplexes,
and a four‐way junction, showing that the advantages of racemic crystallography
should extend to DNA.
article_processing_charge: No
article_type: original
author:
- first_name: Pradeep K
full_name: Mandal, Pradeep K
id: 6a3def15-d4b4-11ef-9fa9-a24c1f545ec3
last_name: Mandal
orcid: 0000-0001-5996-956X
- first_name: Gavin W.
full_name: Collie, Gavin W.
last_name: Collie
- first_name: Brice
full_name: Kauffmann, Brice
last_name: Kauffmann
- first_name: Ivan
full_name: Huc, Ivan
last_name: Huc
citation:
ama: Mandal PK, Collie GW, Kauffmann B, Huc I. Racemic DNA crystallography. Angewandte
Chemie International Edition. 2014;53(52):14424-14427. doi:10.1002/anie.201409014
apa: Mandal, P. K., Collie, G. W., Kauffmann, B., & Huc, I. (2014). Racemic
DNA crystallography. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201409014
chicago: Mandal, Pradeep K, Gavin W. Collie, Brice Kauffmann, and Ivan Huc. “Racemic
DNA Crystallography.” Angewandte Chemie International Edition. Wiley, 2014.
https://doi.org/10.1002/anie.201409014.
ieee: P. K. Mandal, G. W. Collie, B. Kauffmann, and I. Huc, “Racemic DNA crystallography,”
Angewandte Chemie International Edition, vol. 53, no. 52. Wiley, pp. 14424–14427,
2014.
ista: Mandal PK, Collie GW, Kauffmann B, Huc I. 2014. Racemic DNA crystallography.
Angewandte Chemie International Edition. 53(52), 14424–14427.
mla: Mandal, Pradeep K., et al. “Racemic DNA Crystallography.” Angewandte Chemie
International Edition, vol. 53, no. 52, Wiley, 2014, pp. 14424–27, doi:10.1002/anie.201409014.
short: P.K. Mandal, G.W. Collie, B. Kauffmann, I. Huc, Angewandte Chemie International
Edition 53 (2014) 14424–14427.
date_created: 2026-01-29T21:49:27Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2026-02-23T09:12:57Z
doi: 10.1002/anie.201409014
extern: '1'
has_accepted_license: '1'
intvolume: ' 53'
issue: '52'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/anie.201409014
month: '10'
oa: 1
oa_version: Published Version
page: 14424-14427
publication: Angewandte Chemie International Edition
publication_identifier:
eissn:
- 1521-3773
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Racemic DNA crystallography
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 53
year: '2014'
...
---
_id: '2115'
abstract:
- lang: eng
text: The facial performance of an individual is inherently rich in subtle deformation
and timing details. Although these subtleties make the performance realistic and
compelling, they often elude both motion capture and hand animation. We present
a technique for adding fine-scale details and expressiveness to low-resolution
art-directed facial performances, such as those created manually using a rig,
via marker-based capture, by fitting a morphable model to a video, or through
Kinect reconstruction using recent faceshift technology. We employ a high-resolution
facial performance capture system to acquire a representative performance of an
individual in which he or she explores the full range of facial expressiveness.
From the captured data, our system extracts an expressiveness model that encodes
subtle spatial and temporal deformation details specific to that particular individual.
Once this model has been built, these details can be transferred to low-resolution
art-directed performances. We demonstrate results on various forms of input; after
our enhancement, the resulting animations exhibit the same nuances and fine spatial
details as the captured performance, with optional temporal enhancement to match
the dynamics of the actor. Finally, we show that our technique outperforms the
current state-of-the-art in example-based facial animation.
article_number: '13'
article_processing_charge: No
author:
- first_name: Amit
full_name: Bermano, Amit
last_name: Bermano
- first_name: Derek
full_name: Bradley, Derek
last_name: Bradley
- first_name: Thabo
full_name: Beeler, Thabo
last_name: Beeler
- first_name: Fabio
full_name: Zund, Fabio
last_name: Zund
- first_name: Derek
full_name: Nowrouzezahrai, Derek
last_name: Nowrouzezahrai
- first_name: Ilya
full_name: Baran, Ilya
last_name: Baran
- first_name: Olga
full_name: Sorkine Hornung, Olga
last_name: Sorkine Hornung
- first_name: Hanspeter
full_name: Pfister, Hanspeter
last_name: Pfister
- first_name: Robert
full_name: Sumner, Robert
last_name: Sumner
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Markus
full_name: Groß, Markus
last_name: Groß
citation:
ama: Bermano A, Bradley D, Beeler T, et al. Facial performance enhancement using
dynamic shape space analysis. ACM Transactions on Graphics. 2014;33(2).
doi:10.1145/2546276
apa: Bermano, A., Bradley, D., Beeler, T., Zund, F., Nowrouzezahrai, D., Baran,
I., … Groß, M. (2014). Facial performance enhancement using dynamic shape space
analysis. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2546276
chicago: Bermano, Amit, Derek Bradley, Thabo Beeler, Fabio Zund, Derek Nowrouzezahrai,
Ilya Baran, Olga Sorkine Hornung, et al. “Facial Performance Enhancement Using
Dynamic Shape Space Analysis.” ACM Transactions on Graphics. ACM, 2014.
https://doi.org/10.1145/2546276.
ieee: A. Bermano et al., “Facial performance enhancement using dynamic shape
space analysis,” ACM Transactions on Graphics, vol. 33, no. 2. ACM, 2014.
ista: Bermano A, Bradley D, Beeler T, Zund F, Nowrouzezahrai D, Baran I, Sorkine
Hornung O, Pfister H, Sumner R, Bickel B, Groß M. 2014. Facial performance enhancement
using dynamic shape space analysis. ACM Transactions on Graphics. 33(2), 13.
mla: Bermano, Amit, et al. “Facial Performance Enhancement Using Dynamic Shape Space
Analysis.” ACM Transactions on Graphics, vol. 33, no. 2, 13, ACM, 2014,
doi:10.1145/2546276.
short: A. Bermano, D. Bradley, T. Beeler, F. Zund, D. Nowrouzezahrai, I. Baran,
O. Sorkine Hornung, H. Pfister, R. Sumner, B. Bickel, M. Groß, ACM Transactions
on Graphics 33 (2014).
date_created: 2018-12-11T11:55:48Z
date_published: 2014-03-01T00:00:00Z
date_updated: 2025-08-05T14:26:43Z
day: '01'
doi: 10.1145/2546276
extern: '1'
intvolume: ' 33'
issue: '2'
language:
- iso: eng
month: '03'
oa_version: None
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '4919'
status: public
title: Facial performance enhancement using dynamic shape space analysis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2014'
...
---
OA_type: closed access
_id: '21155'
abstract:
- lang: eng
text: The crystal structure of the tetradecanucleotide d(CCCCGGTACCGGGG)2 has previously
been reported as an A-type double helix at a resolution of 2.5 Å in space group
P41. Here, the structure of this sequence was determined at a significantly higher
resolution of 1.65 Å in space group P41212. The differences in crystal packing
between the former and latter are described. The crystallographic asymmetric unit
consists of one tetradecanucleotide duplex that spans more than one full turn
of the A-helix. This structure allowed the unambiguous identification of solvent
interactions.
article_processing_charge: No
article_type: original
author:
- first_name: Monica
full_name: Purushothaman, Monica
last_name: Purushothaman
- first_name: Anna
full_name: Varghese, Anna
last_name: Varghese
- first_name: Pradeep K
full_name: Mandal, Pradeep K
id: 6a3def15-d4b4-11ef-9fa9-a24c1f545ec3
last_name: Mandal
orcid: 0000-0001-5996-956X
- first_name: Namasivayam
full_name: Gautham, Namasivayam
last_name: Gautham
citation:
ama: Purushothaman M, Varghese A, Mandal PK, Gautham N. Structure of d(CCCCGGTACCGGGG)2
at 1.65 Å resolution. Acta Crystallographica Section F Structural Biology Communications.
2014;70(7):860-865. doi:10.1107/s2053230x1401084x
apa: Purushothaman, M., Varghese, A., Mandal, P. K., & Gautham, N. (2014). Structure
of d(CCCCGGTACCGGGG)2 at 1.65 Å resolution. Acta Crystallographica Section
F Structural Biology Communications. International Union of Crystallography.
https://doi.org/10.1107/s2053230x1401084x
chicago: Purushothaman, Monica, Anna Varghese, Pradeep K Mandal, and Namasivayam
Gautham. “Structure of d(CCCCGGTACCGGGG)2 at 1.65 Å Resolution.” Acta Crystallographica
Section F Structural Biology Communications. International Union of Crystallography,
2014. https://doi.org/10.1107/s2053230x1401084x.
ieee: M. Purushothaman, A. Varghese, P. K. Mandal, and N. Gautham, “Structure of
d(CCCCGGTACCGGGG)2 at 1.65 Å resolution,” Acta Crystallographica Section F
Structural Biology Communications, vol. 70, no. 7. International Union of
Crystallography, pp. 860–865, 2014.
ista: Purushothaman M, Varghese A, Mandal PK, Gautham N. 2014. Structure of d(CCCCGGTACCGGGG)2
at 1.65 Å resolution. Acta Crystallographica Section F Structural Biology Communications.
70(7), 860–865.
mla: Purushothaman, Monica, et al. “Structure of d(CCCCGGTACCGGGG)2 at 1.65 Å Resolution.”
Acta Crystallographica Section F Structural Biology Communications, vol.
70, no. 7, International Union of Crystallography, 2014, pp. 860–65, doi:10.1107/s2053230x1401084x.
short: M. Purushothaman, A. Varghese, P.K. Mandal, N. Gautham, Acta Crystallographica
Section F Structural Biology Communications 70 (2014) 860–865.
date_created: 2026-02-06T12:22:51Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2026-02-23T08:21:48Z
day: '01'
doi: 10.1107/s2053230x1401084x
extern: '1'
has_accepted_license: '1'
intvolume: ' 70'
issue: '7'
language:
- iso: eng
month: '07'
oa_version: None
page: 860-865
publication: Acta Crystallographica Section F Structural Biology Communications
publication_identifier:
issn:
- 2053-230X
publication_status: published
publisher: International Union of Crystallography
quality_controlled: '1'
status: public
title: Structure of d(CCCCGGTACCGGGG)2 at 1.65 Å resolution
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 70
year: '2014'
...
---
_id: '2131'
abstract:
- lang: eng
text: We study approximations to a class of vector-valued equations of Burgers type
driven by a multiplicative space-time white noise. A solution theory for this
class of equations has been developed recently in Probability Theory Related Fields
by Hairer and Weber. The key idea was to use the theory of controlled rough paths
to give definitions of weak/mild solutions and to set up a Picard iteration argument.
In this article the limiting behavior of a rather large class of (spatial) approximations
to these equations is studied. These approximations are shown to converge and
convergence rates are given, but the limit may depend on the particular choice
of approximation. This effect is a spatial analogue to the Itô-Stratonovich correction
in the theory of stochastic ordinary differential equations, where it is well
known that different approximation schemes may converge to different solutions.
acknowledgement: JM is supported by Rubicon grant 680-50-0901 of the Netherlands Organisation
for Scientific Research (NWO). MH is supported by EPSRC grant EP/D071593/1 and by
the Royal Society through a Wolfson Research Merit Award. Both MH and HW are supported
by the Le
article_processing_charge: No
arxiv: 1
author:
- first_name: Martin
full_name: Hairer, Martin
last_name: Hairer
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Hendrik
full_name: Weber, Hendrik
last_name: Weber
citation:
ama: Hairer M, Maas J, Weber H. Approximating rough stochastic PDEs. Communications
on Pure and Applied Mathematics. 2014;67(5):776-870. doi:10.1002/cpa.21495
apa: Hairer, M., Maas, J., & Weber, H. (2014). Approximating rough stochastic
PDEs. Communications on Pure and Applied Mathematics. Wiley. https://doi.org/10.1002/cpa.21495
chicago: Hairer, Martin, Jan Maas, and Hendrik Weber. “Approximating Rough Stochastic
PDEs.” Communications on Pure and Applied Mathematics. Wiley, 2014. https://doi.org/10.1002/cpa.21495.
ieee: M. Hairer, J. Maas, and H. Weber, “Approximating rough stochastic PDEs,” Communications
on Pure and Applied Mathematics, vol. 67, no. 5. Wiley, pp. 776–870, 2014.
ista: Hairer M, Maas J, Weber H. 2014. Approximating rough stochastic PDEs. Communications
on Pure and Applied Mathematics. 67(5), 776–870.
mla: Hairer, Martin, et al. “Approximating Rough Stochastic PDEs.” Communications
on Pure and Applied Mathematics, vol. 67, no. 5, Wiley, 2014, pp. 776–870,
doi:10.1002/cpa.21495.
short: M. Hairer, J. Maas, H. Weber, Communications on Pure and Applied Mathematics
67 (2014) 776–870.
date_created: 2018-12-11T11:55:53Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2025-08-05T14:22:59Z
day: '01'
doi: 10.1002/cpa.21495
extern: '1'
external_id:
arxiv:
- '1202.3094 '
intvolume: ' 67'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'http://arxiv.org/abs/1202.3094 '
month: '05'
oa: 1
oa_version: None
page: 776 - 870
publication: Communications on Pure and Applied Mathematics
publication_status: published
publisher: Wiley
publist_id: '4902'
status: public
title: Approximating rough stochastic PDEs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 67
year: '2014'
...
---
OA_place: repository
OA_type: green
_id: '2132'
abstract:
- lang: eng
text: We consider discrete porous medium equations of the form ∂tρt=Δϕ(ρt), where
Δ is the generator of a reversible continuous time Markov chain on a finite set
χ, and ϕ is an increasing function. We show that these equations arise as gradient
flows of certain entropy functionals with respect to suitable non-local transportation
metrics. This may be seen as a discrete analogue of the Wasserstein gradient flow
structure for porous medium equations in ℝn discovered by Otto. We present a one-dimensional
counterexample to geodesic convexity and discuss Gromov-Hausdorff convergence
to the Wasserstein metric.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Matthias
full_name: Erbar, Matthias
last_name: Erbar
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
citation:
ama: Erbar M, Maas J. Gradient flow structures for discrete porous medium equations.
Discrete and Continuous Dynamical Systems- Series A. 2014;34(4):1355-1374.
doi:10.3934/dcds.2014.34.1355
apa: Erbar, M., & Maas, J. (2014). Gradient flow structures for discrete porous
medium equations. Discrete and Continuous Dynamical Systems- Series A.
Southwest Missouri State University. https://doi.org/10.3934/dcds.2014.34.1355
chicago: Erbar, Matthias, and Jan Maas. “Gradient Flow Structures for Discrete Porous
Medium Equations.” Discrete and Continuous Dynamical Systems- Series A.
Southwest Missouri State University, 2014. https://doi.org/10.3934/dcds.2014.34.1355 .
ieee: M. Erbar and J. Maas, “Gradient flow structures for discrete porous medium
equations,” Discrete and Continuous Dynamical Systems- Series A, vol. 34,
no. 4. Southwest Missouri State University, pp. 1355–1374, 2014.
ista: Erbar M, Maas J. 2014. Gradient flow structures for discrete porous medium
equations. Discrete and Continuous Dynamical Systems- Series A. 34(4), 1355–1374.
mla: Erbar, Matthias, and Jan Maas. “Gradient Flow Structures for Discrete Porous
Medium Equations.” Discrete and Continuous Dynamical Systems- Series A,
vol. 34, no. 4, Southwest Missouri State University, 2014, pp. 1355–74, doi:10.3934/dcds.2014.34.1355
.
short: M. Erbar, J. Maas, Discrete and Continuous Dynamical Systems- Series A 34
(2014) 1355–1374.
date_created: 2018-12-11T11:55:54Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2025-08-05T14:24:47Z
day: '01'
doi: '10.3934/dcds.2014.34.1355 '
extern: '1'
external_id:
arxiv:
- '1212.1129'
intvolume: ' 34'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1212.1129
month: '04'
oa: 1
oa_version: Preprint
page: 1355 - 1374
publication: Discrete and Continuous Dynamical Systems- Series A
publication_status: published
publisher: Southwest Missouri State University
publist_id: '4903'
status: public
title: Gradient flow structures for discrete porous medium equations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2014'
...
---
_id: '2133'
abstract:
- lang: eng
text: "Let ℭ denote the Clifford algebra over ℝ\U0001D45B, which is the von Neumann
algebra generated by n self-adjoint operators Q j , j = 1,…,n satisfying the canonical
anticommutation relations, Q i Q j + Q j Q i = 2δ ij I, and let τ denote the
normalized trace on ℭ. This algebra arises in quantum mechanics as the algebra
of observables generated by n fermionic degrees of freedom. Let \U0001D513 denote
the set of all positive operators \U0001D70C∈ℭ such that τ(ρ) = 1; these are the
non-commutative analogs of probability densities in the non-commutative probability
space (ℭ,\U0001D70F). The fermionic Fokker–Planck equation is a quantum-mechanical
analog of the classical Fokker–Planck equation with which it has much in common,
such as the same optimal hypercontractivity properties. In this paper we construct
a Riemannian metric on \U0001D513 that we show to be a natural analog of the classical
2-Wasserstein metric, and we show that, in analogy with the classical case, the
fermionic Fokker–Planck equation is gradient flow in this metric for the relative
entropy with respect to the ground state. We derive a number of consequences of
this, such as a sharp Talagrand inequality for this metric, and we prove a number
of results pertaining to this metric. Several open problems are raised."
author:
- first_name: Eric
full_name: Carlen, Eric
last_name: Carlen
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
citation:
ama: Carlen E, Maas J. An analog of the 2-Wasserstein metric in non-commutative
probability under which the fermionic Fokker-Planck equation is gradient flow
for the entropy. Communications in Mathematical Physics. 2014;331(3):887-926.
doi:10.1007/s00220-014-2124-8
apa: Carlen, E., & Maas, J. (2014). An analog of the 2-Wasserstein metric in
non-commutative probability under which the fermionic Fokker-Planck equation is
gradient flow for the entropy. Communications in Mathematical Physics.
Springer. https://doi.org/10.1007/s00220-014-2124-8
chicago: Carlen, Eric, and Jan Maas. “An Analog of the 2-Wasserstein Metric in Non-Commutative
Probability under Which the Fermionic Fokker-Planck Equation Is Gradient Flow
for the Entropy.” Communications in Mathematical Physics. Springer, 2014.
https://doi.org/10.1007/s00220-014-2124-8.
ieee: E. Carlen and J. Maas, “An analog of the 2-Wasserstein metric in non-commutative
probability under which the fermionic Fokker-Planck equation is gradient flow
for the entropy,” Communications in Mathematical Physics, vol. 331, no.
3. Springer, pp. 887–926, 2014.
ista: Carlen E, Maas J. 2014. An analog of the 2-Wasserstein metric in non-commutative
probability under which the fermionic Fokker-Planck equation is gradient flow
for the entropy. Communications in Mathematical Physics. 331(3), 887–926.
mla: Carlen, Eric, and Jan Maas. “An Analog of the 2-Wasserstein Metric in Non-Commutative
Probability under Which the Fermionic Fokker-Planck Equation Is Gradient Flow
for the Entropy.” Communications in Mathematical Physics, vol. 331, no.
3, Springer, 2014, pp. 887–926, doi:10.1007/s00220-014-2124-8.
short: E. Carlen, J. Maas, Communications in Mathematical Physics 331 (2014) 887–926.
date_created: 2018-12-11T11:55:54Z
date_published: 2014-11-01T00:00:00Z
date_updated: 2021-01-12T06:55:30Z
day: '01'
doi: 10.1007/s00220-014-2124-8
extern: '1'
intvolume: ' 331'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'http://arxiv.org/abs/1203.5377 '
month: '11'
oa: 1
oa_version: Submitted Version
page: 887 - 926
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4901'
quality_controlled: '1'
status: public
title: An analog of the 2-Wasserstein metric in non-commutative probability under
which the fermionic Fokker-Planck equation is gradient flow for the entropy
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 331
year: '2014'
...
---
_id: '2140'
abstract:
- lang: eng
text: We propose a technique for engineering momentum-dependent dissipation in Bose-Einstein
condensates with non-local interactions. The scheme relies on the use of momentum-dependent
dark-states in close analogy to velocity-selective coherent population trapping.
During the short-time dissipative dynamics, the system is driven into a particular
finite-momentum phonon mode, which in real space corresponds to an ordered structure
with non-local density-density correlations. Dissipation-induced ordering can
be observed and studied in present-day experiments using cold atoms with dipole-dipole
or off-resonant Rydberg interactions. Due to its dissipative nature, the ordering
does not require artificial breaking of translational symmetry by an opticallattice
or harmonic trap. This opens up a perspective of direct cooling of quantum gases
into strongly-interacting phases.
acknowledgement: This work was supported by NSF through a grant for the Institute
for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and
Smithsonian Astrophysical Observatory as well as the Harvard Quantum Optics Center.
article_number: '070401'
author:
- first_name: Johannes
full_name: Otterbach, Johannes
last_name: Otterbach
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Otterbach J, Lemeshko M. Dissipative preparation of spatial order in Rydberg-dressed
Bose-Einstein condensates. Physical Review Letters. 2014;113(7). doi:10.1103/PhysRevLett.113.070401
apa: Otterbach, J., & Lemeshko, M. (2014). Dissipative preparation of spatial
order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters.
American Physical Society. https://doi.org/10.1103/PhysRevLett.113.070401
chicago: Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of
Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review
Letters. American Physical Society, 2014. https://doi.org/10.1103/PhysRevLett.113.070401.
ieee: J. Otterbach and M. Lemeshko, “Dissipative preparation of spatial order in
Rydberg-dressed Bose-Einstein condensates,” Physical Review Letters, vol.
113, no. 7. American Physical Society, 2014.
ista: Otterbach J, Lemeshko M. 2014. Dissipative preparation of spatial order in
Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 113(7), 070401.
mla: Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial
Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review Letters,
vol. 113, no. 7, 070401, American Physical Society, 2014, doi:10.1103/PhysRevLett.113.070401.
short: J. Otterbach, M. Lemeshko, Physical Review Letters 113 (2014).
date_created: 2018-12-11T11:55:56Z
date_published: 2014-08-11T00:00:00Z
date_updated: 2021-01-12T06:55:33Z
day: '11'
doi: 10.1103/PhysRevLett.113.070401
extern: '1'
intvolume: ' 113'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1308.5905
month: '08'
oa: 1
oa_version: Submitted Version
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '4884'
status: public
title: Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2014'
...
---
_id: '2141'
abstract:
- lang: eng
text: The computation of the winning set for Büchi objectives in alternating games
on graphs is a central problem in computer-aided verification with a large number
of applications. The long-standing best known upper bound for solving the problem
is Õ(n ⋅ m), where n is the number of vertices and m is the number of edges in
the graph. We are the first to break the Õ(n ⋅ m) boundary by presenting a new
technique that reduces the running time to O(n2). This bound also leads to O(n2)-time
algorithms for computing the set of almost-sure winning vertices for Büchi objectives
(1) in alternating games with probabilistic transitions (improving an earlier
bound of Õ(n ⋅ m)), (2) in concurrent graph games with constant actions (improving
an earlier bound of O(n3)), and (3) in Markov decision processes (improving for
m>n4/3 an earlier bound of O(m ⋅ √m)). We then show how to maintain the winning
set for Büchi objectives in alternating games under a sequence of edge insertions
or a sequence of edge deletions in O(n) amortized time per operation. Our algorithms
are the first dynamic algorithms for this problem. We then consider another core
graph theoretic problem in verification of probabilistic systems, namely computing
the maximal end-component decomposition of a graph. We present two improved static
algorithms for the maximal end-component decomposition problem. Our first algorithm
is an O(m ⋅ √m)-time algorithm, and our second algorithm is an O(n2)-time algorithm
which is obtained using the same technique as for alternating Büchi games. Thus,
we obtain an O(min &lcu;m ⋅ √m,n2})-time algorithm improving the long-standing
O(n ⋅ m) time bound. Finally, we show how to maintain the maximal end-component
decomposition of a graph under a sequence of edge insertions or a sequence of
edge deletions in O(n) amortized time per edge deletion, and O(m) worst-case time
per edge insertion. Again, our algorithms are the first dynamic algorithms for
this problem.
article_number: a15
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
citation:
ama: Chatterjee K, Henzinger M. Efficient and dynamic algorithms for alternating
Büchi games and maximal end-component decomposition. Journal of the ACM.
2014;61(3). doi:10.1145/2597631
apa: Chatterjee, K., & Henzinger, M. (2014). Efficient and dynamic algorithms
for alternating Büchi games and maximal end-component decomposition. Journal
of the ACM. ACM. https://doi.org/10.1145/2597631
chicago: Chatterjee, Krishnendu, and Monika Henzinger. “Efficient and Dynamic Algorithms
for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal
of the ACM. ACM, 2014. https://doi.org/10.1145/2597631.
ieee: K. Chatterjee and M. Henzinger, “Efficient and dynamic algorithms for alternating
Büchi games and maximal end-component decomposition,” Journal of the ACM,
vol. 61, no. 3. ACM, 2014.
ista: Chatterjee K, Henzinger M. 2014. Efficient and dynamic algorithms for alternating
Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3),
a15.
mla: Chatterjee, Krishnendu, and Monika Henzinger. “Efficient and Dynamic Algorithms
for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal
of the ACM, vol. 61, no. 3, a15, ACM, 2014, doi:10.1145/2597631.
short: K. Chatterjee, M. Henzinger, Journal of the ACM 61 (2014).
date_created: 2018-12-11T11:55:57Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2025-09-29T11:45:13Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/2597631
ec_funded: 1
external_id:
isi:
- '000337201400001'
intvolume: ' 61'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprints.cs.univie.ac.at/3933/
month: '05'
oa: 1
oa_version: Submitted 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: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '4883'
quality_controlled: '1'
related_material:
record:
- id: '3165'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Efficient and dynamic algorithms for alternating Büchi games and maximal end-component
decomposition
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 61
year: '2014'
...
---
_id: '2153'
abstract:
- lang: eng
text: 'We define a simple, explicit map sending a morphism f : M → N of pointwise
finite dimensional persistence modules to a matching between the barcodes of M
and N. Our main result is that, in a precise sense, the quality of this matching
is tightly controlled by the lengths of the longest intervals in the barcodes
of ker f and coker f . As an immediate corollary, we obtain a new proof of the
algebraic stability theorem for persistence barcodes [5, 9], a fundamental result
in the theory of persistent homology. In contrast to previous proofs, ours shows
explicitly how a δ-interleaving morphism between two persistence modules induces
a δ-matching between the barcodes of the two modules. Our main result also specializes
to a structure theorem for submodules and quotients of persistence modules. Copyright
is held by the owner/author(s).'
article_processing_charge: No
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: Michael
full_name: Lesnick, Michael
last_name: Lesnick
citation:
ama: 'Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability
of persistence. In: Proceedings of the Annual Symposium on Computational Geometry.
ACM; 2014:355-364. doi:10.1145/2582112.2582168'
apa: 'Bauer, U., & Lesnick, M. (2014). Induced matchings of barcodes and the
algebraic stability of persistence. In Proceedings of the Annual Symposium
on Computational Geometry (pp. 355–364). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582168'
chicago: Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and
the Algebraic Stability of Persistence.” In Proceedings of the Annual Symposium
on Computational Geometry, 355–64. ACM, 2014. https://doi.org/10.1145/2582112.2582168.
ieee: U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic
stability of persistence,” in Proceedings of the Annual Symposium on Computational
Geometry, Kyoto, Japan, 2014, pp. 355–364.
ista: 'Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic
stability of persistence. Proceedings of the Annual Symposium on Computational
Geometry. SoCG: Symposium on Computational Geometry, 355–364.'
mla: Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the
Algebraic Stability of Persistence.” Proceedings of the Annual Symposium on
Computational Geometry, ACM, 2014, pp. 355–64, doi:10.1145/2582112.2582168.
short: U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 355–364.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
date_created: 2018-12-11T11:56:01Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2025-06-11T07:57:54Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582168
ec_funded: 1
external_id:
arxiv:
- '1311.3681'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1311.3681
month: '06'
oa: 1
oa_version: Submitted Version
page: 355 - 364
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4853'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Induced matchings of barcodes and the algebraic stability of persistence
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2154'
abstract:
- lang: eng
text: A result of Boros and Füredi (d = 2) and of Bárány (arbitrary d) asserts that
for every d there exists cd > 0 such that for every n-point set P ⊂ ℝd, some
point of ℝd is covered by at least (Formula presented.) of the d-simplices spanned
by the points of P. The largest possible value of cd has been the subject of ongoing
research. Recently Gromov improved the existing lower bounds considerably by introducing
a new, topological proof method. We provide an exposition of the combinatorial
component of Gromov's approach, in terms accessible to combinatorialists and discrete
geometers, and we investigate the limits of his method. In particular, we give
tighter bounds on the cofilling profiles for the (n - 1)-simplex. These bounds
yield a minor improvement over Gromov's lower bounds on cd for large d, but they
also show that the room for further improvement through the cofilling profiles
alone is quite small. We also prove a slightly better lower bound for c3 by an
approach using an additional structure besides the cofilling profiles. We formulate
a combinatorial extremal problem whose solution might perhaps lead to a tight
lower bound for cd.
acknowledgement: Swiss National Science Foundation (SNF 200021-125309, 200020-138230,
200020-12507)
article_processing_charge: No
arxiv: 1
author:
- first_name: Jiří
full_name: Matoušek, Jiří
last_name: Matoušek
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Matoušek J, Wagner U. On Gromov’s method of selecting heavily covered points.
Discrete & Computational Geometry. 2014;52(1):1-33. doi:10.1007/s00454-014-9584-7
apa: Matoušek, J., & Wagner, U. (2014). On Gromov’s method of selecting heavily
covered points. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-014-9584-7
chicago: Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily
Covered Points.” Discrete & Computational Geometry. Springer, 2014.
https://doi.org/10.1007/s00454-014-9584-7.
ieee: J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered
points,” Discrete & Computational Geometry, vol. 52, no. 1. Springer,
pp. 1–33, 2014.
ista: Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered
points. Discrete & Computational Geometry. 52(1), 1–33.
mla: Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered
Points.” Discrete & Computational Geometry, vol. 52, no. 1, Springer,
2014, pp. 1–33, doi:10.1007/s00454-014-9584-7.
short: J. Matoušek, U. Wagner, Discrete & Computational Geometry 52 (2014) 1–33.
date_created: 2018-12-11T11:56:01Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2025-09-29T11:44:29Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-014-9584-7
external_id:
arxiv:
- '1102.3515'
isi:
- '000339382600001'
intvolume: ' 52'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1102.3515
month: '07'
oa: 1
oa_version: Submitted Version
page: 1 - 33
project:
- _id: 25FA3206-B435-11E9-9278-68D0E5697425
grant_number: PP00P2_138948
name: 'Embeddings in Higher Dimensions: Algorithms and Combinatorics'
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '4852'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On Gromov's method of selecting heavily covered points
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 52
year: '2014'
...
---
_id: '2155'
abstract:
- lang: eng
text: Given a finite set of points in Rn and a positive radius, we study the Čech,
Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete
Morse theory. We prove that the latter three complexes are simple-homotopy equivalent.
Our results have applications in topological data analysis and in the reconstruction
of shapes from sampled data. Copyright is held by the owner/author(s).
acknowledgement: This research is partially supported by ESF under the ACAT Research
Network Programme, and by the Russian Government under mega project 11.G34.31.0053
article_processing_charge: No
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 filtrations.
In: Proceedings of the Annual Symposium on Computational Geometry. ACM;
2014:484-490. doi:10.1145/2582112.2582167'
apa: 'Bauer, U., & Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay
filtrations. In Proceedings of the Annual Symposium on Computational Geometry
(pp. 484–490). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582167'
chicago: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and
Delaunay Filtrations.” In Proceedings of the Annual Symposium on Computational
Geometry, 484–90. ACM, 2014. https://doi.org/10.1145/2582112.2582167.
ieee: U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,”
in Proceedings of the Annual Symposium on Computational Geometry, Kyoto,
Japan, 2014, pp. 484–490.
ista: 'Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations.
Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium
on Computational Geometry, 484–490.'
mla: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay
Filtrations.” Proceedings of the Annual Symposium on Computational Geometry,
ACM, 2014, pp. 484–90, doi:10.1145/2582112.2582167.
short: U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 484–490.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
corr_author: '1'
date_created: 2018-12-11T11:56:01Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2025-06-11T07:58:27Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582167
ec_funded: 1
external_id:
arxiv:
- '1312.1231'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1312.1231
month: '06'
oa: 1
oa_version: Submitted Version
page: 484 - 490
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4851'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The morse theory of Čech and Delaunay filtrations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2156'
abstract:
- lang: eng
text: We propose a metric for Reeb graphs, called the functional distortion distance.
Under this distance, the Reeb graph is stable against small changes of input functions.
At the same time, it remains discriminative at differentiating input functions.
In particular, the main result is that the functional distortion distance between
two Reeb graphs is bounded from below by the bottleneck distance between both
the ordinary and extended persistence diagrams for appropriate dimensions. As
an application of our results, we analyze a natural simplification scheme for
Reeb graphs, and show that persistent features in Reeb graph remains persistent
under simplification. Understanding the stability of important features of the
Reeb graph under simplification is an interesting problem on its own right, and
critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s).
acknowledgement: National Science Foundation under grants CCF-1319406, CCF-1116258.
article_processing_charge: No
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: Xiaoyin
full_name: Ge, Xiaoyin
last_name: Ge
- first_name: Yusu
full_name: Wang, Yusu
last_name: Wang
citation:
ama: 'Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: Proceedings
of the Annual Symposium on Computational Geometry. ACM; 2014:464-473. doi:10.1145/2582112.2582169'
apa: 'Bauer, U., Ge, X., & Wang, Y. (2014). Measuring distance between Reeb
graphs. In Proceedings of the Annual Symposium on Computational Geometry
(pp. 464–473). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582169'
chicago: Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb
Graphs.” In Proceedings of the Annual Symposium on Computational Geometry,
464–73. ACM, 2014. https://doi.org/10.1145/2582112.2582169.
ieee: U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in
Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan,
2014, pp. 464–473.
ista: 'Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings
of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational
Geometry, 464–473.'
mla: Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” Proceedings
of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–73,
doi:10.1145/2582112.2582169.
short: U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 464–473.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
date_created: 2018-12-11T11:56:02Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2025-06-11T07:58:42Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582169
ec_funded: 1
external_id:
arxiv:
- '1307.2839'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1307.2839
month: '06'
oa: 1
oa_version: Submitted Version
page: 464 - 473
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4850'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Measuring distance between Reeb graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2157'
abstract:
- lang: eng
text: 'We show that the following algorithmic problem is decidable: given a 2-dimensional
simplicial complex, can it be embedded (topologically, or equivalently, piecewise
linearly) in ℝ3? By a known reduction, it suffices to decide the embeddability
of a given triangulated 3-manifold X into the 3-sphere S3. The main step, which
allows us to simplify X and recurse, is in proving that if X can be embedded in
S3, then there is also an embedding in which X has a short meridian, i.e., an
essential curve in the boundary of X bounding a disk in S3 nX with length bounded
by a computable function of the number of tetrahedra of X.'
acknowledgement: ERC Advanced Grant No. 267165; Grant GRADR Eurogiga GIG/11/E023 (SNSF-PP00P2-138948);
Swiss National Science Foundation (SNSF-200020-138230).
article_processing_charge: No
arxiv: 1
author:
- first_name: Jiří
full_name: Matoušek, Jiří
last_name: Matoušek
- first_name: Eric
full_name: Sedgwick, Eric
last_name: Sedgwick
- first_name: Martin
full_name: Tancer, Martin
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Matoušek J, Sedgwick E, Tancer M, Wagner U. Embeddability in the 3 sphere
is decidable. In: Proceedings of the Annual Symposium on Computational Geometry.
ACM; 2014:78-84. doi:10.1145/2582112.2582137'
apa: 'Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2014). Embeddability
in the 3 sphere is decidable. In Proceedings of the Annual Symposium on Computational
Geometry (pp. 78–84). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582137'
chicago: Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability
in the 3 Sphere Is Decidable.” In Proceedings of the Annual Symposium on Computational
Geometry, 78–84. ACM, 2014. https://doi.org/10.1145/2582112.2582137.
ieee: J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the
3 sphere is decidable,” in Proceedings of the Annual Symposium on Computational
Geometry, Kyoto, Japan, 2014, pp. 78–84.
ista: 'Matoušek J, Sedgwick E, Tancer M, Wagner U. 2014. Embeddability in the 3
sphere is decidable. Proceedings of the Annual Symposium on Computational Geometry.
SoCG: Symposium on Computational Geometry, 78–84.'
mla: Matoušek, Jiří, et al. “Embeddability in the 3 Sphere Is Decidable.” Proceedings
of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84, doi:10.1145/2582112.2582137.
short: J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, in:, Proceedings of the Annual
Symposium on Computational Geometry, ACM, 2014, pp. 78–84.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
date_created: 2018-12-11T11:56:02Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2025-06-11T07:59:02Z
day: '01'
department:
- _id: UlWa
doi: 10.1145/2582112.2582137
external_id:
arxiv:
- '1402.0815'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1402.0815
month: '06'
oa: 1
oa_version: Submitted Version
page: 78 - 84
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4849'
quality_controlled: '1'
related_material:
record:
- id: '425'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Embeddability in the 3 sphere is decidable
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2158'
abstract:
- lang: eng
text: Directional guidance of migrating cells is relatively well explored in the
reductionist setting of cell culture experiments. Here spatial gradients of chemical
cues as well as gradients of mechanical substrate characteristics prove sufficient
to attract single cells as well as their collectives. How such gradients present
and act in the context of an organism is far less clear. Here we review recent
advances in understanding how guidance cues emerge and operate in the physiological
context.
acknowledgement: This effort was supported by the Intramural Research Program of the
Center for Cancer Research, NCI, National Institutes of Health and the European
Research Council (ERC).
article_processing_charge: No
author:
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Carole
full_name: Parent, Carole
last_name: Parent
citation:
ama: Majumdar R, Sixt MK, Parent C. New paradigms in the establishment and maintenance
of gradients during directed cell migration. Current Opinion in Cell Biology.
2014;30(1):33-40. doi:10.1016/j.ceb.2014.05.010
apa: Majumdar, R., Sixt, M. K., & Parent, C. (2014). New paradigms in the establishment
and maintenance of gradients during directed cell migration. Current Opinion
in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2014.05.010
chicago: Majumdar, Ritankar, Michael K Sixt, and Carole Parent. “New Paradigms in
the Establishment and Maintenance of Gradients during Directed Cell Migration.”
Current Opinion in Cell Biology. Elsevier, 2014. https://doi.org/10.1016/j.ceb.2014.05.010.
ieee: R. Majumdar, M. K. Sixt, and C. Parent, “New paradigms in the establishment
and maintenance of gradients during directed cell migration,” Current Opinion
in Cell Biology, vol. 30, no. 1. Elsevier, pp. 33–40, 2014.
ista: Majumdar R, Sixt MK, Parent C. 2014. New paradigms in the establishment and
maintenance of gradients during directed cell migration. Current Opinion in Cell
Biology. 30(1), 33–40.
mla: Majumdar, Ritankar, et al. “New Paradigms in the Establishment and Maintenance
of Gradients during Directed Cell Migration.” Current Opinion in Cell Biology,
vol. 30, no. 1, Elsevier, 2014, pp. 33–40, doi:10.1016/j.ceb.2014.05.010.
short: R. Majumdar, M.K. Sixt, C. Parent, Current Opinion in Cell Biology 30 (2014)
33–40.
date_created: 2018-12-11T11:56:03Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2025-09-29T11:43:11Z
day: '01'
department:
- _id: MiSi
doi: 10.1016/j.ceb.2014.05.010
external_id:
isi:
- '000343620300006'
pmid:
- '24959970'
intvolume: ' 30'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4177954/
month: '10'
oa: 1
oa_version: Submitted Version
page: 33 - 40
pmid: 1
publication: Current Opinion in Cell Biology
publication_status: published
publisher: Elsevier
publist_id: '4848'
quality_controlled: '1'
scopus_import: '1'
status: public
title: New paradigms in the establishment and maintenance of gradients during directed
cell migration
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 30
year: '2014'
...