---
_id: '5453'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Arbitrarily Strong Amplifiers
of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-749-v3-1
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily
strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-749-v3-1
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria,
2016. https://doi.org/10.15479/AT:IST-2017-749-v3-1.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong
amplifiers of natural selection. IST Austria, 2016.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong
amplifiers of natural selection, IST Austria, 34p.
mla: Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection.
IST Austria, 2016, doi:10.15479/AT:IST-2017-749-v3-1.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong
Amplifiers of Natural Selection, IST Austria, 2016.
date_created: 2018-12-12T11:39:25Z
date_published: 2016-12-30T00:00:00Z
date_updated: 2025-04-15T07:55:37Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2017-749-v3-1
file:
- access_level: open_access
checksum: 83b0313dab3bff4bdb6ac38695026fda
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:13Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5474'
file_name: IST-2017-749-v3+1_main.pdf
file_size: 1015647
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
fulldoi: https://doi.org/10.15479/AT:IST-2017-749-v3-1
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '34'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '755'
related_material:
record:
- id: '5452'
relation: earlier_version
status: public
status: public
title: Arbitrarily strong amplifiers of natural selection
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5550'
abstract:
- lang: eng
text: "We collected flower colour information on species in the tribe Antirrhineae
from taxonomic literature. We also retreived molecular data from GenBank for as
many of these species as possible to estimate phylogenetic relationships among
these taxa. We then used the R package 'diversitree' to examine patterns of evolutionary
transitions between anthocyanin and yellow pigmentation across the phylogeny.\r\n\r\nFor
full details of the methods see:\r\nEllis TJ and Field DL \"Repeated gains in
yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae”,
Annals of Botany (in press)"
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ellis, Thomas
id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
last_name: Ellis
orcid: 0000-0002-8511-0254
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
citation:
ama: Ellis T, Field D. Flower colour data and phylogeny (NEXUS) files. 2016. doi:10.15479/AT:ISTA:34
apa: Ellis, T., & Field, D. (2016). Flower colour data and phylogeny (NEXUS)
files. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:34
chicago: Ellis, Thomas, and David Field. “Flower Colour Data and Phylogeny (NEXUS)
Files.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:34.
ieee: T. Ellis and D. Field, “Flower colour data and phylogeny (NEXUS) files.” Institute
of Science and Technology Austria, 2016.
ista: Ellis T, Field D. 2016. Flower colour data and phylogeny (NEXUS) files, Institute
of Science and Technology Austria, 10.15479/AT:ISTA:34.
mla: Ellis, Thomas, and David Field. Flower Colour Data and Phylogeny (NEXUS)
Files. Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:34.
short: T. Ellis, D. Field, (2016).
datarep_id: '34'
date_created: 2018-12-12T12:31:29Z
date_published: 2016-02-19T00:00:00Z
date_updated: 2025-09-22T07:32:43Z
day: '19'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:34
file:
- access_level: open_access
checksum: 950f85b80427d357bfeff09608ba02e9
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:27Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5594'
file_name: IST-2016-34-v1+1_tellis_flower_colour_data.zip
file_size: 4468543
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
fulldoi: https://doi.org/10.15479/AT:ISTA:34
has_accepted_license: '1'
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
publist_id: '5828'
related_material:
record:
- id: '1382'
relation: research_paper
status: public
status: public
title: Flower colour data and phylogeny (NEXUS) files
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5556'
abstract:
- lang: eng
text: "MATLAB code and processed datasets available for reproducing the results
in: \r\nLukačišin, M.*, Landon, M.*, Jajoo, R*. (2016) Sequence-Specific Thermodynamic
Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking
in Yeast.\r\n*equal contributions"
article_processing_charge: No
author:
- first_name: Martin
full_name: Lukacisin, Martin
id: 298FFE8C-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisin
orcid: 0000-0001-6549-4177
- first_name: Matthieu
full_name: Landon, Matthieu
last_name: Landon
- first_name: Rishi
full_name: Jajoo, Rishi
last_name: Jajoo
citation:
ama: Lukacisin M, Landon M, Jajoo R. MATLAB analysis code for “Sequence-Specific
Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing
and Backtracking in Yeast.” 2016. doi:10.15479/AT:ISTA:45
apa: Lukacisin, M., Landon, M., & Jajoo, R. (2016). MATLAB analysis code for
“Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional
Pausing and Backtracking in Yeast.” Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:45
chicago: Lukacisin, Martin, Matthieu Landon, and Rishi Jajoo. “MATLAB Analysis Code
for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both
Transcriptional Pausing and Backtracking in Yeast.’” Institute of Science and
Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:45.
ieee: M. Lukacisin, M. Landon, and R. Jajoo, “MATLAB analysis code for ‘Sequence-Specific
Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing
and Backtracking in Yeast.’” Institute of Science and Technology Austria, 2016.
ista: Lukacisin M, Landon M, Jajoo R. 2016. MATLAB analysis code for ‘Sequence-Specific
Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing
and Backtracking in Yeast’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:45.
mla: Lukacisin, Martin, et al. MATLAB Analysis Code for “Sequence-Specific Thermodynamic
Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking
in Yeast.” Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:45.
short: M. Lukacisin, M. Landon, R. Jajoo, (2016).
datarep_id: '45'
date_created: 2018-12-12T12:31:31Z
date_published: 2016-08-25T00:00:00Z
date_updated: 2025-07-10T11:49:51Z
day: '25'
ddc:
- '571'
department:
- _id: ToBo
doi: 10.15479/AT:ISTA:45
file:
- access_level: open_access
checksum: ee697f2b1ade4dc14d6ac0334dd832ab
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:58Z
date_updated: 2020-07-14T12:47:02Z
file_id: '5616'
file_name: IST-2016-45-v1+1_PaperCode.zip
file_size: 296722548
relation: main_file
file_date_updated: 2020-07-14T12:47:02Z
fulldoi: https://doi.org/10.15479/AT:ISTA:45
has_accepted_license: '1'
keyword:
- transcription
- pausing
- backtracking
- polymerase
- RNA
- NET-seq
- nucleosome
- basepairing
license: https://creativecommons.org/licenses/by-sa/4.0/
month: '08'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8431'
relation: used_in_publication
status: deleted
- id: '1029'
relation: research_paper
status: public
status: public
title: MATLAB analysis code for 'Sequence-Specific Thermodynamic Properties of Nucleic
Acids Influence Both Transcriptional Pausing and Backtracking in Yeast'
tmp:
image: /images/cc_by_sa.png
legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
BY-SA 4.0)
short: CC BY-SA (4.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5557'
abstract:
- lang: eng
text: "Small synthetic discrete tomography problems.\r\nSizes are 32x32, 64z64 and
256x256.\r\nProjection angles are 2, 4, and 6.\r\nNumber of labels are 3 and 5."
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
citation:
ama: Swoboda P. Synthetic discrete tomography problems. 2016. doi:10.15479/AT:ISTA:46
apa: Swoboda, P. (2016). Synthetic discrete tomography problems. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:46
chicago: Swoboda, Paul. “Synthetic Discrete Tomography Problems.” Institute of Science
and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:46.
ieee: P. Swoboda, “Synthetic discrete tomography problems.” Institute of Science
and Technology Austria, 2016.
ista: Swoboda P. 2016. Synthetic discrete tomography problems, Institute of Science
and Technology Austria, 10.15479/AT:ISTA:46.
mla: Swoboda, Paul. Synthetic Discrete Tomography Problems. Institute of
Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:46.
short: P. Swoboda, (2016).
contributor:
- contributor_type: data_collector
first_name: Jan
last_name: Kuske
datarep_id: '46'
date_created: 2018-12-12T12:31:31Z
date_published: 2016-09-20T00:00:00Z
date_updated: 2024-02-21T13:50:21Z
day: '20'
ddc:
- '006'
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:46
file:
- access_level: open_access
checksum: aa5a16a0dc888da7186fb8fc45e88439
content_type: application/zip
creator: system
date_created: 2018-12-12T13:05:19Z
date_updated: 2020-07-14T12:47:02Z
file_id: '5645'
file_name: IST-2016-46-v1+1_discrete_tomography_synthetic.zip
file_size: 36058401
relation: main_file
file_date_updated: 2020-07-14T12:47:02Z
fulldoi: https://doi.org/10.15479/AT:ISTA:46
has_accepted_license: '1'
keyword:
- discrete tomography
month: '09'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: Synthetic discrete tomography problems
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '5749'
abstract:
- lang: eng
text: Parasitism creates selection for resistance mechanisms in host populations
and is hypothesized to promote increased host evolvability. However, the influence
of these traits on host evolution when parasites are no longer present is unclear.
We used experimental evolution and whole-genome sequencing of Escherichia coli
to determine the effects of past and present exposure to parasitic viruses (phages)
on the spread of mutator alleles, resistance, and bacterial competitive fitness.
We found that mutator alleles spread rapidly during adaptation to any of four
different phage species, and this pattern was even more pronounced with multiple
phages present simultaneously. However, hypermutability did not detectably accelerate
adaptation in the absence of phages and recovery of fitness costs associated with
resistance. Several lineages evolved phage resistance through elevated mucoidy,
and during subsequent evolution in phage-free conditions they rapidly reverted
to nonmucoid, phage-susceptible phenotypes. Genome sequencing revealed that this
phenotypic reversion was achieved by additional genetic changes rather than by
genotypic reversion of the initial resistance mutations. Insertion sequence (IS)
elements played a key role in both the acquisition of resistance and adaptation
in the absence of parasites; unlike single nucleotide polymorphisms, IS insertions
were not more frequent in mutator lineages. Our results provide a genetic explanation
for rapid reversion of mucoidy, a phenotype observed in other bacterial species
including human pathogens. Moreover, this demonstrates that the types of genetic
change underlying adaptation to fitness costs, and consequently the impact of
evolvability mechanisms such as increased point-mutation rates, depend critically
on the mechanism of resistance.
acknowledgement: The authors thank three anonymous reviewers and the editor for helpful
comments on the manuscript, as well as Dominique Schneider for feedback on an earlier
draft, Jenna Gallie for lytic λ and Julien Capelle for T5 and T6. This work was
supported by the Swiss National Science Foundation (PZ00P3_148255 to A.H.) and an
EU Marie Curie PEOPLE Postdoctoral Fellowship for Career Development (FP7-PEOPLE-2012-IEF-331824
to S.W.).
article_processing_charge: No
article_type: original
author:
- first_name: Sébastien
full_name: Wielgoss, Sébastien
last_name: Wielgoss
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Anna M.
full_name: Bischofberger, Anna M.
last_name: Bischofberger
- first_name: Alex R.
full_name: Hall, Alex R.
last_name: Hall
citation:
ama: Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. Adaptation to parasites
and costs of parasite resistance in mutator and nonmutator bacteria. Molecular
Biology and Evolution. 2016;33(3):770-782. doi:10.1093/molbev/msv270
apa: Wielgoss, S., Bergmiller, T., Bischofberger, A. M., & Hall, A. R. (2016).
Adaptation to parasites and costs of parasite resistance in mutator and nonmutator
bacteria. Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1093/molbev/msv270
chicago: Wielgoss, Sébastien, Tobias Bergmiller, Anna M. Bischofberger, and Alex
R. Hall. “Adaptation to Parasites and Costs of Parasite Resistance in Mutator
and Nonmutator Bacteria.” Molecular Biology and Evolution. Oxford University
Press, 2016. https://doi.org/10.1093/molbev/msv270.
ieee: S. Wielgoss, T. Bergmiller, A. M. Bischofberger, and A. R. Hall, “Adaptation
to parasites and costs of parasite resistance in mutator and nonmutator bacteria,”
Molecular Biology and Evolution, vol. 33, no. 3. Oxford University Press,
pp. 770–782, 2016.
ista: Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. 2016. Adaptation to parasites
and costs of parasite resistance in mutator and nonmutator bacteria. Molecular
Biology and Evolution. 33(3), 770–782.
mla: Wielgoss, Sébastien, et al. “Adaptation to Parasites and Costs of Parasite
Resistance in Mutator and Nonmutator Bacteria.” Molecular Biology and Evolution,
vol. 33, no. 3, Oxford University Press, 2016, pp. 770–82, doi:10.1093/molbev/msv270.
short: S. Wielgoss, T. Bergmiller, A.M. Bischofberger, A.R. Hall, Molecular Biology
and Evolution 33 (2016) 770–782.
date_created: 2018-12-18T13:18:10Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2026-04-29T05:57:02Z
day: '01'
ddc:
- '576'
department:
- _id: CaGu
doi: 10.1093/molbev/msv270
external_id:
isi:
- '000371219500015'
pmid:
- '26609077'
file:
- access_level: open_access
checksum: 47d9010690b6c5c17f2ac830cc63ac5c
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T13:21:45Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5750'
file_name: 2016_MolBiolEvol_Wielgoss.pdf
file_size: 634037
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
fulldoi: https://doi.org/10.1093/molbev/msv270
has_accepted_license: '1'
intvolume: ' 33'
isi: 1
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 770-782
pmid: 1
publication: Molecular Biology and Evolution
publication_identifier:
eissn:
- 1537-1719
issn:
- 0737-4038
publication_status: published
publisher: Oxford University Press
pubrep_id: '587'
quality_controlled: '1'
related_material:
record:
- id: '9719'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Adaptation to parasites and costs of parasite resistance in mutator and nonmutator
bacteria
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2016'
...
---
_id: '5805'
abstract:
- lang: eng
text: Discretization of sphere in the integer space follows a particular discretization
scheme, which, in principle, conforms to some topological model. This eventually
gives rise to interesting topological properties of a discrete spherical surface,
which need to be investigated for its analytical characterization. This paper
presents some novel results on the local topological properties of the naive model
of discrete sphere. They follow from the bijection of each quadraginta octant
of naive sphere with its projection map called f -map on the corresponding functional
plane and from the characterization of certain jumps in the f-map. As an application,
we have shown how these properties can be used in designing an efficient reconstruction
algorithm for a naive spherical surface from an input voxel set when it is sparse
or noisy.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Nabhasmita
full_name: Sen, Nabhasmita
last_name: Sen
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: 'Sen N, Biswas R, Bhowmick P. On some local topological properties of naive
discrete sphere. In: Computational Topology in Image Context. Vol 9667.
Cham: Springer Nature; 2016:253-264. doi:10.1007/978-3-319-39441-1_23'
apa: 'Sen, N., Biswas, R., & Bhowmick, P. (2016). On some local topological
properties of naive discrete sphere. In Computational Topology in Image Context
(Vol. 9667, pp. 253–264). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-39441-1_23'
chicago: 'Sen, Nabhasmita, Ranita Biswas, and Partha Bhowmick. “On Some Local Topological
Properties of Naive Discrete Sphere.” In Computational Topology in Image Context,
9667:253–64. Cham: Springer Nature, 2016. https://doi.org/10.1007/978-3-319-39441-1_23.'
ieee: 'N. Sen, R. Biswas, and P. Bhowmick, “On some local topological properties
of naive discrete sphere,” in Computational Topology in Image Context,
vol. 9667, Cham: Springer Nature, 2016, pp. 253–264.'
ista: 'Sen N, Biswas R, Bhowmick P. 2016.On some local topological properties of
naive discrete sphere. In: Computational Topology in Image Context. LNCS, vol.
9667, 253–264.'
mla: Sen, Nabhasmita, et al. “On Some Local Topological Properties of Naive Discrete
Sphere.” Computational Topology in Image Context, vol. 9667, Springer Nature,
2016, pp. 253–64, doi:10.1007/978-3-319-39441-1_23.
short: N. Sen, R. Biswas, P. Bhowmick, in:, Computational Topology in Image Context,
Springer Nature, Cham, 2016, pp. 253–264.
conference:
end_date: 2016-06-17
location: Marseille, France
name: 'CTIC: Computational Topology in Image Context'
start_date: 2016-06-15
date_created: 2019-01-08T20:44:24Z
date_published: 2016-06-02T00:00:00Z
date_updated: 2022-01-28T08:01:22Z
day: '02'
department:
- _id: HeEd
doi: 10.1007/978-3-319-39441-1_23
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-319-39441-1_23
intvolume: ' 9667'
language:
- iso: eng
month: '06'
oa_version: None
page: 253-264
place: Cham
publication: Computational Topology in Image Context
publication_identifier:
eisbn:
- 978-3-319-39441-1
eissn:
- 1611-3349
isbn:
- 978-3-319-39440-4
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: On some local topological properties of naive discrete sphere
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9667
year: '2016'
...
---
_id: '5806'
abstract:
- lang: eng
text: Although the concept of functional plane for naive plane is studied and reported
in the literature in great detail, no similar study is yet found for naive sphere.
This article exposes the first study in this line, opening up further prospects
of analyzing the topological properties of sphere in the discrete space. We show
that each quadraginta octant Q of a naive sphere forms a bijection with its projected
pixel set on a unique coordinate plane, which thereby serves as the functional
plane of Q, and hence gives rise to merely mono-jumps during back projection.
The other two coordinate planes serve as para-functional and dia-functional planes
for Q, as the former is ‘mono-jumping’ but not bijective, whereas the latter holds
neither of the two. Owing to this, the quadraginta octants form symmetry groups
and subgroups with equivalent jump conditions. We also show a potential application
in generating a special class of discrete 3D circles based on back projection
and jump bridging by Steiner voxels. A circle in this class possesses 4-symmetry,
uniqueness, and bounded distance from the underlying real sphere and real plane.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: 'Biswas R, Bhowmick P. On functionality of quadraginta octants of naive sphere
with application to circle drawing. In: Discrete Geometry for Computer Imagery.
Vol 9647. Cham: Springer Nature; 2016:256-267. doi:10.1007/978-3-319-32360-2_20'
apa: 'Biswas, R., & Bhowmick, P. (2016). On functionality of quadraginta octants
of naive sphere with application to circle drawing. In Discrete Geometry for
Computer Imagery (Vol. 9647, pp. 256–267). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-32360-2_20'
chicago: 'Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta
Octants of Naive Sphere with Application to Circle Drawing.” In Discrete Geometry
for Computer Imagery, 9647:256–67. Cham: Springer Nature, 2016. https://doi.org/10.1007/978-3-319-32360-2_20.'
ieee: R. Biswas and P. Bhowmick, “On functionality of quadraginta octants of naive
sphere with application to circle drawing,” in Discrete Geometry for Computer
Imagery, Nantes, France, 2016, vol. 9647, pp. 256–267.
ista: 'Biswas R, Bhowmick P. 2016. On functionality of quadraginta octants of naive
sphere with application to circle drawing. Discrete Geometry for Computer Imagery.
DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS,
vol. 9647, 256–267.'
mla: Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants
of Naive Sphere with Application to Circle Drawing.” Discrete Geometry for
Computer Imagery, vol. 9647, Springer Nature, 2016, pp. 256–67, doi:10.1007/978-3-319-32360-2_20.
short: R. Biswas, P. Bhowmick, in:, Discrete Geometry for Computer Imagery, Springer
Nature, Cham, 2016, pp. 256–267.
conference:
end_date: 2016-04-20
location: Nantes, France
name: 'DGCI: International Conference on Discrete Geometry for Computer Imagery'
start_date: 2016-04-18
date_created: 2019-01-08T20:44:37Z
date_published: 2016-04-09T00:00:00Z
date_updated: 2022-01-28T08:10:11Z
day: '09'
department:
- _id: HeEd
doi: 10.1007/978-3-319-32360-2_20
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-319-32360-2_20
intvolume: ' 9647'
language:
- iso: eng
month: '04'
oa_version: None
page: 256-267
place: Cham
publication: Discrete Geometry for Computer Imagery
publication_identifier:
eisbn:
- 978-3-319-32360-2
isbn:
- 978-3-319-32359-6
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: On functionality of quadraginta octants of naive sphere with application to
circle drawing
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9647
year: '2016'
...
---
_id: '5809'
abstract:
- lang: eng
text: A discrete spherical circle is a topologically well-connected 3D circle in
the integer space, which belongs to a discrete sphere as well as a discrete plane.
It is one of the most important 3D geometric primitives, but has not possibly
yet been studied up to its merit. This paper is a maiden exposition of some of
its elementary properties, which indicates a sense of its profound theoretical
prospects in the framework of digital geometry. We have shown how different types
of discretization can lead to forbidden and admissible classes, when one attempts
to define the discretization of a spherical circle in terms of intersection between
a discrete sphere and a discrete plane. Several fundamental theoretical results
have been presented, the algorithm for construction of discrete spherical circles
has been discussed, and some test results have been furnished to demonstrate its
practicality and usefulness.
article_processing_charge: No
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
- first_name: Valentin E.
full_name: Brimkov, Valentin E.
last_name: Brimkov
citation:
ama: 'Biswas R, Bhowmick P, Brimkov VE. On the connectivity and smoothness of discrete
spherical circles. In: Combinatorial Image Analysis. Vol 9448. Cham: Springer
Nature; 2016:86-100. doi:10.1007/978-3-319-26145-4_7'
apa: 'Biswas, R., Bhowmick, P., & Brimkov, V. E. (2016). On the connectivity
and smoothness of discrete spherical circles. In Combinatorial image analysis
(Vol. 9448, pp. 86–100). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-26145-4_7'
chicago: 'Biswas, Ranita, Partha Bhowmick, and Valentin E. Brimkov. “On the Connectivity
and Smoothness of Discrete Spherical Circles.” In Combinatorial Image Analysis,
9448:86–100. Cham: Springer Nature, 2016. https://doi.org/10.1007/978-3-319-26145-4_7.'
ieee: 'R. Biswas, P. Bhowmick, and V. E. Brimkov, “On the connectivity and smoothness
of discrete spherical circles,” in Combinatorial image analysis, vol. 9448,
Cham: Springer Nature, 2016, pp. 86–100.'
ista: 'Biswas R, Bhowmick P, Brimkov VE. 2016.On the connectivity and smoothness
of discrete spherical circles. In: Combinatorial image analysis. vol. 9448, 86–100.'
mla: Biswas, Ranita, et al. “On the Connectivity and Smoothness of Discrete Spherical
Circles.” Combinatorial Image Analysis, vol. 9448, Springer Nature, 2016,
pp. 86–100, doi:10.1007/978-3-319-26145-4_7.
short: R. Biswas, P. Bhowmick, V.E. Brimkov, in:, Combinatorial Image Analysis,
Springer Nature, Cham, 2016, pp. 86–100.
conference:
end_date: 2015-11-27
location: Kolkata, India
name: 'IWCIA: International Workshop on Combinatorial Image Analysis'
start_date: 2015-11-24
date_created: 2019-01-08T20:45:19Z
date_published: 2016-01-06T00:00:00Z
date_updated: 2022-01-28T08:13:03Z
day: '06'
department:
- _id: HeEd
doi: 10.1007/978-3-319-26145-4_7
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-319-26145-4_7
intvolume: ' 9448'
language:
- iso: eng
month: '01'
oa_version: None
page: 86-100
place: Cham
publication: Combinatorial image analysis
publication_identifier:
eisbn:
- 978-3-319-26145-4
eissn:
- 1611-3349
isbn:
- 978-3-319-26144-7
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: On the connectivity and smoothness of discrete spherical circles
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9448
year: '2016'
...
---
OA_type: closed access
_id: '19990'
abstract:
- lang: eng
text: Visualizing molecular localization at high resolution contributes to understanding
of their functions and roles in physiological and pathological conditions. Sodium
dodecyl sulfate-digested freeze-fracture replica labeling (SDS-FRL) is a powerful
electron microscopy method to study high-resolution two-dimensional distribution
of transmembrane proteins and their tightly associated proteins on platinum-carbon
replica. During treatment with SDS, unfixed proteins and intracellular organelle
are dissolved and integral membrane proteins captured and stabilized by carbon
and platinum deposition are denatured, retaining most of their antigenicity, and
exposed on exoplasmic and protoplasmic surfaces of lipid monolayers. The exposure
of these antigens on the surface of replica facilitates the accessibility of antibodies
and therefore provides higher labeling efficiency than those obtained with other
immunoelectron microscopy techniques. In this chapter, we describe the protocols
of SDS-FRL adapted for mammalian brain samples and an additional procedure for
fluorescence-guided electron microscopy for replica immunolabeling.
acknowledgement: We thank Mitsuru Ikeda for preparing replica images used in Fig.
2.
article_processing_charge: No
author:
- first_name: Harumi
full_name: Harada, Harumi
id: 2E55CDF2-F248-11E8-B48F-1D18A9856A87
last_name: Harada
orcid: 0000-0001-7429-7896
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
citation:
ama: 'Harada H, Shigemoto R. High-Resolution Localization of Membrane Proteins by
SDS-Digested Freeze-Fracture Replica Labeling (SDS-FRL). In: Receptor and Ion
Channel Detection in the Brain. Neuromethods. Springer Nature; 2016:233-245.
doi:10.1007/978-1-4939-3064-7_17'
apa: Harada, H., & Shigemoto, R. (2016). High-Resolution Localization of Membrane
Proteins by SDS-Digested Freeze-Fracture Replica Labeling (SDS-FRL). In Receptor
and Ion Channel Detection in the Brain (pp. 233–245). Springer Nature. https://doi.org/10.1007/978-1-4939-3064-7_17
chicago: Harada, Harumi, and Ryuichi Shigemoto. “High-Resolution Localization of
Membrane Proteins by SDS-Digested Freeze-Fracture Replica Labeling (SDS-FRL).”
In Receptor and Ion Channel Detection in the Brain, 233–45. Neuromethods.
Springer Nature, 2016. https://doi.org/10.1007/978-1-4939-3064-7_17.
ieee: H. Harada and R. Shigemoto, “High-Resolution Localization of Membrane Proteins
by SDS-Digested Freeze-Fracture Replica Labeling (SDS-FRL),” in Receptor and
Ion Channel Detection in the Brain, Springer Nature, 2016, pp. 233–245.
ista: 'Harada H, Shigemoto R. 2016.High-Resolution Localization of Membrane Proteins
by SDS-Digested Freeze-Fracture Replica Labeling (SDS-FRL). In: Receptor and Ion
Channel Detection in the Brain. , 233–245.'
mla: Harada, Harumi, and Ryuichi Shigemoto. “High-Resolution Localization of Membrane
Proteins by SDS-Digested Freeze-Fracture Replica Labeling (SDS-FRL).” Receptor
and Ion Channel Detection in the Brain, Springer Nature, 2016, pp. 233–45,
doi:10.1007/978-1-4939-3064-7_17.
short: H. Harada, R. Shigemoto, in:, Receptor and Ion Channel Detection in the Brain,
Springer Nature, 2016, pp. 233–245.
corr_author: '1'
date_created: 2025-07-10T13:56:06Z
date_published: 2016-02-02T00:00:00Z
date_updated: 2026-04-07T08:32:03Z
day: '02'
department:
- _id: RySh
doi: 10.1007/978-1-4939-3064-7_17
fulldoi: https://doi.org/10.1007/978-1-4939-3064-7_17
language:
- iso: eng
month: '02'
oa_version: None
page: 233-245
publication: Receptor and Ion Channel Detection in the Brain
publication_identifier:
eisbn:
- '9781493930647'
eissn:
- 1940-6045
isbn:
- '9781493930630'
issn:
- 0893-2336
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
series_title: Neuromethods
status: public
title: High-Resolution Localization of Membrane Proteins by SDS-Digested Freeze-Fracture
Replica Labeling (SDS-FRL)
type: book_chapter
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2016'
...
---
OA_type: closed access
_id: '19991'
abstract:
- lang: eng
text: 'When applying machine learning techniques to real-world problems, prior knowledge
plays a crucial role in enriching the learning system. This prior knowledge is
typically defined by domain experts and can be integrated into machine learning
algorithms in a variety of ways: as a preference of certain prediction functions
over others, as a Bayesian prior over parameters, or as additional information
about the samples in the training set used for learning a prediction function.
The latter setup is called learning using privileged information (LUPI) and was
adopted by Vapnik and Vashist in (Neural Netw, 2009). Formally, LUPI refers to
the setting when, in addition to the main data modality, the learning system has
access to an extra source of information about the training examples. The additional
source of information is only available during training and therefore is called
privileged. The main goal of LUPI is to utilize privileged information and to
learn a better model in the main data modality than one would learn without the
privileged source. As an illustration, for protein classification based on amino-acid
sequences, the protein tertiary structure can be considered additional information.
Another example is recognizing objects in images; the textual information in the
form of image tags contains additional object descriptions and can be used as
privileged.'
article_processing_charge: No
author:
- first_name: Viktoriia
full_name: Sharmanska, Viktoriia
id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87
last_name: Sharmanska
orcid: 0000-0003-0192-9308
- first_name: Novi
full_name: Quadrianto, Novi
last_name: Quadrianto
citation:
ama: 'Sharmanska V, Quadrianto N. Learning Using Privileged Information. In: Encyclopedia
of Machine Learning and Data Mining. Springer Nature; 2016:1-4. doi:10.1007/978-1-4899-7502-7_892-1'
apa: Sharmanska, V., & Quadrianto, N. (2016). Learning Using Privileged Information.
In Encyclopedia of Machine Learning and Data Mining (pp. 1–4). Springer
Nature. https://doi.org/10.1007/978-1-4899-7502-7_892-1
chicago: Sharmanska, Viktoriia, and Novi Quadrianto. “Learning Using Privileged
Information.” In Encyclopedia of Machine Learning and Data Mining, 1–4.
Springer Nature, 2016. https://doi.org/10.1007/978-1-4899-7502-7_892-1.
ieee: V. Sharmanska and N. Quadrianto, “Learning Using Privileged Information,”
in Encyclopedia of Machine Learning and Data Mining, Springer Nature, 2016,
pp. 1–4.
ista: 'Sharmanska V, Quadrianto N. 2016.Learning Using Privileged Information. In:
Encyclopedia of Machine Learning and Data Mining. , 1–4.'
mla: Sharmanska, Viktoriia, and Novi Quadrianto. “Learning Using Privileged Information.”
Encyclopedia of Machine Learning and Data Mining, Springer Nature, 2016,
pp. 1–4, doi:10.1007/978-1-4899-7502-7_892-1.
short: V. Sharmanska, N. Quadrianto, in:, Encyclopedia of Machine Learning and Data
Mining, Springer Nature, 2016, pp. 1–4.
corr_author: '1'
date_created: 2025-07-10T13:57:52Z
date_published: 2016-07-06T00:00:00Z
date_updated: 2025-09-23T10:53:13Z
day: '06'
department:
- _id: ChLa
doi: 10.1007/978-1-4899-7502-7_892-1
fulldoi: https://doi.org/10.1007/978-1-4899-7502-7_892-1
language:
- iso: eng
month: '07'
oa_version: None
page: 1-4
publication: Encyclopedia of Machine Learning and Data Mining
publication_identifier:
eisbn:
- '9781489975027'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Learning Using Privileged Information
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '1008'
abstract:
- lang: eng
text: Feedback loops in biological networks, among others, enable differentiation
and cell cycle progression, and increase robustness in signal transduction. In
natural networks, feedback loops are often complex and intertwined, making it
challenging to identify which loops are mainly responsible for an observed behavior.
However, minimal synthetic replicas could allow for such identification. Here,
we engineered a synthetic permease-inducer-repressor system in Saccharomyces cerevisiae
to analyze if a transport-mediated positive feedback loop could be a core mechanism
for the switch-like behavior in the regulation of metabolic gene networks such
as the S. cerevisiae GAL system or the Escherichia coli lac operon. We characterized
the synthetic circuit using deterministic and stochastic mathematical models.
Similar to its natural counterparts, our synthetic system shows bistable and hysteretic
behavior, and the inducer concentration range for bistability as well as the switching
rates between the two stable states depend on the repressor concentration. Our
results indicate that a generic permease–inducer–repressor circuit with a single
feedback loop is sufficient to explain the experimentally observed bistable behavior
of the natural systems. We anticipate that the approach of reimplementing natural
systems with orthogonal parts to identify crucial network components is applicable
to other natural systems such as signaling pathways.
acknowledgement: We thank Julio Polaina (Instituto de Agroqu ı ́ mica y Tecnolog ı
́ a de Alimentos, C.S.I.C., Paterna, Spain) for the gift of plasmid pMR4, Gregor
W. Schmidt for provision of and support with the micro fl uidic device, Markus Du
̈ rr for the cell tracking R script, and Lukas Widmer for the script for MEIGO using
“ parfor ” in MATLAB. We acknowledge the members of the Stelling group for discussions,
comments, and support.
article_processing_charge: No
author:
- first_name: Robert
full_name: Gnügge, Robert
last_name: Gnügge
- first_name: Lekshmi
full_name: Dharmarajan, Lekshmi
last_name: Dharmarajan
- first_name: Moritz
full_name: Lang, Moritz
id: 29E0800A-F248-11E8-B48F-1D18A9856A87
last_name: Lang
- first_name: Jörg
full_name: Stelling, Jörg
last_name: Stelling
citation:
ama: Gnügge R, Dharmarajan L, Lang M, Stelling J. An orthogonal permease–inducer–repressor
feedback loop shows bistability. ACS Synthetic Biology. 2016;5(10):1098-1107.
doi:10.1021/acssynbio.6b00013
apa: Gnügge, R., Dharmarajan, L., Lang, M., & Stelling, J. (2016). An orthogonal
permease–inducer–repressor feedback loop shows bistability. ACS Synthetic Biology.
American Chemical Society. https://doi.org/10.1021/acssynbio.6b00013
chicago: Gnügge, Robert, Lekshmi Dharmarajan, Moritz Lang, and Jörg Stelling. “An
Orthogonal Permease–Inducer–Repressor Feedback Loop Shows Bistability.” ACS
Synthetic Biology. American Chemical Society, 2016. https://doi.org/10.1021/acssynbio.6b00013.
ieee: R. Gnügge, L. Dharmarajan, M. Lang, and J. Stelling, “An orthogonal permease–inducer–repressor
feedback loop shows bistability,” ACS Synthetic Biology, vol. 5, no. 10.
American Chemical Society, pp. 1098–1107, 2016.
ista: Gnügge R, Dharmarajan L, Lang M, Stelling J. 2016. An orthogonal permease–inducer–repressor
feedback loop shows bistability. ACS Synthetic Biology. 5(10), 1098–1107.
mla: Gnügge, Robert, et al. “An Orthogonal Permease–Inducer–Repressor Feedback Loop
Shows Bistability.” ACS Synthetic Biology, vol. 5, no. 10, American Chemical
Society, 2016, pp. 1098–107, doi:10.1021/acssynbio.6b00013.
short: R. Gnügge, L. Dharmarajan, M. Lang, J. Stelling, ACS Synthetic Biology 5
(2016) 1098–1107.
date_created: 2018-12-11T11:49:40Z
date_published: 2016-05-05T00:00:00Z
date_updated: 2025-09-22T14:20:45Z
day: '05'
department:
- _id: CaGu
doi: 10.1021/acssynbio.6b00013
external_id:
isi:
- '000386196100008'
fulldoi: https://doi.org/10.1021/acssynbio.6b00013
intvolume: ' 5'
isi: 1
issue: '10'
language:
- iso: eng
month: '05'
oa_version: None
page: 1098 - 1107
publication: ACS Synthetic Biology
publication_status: published
publisher: American Chemical Society
publist_id: '6390'
quality_controlled: '1'
status: public
title: An orthogonal permease–inducer–repressor feedback loop shows bistability
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 5
year: '2016'
...
---
_id: '1068'
abstract:
- lang: eng
text: 'Games on graphs provide the appropriate framework to study several central
problems in computer science, such as verification and synthesis of reactive systems.
One of the most basic objectives for games on graphs is the liveness (or Büchi)
objective that given a target set of vertices requires that some vertex in the
target set is visited infinitely often. We study generalized Büchi objectives
(i.e., conjunction of liveness objectives), and implications between two generalized
Büchi objectives (known as GR(1) objectives), that arise in numerous applications
in computer-aided verification. We present improved algorithms and conditional
super-linear lower bounds based on widely believed assumptions about the complexity
of (A1) combinatorial Boolean matrix multiplication and (A2) CNF-SAT. We consider
graph games with n vertices, m edges, and generalized Büchi objectives with k
conjunctions. First, we present an algorithm with running time O(k*n^2), improving
the previously known O(k*n*m) and O(k^2*n^2) worst-case bounds. Our algorithm
is optimal for dense graphs under (A1). Second, we show that the basic algorithm
for the problem is optimal for sparse graphs when the target sets have constant
size under (A2). Finally, we consider GR(1) objectives, with k_1 conjunctions
in the antecedent and k_2 conjunctions in the consequent, and present an O(k_1
k_2 n^{2.5})-time algorithm, improving the previously known O(k_1*k_2*n*m)-time
algorithm for m > n^{1.5}. '
acknowledgement: K. C., M. H., and W. D. are partially supported by the Vienna Science
and Technology Fund (WWTF) through project ICT15-003. K. C. is partially supported
by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC
Start grant (279307
alternative_title:
- LIPIcs
article_number: '25'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvorák, Wolfgang
last_name: Dvorák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. Conditionally optimal
algorithms for generalized Büchi Games. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2016. doi:10.4230/LIPIcs.MFCS.2016.25'
apa: 'Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2016).
Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented
at the MFCS: Mathematical Foundations of Computer Science, Krakow, Poland: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.25'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Veronika
Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,”
Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.25.
ieee: 'K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Conditionally
optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical
Foundations of Computer Science, Krakow, Poland, 2016, vol. 58.'
ista: 'Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2016. Conditionally
optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations
of Computer Science, LIPIcs, vol. 58, 25.'
mla: Chatterjee, Krishnendu, et al. Conditionally Optimal Algorithms for Generalized
Büchi Games. Vol. 58, 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016, doi:10.4230/LIPIcs.MFCS.2016.25.
short: K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2016.
conference:
end_date: 2016-08-26
location: Krakow, Poland
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2016-08-22
date_created: 2018-12-11T11:49:58Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2025-07-10T11:49:55Z
day: '01'
ddc:
- '000'
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2016.25
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:02Z
date_updated: 2018-12-12T10:16:02Z
file_id: '5187'
file_name: IST-2017-779-v1+1_LIPIcs-MFCS-2016-25.pdf
file_size: 632786
relation: main_file
file_date_updated: 2018-12-12T10:16:02Z
fulldoi: https://doi.org/10.4230/LIPIcs.MFCS.2016.25
has_accepted_license: '1'
intvolume: ' 58'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6317'
pubrep_id: '779'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Conditionally optimal algorithms for generalized Büchi Games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2016'
...
---
_id: '1069'
abstract:
- lang: eng
text: "The Continuous Skolem Problem asks whether a real-valued function satisfying
a linear differen-\r\ntial equation has a zero in a given interval of real numbers.
This is a fundamental reachability\r\nproblem for continuous linear dynamical
systems, such as linear hybrid automata and continuous-\r\ntime Markov chains.
Decidability of the problem is currently open – indeed decidability is open\r\neven
for the sub-problem in which a zero is sought in a bounded interval. In this paper
we show\r\ndecidability of the bounded problem subject to Schanuel’s Conjecture,
a unifying conjecture in\r\ntranscendental number theory. We furthermore analyse
the unbounded problem in terms of the\r\nfrequencies of the differential equation,
that is, the imaginary parts of the characteristic roots.\r\nWe show that the
unbounded problem can be reduced to the bounded problem if there is at most\r\none
rationally linearly independent frequency, or if there are two rationally linearly
independent\r\nfrequencies and all characteristic roots are simple. We complete
the picture by showing that de-\r\ncidability of the unbounded problem in the
case of two (or more) rationally linearly independent\r\nfrequencies would entail
a major new effectiveness result in Diophantine approximation, namely\r\ncomputability
of the Diophantine-approximation types of all real algebraic numbers."
acknowledgement: 'Ventsislav Chonev is supported by Austrian Science Fund (FWF) NFN
Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and ERC
Advanced Grant (267989: QUAREM).'
alternative_title:
- LIPIcs
article_number: '100'
article_processing_charge: No
author:
- first_name: Ventsislav K
full_name: Chonev, Ventsislav K
id: 36CBE2E6-F248-11E8-B48F-1D18A9856A87
last_name: Chonev
- first_name: Joël
full_name: Ouaknine, Joël
last_name: Ouaknine
- first_name: James
full_name: Worrell, James
last_name: Worrell
citation:
ama: 'Chonev VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear
dynamical systems. In: Vol 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2016. doi:10.4230/LIPIcs.ICALP.2016.100'
apa: 'Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On the skolem problem
for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata,
Languages and Programming, Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für
Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.100'
chicago: Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem
Problem for Continuous Linear Dynamical Systems,” Vol. 55. Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.100.
ieee: 'V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous
linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming,
Rome, Italy, 2016, vol. 55.'
ista: 'Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous
linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs,
vol. 55, 100.'
mla: Chonev, Ventsislav K., et al. On the Skolem Problem for Continuous Linear
Dynamical Systems. Vol. 55, 100, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016, doi:10.4230/LIPIcs.ICALP.2016.100.
short: V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2016.
conference:
end_date: 2016-07-15
location: Rome, Italy
name: 'ICALP: Automata, Languages and Programming'
start_date: 2016-07-12
date_created: 2018-12-11T11:49:59Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2025-06-03T11:32:08Z
day: '01'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2016.100
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:26Z
date_updated: 2018-12-12T10:16:26Z
file_id: '5213'
file_name: IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf
file_size: 521415
relation: main_file
file_date_updated: 2018-12-12T10:16:26Z
fulldoi: https://doi.org/10.4230/LIPIcs.ICALP.2016.100
has_accepted_license: '1'
intvolume: ' 55'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6314'
pubrep_id: '778'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the skolem problem for continuous linear dynamical systems
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...
---
_id: '1070'
abstract:
- lang: eng
text: 'We present a logic that extends CTL (Computation Tree Logic) with operators
that express synchronization properties. A property is synchronized in a system
if it holds in all paths of a certain length. The new logic is obtained by using
the same path quantifiers and temporal operators as in CTL, but allowing a different
order of the quantifiers. This small syntactic variation induces a logic that
can express non-regular properties for which known extensions of MSO with equality
of path length are undecidable. We show that our variant of CTL is decidable and
that the model-checking problem is in Delta_3^P = P^{NP^NP}, and is DP-hard. We
analogously consider quantifier exchange in extensions of CTL, and we present
operators defined using basic operators of CTL* that express the occurrence of
infinitely many synchronization points. We show that the model-checking problem
remains in Delta_3^P. The distinguishing power of CTL and of our new logic coincide
if the Next operator is allowed in the logics, thus the classical bisimulation
quotient can be used for state-space reduction before model checking. '
acknowledgement: "This research was partially supported by Austrian Science Fund (FWF)
NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), Vienna
Science and Technology Fund (WWTF) through project ICT15-003, and European project
Cassting (FP7-601148).\r\n\r\nWe thank Stefan Göller and anonymous reviewers for
their insightful\r\ncomments and suggestions.\r\n"
alternative_title:
- LIPIcs
article_number: '98'
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Computation tree logic for synchronization properties.
In: Vol 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.98'
apa: 'Chatterjee, K., & Doyen, L. (2016). Computation tree logic for synchronization
properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming,
Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.98'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for
Synchronization Properties,” Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.98.
ieee: 'K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,”
presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016,
vol. 55.'
ista: 'Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties.
ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Computation Tree Logic for Synchronization
Properties. Vol. 55, 98, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016, doi:10.4230/LIPIcs.ICALP.2016.98.
short: K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016.
conference:
end_date: 2016-07-15
location: Rome, Italy
name: 'ICALP: Automata, Languages and Programming'
start_date: 2016-07-12
date_created: 2018-12-11T11:49:59Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2025-06-03T11:18:54Z
day: '01'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2016.98
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:52Z
date_updated: 2018-12-12T10:08:52Z
file_id: '4714'
file_name: IST-2017-812-v1+1_LIPIcs-ICALP-2016-98.pdf
file_size: 546133
relation: main_file
file_date_updated: 2018-12-12T10:08:52Z
fulldoi: https://doi.org/10.4230/LIPIcs.ICALP.2016.98
has_accepted_license: '1'
intvolume: ' 55'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6313'
pubrep_id: '812'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computation tree logic for synchronization properties
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...
---
_id: '1071'
abstract:
- lang: eng
text: 'We consider data-structures for answering reachability and distance queries
on constant-treewidth graphs with n nodes, on the standard RAM computational model
with wordsize W=Theta(log n). Our first contribution is a data-structure that
after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time;
and (2) single-source reachability queries in O(n/log n) time. This is (asymptotically)
optimal and is faster than DFS/BFS when answering more than a constant number
of single-source queries. The data-structure uses at all times O(n) space. Our
second contribution is a space-time tradeoff data-structure for distance queries.
For any epsilon in [1/2,1], we provide a data-structure with polynomial preprocessing
time that allows pair queries in O(n^{1-\epsilon} alpha(n)) time, where alpha
is the inverse of the Ackermann function, and at all times uses O(n^epsilon) space.
The input graph G is not considered in the space complexity. '
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE) and ERC Start grant
(279307: Graph Games).'
alternative_title:
- LIPIcs
article_number: '28'
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: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Optimal reachability and a space
time tradeoff for distance queries in constant treewidth graphs. In: Vol 57. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.ESA.2016.28'
apa: 'Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs (Vol.
57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.28'
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
“Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant
Treewidth Graphs,” Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.
ieee: 'K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs,”
presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016,
vol. 57.'
ista: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs. ESA:
European Symposium on Algorithms, LIPIcs, vol. 57, 28.'
mla: Chatterjee, Krishnendu, et al. Optimal Reachability and a Space Time Tradeoff
for Distance Queries in Constant Treewidth Graphs. Vol. 57, 28, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.ESA.2016.28.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2016.
conference:
end_date: 2016-08-24
location: Aarhus, Denmark
name: 'ESA: European Symposium on Algorithms'
start_date: 2016-08-22
date_created: 2018-12-11T11:49:59Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2026-04-08T14:22:16Z
day: '01'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ESA.2016.28
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:31Z
date_updated: 2018-12-12T10:14:31Z
file_id: '5084'
file_name: IST-2017-777-v1+1_LIPIcs-ESA-2016-28.pdf
file_size: 579225
relation: main_file
file_date_updated: 2018-12-12T10:14:31Z
fulldoi: https://doi.org/10.4230/LIPIcs.ESA.2016.28
has_accepted_license: '1'
intvolume: ' 57'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6312'
pubrep_id: '777'
quality_controlled: '1'
related_material:
record:
- id: '821'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Optimal reachability and a space time tradeoff for distance queries in constant
treewidth graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2016'
...
---
_id: '1081'
abstract:
- lang: eng
text: The asymmetric localization of proteins in the plasma membrane domains of
eukaryotic cells is a fundamental manifestation of cell polarity that is central
to multicellular organization and developmental patterning. In plants, the mechanisms
underlying the polar localization of cargo proteins are still largely unknown
and appear to be fundamentally distinct from those operating in mammals. Here,
we present a systematic, quantitative comparative analysis of the polar delivery
and subcellular localization of proteins that characterize distinct polar plasma
membrane domains in plant cells. The combination of microscopic analyses and computational
modeling revealed a mechanistic framework common to diverse polar cargos and underlying
the establishment and maintenance of apical, basal, and lateral polar domains
in plant cells. This mechanism depends on the polar secretion, constitutive endocytic
recycling, and restricted lateral diffusion of cargos within the plasma membrane.
Moreover, our observations suggest that polar cargo distribution involves the
individual protein potential to form clusters within the plasma membrane and interact
with the extracellular matrix. Our observations provide insights into the shared
cellular mechanisms of polar cargo delivery and polarity maintenance in plant
cells.
acknowledgement: "We thank Bonnie Bartel, Jenny Russinova and Niko Geldner\r\nfor
sharing published material, Martine de Cock and Annick\r\nBleys for help in preparing
the manuscript. This work was\r\nsupported by the European Research Council (project\r\nERC-2011-StG-20101109-PSDP);
Czech Science Foundation\r\nGAČR (GA13-40637S); project CEITEC—Central European\r\nInstitute
of Technology (CZ.1.05/1.1.00/02.0068). SV is a\r\npostdoctoral fellow of the Research
Foundation-Flanders.\r\nSN is a Project Assistant Professor supported by the Japanese\r\nSociety
for the Promotion of Science (JSPS; 30612022 to SN),\r\nthe NC-CARP project of the
Ministry of Education, Culture,\r\nSports, Science and Technology in Japan to SN."
article_number: '16018'
article_processing_charge: No
author:
- first_name: Łukasz
full_name: Łangowski, Łukasz
last_name: Łangowski
- first_name: Krzysztof T
full_name: Wabnik, Krzysztof T
id: 4DE369A4-F248-11E8-B48F-1D18A9856A87
last_name: Wabnik
orcid: 0000-0001-7263-0560
- first_name: Hongjiang
full_name: Li, Hongjiang
id: 33CA54A6-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0001-5039-9660
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Satoshi
full_name: Naramoto, Satoshi
last_name: Naramoto
- first_name: Hirokazu
full_name: Tanaka, Hirokazu
last_name: Tanaka
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Łangowski Ł, Wabnik KT, Li H, et al. Cellular mechanisms for cargo delivery
and polarity maintenance at different polar domains in plant cells. Cell Discovery.
2016;2. doi:10.1038/celldisc.2016.18
apa: Łangowski, Ł., Wabnik, K. T., Li, H., Vanneste, S., Naramoto, S., Tanaka, H.,
& Friml, J. (2016). Cellular mechanisms for cargo delivery and polarity maintenance
at different polar domains in plant cells. Cell Discovery. Nature Publishing
Group. https://doi.org/10.1038/celldisc.2016.18
chicago: Łangowski, Łukasz, Krzysztof T Wabnik, Hongjiang Li, Steffen Vanneste,
Satoshi Naramoto, Hirokazu Tanaka, and Jiří Friml. “Cellular Mechanisms for Cargo
Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.”
Cell Discovery. Nature Publishing Group, 2016. https://doi.org/10.1038/celldisc.2016.18.
ieee: Ł. Łangowski et al., “Cellular mechanisms for cargo delivery and polarity
maintenance at different polar domains in plant cells,” Cell Discovery,
vol. 2. Nature Publishing Group, 2016.
ista: Łangowski Ł, Wabnik KT, Li H, Vanneste S, Naramoto S, Tanaka H, Friml J. 2016.
Cellular mechanisms for cargo delivery and polarity maintenance at different polar
domains in plant cells. Cell Discovery. 2, 16018.
mla: Łangowski, Łukasz, et al. “Cellular Mechanisms for Cargo Delivery and Polarity
Maintenance at Different Polar Domains in Plant Cells.” Cell Discovery,
vol. 2, 16018, Nature Publishing Group, 2016, doi:10.1038/celldisc.2016.18.
short: Ł. Łangowski, K.T. Wabnik, H. Li, S. Vanneste, S. Naramoto, H. Tanaka, J.
Friml, Cell Discovery 2 (2016).
date_created: 2018-12-11T11:50:02Z
date_published: 2016-07-19T00:00:00Z
date_updated: 2025-09-22T14:19:46Z
day: '19'
ddc:
- '580'
department:
- _id: EvBe
- _id: JiFr
doi: 10.1038/celldisc.2016.18
ec_funded: 1
external_id:
isi:
- '000414797400001'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:33Z
date_updated: 2018-12-12T10:13:33Z
file_id: '5017'
file_name: IST-2017-757-v1+1_celldisc201618.pdf
file_size: 5261671
relation: main_file
file_date_updated: 2018-12-12T10:13:33Z
fulldoi: https://doi.org/10.1038/celldisc.2016.18
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Cell Discovery
publication_status: published
publisher: Nature Publishing Group
publist_id: '6299'
pubrep_id: '757'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cellular mechanisms for cargo delivery and polarity maintenance at different
polar domains in plant cells
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2
year: '2016'
...
---
_id: '8094'
abstract:
- lang: eng
text: 'With the accelerated development of robot technologies, optimal control becomes
one of the central themes of research. In traditional approaches, the controller,
by its internal functionality, finds appropriate actions on the basis of the history
of sensor values, guided by the goals, intentions, objectives, learning schemes,
and so forth. The idea is that the controller controls the world---the body plus
its environment---as reliably as possible. This paper focuses on new lines of
self-organization for developmental robotics. We apply the recently developed
differential extrinsic synaptic plasticity to a muscle-tendon driven arm-shoulder
system from the Myorobotics toolkit. In the experiments, we observe a vast variety
of self-organized behavior patterns: when left alone, the arm realizes pseudo-random
sequences of different poses. By applying physical forces, the system can be entrained
into definite motion patterns like wiping a table. Most interestingly, after attaching
an object, the controller gets in a functional resonance with the object''s internal
dynamics, starting to shake spontaneously bottles half-filled with water or sensitively
driving an attached pendulum into a circular mode. When attached to the crank
of a wheel the neural system independently discovers how to rotate it. In this
way, the robot discovers affordances of objects its body is interacting with.'
article_processing_charge: No
author:
- first_name: Georg S
full_name: Martius, Georg S
id: 3A276B68-F248-11E8-B48F-1D18A9856A87
last_name: Martius
- first_name: Rafael
full_name: Hostettler, Rafael
last_name: Hostettler
- first_name: Alois
full_name: Knoll, Alois
last_name: Knoll
- first_name: Ralf
full_name: Der, Ralf
last_name: Der
citation:
ama: 'Martius GS, Hostettler R, Knoll A, Der R. Self-organized control of an tendon
driven arm by differential extrinsic plasticity. In: 15th International Conference
on the Synthesis and Simulation of Living Systems. Vol 28. MIT Press; 2016:142-143.
doi:10.7551/978-0-262-33936-0-ch029'
apa: 'Martius, G. S., Hostettler, R., Knoll, A., & Der, R. (2016). Self-organized
control of an tendon driven arm by differential extrinsic plasticity. In 15th
International Conference on the Synthesis and Simulation of Living Systems
(Vol. 28, pp. 142–143). Cancun, Mexico: MIT Press. https://doi.org/10.7551/978-0-262-33936-0-ch029'
chicago: Martius, Georg S, Rafael Hostettler, Alois Knoll, and Ralf Der. “Self-Organized
Control of an Tendon Driven Arm by Differential Extrinsic Plasticity.” In 15th
International Conference on the Synthesis and Simulation of Living Systems,
28:142–43. MIT Press, 2016. https://doi.org/10.7551/978-0-262-33936-0-ch029.
ieee: G. S. Martius, R. Hostettler, A. Knoll, and R. Der, “Self-organized control
of an tendon driven arm by differential extrinsic plasticity,” in 15th International
Conference on the Synthesis and Simulation of Living Systems, Cancun, Mexico,
2016, vol. 28, pp. 142–143.
ista: 'Martius GS, Hostettler R, Knoll A, Der R. 2016. Self-organized control of
an tendon driven arm by differential extrinsic plasticity. 15th International
Conference on the Synthesis and Simulation of Living Systems. ALIFE 2016: Conference
on the Synthesis and Simulation of Living Systems vol. 28, 142–143.'
mla: Martius, Georg S., et al. “Self-Organized Control of an Tendon Driven Arm by
Differential Extrinsic Plasticity.” 15th International Conference on the Synthesis
and Simulation of Living Systems, vol. 28, MIT Press, 2016, pp. 142–43, doi:10.7551/978-0-262-33936-0-ch029.
short: G.S. Martius, R. Hostettler, A. Knoll, R. Der, in:, 15th International Conference
on the Synthesis and Simulation of Living Systems, MIT Press, 2016, pp. 142–143.
conference:
end_date: 2016-07-08
location: Cancun, Mexico
name: 'ALIFE 2016: Conference on the Synthesis and Simulation of Living Systems'
start_date: 2016-07-04
corr_author: '1'
date_created: 2020-07-05T22:00:47Z
date_published: 2016-09-01T00:00:00Z
date_updated: 2025-07-10T11:55:05Z
day: '01'
ddc:
- '610'
department:
- _id: ChLa
- _id: GaTk
doi: 10.7551/978-0-262-33936-0-ch029
ec_funded: 1
file:
- access_level: open_access
checksum: cff63e7a4b8ac466ba51a9c84153a940
content_type: application/pdf
creator: cziletti
date_created: 2020-07-06T12:59:09Z
date_updated: 2020-07-14T12:48:09Z
file_id: '8096'
file_name: 2016_ProcALIFE_Martius.pdf
file_size: 678670
relation: main_file
file_date_updated: 2020-07-14T12:48:09Z
fulldoi: https://doi.org/10.7551/978-0-262-33936-0-ch029
has_accepted_license: '1'
intvolume: ' 28'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 142-143
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: 15th International Conference on the Synthesis and Simulation of Living
Systems
publication_identifier:
isbn:
- '9780262339360'
publication_status: published
publisher: MIT Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Self-organized control of an tendon driven arm by differential extrinsic plasticity
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2016'
...
---
_id: '9456'
abstract:
- lang: eng
text: The discovery of introns four decades ago was one of the most unexpected findings
in molecular biology. Introns are sequences interrupting genes that must be removed
as part of messenger RNA production. Genome sequencing projects have shown that
most eukaryotic genes contain at least one intron, and frequently many. Comparison
of these genomes reveals a history of long evolutionary periods during which few
introns were gained, punctuated by episodes of rapid, extensive gain. However,
although several detailed mechanisms for such episodic intron generation have
been proposed, none has been empirically supported on a genomic scale. Here we
show how short, non-autonomous DNA transposons independently generated hundreds
to thousands of introns in the prasinophyte Micromonas pusilla and the pelagophyte
Aureococcus anophagefferens. Each transposon carries one splice site. The other
splice site is co-opted from the gene sequence that is duplicated upon transposon
insertion, allowing perfect splicing out of the RNA. The distributions of sequences
that can be co-opted are biased with respect to codons, and phasing of transposon-generated
introns is similarly biased. These transposons insert between pre-existing nucleosomes,
so that multiple nearby insertions generate nucleosome-sized intervening segments.
Thus, transposon insertion and sequence co-option may explain the intron phase
biases and prevalence of nucleosome-sized exons observed in eukaryotes. Overall,
the two independent examples of proliferating elements illustrate a general DNA
transposon mechanism that can plausibly account for episodes of rapid, extensive
intron gain during eukaryotic evolution.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Jason T.
full_name: Huff, Jason T.
last_name: Huff
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: Scott W.
full_name: Roy, Scott W.
last_name: Roy
citation:
ama: Huff JT, Zilberman D, Roy SW. Mechanism for DNA transposons to generate introns
on genomic scales. Nature. 2016;538(7626):533-536. doi:10.1038/nature20110
apa: Huff, J. T., Zilberman, D., & Roy, S. W. (2016). Mechanism for DNA transposons
to generate introns on genomic scales. Nature. Springer Nature . https://doi.org/10.1038/nature20110
chicago: Huff, Jason T., Daniel Zilberman, and Scott W. Roy. “Mechanism for DNA
Transposons to Generate Introns on Genomic Scales.” Nature. Springer Nature
, 2016. https://doi.org/10.1038/nature20110.
ieee: J. T. Huff, D. Zilberman, and S. W. Roy, “Mechanism for DNA transposons to
generate introns on genomic scales,” Nature, vol. 538, no. 7626. Springer
Nature , pp. 533–536, 2016.
ista: Huff JT, Zilberman D, Roy SW. 2016. Mechanism for DNA transposons to generate
introns on genomic scales. Nature. 538(7626), 533–536.
mla: Huff, Jason T., et al. “Mechanism for DNA Transposons to Generate Introns on
Genomic Scales.” Nature, vol. 538, no. 7626, Springer Nature , 2016, pp.
533–36, doi:10.1038/nature20110.
short: J.T. Huff, D. Zilberman, S.W. Roy, Nature 538 (2016) 533–536.
date_created: 2021-06-04T11:34:55Z
date_published: 2016-10-27T00:00:00Z
date_updated: 2021-12-14T07:55:30Z
day: '27'
department:
- _id: DaZi
doi: 10.1038/nature20110
extern: '1'
external_id:
pmid:
- '27760113'
fulldoi: https://doi.org/10.1038/nature20110
intvolume: ' 538'
issue: '7626'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5684705/
month: '10'
oa: 1
oa_version: Submitted Version
page: 533-536
pmid: 1
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: 'Springer Nature '
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mechanism for DNA transposons to generate introns on genomic scales
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 538
year: '2016'
...
---
_id: '9473'
abstract:
- lang: eng
text: Cytosine DNA methylation regulates the expression of eukaryotic genes and
transposons. Methylation is copied by methyltransferases after DNA replication,
which results in faithful transmission of methylation patterns during cell division
and, at least in flowering plants, across generations. Transgenerational inheritance
is mediated by a small group of cells that includes gametes and their progenitors.
However, methylation is usually analyzed in somatic tissues that do not contribute
to the next generation, and the mechanisms of transgenerational inheritance are
inferred from such studies. To gain a better understanding of how DNA methylation
is inherited, we analyzed purified Arabidopsis thaliana sperm and vegetative cells-the
cell types that comprise pollen-with mutations in the DRM, CMT2, and CMT3 methyltransferases.
We find that DNA methylation dependency on these enzymes is similar in sperm,
vegetative cells, and somatic tissues, although DRM activity extends into heterochromatin
in vegetative cells, likely reflecting transcription of heterochromatic transposons
in this cell type. We also show that lack of histone H1, which elevates heterochromatic
DNA methylation in somatic tissues, does not have this effect in pollen. Instead,
levels of CG methylation in wild-type sperm and vegetative cells, as well as in
wild-type microspores from which both pollen cell types originate, are substantially
higher than in wild-type somatic tissues and similar to those of H1-depleted roots.
Our results demonstrate that the mechanisms of methylation maintenance are similar
between pollen and somatic cells, but the efficiency of CG methylation is higher
in pollen, allowing methylation patterns to be accurately inherited across generations.
article_processing_charge: No
article_type: original
author:
- first_name: Ping-Hung
full_name: Hsieh, Ping-Hung
last_name: Hsieh
- first_name: Shengbo
full_name: He, Shengbo
last_name: He
- first_name: Toby
full_name: Buttress, Toby
last_name: Buttress
- first_name: Hongbo
full_name: Gao, Hongbo
last_name: Gao
- first_name: Matthew
full_name: Couchman, Matthew
last_name: Couchman
- first_name: Robert L.
full_name: Fischer, Robert L.
last_name: Fischer
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
citation:
ama: Hsieh P-H, He S, Buttress T, et al. Arabidopsis male sexual lineage exhibits
more robust maintenance of CG methylation than somatic tissues. Proceedings
of the National Academy of Sciences. 2016;113(52):15132-15137. doi:10.1073/pnas.1619074114
apa: Hsieh, P.-H., He, S., Buttress, T., Gao, H., Couchman, M., Fischer, R. L.,
… Feng, X. (2016). Arabidopsis male sexual lineage exhibits more robust maintenance
of CG methylation than somatic tissues. Proceedings of the National Academy
of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1619074114
chicago: Hsieh, Ping-Hung, Shengbo He, Toby Buttress, Hongbo Gao, Matthew Couchman,
Robert L. Fischer, Daniel Zilberman, and Xiaoqi Feng. “Arabidopsis Male Sexual
Lineage Exhibits More Robust Maintenance of CG Methylation than Somatic Tissues.”
Proceedings of the National Academy of Sciences. National Academy of Sciences,
2016. https://doi.org/10.1073/pnas.1619074114.
ieee: P.-H. Hsieh et al., “Arabidopsis male sexual lineage exhibits more
robust maintenance of CG methylation than somatic tissues,” Proceedings of
the National Academy of Sciences, vol. 113, no. 52. National Academy of Sciences,
pp. 15132–15137, 2016.
ista: Hsieh P-H, He S, Buttress T, Gao H, Couchman M, Fischer RL, Zilberman D, Feng
X. 2016. Arabidopsis male sexual lineage exhibits more robust maintenance of CG
methylation than somatic tissues. Proceedings of the National Academy of Sciences.
113(52), 15132–15137.
mla: Hsieh, Ping-Hung, et al. “Arabidopsis Male Sexual Lineage Exhibits More Robust
Maintenance of CG Methylation than Somatic Tissues.” Proceedings of the National
Academy of Sciences, vol. 113, no. 52, National Academy of Sciences, 2016,
pp. 15132–37, doi:10.1073/pnas.1619074114.
short: P.-H. Hsieh, S. He, T. Buttress, H. Gao, M. Couchman, R.L. Fischer, D. Zilberman,
X. Feng, Proceedings of the National Academy of Sciences 113 (2016) 15132–15137.
date_created: 2021-06-07T06:21:39Z
date_published: 2016-12-27T00:00:00Z
date_updated: 2023-05-08T11:00:40Z
day: '27'
department:
- _id: DaZi
- _id: XiFe
doi: 10.1073/pnas.1619074114
extern: '1'
external_id:
pmid:
- '27956643'
fulldoi: https://doi.org/10.1073/pnas.1619074114
intvolume: ' 113'
issue: '52'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1073/pnas.1619074114
month: '12'
oa: 1
oa_version: Published Version
page: 15132-15137
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Arabidopsis male sexual lineage exhibits more robust maintenance of CG methylation
than somatic tissues
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2016'
...
---
_id: '9477'
abstract:
- lang: eng
text: Cytosine methylation is a DNA modification with important regulatory functions
in eukaryotes. In flowering plants, sexual reproduction is accompanied by extensive
DNA demethylation, which is required for proper gene expression in the endosperm,
a nutritive extraembryonic seed tissue. Endosperm arises from a fusion of a sperm
cell carried in the pollen and a female central cell. Endosperm DNA demethylation
is observed specifically on the chromosomes inherited from the central cell in
Arabidopsis thaliana, rice, and maize, and requires the DEMETER DNA demethylase
in Arabidopsis. DEMETER is expressed in the central cell before fertilization,
suggesting that endosperm demethylation patterns are inherited from the central
cell. Down-regulation of the MET1 DNA methyltransferase has also been proposed
to contribute to central cell demethylation. However, with the exception of three
maize genes, central cell DNA methylation has not been directly measured, leaving
the origin and mechanism of endosperm demethylation uncertain. Here, we report
genome-wide analysis of DNA methylation in the central cells of Arabidopsis and
rice—species that diverged 150 million years ago—as well as in rice egg cells.
We find that DNA demethylation in both species is initiated in central cells,
which requires DEMETER in Arabidopsis. However, we do not observe a global reduction
of CG methylation that would be indicative of lowered MET1 activity; on the contrary,
CG methylation efficiency is elevated in female gametes compared with nonsexual
tissues. Our results demonstrate that locus-specific, active DNA demethylation
in the central cell is the origin of maternal chromosome hypomethylation in the
endosperm.
article_processing_charge: No
article_type: original
author:
- first_name: Kyunghyuk
full_name: Park, Kyunghyuk
last_name: Park
- first_name: M. Yvonne
full_name: Kim, M. Yvonne
last_name: Kim
- first_name: Martin
full_name: Vickers, Martin
last_name: Vickers
- first_name: Jin-Sup
full_name: Park, Jin-Sup
last_name: Park
- first_name: Youbong
full_name: Hyun, Youbong
last_name: Hyun
- first_name: Takashi
full_name: Okamoto, Takashi
last_name: Okamoto
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: Robert L.
full_name: Fischer, Robert L.
last_name: Fischer
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
- first_name: Yeonhee
full_name: Choi, Yeonhee
last_name: Choi
- first_name: Stefan
full_name: Scholten, Stefan
last_name: Scholten
citation:
ama: Park K, Kim MY, Vickers M, et al. DNA demethylation is initiated in the central
cells of Arabidopsis and rice. Proceedings of the National Academy of Sciences.
2016;113(52):15138-15143. doi:10.1073/pnas.1619047114
apa: Park, K., Kim, M. Y., Vickers, M., Park, J.-S., Hyun, Y., Okamoto, T., … Scholten,
S. (2016). DNA demethylation is initiated in the central cells of Arabidopsis
and rice. Proceedings of the National Academy of Sciences. National Academy
of Sciences. https://doi.org/10.1073/pnas.1619047114
chicago: Park, Kyunghyuk, M. Yvonne Kim, Martin Vickers, Jin-Sup Park, Youbong Hyun,
Takashi Okamoto, Daniel Zilberman, et al. “DNA Demethylation Is Initiated in the
Central Cells of Arabidopsis and Rice.” Proceedings of the National Academy
of Sciences. National Academy of Sciences, 2016. https://doi.org/10.1073/pnas.1619047114.
ieee: K. Park et al., “DNA demethylation is initiated in the central cells
of Arabidopsis and rice,” Proceedings of the National Academy of Sciences,
vol. 113, no. 52. National Academy of Sciences, pp. 15138–15143, 2016.
ista: Park K, Kim MY, Vickers M, Park J-S, Hyun Y, Okamoto T, Zilberman D, Fischer
RL, Feng X, Choi Y, Scholten S. 2016. DNA demethylation is initiated in the central
cells of Arabidopsis and rice. Proceedings of the National Academy of Sciences.
113(52), 15138–15143.
mla: Park, Kyunghyuk, et al. “DNA Demethylation Is Initiated in the Central Cells
of Arabidopsis and Rice.” Proceedings of the National Academy of Sciences,
vol. 113, no. 52, National Academy of Sciences, 2016, pp. 15138–43, doi:10.1073/pnas.1619047114.
short: K. Park, M.Y. Kim, M. Vickers, J.-S. Park, Y. Hyun, T. Okamoto, D. Zilberman,
R.L. Fischer, X. Feng, Y. Choi, S. Scholten, Proceedings of the National Academy
of Sciences 113 (2016) 15138–15143.
date_created: 2021-06-07T07:10:59Z
date_published: 2016-12-27T00:00:00Z
date_updated: 2023-05-08T11:00:07Z
day: '27'
department:
- _id: DaZi
- _id: XiFe
doi: 10.1073/pnas.1619047114
extern: '1'
external_id:
pmid:
- '27956642'
fulldoi: https://doi.org/10.1073/pnas.1619047114
intvolume: ' 113'
issue: '52'
keyword:
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1073/pnas.1619047114
month: '12'
oa: 1
oa_version: Published Version
page: 15138-15143
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: DNA demethylation is initiated in the central cells of Arabidopsis and rice
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2016'
...