---
_id: '3405'
abstract:
- lang: eng
text: Glutamate is the major excitatory neurotransmitter in the mammalian central
nervous system and gates non-selective cation channels. The origins of glutamate
receptors are not well understood as they differ structurally and functionally
from simple bacterial ligand-gated ion channels. Here we report the discovery
of an ionotropic glutamate receptor that combines the typical eukaryotic domain
architecture with the 'TXVGYG' signature sequence of the selectivity filter found
in K+ channels. This receptor exhibits functional properties intermediate between
bacterial and eukaryotic glutamate-gated ion channels, suggesting a link in the
evolution of ionotropic glutamate receptors.
article_processing_charge: No
author:
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Guillaume
full_name: Sandoz, Guillaume
last_name: Sandoz
- first_name: Ehud
full_name: Isacoff, Ehud
last_name: Isacoff
citation:
ama: Janovjak HL, Sandoz G, Isacoff E. Modern ionotropic glutamate receptor with
a K+ selectivity signature sequence. Nature Communications. 2011;2(232):1-6.
doi:10.1038/ncomms1231
apa: Janovjak, H. L., Sandoz, G., & Isacoff, E. (2011). Modern ionotropic glutamate
receptor with a K+ selectivity signature sequence. Nature Communications.
Nature Publishing Group. https://doi.org/10.1038/ncomms1231
chicago: Janovjak, Harald L, Guillaume Sandoz, and Ehud Isacoff. “Modern Ionotropic
Glutamate Receptor with a K+ Selectivity Signature Sequence.” Nature Communications.
Nature Publishing Group, 2011. https://doi.org/10.1038/ncomms1231.
ieee: H. L. Janovjak, G. Sandoz, and E. Isacoff, “Modern ionotropic glutamate receptor
with a K+ selectivity signature sequence,” Nature Communications, vol.
2, no. 232. Nature Publishing Group, pp. 1–6, 2011.
ista: Janovjak HL, Sandoz G, Isacoff E. 2011. Modern ionotropic glutamate receptor
with a K+ selectivity signature sequence. Nature Communications. 2(232), 1–6.
mla: Janovjak, Harald L., et al. “Modern Ionotropic Glutamate Receptor with a K+
Selectivity Signature Sequence.” Nature Communications, vol. 2, no. 232,
Nature Publishing Group, 2011, pp. 1–6, doi:10.1038/ncomms1231.
short: H.L. Janovjak, G. Sandoz, E. Isacoff, Nature Communications 2 (2011) 1–6.
corr_author: '1'
date_created: 2018-12-11T12:03:09Z
date_published: 2011-03-08T00:00:00Z
date_updated: 2025-09-30T08:40:22Z
day: '08'
ddc:
- '570'
- '571'
department:
- _id: HaJa
doi: 10.1038/ncomms1231
external_id:
isi:
- '000289982600022'
file:
- access_level: open_access
checksum: 6b68d65aadd97c18d663eb117a0a9d35
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:36Z
date_updated: 2020-07-14T12:46:12Z
file_id: '4891'
file_name: IST-2017-832-v1+1_janovjak.pdf
file_size: 387654
relation: main_file
file_date_updated: 2020-07-14T12:46:12Z
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
issue: '232'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 1 - 6
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '2997'
pubrep_id: '832'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Modern ionotropic glutamate receptor with a K+ selectivity signature sequence
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2
year: '2011'
...
---
_id: '3429'
abstract:
- lang: eng
text: Transcription factors are central to sustaining pluripotency, yet little is
known about transcription factor dynamics in defining pluripotency in the early
mammalian embryo. Here, we establish a fluorescence decay after photoactivation
(FDAP) assay to quantitatively study the kinetic behaviour of Oct4, a key transcription
factor controlling pre-implantation development in the mouse embryo. FDAP measurements
reveal that each cell in a developing embryo shows one of two distinct Oct4 kinetics,
before there are any morphologically distinguishable differences or outward signs
of lineage patterning. The differences revealed by FDAP are due to differences
in the accessibility of Oct4 to its DNA binding sites in the nucleus. Lineage
tracing of the cells in the two distinct sub-populations demonstrates that the
Oct4 kinetics predict lineages of the early embryo. Cells with slower Oct4 kinetics
are more likely to give rise to the pluripotent cell lineage that contributes
to the inner cell mass. Those with faster Oct4 kinetics contribute mostly to the
extra-embryonic lineage. Our findings identify Oct4 kinetics, rather than differences
in total transcription factor expression levels, as a predictive measure of developmental
cell lineage patterning in the early mouse embryo.
acknowledgement: This work was supported by the Beckman Institute and Biological Imaging
Center at the California Institute of Technology and by the NHGRI Center of Excellence
in Genomic Science grant P50HG004071.
article_processing_charge: No
author:
- first_name: Nicolas
full_name: Plachta, Nicolas
last_name: Plachta
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
- first_name: Shirley
full_name: Pease, Shirley
last_name: Pease
- first_name: Scott
full_name: Fraser, Scott
last_name: Fraser
- first_name: Periklis
full_name: Pantazis, Periklis
last_name: Pantazis
citation:
ama: Plachta N, Bollenbach MT, Pease S, Fraser S, Pantazis P. Oct4 kinetics predict
cell lineage patterning in the early mammalian embryo. Nature Cell Biology.
2011;13(2):117-123. doi:10.1038/ncb2154
apa: Plachta, N., Bollenbach, M. T., Pease, S., Fraser, S., & Pantazis, P. (2011).
Oct4 kinetics predict cell lineage patterning in the early mammalian embryo. Nature
Cell Biology. Nature Publishing Group. https://doi.org/10.1038/ncb2154
chicago: Plachta, Nicolas, Mark Tobias Bollenbach, Shirley Pease, Scott Fraser,
and Periklis Pantazis. “Oct4 Kinetics Predict Cell Lineage Patterning in the Early
Mammalian Embryo.” Nature Cell Biology. Nature Publishing Group, 2011.
https://doi.org/10.1038/ncb2154.
ieee: N. Plachta, M. T. Bollenbach, S. Pease, S. Fraser, and P. Pantazis, “Oct4
kinetics predict cell lineage patterning in the early mammalian embryo,” Nature
Cell Biology, vol. 13, no. 2. Nature Publishing Group, pp. 117–123, 2011.
ista: Plachta N, Bollenbach MT, Pease S, Fraser S, Pantazis P. 2011. Oct4 kinetics
predict cell lineage patterning in the early mammalian embryo. Nature Cell Biology.
13(2), 117–123.
mla: Plachta, Nicolas, et al. “Oct4 Kinetics Predict Cell Lineage Patterning in
the Early Mammalian Embryo.” Nature Cell Biology, vol. 13, no. 2, Nature
Publishing Group, 2011, pp. 117–23, doi:10.1038/ncb2154.
short: N. Plachta, M.T. Bollenbach, S. Pease, S. Fraser, P. Pantazis, Nature Cell
Biology 13 (2011) 117–123.
date_created: 2018-12-11T12:03:17Z
date_published: 2011-01-23T00:00:00Z
date_updated: 2025-09-30T08:39:51Z
day: '23'
department:
- _id: ToBo
doi: 10.1038/ncb2154
external_id:
isi:
- '000286805900004'
intvolume: ' 13'
isi: 1
issue: '2'
language:
- iso: eng
month: '01'
oa_version: None
page: 117 - 123
publication: Nature Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '2971'
scopus_import: '1'
status: public
title: Oct4 kinetics predict cell lineage patterning in the early mammalian embryo
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 13
year: '2011'
...
---
_id: '3505'
abstract:
- lang: eng
text: Cell migration on two-dimensional (2D) substrates follows entirely different
rules than cell migration in three-dimensional (3D) environments. This is especially
relevant for leukocytes that are able to migrate in the absence of adhesion receptors
within the confined geometry of artificial 3D extracellular matrix scaffolds and
within the interstitial space in vivo. Here, we describe in detail a simple and
economical protocol to visualize dendritic cell migration in 3D collagen scaffolds
along chemotactic gradients. This method can be adapted to other cell types and
may serve as a physiologically relevant paradigm for the directed locomotion of
most amoeboid cells.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
article_type: original
author:
- 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: Tim
full_name: Lämmermann, Tim
last_name: Lämmermann
citation:
ama: Sixt MK, Lämmermann T. In vitro analysis of chemotactic leukocyte migration
in 3D environments. Cell Migration. 2011;769:149-165. doi:10.1007/978-1-61779-207-6_11
apa: Sixt, M. K., & Lämmermann, T. (2011). In vitro analysis of chemotactic
leukocyte migration in 3D environments. Cell Migration. Springer. https://doi.org/10.1007/978-1-61779-207-6_11
chicago: Sixt, Michael K, and Tim Lämmermann. “In Vitro Analysis of Chemotactic
Leukocyte Migration in 3D Environments.” Cell Migration. Springer, 2011.
https://doi.org/10.1007/978-1-61779-207-6_11.
ieee: M. K. Sixt and T. Lämmermann, “In vitro analysis of chemotactic leukocyte
migration in 3D environments,” Cell Migration, vol. 769. Springer, pp.
149–165, 2011.
ista: Sixt MK, Lämmermann T. 2011. In vitro analysis of chemotactic leukocyte migration
in 3D environments. Cell Migration. 769, 149–165.
mla: Sixt, Michael K., and Tim Lämmermann. “In Vitro Analysis of Chemotactic Leukocyte
Migration in 3D Environments.” Cell Migration, vol. 769, Springer, 2011,
pp. 149–65, doi:10.1007/978-1-61779-207-6_11.
short: M.K. Sixt, T. Lämmermann, Cell Migration 769 (2011) 149–165.
corr_author: '1'
date_created: 2018-12-11T12:03:41Z
date_published: 2011-05-17T00:00:00Z
date_updated: 2026-06-18T18:46:10Z
day: '17'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1007/978-1-61779-207-6_11
intvolume: ' 769'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://pure.mpg.de/pubman/item/item_3219628_1/component/file_3219630/Sixt%20et%20al..pdf
month: '05'
oa: 1
oa_version: Published Version
page: 149 - 165
publication: Cell Migration
publication_status: published
publisher: Springer
publist_id: '2882'
quality_controlled: '1'
scopus_import: '1'
status: public
title: In vitro analysis of chemotactic leukocyte migration in 3D environments
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 769
year: '2011'
...
---
_id: '3771'
abstract:
- lang: eng
text: The small-sized frugivorous bat Carollia perspicillata is an understory specialist
and occurs in a wide range of lowland habitats, tending to be more common in tropical
dry or moist forests of South and Central America. Its sister species, Carollia
brevicauda, occurs almost exclusively in the Amazon rainforest. A recent phylogeographic
study proposed a hypothesis of origin and subsequent diversification for C. perspicillata
along the Atlantic coastal forest of Brazil. Additionally, it also found two allopatric
clades for C. brevicauda separated by the Amazon Basin. We used cytochrome b gene
sequences and a more extensive sampling to test hypotheses related to the origin
and diversification of C. perspicillata plus C. brevicauda clade in South America.
The results obtained indicate that there are two sympatric evolutionary lineages
within each species. In C. perspicillata, one lineage is limited to the Southern
Atlantic Forest, whereas the other is widely distributed. Coalescent analysis
points to a simultaneous origin for C. perspicillata and C. brevicauda, although
no place for the diversification of each species can be firmly suggested. The
phylogeographic pattern shown by C. perspicillata is also congruent with the Pleistocene
refugia hypothesis as a likely vicariant phenomenon shaping the present distribution
of its intraspecific lineages.
article_processing_charge: No
author:
- first_name: Ana
full_name: Pavan, Ana
last_name: Pavan
- first_name: Felipe
full_name: Martins, Felipe
last_name: Martins
- first_name: Fabrício
full_name: Santos, Fabrício
last_name: Santos
- first_name: Albert
full_name: Ditchfield, Albert
last_name: Ditchfield
- 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
citation:
ama: 'Pavan A, Martins F, Santos F, Ditchfield A, Fernandes Redondo RA. Patterns
of diversification in two species of short-tailed bats (Carollia Gray, 1838):
the effects of historical fragmentation of Brazilian rainforests. Biological
Journal of the Linnean Society. 2011;102(3):527-539. doi:10.1111/j.1095-8312.2010.01601.x'
apa: 'Pavan, A., Martins, F., Santos, F., Ditchfield, A., & Fernandes Redondo,
R. A. (2011). Patterns of diversification in two species of short-tailed bats
(Carollia Gray, 1838): the effects of historical fragmentation of Brazilian rainforests.
Biological Journal of the Linnean Society. Wiley-Blackwell. https://doi.org/10.1111/j.1095-8312.2010.01601.x'
chicago: 'Pavan, Ana, Felipe Martins, Fabrício Santos, Albert Ditchfield, and Rodrigo
A Fernandes Redondo. “Patterns of Diversification in Two Species of Short-Tailed
Bats (Carollia Gray, 1838): The Effects of Historical Fragmentation of Brazilian
Rainforests.” Biological Journal of the Linnean Society. Wiley-Blackwell,
2011. https://doi.org/10.1111/j.1095-8312.2010.01601.x.'
ieee: 'A. Pavan, F. Martins, F. Santos, A. Ditchfield, and R. A. Fernandes Redondo,
“Patterns of diversification in two species of short-tailed bats (Carollia Gray,
1838): the effects of historical fragmentation of Brazilian rainforests.,” Biological
Journal of the Linnean Society, vol. 102, no. 3. Wiley-Blackwell, pp. 527–539,
2011.'
ista: 'Pavan A, Martins F, Santos F, Ditchfield A, Fernandes Redondo RA. 2011. Patterns
of diversification in two species of short-tailed bats (Carollia Gray, 1838):
the effects of historical fragmentation of Brazilian rainforests. Biological Journal
of the Linnean Society. 102(3), 527–539.'
mla: 'Pavan, Ana, et al. “Patterns of Diversification in Two Species of Short-Tailed
Bats (Carollia Gray, 1838): The Effects of Historical Fragmentation of Brazilian
Rainforests.” Biological Journal of the Linnean Society, vol. 102, no.
3, Wiley-Blackwell, 2011, pp. 527–39, doi:10.1111/j.1095-8312.2010.01601.x.'
short: A. Pavan, F. Martins, F. Santos, A. Ditchfield, R.A. Fernandes Redondo, Biological
Journal of the Linnean Society 102 (2011) 527–539.
corr_author: '1'
date_created: 2018-12-11T12:05:05Z
date_published: 2011-02-10T00:00:00Z
date_updated: 2025-09-30T08:39:13Z
day: '10'
department:
- _id: FyKo
doi: 10.1111/j.1095-8312.2010.01601.x
external_id:
isi:
- '000287193800005'
intvolume: ' 102'
isi: 1
issue: '3'
language:
- iso: eng
month: '02'
oa_version: None
page: 527 - 539
publication: Biological Journal of the Linnean Society
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2456'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Patterns of diversification in two species of short-tailed bats (Carollia
Gray, 1838): the effects of historical fragmentation of Brazilian rainforests.'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 102
year: '2011'
...
---
_id: '3778'
article_processing_charge: No
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Barton NH. Estimating linkage disequilibria. Heredity. 2011;106(2):205-206.
doi:10.1038/hdy.2010.67
apa: Barton, N. H. (2011). Estimating linkage disequilibria. Heredity. Nature
Publishing Group. https://doi.org/10.1038/hdy.2010.67
chicago: Barton, Nicholas H. “Estimating Linkage Disequilibria.” Heredity.
Nature Publishing Group, 2011. https://doi.org/10.1038/hdy.2010.67.
ieee: N. H. Barton, “Estimating linkage disequilibria,” Heredity, vol. 106,
no. 2. Nature Publishing Group, pp. 205–206, 2011.
ista: Barton NH. 2011. Estimating linkage disequilibria. Heredity. 106(2), 205–206.
mla: Barton, Nicholas H. “Estimating Linkage Disequilibria.” Heredity, vol.
106, no. 2, Nature Publishing Group, 2011, pp. 205–06, doi:10.1038/hdy.2010.67.
short: N.H. Barton, Heredity 106 (2011) 205–206.
corr_author: '1'
date_created: 2018-12-11T12:05:07Z
date_published: 2011-02-01T00:00:00Z
date_updated: 2025-09-30T08:38:46Z
day: '01'
department:
- _id: NiBa
doi: 10.1038/hdy.2010.67
external_id:
isi:
- '000286375300002'
pmid:
- '20502479'
intvolume: ' 106'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3183869/
month: '02'
oa: 1
oa_version: Submitted Version
page: 205 - 206
pmid: 1
publication: Heredity
publication_status: published
publisher: Nature Publishing Group
publist_id: '2449'
scopus_import: '1'
status: public
title: Estimating linkage disequilibria
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 106
year: '2011'
...
---
_id: '3784'
abstract:
- lang: eng
text: Advanced stages of Scyllarus phyllosoma larvae were collected by demersal
trawling during fishery research surveys in the western Mediterranean Sea in 2003–2005.
Nucleotide sequence analysis of the mitochondrial 16S rDNA gene allowed the final-stage
phyllosoma of Scyllarus arctus to be identified among these larvae. Its morphology
is described and illustrated. This constitutes the second complete description
of a Scyllaridae phyllosoma with its specific identity being validated by molecular
techniques (the first was S. pygmaeus). These results also solved a long lasting
taxonomic anomaly of several species assigned to the ancient genus Phyllosoma
Leach, 1814. Detailed examination indicated that the final-stage phyllosoma of
S. arctus shows closer affinities with the American scyllarid Scyllarus depressus
or with the Australian Scyllarus sp. b (sensu Phillips et al., 1981) than to its
sympatric species S. pygmaeus.
article_processing_charge: No
article_type: original
author:
- first_name: Ferran
full_name: Palero, Ferran
id: 3F0E2A22-F248-11E8-B48F-1D18A9856A87
last_name: Palero
orcid: 0000-0002-0343-8329
- first_name: Guillermo
full_name: Guerao, Guillermo
last_name: Guerao
- first_name: Paul
full_name: Clark, Paul
last_name: Clark
- first_name: Pere
full_name: Abello, Pere
last_name: Abello
citation:
ama: 'Palero F, Guerao G, Clark P, Abello P. Scyllarus arctus (Crustacea: Decapoda:
Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological
description. Journal of the Marine Biological Association of the United Kingdom.
2011;91(2):485-492. doi:10.1017/S0025315410000287'
apa: 'Palero, F., Guerao, G., Clark, P., & Abello, P. (2011). Scyllarus arctus
(Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis,
with morphological description. Journal of the Marine Biological Association
of the United Kingdom. Cambridge University Press. https://doi.org/10.1017/S0025315410000287'
chicago: 'Palero, Ferran, Guillermo Guerao, Paul Clark, and Pere Abello. “Scyllarus
Arctus (Crustacea: Decapoda: Scyllaridae) Final Stage Phyllosoma Identified by
DNA Analysis, with Morphological Description.” Journal of the Marine Biological
Association of the United Kingdom. Cambridge University Press, 2011. https://doi.org/10.1017/S0025315410000287.'
ieee: 'F. Palero, G. Guerao, P. Clark, and P. Abello, “Scyllarus arctus (Crustacea:
Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with
morphological description,” Journal of the Marine Biological Association of
the United Kingdom, vol. 91, no. 2. Cambridge University Press, pp. 485–492,
2011.'
ista: 'Palero F, Guerao G, Clark P, Abello P. 2011. Scyllarus arctus (Crustacea:
Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with
morphological description. Journal of the Marine Biological Association of the
United Kingdom. 91(2), 485–492.'
mla: 'Palero, Ferran, et al. “Scyllarus Arctus (Crustacea: Decapoda: Scyllaridae)
Final Stage Phyllosoma Identified by DNA Analysis, with Morphological Description.”
Journal of the Marine Biological Association of the United Kingdom, vol.
91, no. 2, Cambridge University Press, 2011, pp. 485–92, doi:10.1017/S0025315410000287.'
short: F. Palero, G. Guerao, P. Clark, P. Abello, Journal of the Marine Biological
Association of the United Kingdom 91 (2011) 485–492.
corr_author: '1'
date_created: 2018-12-11T12:05:09Z
date_published: 2011-03-01T00:00:00Z
date_updated: 2026-06-18T18:46:40Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1017/S0025315410000287
external_id:
isi:
- '000287940400022'
intvolume: ' 91'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://digital.csic.es/bitstream/10261/32783/3/Palero_et_al_2011.pdf
month: '03'
oa: 1
oa_version: Published Version
page: 485 - 492
publication: Journal of the Marine Biological Association of the United Kingdom
publication_status: published
publisher: Cambridge University Press
publist_id: '2443'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma
identified by DNA analysis, with morphological description'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 91
year: '2011'
...
---
_id: '3791'
abstract:
- lang: eng
text: During the development of multicellular organisms, cell fate specification
is followed by the sorting of different cell types into distinct domains from
where the different tissues and organs are formed. Cell sorting involves both
the segregation of a mixed population of cells with different fates and properties
into distinct domains, and the active maintenance of their segregated state. Because
of its biological importance and apparent resemblance to fluid segregation in
physics, cell sorting was extensively studied by both biologists and physicists
over the last decades. Different theories were developed that try to explain cell
sorting on the basis of the physical properties of the constituent cells. However,
only recently the molecular and cellular mechanisms that control the physical
properties driving cell sorting, have begun to be unraveled. In this review, we
will provide an overview of different cell-sorting processes in development and
discuss how these processes can be explained by the different sorting theories,
and how these theories in turn can be connected to the molecular and cellular
mechanisms driving these processes.
alternative_title:
- Current Topics in Developmental Biology
article_processing_charge: No
author:
- first_name: Gabriel
full_name: Krens, Gabriel
id: 2B819732-F248-11E8-B48F-1D18A9856A87
last_name: Krens
orcid: 0000-0003-4761-5996
- 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: 'Krens G, Heisenberg C-PJ. Cell sorting in development. In: Labouesse M, ed.
Forces and Tension in Development. Vol 95. Elsevier; 2011:189-213. doi:10.1016/B978-0-12-385065-2.00006-2'
apa: Krens, G., & Heisenberg, C.-P. J. (2011). Cell sorting in development.
In M. Labouesse (Ed.), Forces and Tension in Development (Vol. 95, pp.
189–213). Elsevier. https://doi.org/10.1016/B978-0-12-385065-2.00006-2
chicago: Krens, Gabriel, and Carl-Philipp J Heisenberg. “Cell Sorting in Development.”
In Forces and Tension in Development, edited by Michel Labouesse, 95:189–213.
Elsevier, 2011. https://doi.org/10.1016/B978-0-12-385065-2.00006-2.
ieee: G. Krens and C.-P. J. Heisenberg, “Cell sorting in development,” in Forces
and Tension in Development, vol. 95, M. Labouesse, Ed. Elsevier, 2011, pp.
189–213.
ista: 'Krens G, Heisenberg C-PJ. 2011.Cell sorting in development. In: Forces and
Tension in Development. Current Topics in Developmental Biology, vol. 95, 189–213.'
mla: Krens, Gabriel, and Carl-Philipp J. Heisenberg. “Cell Sorting in Development.”
Forces and Tension in Development, edited by Michel Labouesse, vol. 95,
Elsevier, 2011, pp. 189–213, doi:10.1016/B978-0-12-385065-2.00006-2.
short: G. Krens, C.-P.J. Heisenberg, in:, M. Labouesse (Ed.), Forces and Tension
in Development, Elsevier, 2011, pp. 189–213.
corr_author: '1'
date_created: 2018-12-11T12:05:11Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2025-09-30T08:37:44Z
day: '01'
department:
- _id: CaHe
doi: 10.1016/B978-0-12-385065-2.00006-2
editor:
- first_name: Michel
full_name: Labouesse, Michel
last_name: Labouesse
external_id:
isi:
- '000290454200007'
intvolume: ' 95'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 189 - 213
publication: Forces and Tension in Development
publication_status: published
publisher: Elsevier
publist_id: '2436'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cell sorting in development
type: book_chapter
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 95
year: '2011'
...
---
_id: '3796'
abstract:
- lang: eng
text: We address the problem of covering ℝ n with congruent balls, while minimizing
the number of balls that contain an average point. Considering the 1-parameter
family of lattices defined by stretching or compressing the integer grid in diagonal
direction, we give a closed formula for the covering density that depends on the
distortion parameter. We observe that our family contains the thinnest lattice
coverings in dimensions 2 to 5. We also consider the problem of packing congruent
balls in ℝ n , for which we give a closed formula for the packing density as well.
Again we observe that our family contains optimal configurations, this time densest
packings in dimensions 2 and 3.
alternative_title:
- LNCS
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
citation:
ama: 'Edelsbrunner H, Kerber M. Covering and packing with spheres by diagonal distortion
in R^n. In: Calude C, Rozenberg G, Salomaa A, eds. Rainbow of Computer Science.
Vol 6570. Dedicated to Hermann Maurer on the Occasion of His 70th Birthday. Springer;
2011:20-35. doi:10.1007/978-3-642-19391-0_2'
apa: Edelsbrunner, H., & Kerber, M. (2011). Covering and packing with spheres
by diagonal distortion in R^n. In C. Calude, G. Rozenberg, & A. Salomaa (Eds.),
Rainbow of Computer Science (Vol. 6570, pp. 20–35). Springer. https://doi.org/10.1007/978-3-642-19391-0_2
chicago: Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres
by Diagonal Distortion in R^n.” In Rainbow of Computer Science, edited
by Cristian Calude, Grzegorz Rozenberg, and Arto Salomaa, 6570:20–35. Dedicated
to Hermann Maurer on the Occasion of His 70th Birthday. Springer, 2011. https://doi.org/10.1007/978-3-642-19391-0_2.
ieee: H. Edelsbrunner and M. Kerber, “Covering and packing with spheres by diagonal
distortion in R^n,” in Rainbow of Computer Science, vol. 6570, C. Calude,
G. Rozenberg, and A. Salomaa, Eds. Springer, 2011, pp. 20–35.
ista: 'Edelsbrunner H, Kerber M. 2011.Covering and packing with spheres by diagonal
distortion in R^n. In: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.'
mla: Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres
by Diagonal Distortion in R^n.” Rainbow of Computer Science, edited by
Cristian Calude et al., vol. 6570, Springer, 2011, pp. 20–35, doi:10.1007/978-3-642-19391-0_2.
short: H. Edelsbrunner, M. Kerber, in:, C. Calude, G. Rozenberg, A. Salomaa (Eds.),
Rainbow of Computer Science, Springer, 2011, pp. 20–35.
corr_author: '1'
date_created: 2018-12-11T12:05:13Z
date_published: 2011-05-03T00:00:00Z
date_updated: 2024-10-21T06:03:02Z
day: '03'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/978-3-642-19391-0_2
editor:
- first_name: Cristian
full_name: Calude, Cristian
last_name: Calude
- first_name: Grzegorz
full_name: Rozenberg, Grzegorz
last_name: Rozenberg
- first_name: Arto
full_name: Salomaa, Arto
last_name: Salomaa
file:
- access_level: open_access
checksum: aaf22b4d7bd4277ffe8db532119cf474
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:42Z
date_updated: 2020-07-14T12:46:16Z
file_id: '4640'
file_name: IST-2016-539-v1+1_2011-B-01-CoveringPacking.pdf
file_size: 436875
relation: main_file
file_date_updated: 2020-07-14T12:46:16Z
has_accepted_license: '1'
intvolume: ' 6570'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 20 - 35
publication: Rainbow of Computer Science
publication_status: published
publisher: Springer
publist_id: '2427'
pubrep_id: '539'
quality_controlled: '1'
scopus_import: '1'
series_title: Dedicated to Hermann Maurer on the Occasion of His 70th Birthday
status: public
title: Covering and packing with spheres by diagonal distortion in R^n
type: book_chapter
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6570
year: '2011'
...
---
_id: '3965'
abstract:
- lang: eng
text: The elevation function on a smoothly embedded 2-manifold in R-3 reflects the
multiscale topography of cavities and protrusions as local maxima. The function
has been useful in identifying coarse docking configurations for protein pairs.
Transporting the concept from the smooth to the piecewise linear category, this
paper describes an algorithm for finding all local maxima. While its worst-case
running time is the same as of the algorithm used in prior work, its performance
in practice is orders of magnitudes superior. We cast light on this improvement
by relating the running time to the total absolute Gaussian curvature of the 2-manifold.
author:
- first_name: Bei
full_name: Wang, Bei
last_name: Wang
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Dmitriy
full_name: Morozov, Dmitriy
last_name: Morozov
citation:
ama: Wang B, Edelsbrunner H, Morozov D. Computing elevation maxima by searching
the Gauss sphere. Journal of Experimental Algorithmics. 2011;16(2.2):1-13.
doi:10.1145/1963190.1970375
apa: Wang, B., Edelsbrunner, H., & Morozov, D. (2011). Computing elevation maxima
by searching the Gauss sphere. Journal of Experimental Algorithmics. ACM.
https://doi.org/10.1145/1963190.1970375
chicago: Wang, Bei, Herbert Edelsbrunner, and Dmitriy Morozov. “Computing Elevation
Maxima by Searching the Gauss Sphere.” Journal of Experimental Algorithmics.
ACM, 2011. https://doi.org/10.1145/1963190.1970375.
ieee: B. Wang, H. Edelsbrunner, and D. Morozov, “Computing elevation maxima by searching
the Gauss sphere,” Journal of Experimental Algorithmics, vol. 16, no. 2.2.
ACM, pp. 1–13, 2011.
ista: Wang B, Edelsbrunner H, Morozov D. 2011. Computing elevation maxima by searching
the Gauss sphere. Journal of Experimental Algorithmics. 16(2.2), 1–13.
mla: Wang, Bei, et al. “Computing Elevation Maxima by Searching the Gauss Sphere.”
Journal of Experimental Algorithmics, vol. 16, no. 2.2, ACM, 2011, pp.
1–13, doi:10.1145/1963190.1970375.
short: B. Wang, H. Edelsbrunner, D. Morozov, Journal of Experimental Algorithmics
16 (2011) 1–13.
date_created: 2018-12-11T12:06:09Z
date_published: 2011-05-01T00:00:00Z
date_updated: 2021-01-12T07:53:31Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/1963190.1970375
intvolume: ' 16'
issue: '2.2'
language:
- iso: eng
month: '05'
oa_version: None
page: 1 - 13
publication: Journal of Experimental Algorithmics
publication_status: published
publisher: ACM
publist_id: '2161'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computing elevation maxima by searching the Gauss sphere
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2011'
...
---
_id: '3315'
abstract:
- lang: eng
text: We consider two-player games played in real time on game structures with clocks
where the objectives of players are described using parity conditions. The games
are concurrent in that at each turn, both players independently propose a time
delay and an action, and the action with the shorter delay is chosen. To prevent
a player from winning by blocking time, we restrict each player to play strategies
that ensure that the player cannot be responsible for causing a zeno run. First,
we present an efficient reduction of these games to turn-based (i.e., not concurrent)
finite-state (i.e., untimed) parity games. Our reduction improves the best known
complexity for solving timed parity games. Moreover, the rich class of algorithms
for classical parity games can now be applied to timed parity games. The states
of the resulting game are based on clock regions of the original game, and the
state space of the finite game is linear in the size of the region graph. Second,
we consider two restricted classes of strategies for the player that represents
the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust
winning strategies. Using a limit-robust winning strategy, the controller cannot
choose an exact real-valued time delay but must allow for some nonzero jitter
in each of its actions. If there is a given lower bound on the jitter, then the
strategy is bounded-robust winning. We show that exact strategies are more powerful
than limit-robust strategies, which are more powerful than bounded-robust winning
strategies for any bound. For both kinds of robust strategies, we present efficient
reductions to standard timed automaton games. These reductions provide algorithms
for the synthesis of robust real-time controllers.
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: Vinayak
full_name: Prabhu, Vinayak
last_name: Prabhu
citation:
ama: 'Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness.
Logical Methods in Computer Science. 2011;7(4). doi:10.2168/LMCS-7(4:8)2011'
apa: 'Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games:
Complexity and robustness. Logical Methods in Computer Science. International
Federation for Computational Logic. https://doi.org/10.2168/LMCS-7(4:8)2011'
chicago: 'Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed
Parity Games: Complexity and Robustness.” Logical Methods in Computer Science.
International Federation for Computational Logic, 2011. https://doi.org/10.2168/LMCS-7(4:8)2011.'
ieee: 'K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity
and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International
Federation for Computational Logic, 2011.'
ista: 'Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity
and robustness. Logical Methods in Computer Science. 7(4).'
mla: 'Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.”
Logical Methods in Computer Science, vol. 7, no. 4, International Federation
for Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.'
short: K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science
7 (2011).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:02:37Z
date_published: 2011-12-14T00:00:00Z
date_updated: 2026-07-06T13:25:39Z
day: '14'
ddc:
- '000'
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.2168/LMCS-7(4:8)2011
ec_funded: 1
file:
- access_level: open_access
checksum: 3480e1594bbef25ff7462fa93a8a814e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:42Z
date_updated: 2020-07-14T12:46:07Z
file_id: '5231'
file_name: IST-2016-86-v2+1_1011.0688_3_.pdf
file_size: 588863
relation: main_file
file_date_updated: 2020-07-14T12:46:07Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication: Logical Methods in Computer Science
publication_status: published
publisher: International Federation for Computational Logic
publist_id: '3324'
pubrep_id: '506'
quality_controlled: '1'
related_material:
record:
- id: '3876'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'Timed parity games: Complexity and robustness'
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2011'
...
---
_id: '3302'
abstract:
- lang: eng
text: Cloud computing aims to give users virtually unlimited pay-per-use computing
resources without the burden of managing the underlying infrastructure. We present
a new job execution environment Flextic that exploits scal- able static scheduling
techniques to provide the user with a flexible pricing model, such as a tradeoff
between dif- ferent degrees of execution speed and execution price, and at the
same time, reduce scheduling overhead for the cloud provider. We have evaluated
a prototype of Flextic on Amazon EC2 and compared it against Hadoop. For various
data parallel jobs from machine learning, im- age processing, and gene sequencing
that we considered, Flextic has low scheduling overhead and reduces job du- ration
by up to 15% compared to Hadoop, a dynamic cloud scheduler.
article_processing_charge: No
author:
- 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: Anmol
full_name: Singh, Anmol
id: 72A86902-E99F-11E9-9F62-915534D1B916
last_name: Singh
- first_name: Vasu
full_name: Singh, Vasu
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: 'Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds.
In: 3rd USENIX Workshop on Hot Topics in Cloud Computing. Usenix Association;
2011:1-6.'
apa: 'Henzinger, T. A., Singh, A., Singh, V., Wies, T., & Zufferey, D. (2011).
Static scheduling in clouds. In 3rd USENIX Workshop on Hot Topics in Cloud
Computing (pp. 1–6). Portland, OR, United States: Usenix Association.'
chicago: Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey.
“Static Scheduling in Clouds.” In 3rd USENIX Workshop on Hot Topics in Cloud
Computing, 1–6. Usenix Association, 2011.
ieee: T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling
in clouds,” in 3rd USENIX Workshop on Hot Topics in Cloud Computing, Portland,
OR, United States, 2011, pp. 1–6.
ista: 'Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling
in clouds. 3rd USENIX Workshop on Hot Topics in Cloud Computing. HotCloud: Workshop
on Hot Topics in Cloud Computing, 1–6.'
mla: Henzinger, Thomas A., et al. “Static Scheduling in Clouds.” 3rd USENIX Workshop
on Hot Topics in Cloud Computing, Usenix Association, 2011, pp. 1–6.
short: T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, 3rd USENIX
Workshop on Hot Topics in Cloud Computing, Usenix Association, 2011, pp. 1–6.
conference:
end_date: 2011-06-15
location: Portland, OR, United States
name: 'HotCloud: Workshop on Hot Topics in Cloud Computing'
start_date: 2011-06-14
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:02:33Z
date_published: 2011-06-14T00:00:00Z
date_updated: 2026-07-07T06:07:16Z
day: '14'
ddc:
- '000'
- '005'
department:
- _id: ToHe
file:
- access_level: open_access
checksum: 21a461ac004bb535c83320fe79b30375
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:14Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5333'
file_name: IST-2012-90-v1+1_Static_scheduling_in_clouds.pdf
file_size: 232770
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 1 - 6
publication: 3rd USENIX Workshop on Hot Topics in Cloud Computing
publication_status: published
publisher: Usenix Association
publist_id: '3338'
pubrep_id: '90'
quality_controlled: '1'
status: public
title: Static scheduling in clouds
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3356'
abstract:
- lang: eng
text: There is recently a significant effort to add quantitative objectives to formal
verification and synthesis. We introduce and investigate the extension of temporal
logics with quantitative atomic assertions, aiming for a general and flexible
framework for quantitative-oriented specifications. In the heart of quantitative
objectives lies the accumulation of values along a computation. It is either the
accumulated summation, as with the energy objectives, or the accumulated average,
as with the mean-payoff objectives. We investigate the extension of temporal logics
with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is
a numeric variable of the system, c is a constant rational number, and Sum(v)
and Avg(v) denote the accumulated sum and average of the values of v from the
beginning of the computation up to the current point of time. We also allow the
path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring
to the average value along an entire computation. We study the border of decidability
for extensions of various temporal logics. In particular, we show that extending
the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by
prefix-accumulation assertions and extending LTL with path-accumulation assertions,
result in temporal logics whose model-checking problem is decidable. The extended
logics allow to significantly extend the currently known energy and mean-payoff
objectives. Moreover, the prefix-accumulation assertions may be refined with "controlled-accumulation",
allowing, for example, to specify constraints on the average waiting time between
a request and a grant. On the negative side, we show that the fragment we point
to is, in a sense, the maximal logic whose extension with prefix-accumulation
assertions permits a decidable model-checking procedure. Extending a temporal
logic that has the EG or EU modalities, and in particular CTL and LTL, makes the
problem undecidable.
article_number: '5970226'
article_processing_charge: No
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- 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: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications
with accumulative values. In: IEEE; 2011. doi:10.1109/LICS.2011.33'
apa: 'Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal
specifications with accumulative values. Presented at the LICS: Logic in Computer
Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33'
chicago: Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman.
“Temporal Specifications with Accumulative Values.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.33.
ieee: 'U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications
with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto,
Canada, 2011.'
ista: 'Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications
with accumulative values. LICS: Logic in Computer Science, 5970226.'
mla: Boker, Udi, et al. Temporal Specifications with Accumulative Values.
5970226, IEEE, 2011, doi:10.1109/LICS.2011.33.
short: U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.
conference:
end_date: 2011-06-24
location: Toronto, Canada
name: 'LICS: Logic in Computer Science'
start_date: 2011-06-21
date_created: 2018-12-11T12:02:52Z
date_published: 2011-06-21T00:00:00Z
date_updated: 2026-07-07T14:01:43Z
day: '21'
ddc:
- '000'
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1109/LICS.2011.33
ec_funded: 1
external_id:
isi:
- '000297350400007'
file:
- access_level: open_access
checksum: 792128f5455f0f40f1105f0398e05fa9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:42Z
date_updated: 2020-07-14T12:46:09Z
file_id: '4960'
file_name: IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf
file_size: 225426
relation: main_file
file_date_updated: 2020-07-14T12:46:09Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: IEEE
publist_id: '3259'
pubrep_id: '83'
related_material:
record:
- id: '5385'
relation: earlier_version
status: public
- id: '2038'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Temporal specifications with accumulative values
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2011'
...
---
_id: '5385'
abstract:
- lang: eng
text: There is recently a significant effort to add quantitative objectives to formal
verification and synthesis. We introduce and investigate the extension of temporal
logics with quantitative atomic assertions, aiming for a general and flexible
framework for quantitative-oriented specifications. In the heart of quantitative
objectives lies the accumulation of values along a computation. It is either the
accumulated summation, as with the energy objectives, or the accumulated average,
as with the mean-payoff objectives. We investigate the extension of temporal logics
with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is
a numeric variable of the system, c is a constant rational number, and Sum(v)
and Avg(v) denote the accumulated sum and average of the values of v from the
beginning of the computation up to the current point of time. We also allow the
path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring
to the average value along an entire computation. We study the border of decidability
for extensions of various temporal logics. In particular, we show that extending
the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by
prefix-accumulation assertions and extending LTL with path-accumulation assertions,
result in temporal logics whose model-checking problem is decidable. The extended
logics allow to significantly extend the currently known energy and mean-payoff
objectives. Moreover, the prefix-accumulation assertions may be refined with “controlled-accumulation”,
allowing, for example, to specify constraints on the average waiting time between
a request and a grant. On the negative side, we show that the fragment we point
to is, in a sense, the maximal logic whose extension with prefix-accumulation
assertions permits a decidable model-checking procedure. Extending a temporal
logic that has the EG or EU modalities, and in particular CTL and LTL, makes the
problem undecidable.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- 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: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal Specifications
with Accumulative Values. IST Austria; 2011. doi:10.15479/AT:IST-2011-0003
apa: Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal
specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003
chicago: Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman.
Temporal Specifications with Accumulative Values. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0003.
ieee: U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications
with accumulative values. IST Austria, 2011.
ista: Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications
with accumulative values, IST Austria, 14p.
mla: Boker, Udi, et al. Temporal Specifications with Accumulative Values.
IST Austria, 2011, doi:10.15479/AT:IST-2011-0003.
short: U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications
with Accumulative Values, IST Austria, 2011.
date_created: 2018-12-12T11:39:02Z
date_published: 2011-04-04T00:00:00Z
date_updated: 2026-07-07T14:01:43Z
day: '04'
ddc:
- '000'
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.15479/AT:IST-2011-0003
ec_funded: 1
file:
- access_level: open_access
checksum: 8491d0d48c4911620ecd5350b413c11e
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:00Z
date_updated: 2020-07-14T12:46:41Z
file_id: '5461'
file_name: IST-2011-0003_IST-2011-0003.pdf
file_size: 366281
relation: main_file
file_date_updated: 2020-07-14T12:46:41Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '14'
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '21'
related_material:
record:
- id: '3356'
relation: later_version
status: public
- id: '2038'
relation: later_version
status: public
status: public
title: Temporal specifications with accumulative values
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5381'
abstract:
- lang: eng
text: "In two-player finite-state stochastic games of partial obser- vation on graphs,
in every state of the graph, the players simultaneously choose an action, and
their joint actions determine a probability distri- bution over the successor
states. The game is played for infinitely many rounds and thus the players construct
an infinite path in the graph. We consider reachability objectives where the first
player tries to ensure a target state to be visited almost-surely (i.e., with
probability 1) or pos- itively (i.e., with positive probability), no matter the
strategy of the second player.\r\n\r\nWe classify such games according to the
information and to the power of randomization available to the players. On the
basis of information, the game can be one-sided with either (a) player 1, or (b)
player 2 having partial observation (and the other player has perfect observation),
or two- sided with (c) both players having partial observation. On the basis of
randomization, (a) the players may not be allowed to use randomization (pure strategies),
or (b) they may choose a probability distribution over actions but the actual
random choice is external and not visible to the player (actions invisible), or
(c) they may use full randomization.\r\n\r\nOur main results for pure strategies
are as follows: (1) For one-sided games with player 2 perfect observation we show
that (in contrast to full randomized strategies) belief-based (subset-construction
based) strate- gies are not sufficient, and present an exponential upper bound
on mem- ory both for almost-sure and positive winning strategies; we show that
the problem of deciding the existence of almost-sure and positive winning strategies
for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid
the explicit exponential construction. (2) For one-sided games with player 1 perfect
observation we show that non-elementary memory is both necessary and sufficient
for both almost-sure and posi- tive winning strategies. (3) We show that for the
general (two-sided) case finite-memory strategies are sufficient for both positive
and almost-sure winning, and at least non-elementary memory is required. We establish
the equivalence of the almost-sure winning problems for pure strategies and for
randomized strategies with actions invisible. Our equivalence re- sult exhibit
serious flaws in previous results in the literature: we show a non-elementary
memory lower bound for almost-sure winning whereas an exponential upper bound
was previously claimed."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Partial-Observation Stochastic Games: How to Win
When Belief Fails. IST Austria; 2011. doi:10.15479/AT:IST-2011-0007'
apa: 'Chatterjee, K., & Doyen, L. (2011). Partial-observation stochastic
games: How to win when belief fails. IST Austria. https://doi.org/10.15479/AT:IST-2011-0007'
chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic
Games: How to Win When Belief Fails. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0007.'
ieee: 'K. Chatterjee and L. Doyen, Partial-observation stochastic games: How
to win when belief fails. IST Austria, 2011.'
ista: 'Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to
win when belief fails, IST Austria, 43p.'
mla: 'Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic
Games: How to Win When Belief Fails. IST Austria, 2011, doi:10.15479/AT:IST-2011-0007.'
short: 'K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win
When Belief Fails, IST Austria, 2011.'
date_created: 2018-12-12T11:39:00Z
date_published: 2011-07-05T00:00:00Z
date_updated: 2026-07-07T14:01:25Z
day: '05'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0007
file:
- access_level: open_access
checksum: 06bf6dfc97f6006e3fd0e9a3f31bc961
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:27Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5488'
file_name: IST-2011-0007_IST-2011-0007.pdf
file_size: 574055
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '43'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '17'
related_material:
record:
- id: '1903'
relation: later_version
status: public
- id: '2955'
relation: later_version
status: public
- id: '2211'
relation: later_version
status: public
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3353'
abstract:
- lang: eng
text: 'Compositional theories are crucial when designing large and complex systems
from smaller components. In this work we propose such a theory for synchronous
concurrent systems. Our approach follows so-called interface theories, which use
game-theoretic interpretations of composition and refinement. These are appropriate
for systems with distinct inputs and outputs, and explicit conditions on inputs
that must be enforced during composition. Our interfaces model systems that execute
in an infinite sequence of synchronous rounds. At each round, a contract must
be satisfied. The contract is simply a relation specifying the set of valid input/output
pairs. Interfaces can be composed by parallel, serial or feedback composition.
A refinement relation between interfaces is defined, and shown to have two main
properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability,
namely, the ability to replace an interface by another one in any context. Shared
refinement and abstraction operators, corresponding to greatest lower and least
upper bounds with respect to refinement, are also defined. Input-complete interfaces,
that impose no restrictions on inputs, and deterministic interfaces, that produce
a unique output for any legal input, are discussed as special cases, and an interesting
duality between the two classes is exposed. A number of illustrative examples
are provided, as well as algorithms to compute compositions, check refinement,
and so on, for finite-state interfaces.'
article_number: '14'
article_processing_charge: No
author:
- first_name: Stavros
full_name: Tripakis, Stavros
last_name: Tripakis
- first_name: Ben
full_name: Lickly, Ben
last_name: Lickly
- 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: Edward
full_name: Lee, Edward
last_name: Lee
citation:
ama: Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational
interfaces. ACM Transactions on Programming Languages and Systems. 2011;33(4).
doi:10.1145/1985342.1985345
apa: Tripakis, S., Lickly, B., Henzinger, T. A., & Lee, E. (2011). A theory
of synchronous relational interfaces. ACM Transactions on Programming Languages
and Systems. ACM. https://doi.org/10.1145/1985342.1985345
chicago: Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory
of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages
and Systems. ACM, 2011. https://doi.org/10.1145/1985342.1985345.
ieee: S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous
relational interfaces,” ACM Transactions on Programming Languages and Systems,
vol. 33, no. 4. ACM, 2011.
ista: Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational
interfaces. ACM Transactions on Programming Languages and Systems. 33(4), 14.
mla: Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.”
ACM Transactions on Programming Languages and Systems, vol. 33, no. 4,
14, ACM, 2011, doi:10.1145/1985342.1985345.
short: S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming
Languages and Systems 33 (2011).
das_tickbox: '1'
date_created: 2018-12-11T12:02:51Z
date_published: 2011-07-01T00:00:00Z
date_updated: 2026-07-07T14:03:34Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: ToHe
doi: 10.1145/1985342.1985345
ec_funded: 1
external_id:
isi:
- '000292766400003'
file:
- access_level: open_access
checksum: 5d44a8aa81e33210649beae507602138
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:45Z
date_updated: 2020-07-14T12:46:09Z
file_id: '5235'
file_name: IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf
file_size: 775662
relation: main_file
file_date_updated: 2020-07-14T12:46:09Z
has_accepted_license: '1'
intvolume: ' 33'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: ACM Transactions on Programming Languages and Systems
publication_status: published
publisher: ACM
publist_id: '3263'
pubrep_id: '85'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A theory of synchronous relational interfaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2011'
...
---
_id: '3354'
abstract:
- lang: eng
text: 'We consider two-player games played on a finite state space for an infinite
number of rounds. The games are concurrent: in each round, the two players (player
1 and player 2) choose their moves independently and simultaneously; the current
state and the two moves determine the successor state. We consider ω-regular winning
conditions specified as parity objectives. Both players are allowed to use randomization
when choosing their moves. We study the computation of the limit-winning set of
states, consisting of the states where the sup-inf value of the game for player
1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability
of winning arbitrarily close to 1. We show that the limit-winning set can be computed
in O(n2d+2) time, where n is the size of the game structure and 2d is the number
of priorities (or colors). The membership problem of whether a state belongs to
the limit-winning set can be decided in NP ∩ coNP. While this complexity is the
same as for the simpler class of turn-based parity games, where in each state
only one of the two players has a choice of moves, our algorithms are considerably
more involved than those for turn-based games. This is because concurrent games
do not satisfy two of the most fundamental properties of turn-based parity games.
First, in concurrent games limit-winning strategies require randomization; and
second, they require infinite memory.'
article_number: '28'
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: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games.
ACM Transactions on Computational Logic. 2011;12(4). doi:10.1145/1970398.1970404
apa: Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent
parity games. ACM Transactions on Computational Logic. ACM. https://doi.org/10.1145/1970398.1970404
chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative
Concurrent Parity Games.” ACM Transactions on Computational Logic. ACM,
2011. https://doi.org/10.1145/1970398.1970404.
ieee: K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent
parity games,” ACM Transactions on Computational Logic, vol. 12, no. 4.
ACM, 2011.
ista: Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity
games. ACM Transactions on Computational Logic. 12(4), 28.
mla: Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” ACM
Transactions on Computational Logic, vol. 12, no. 4, 28, ACM, 2011, doi:10.1145/1970398.1970404.
short: K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational
Logic 12 (2011).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:02:51Z
date_published: 2011-07-04T00:00:00Z
date_updated: 2026-07-07T14:02:38Z
day: '04'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/1970398.1970404
external_id:
isi:
- '000296202300006'
intvolume: ' 12'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
project:
- _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: ACM Transactions on Computational Logic
publication_status: published
publisher: ACM
publist_id: '3262'
quality_controlled: '1'
related_material:
record:
- id: '2054'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Qualitative concurrent parity games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2011'
...
---
_id: '3396'
abstract:
- lang: eng
text: Facial branchiomotor neurons (FBMNs) in zebrafish and mouse embryonic hindbrain
undergo a characteristic tangential migration from rhombomere (r) 4, where they
are born, to r6/7. Cohesion among neuroepithelial cells (NCs) has been suggested
to function in FBMN migration by inhibiting FBMNs positioned in the basal neuroepithelium
such that they move apically between NCs towards the midline of the neuroepithelium
instead of tangentially along the basal side of the neuroepithelium towards r6/7.
However, direct experimental evaluation of this hypothesis is still lacking. Here,
we have used a combination of biophysical cell adhesion measurements and high-resolution
time-lapse microscopy to determine the role of NC cohesion in FBMN migration.
We show that reducing NC cohesion by interfering with Cadherin 2 (Cdh2) activity
results in FBMNs positioned at the basal side of the neuroepithelium moving apically
towards the neural tube midline instead of tangentially towards r6/7. In embryos
with strongly reduced NC cohesion, ectopic apical FBMN movement frequently results
in fusion of the bilateral FBMN clusters over the apical midline of the neural
tube. By contrast, reducing cohesion among FBMNs by interfering with Contactin
2 (Cntn2) expression in these cells has little effect on apical FBMN movement,
but reduces the fusion of the bilateral FBMN clusters in embryos with strongly
diminished NC cohesion. These data provide direct experimental evidence that NC
cohesion functions in tangential FBMN migration by restricting their apical movement.
acknowledged_ssus:
- _id: Bio
- _id: PreCl
acknowledgement: We thank C. Moens and J. Geiger for critical reading of earlier versions
of this manuscript and members of the Heisenberg laboratory for discussions. We
are grateful to the microscopy facility of the MPI-CBG and IST Austria for continuous
support; I. Nüsslein, J. Compagnon and Alex Eichner for help with cell sorting;
and the fish facility of the MPI-CBG and IST Austria for excellent fish care.
article_processing_charge: No
article_type: original
author:
- first_name: Petra
full_name: Stockinger, Petra
id: 261CB030-E90D-11E9-B182-F697D44B663C
last_name: Stockinger
- 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
- first_name: Jean-Léon
full_name: Maître, Jean-Léon
id: 48F1E0D8-F248-11E8-B48F-1D18A9856A87
last_name: Maître
orcid: 0000-0002-3688-1474
citation:
ama: Stockinger P, Heisenberg C-PJ, Maître J-L. Defective neuroepithelial cell cohesion
affects tangential branchiomotor neuron migration in the zebrafish neural tube.
Development. 2011;138(21):4673-4683. doi:10.1242/dev.071233
apa: Stockinger, P., Heisenberg, C.-P. J., & Maître, J.-L. (2011). Defective
neuroepithelial cell cohesion affects tangential branchiomotor neuron migration
in the zebrafish neural tube. Development. Company of Biologists. https://doi.org/10.1242/dev.071233
chicago: Stockinger, Petra, Carl-Philipp J Heisenberg, and Jean-Léon Maître. “Defective
Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration
in the Zebrafish Neural Tube.” Development. Company of Biologists, 2011.
https://doi.org/10.1242/dev.071233.
ieee: P. Stockinger, C.-P. J. Heisenberg, and J.-L. Maître, “Defective neuroepithelial
cell cohesion affects tangential branchiomotor neuron migration in the zebrafish
neural tube,” Development, vol. 138, no. 21. Company of Biologists, pp.
4673–4683, 2011.
ista: Stockinger P, Heisenberg C-PJ, Maître J-L. 2011. Defective neuroepithelial
cell cohesion affects tangential branchiomotor neuron migration in the zebrafish
neural tube. Development. 138(21), 4673–4683.
mla: Stockinger, Petra, et al. “Defective Neuroepithelial Cell Cohesion Affects
Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” Development,
vol. 138, no. 21, Company of Biologists, 2011, pp. 4673–83, doi:10.1242/dev.071233.
short: P. Stockinger, C.-P.J. Heisenberg, J.-L. Maître, Development 138 (2011) 4673–4683.
corr_author: '1'
date_created: 2018-12-11T12:03:06Z
date_published: 2011-11-01T00:00:00Z
date_updated: 2026-07-28T08:23:30Z
day: '01'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.1242/dev.071233
external_id:
isi:
- '000296060100011'
file:
- access_level: open_access
checksum: ca12b79e01ef36c1ef1aea31cf7e7139
content_type: application/pdf
creator: dernst
date_created: 2019-10-07T14:19:42Z
date_updated: 2020-07-14T12:46:12Z
file_id: '6930'
file_name: 2011_Development_Stockinger.pdf
file_size: 4672439
relation: main_file
file_date_updated: 2020-07-14T12:46:12Z
has_accepted_license: '1'
intvolume: ' 138'
isi: 1
issue: '21'
keyword:
- Epithelial cohesion
- Hindbrain
- Neuronal migration
- Zebrafish
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 4673 - 4683
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '3210'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron
migration in the zebrafish neural tube
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 138
year: '2011'
...
---
OA_place: repository
OA_type: green
_id: '3379'
abstract:
- lang: eng
text: The process of gastrulation is highly conserved across vertebrates on both
the genetic and morphological levels, despite great variety in embryonic shape
and speed of development. This mechanism spatially separates the germ layers and
establishes the organizational foundation for future development. Mesodermal identity
is specified in a superficial layer of cells, the epiblast, where cells maintain
an epithelioid morphology. These cells involute to join the deeper hypoblast layer
where they adopt a migratory, mesenchymal morphology. Expression of a cascade
of related transcription factors orchestrates the parallel genetic transition
from primitive to mature mesoderm. Although the early and late stages of this
process are increasingly well understood, the transition between them has remained
largely mysterious. We present here the first high resolution in vivo observations
of the blebby transitional morphology of involuting mesodermal cells in a vertebrate
embryo. We further demonstrate that the zebrafish spadetail mutation creates a
reversible block in the maturation program, stalling cells in the transition state.
This mutation creates an ideal system for dissecting the specific properties of
cells undergoing the morphological transition of maturing mesoderm, as we demonstrate
with a direct measurement of cell–cell adhesion.
acknowledgement: We thank David Grunwald for providing the spadetail-myc fusion construct.
This work was supported by an NIH grant (GM079203) to D.K. and grants from the Austrian
Academy of Sciences to P.S., and from the DFG, MPG and IST Austria to C.-P.H. R.R.
was supported by a Developmental Biology Predoctoral Training Grant, T32HD007183,
from the National Institute of Child Health and Human Development. B.L.M. was supported
by an American Cancer Society fellowship (PF-07-048-01-DDC).
article_processing_charge: No
article_type: original
author:
- first_name: Richard
full_name: Row, Richard
last_name: Row
- first_name: Jean-Léon
full_name: Maître, Jean-Léon
id: 48F1E0D8-F248-11E8-B48F-1D18A9856A87
last_name: Maître
orcid: 0000-0002-3688-1474
- first_name: Benjamin
full_name: Martin, Benjamin
last_name: Martin
- first_name: Petra
full_name: Stockinger, Petra
id: 261CB030-E90D-11E9-B182-F697D44B663C
last_name: Stockinger
- 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
- first_name: David
full_name: Kimelman, David
last_name: Kimelman
citation:
ama: Row R, Maître J-L, Martin B, Stockinger P, Heisenberg C-PJ, Kimelman D. Completion
of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail.
Developmental Biology. 2011;354(1):102-110. doi:10.1016/j.ydbio.2011.03.025
apa: Row, R., Maître, J.-L., Martin, B., Stockinger, P., Heisenberg, C.-P. J., &
Kimelman, D. (2011). Completion of the epithelial to mesenchymal transition in
zebrafish mesoderm requires Spadetail. Developmental Biology. Elsevier.
https://doi.org/10.1016/j.ydbio.2011.03.025
chicago: Row, Richard, Jean-Léon Maître, Benjamin Martin, Petra Stockinger, Carl-Philipp
J Heisenberg, and David Kimelman. “Completion of the Epithelial to Mesenchymal
Transition in Zebrafish Mesoderm Requires Spadetail.” Developmental Biology.
Elsevier, 2011. https://doi.org/10.1016/j.ydbio.2011.03.025.
ieee: R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P. J. Heisenberg, and D.
Kimelman, “Completion of the epithelial to mesenchymal transition in zebrafish
mesoderm requires Spadetail,” Developmental Biology, vol. 354, no. 1. Elsevier,
pp. 102–110, 2011.
ista: Row R, Maître J-L, Martin B, Stockinger P, Heisenberg C-PJ, Kimelman D. 2011.
Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires
Spadetail. Developmental Biology. 354(1), 102–110.
mla: Row, Richard, et al. “Completion of the Epithelial to Mesenchymal Transition
in Zebrafish Mesoderm Requires Spadetail.” Developmental Biology, vol.
354, no. 1, Elsevier, 2011, pp. 102–10, doi:10.1016/j.ydbio.2011.03.025.
short: R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P.J. Heisenberg, D. Kimelman,
Developmental Biology 354 (2011) 102–110.
das_tickbox: '1'
date_created: 2018-12-11T12:03:00Z
date_published: 2011-06-01T00:00:00Z
date_updated: 2026-07-28T08:31:27Z
day: '01'
department:
- _id: CaHe
doi: 10.1016/j.ydbio.2011.03.025
external_id:
isi:
- '000290550500010'
pmid:
- '21463614'
intvolume: ' 354'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3090540/
month: '06'
oa: 1
oa_version: Submitted Version
page: 102 - 110
pmid: 1
publication: Developmental Biology
publication_status: published
publisher: Elsevier
publist_id: '3228'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Completion of the epithelial to mesenchymal transition in zebrafish mesoderm
requires Spadetail
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 354
year: '2011'
...
---
OA_type: closed access
_id: '3781'
abstract:
- lang: eng
text: We bound the difference in length of two curves in terms of their total curvatures
and the Fréchet distance. The bound is independent of the dimension of the ambient
Euclidean space, it improves upon a bound by Cohen-Steiner and Edelsbrunner, and
it generalizes a result by Fáry and Chakerian.
acknowledgement: Funded by Graduate Aid in Areas of National Need (GAANN) Fellowship.
The author would like to thank Herbert Edelsbrunner for his discussions and guidance.
article_processing_charge: No
article_type: original
author:
- first_name: Brittany Terese
full_name: Fasy, Brittany Terese
id: F65D502E-E68D-11E9-9252-C644099818F6
last_name: Fasy
citation:
ama: Fasy BT. The difference in length of curves in R^n. Acta Scientiarum Mathematicarum.
2011;77(1-2):359-367. doi:10.1007/BF03651375
apa: Fasy, B. T. (2011). The difference in length of curves in R^n. Acta Scientiarum
Mathematicarum. Springer Nature. https://doi.org/10.1007/BF03651375
chicago: Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” Acta
Scientiarum Mathematicarum. Springer Nature, 2011. https://doi.org/10.1007/BF03651375.
ieee: B. T. Fasy, “The difference in length of curves in R^n,” Acta Scientiarum
Mathematicarum, vol. 77, no. 1–2. Springer Nature, pp. 359–367, 2011.
ista: Fasy BT. 2011. The difference in length of curves in R^n. Acta Scientiarum
Mathematicarum. 77(1–2), 359–367.
mla: Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” Acta
Scientiarum Mathematicarum, vol. 77, no. 1–2, Springer Nature, 2011, pp. 359–67,
doi:10.1007/BF03651375.
short: B.T. Fasy, Acta Scientiarum Mathematicarum 77 (2011) 359–367.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:05:08Z
date_published: 2011-06-01T00:00:00Z
date_updated: 2026-07-28T08:11:07Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/BF03651375
intvolume: ' 77'
issue: 1-2
language:
- iso: eng
month: '06'
oa_version: None
page: 359 - 367
publication: Acta Scientiarum Mathematicarum
publication_identifier:
eissn:
- 2064-8316
issn:
- 0001-6969
publication_status: published
publisher: Springer Nature
publist_id: '2446'
quality_controlled: '1'
status: public
title: The difference in length of curves in R^n
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2011'
...
---
OA_place: publisher
OA_type: free access
_id: '3383'
article_processing_charge: No
author:
- 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: 'Heisenberg C-PJ. Invited Lectures ‐ Symposia Area. In: The FEBS Journal.
Vol 278. Wiley; 2011:24-24. doi:10.1111/j.1742-4658.2011.08136.x'
apa: 'Heisenberg, C.-P. J. (2011). Invited Lectures ‐ Symposia Area. In The FEBS
Journal (Vol. 278, pp. 24–24). Torino, Italy: Wiley. https://doi.org/10.1111/j.1742-4658.2011.08136.x'
chicago: Heisenberg, Carl-Philipp J. “Invited Lectures ‐ Symposia Area.” In The
FEBS Journal, 278:24–24. Wiley, 2011. https://doi.org/10.1111/j.1742-4658.2011.08136.x.
ieee: C.-P. J. Heisenberg, “Invited Lectures ‐ Symposia Area,” in The FEBS Journal,
Torino, Italy, 2011, vol. 278, no. S1, pp. 24–24.
ista: Heisenberg C-PJ. 2011. Invited Lectures ‐ Symposia Area. The FEBS Journal.
FEBS Congress on Biochemistry for Tomorrow’s Medicine vol. 278, 24–24.
mla: Heisenberg, Carl-Philipp J. “Invited Lectures ‐ Symposia Area.” The FEBS
Journal, vol. 278, no. S1, Wiley, 2011, pp. 24–24, doi:10.1111/j.1742-4658.2011.08136.x.
short: C.-P.J. Heisenberg, in:, The FEBS Journal, Wiley, 2011, pp. 24–24.
conference:
end_date: 2011-06-30
location: Torino, Italy
name: FEBS Congress on Biochemistry for Tomorrow's Medicine
start_date: 2011-06-25
corr_author: '1'
date_created: 2018-12-11T12:03:01Z
date_published: 2011-07-01T00:00:00Z
date_updated: 2026-07-28T08:27:55Z
day: '01'
department:
- _id: CaHe
doi: 10.1111/j.1742-4658.2011.08136.x
intvolume: ' 278'
issue: S1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1111/j.1742-4658.2011.08136.x
month: '07'
oa: 1
oa_version: Published Version
page: 24 - 24
publication: The FEBS Journal
publication_status: published
publisher: Wiley
publist_id: '3224'
quality_controlled: '1'
status: public
title: Invited Lectures ‐ Symposia Area
type: conference_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 278
year: '2011'
...