---
_id: '1585'
abstract:
- lang: eng
text: In this paper, we consider the fluctuation of mutual information statistics
of a multiple input multiple output channel communication systems without assuming
that the entries of the channel matrix have zero pseudovariance. To this end,
we also establish a central limit theorem of the linear spectral statistics for
sample covariance matrices under general moment conditions by removing the restrictions
imposed on the second moment and fourth moment on the matrix entries in Bai and
Silverstein (2004).
acknowledgement: "G. Pan was supported by MOE Tier 2 under Grant 2014-T2-2-060 and
in part by Tier 1 under Grant RG25/14 through the Nanyang Technological University,
Singapore. W. Zhou was supported by the National University of Singapore, Singapore,
under Grant R-155-000-131-112.\r\n"
article_processing_charge: No
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: Guangming
full_name: Pan, Guangming
last_name: Pan
- first_name: Wang
full_name: Zhou, Wang
last_name: Zhou
citation:
ama: Bao Z, Pan G, Zhou W. Asymptotic mutual information statistics of MIMO channels
and CLT of sample covariance matrices. IEEE Transactions on Information Theory.
2015;61(6):3413-3426. doi:10.1109/TIT.2015.2421894
apa: Bao, Z., Pan, G., & Zhou, W. (2015). Asymptotic mutual information statistics
of MIMO channels and CLT of sample covariance matrices. IEEE Transactions on
Information Theory. IEEE. https://doi.org/10.1109/TIT.2015.2421894
chicago: Bao, Zhigang, Guangming Pan, and Wang Zhou. “Asymptotic Mutual Information
Statistics of MIMO Channels and CLT of Sample Covariance Matrices.” IEEE Transactions
on Information Theory. IEEE, 2015. https://doi.org/10.1109/TIT.2015.2421894.
ieee: Z. Bao, G. Pan, and W. Zhou, “Asymptotic mutual information statistics of
MIMO channels and CLT of sample covariance matrices,” IEEE Transactions on
Information Theory, vol. 61, no. 6. IEEE, pp. 3413–3426, 2015.
ista: Bao Z, Pan G, Zhou W. 2015. Asymptotic mutual information statistics of MIMO
channels and CLT of sample covariance matrices. IEEE Transactions on Information
Theory. 61(6), 3413–3426.
mla: Bao, Zhigang, et al. “Asymptotic Mutual Information Statistics of MIMO Channels
and CLT of Sample Covariance Matrices.” IEEE Transactions on Information Theory,
vol. 61, no. 6, IEEE, 2015, pp. 3413–26, doi:10.1109/TIT.2015.2421894.
short: Z. Bao, G. Pan, W. Zhou, IEEE Transactions on Information Theory 61 (2015)
3413–3426.
date_created: 2018-12-11T11:52:52Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2025-09-23T07:57:31Z
day: '01'
department:
- _id: LaEr
doi: 10.1109/TIT.2015.2421894
external_id:
isi:
- '000354943600029'
intvolume: ' 61'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 3413 - 3426
publication: IEEE Transactions on Information Theory
publication_status: published
publisher: IEEE
publist_id: '5586'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Asymptotic mutual information statistics of MIMO channels and CLT of sample
covariance matrices
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 61
year: '2015'
...
---
_id: '1586'
abstract:
- lang: eng
text: Through metabolic engineering cyanobacteria can be employed in biotechnology.
Combining the capacity for oxygenic photosynthesis and carbon fixation with an
engineered metabolic pathway allows carbon-based product formation from CO2, light,
and water directly. Such cyanobacterial 'cell factories' are constructed to produce
biofuels, bioplastics, and commodity chemicals. Efforts of metabolic engineers
and synthetic biologists allow the modification of the intermediary metabolism
at various branching points, expanding the product range. The new biosynthesis
routes 'tap' the metabolism ever more efficiently, particularly through the engineering
of driving forces and utilization of cofactors generated during the light reactions
of photosynthesis, resulting in higher product titers. High rates of carbon rechanneling
ultimately allow an almost-complete allocation of fixed carbon to product above
biomass.
article_processing_charge: No
author:
- first_name: Andreas
full_name: Angermayr, Andreas
id: 4677C796-F248-11E8-B48F-1D18A9856A87
last_name: Angermayr
orcid: 0000-0001-8619-2223
- first_name: Aleix
full_name: Gorchs, Aleix
last_name: Gorchs
- first_name: Klaas
full_name: Hellingwerf, Klaas
last_name: Hellingwerf
citation:
ama: Angermayr A, Gorchs A, Hellingwerf K. Metabolic engineering of cyanobacteria
for the synthesis of commodity products. Trends in Biotechnology. 2015;33(6):352-361.
doi:10.1016/j.tibtech.2015.03.009
apa: Angermayr, A., Gorchs, A., & Hellingwerf, K. (2015). Metabolic engineering
of cyanobacteria for the synthesis of commodity products. Trends in Biotechnology.
Elsevier. https://doi.org/10.1016/j.tibtech.2015.03.009
chicago: Angermayr, Andreas, Aleix Gorchs, and Klaas Hellingwerf. “Metabolic Engineering
of Cyanobacteria for the Synthesis of Commodity Products.” Trends in Biotechnology.
Elsevier, 2015. https://doi.org/10.1016/j.tibtech.2015.03.009.
ieee: A. Angermayr, A. Gorchs, and K. Hellingwerf, “Metabolic engineering of cyanobacteria
for the synthesis of commodity products,” Trends in Biotechnology, vol.
33, no. 6. Elsevier, pp. 352–361, 2015.
ista: Angermayr A, Gorchs A, Hellingwerf K. 2015. Metabolic engineering of cyanobacteria
for the synthesis of commodity products. Trends in Biotechnology. 33(6), 352–361.
mla: Angermayr, Andreas, et al. “Metabolic Engineering of Cyanobacteria for the
Synthesis of Commodity Products.” Trends in Biotechnology, vol. 33, no.
6, Elsevier, 2015, pp. 352–61, doi:10.1016/j.tibtech.2015.03.009.
short: A. Angermayr, A. Gorchs, K. Hellingwerf, Trends in Biotechnology 33 (2015)
352–361.
date_created: 2018-12-11T11:52:52Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2025-09-23T09:33:34Z
day: '01'
department:
- _id: ToBo
doi: 10.1016/j.tibtech.2015.03.009
external_id:
isi:
- '000355709700007'
intvolume: ' 33'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 352 - 361
publication: Trends in Biotechnology
publication_status: published
publisher: Elsevier
publist_id: '5585'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Metabolic engineering of cyanobacteria for the synthesis of commodity products
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 33
year: '2015'
...
---
_id: '1587'
abstract:
- lang: eng
text: We investigate the quantum interference shifts between energetically close
states, where the state structure is observed by laser spectroscopy. We report
a compact and analytical expression that models the quantum interference induced
shift for any admixture of circular polarization of the incident laser and angle
of observation. An experimental scenario free of quantum interference can thus
be predicted with this formula. Although this study is exemplified here for muonic
deuterium, it can be applied to any other laser spectroscopy measurement of ns-n′p
frequencies of a nonrelativistic atomic system, via an ns→n′p→n′′s scheme.
article_number: '062506'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Pedro
full_name: Amaro, Pedro
last_name: Amaro
- first_name: Filippo
full_name: Fratini, Filippo
last_name: Fratini
- first_name: Laleh
full_name: Safari, Laleh
id: 3C325E5E-F248-11E8-B48F-1D18A9856A87
last_name: Safari
- first_name: Aldo
full_name: Antognini, Aldo
last_name: Antognini
- first_name: Paul
full_name: Indelicato, Paul
last_name: Indelicato
- first_name: Randolf
full_name: Pohl, Randolf
last_name: Pohl
- first_name: José
full_name: Santos, José
last_name: Santos
citation:
ama: Amaro P, Fratini F, Safari L, et al. Quantum interference shifts in laser spectroscopy
with elliptical polarization. Physical Review A - Atomic, Molecular, and Optical
Physics. 2015;92(6). doi:10.1103/PhysRevA.92.062506
apa: Amaro, P., Fratini, F., Safari, L., Antognini, A., Indelicato, P., Pohl, R.,
& Santos, J. (2015). Quantum interference shifts in laser spectroscopy with
elliptical polarization. Physical Review A - Atomic, Molecular, and Optical
Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.92.062506
chicago: Amaro, Pedro, Filippo Fratini, Laleh Safari, Aldo Antognini, Paul Indelicato,
Randolf Pohl, and José Santos. “Quantum Interference Shifts in Laser Spectroscopy
with Elliptical Polarization.” Physical Review A - Atomic, Molecular, and Optical
Physics. American Physical Society, 2015. https://doi.org/10.1103/PhysRevA.92.062506.
ieee: P. Amaro et al., “Quantum interference shifts in laser spectroscopy
with elliptical polarization,” Physical Review A - Atomic, Molecular, and Optical
Physics, vol. 92, no. 6. American Physical Society, 2015.
ista: Amaro P, Fratini F, Safari L, Antognini A, Indelicato P, Pohl R, Santos J.
2015. Quantum interference shifts in laser spectroscopy with elliptical polarization.
Physical Review A - Atomic, Molecular, and Optical Physics. 92(6), 062506.
mla: Amaro, Pedro, et al. “Quantum Interference Shifts in Laser Spectroscopy with
Elliptical Polarization.” Physical Review A - Atomic, Molecular, and Optical
Physics, vol. 92, no. 6, 062506, American Physical Society, 2015, doi:10.1103/PhysRevA.92.062506.
short: P. Amaro, F. Fratini, L. Safari, A. Antognini, P. Indelicato, R. Pohl, J.
Santos, Physical Review A - Atomic, Molecular, and Optical Physics 92 (2015).
date_created: 2018-12-11T11:52:53Z
date_published: 2015-12-31T00:00:00Z
date_updated: 2025-09-23T10:30:45Z
day: '31'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.92.062506
ec_funded: 1
external_id:
arxiv:
- '1511.03585'
isi:
- '000367373900002'
intvolume: ' 92'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.03585
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Physical Review A - Atomic, Molecular, and Optical Physics
publication_status: published
publisher: American Physical Society
publist_id: '5584'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantum interference shifts in laser spectroscopy with elliptical polarization
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 92
year: '2015'
...
---
_id: '1588'
abstract:
- lang: eng
text: 'We investigate the Taylor-Couette system where the radius ratio is close
to unity. Systematically increasing the Reynolds number, we observe a number of
previously known transitions, such as one from the classical Taylor vortex flow
(TVF) to wavy vortex flow (WVF) and the transition to fully developed turbulence.
Prior to the onset of turbulence, we observe intermittent bursting patterns of
localized turbulent patches, confirming the experimentally observed pattern of
very short wavelength bursts (VSWBs). A striking finding is that, for a Reynolds
number larger than that for the onset of VSWBs, a new type of intermittently bursting
behavior emerges: patterns of azimuthally closed rings of various orders. We call
them ring-bursting patterns, which surround the cylinder completely but remain
localized and separated in the axial direction through nonturbulent wavy structures.
We employ a number of quantitative measures including the cross-flow energy to
characterize the ring-bursting patterns and to distinguish them from the background
flow. These patterns are interesting because they do not occur in the wide-gap
Taylor-Couette flow systems. The narrow-gap regime is less studied but certainly
deserves further attention to gain deeper insights into complex flow dynamics
in fluids.'
article_number: '053018'
article_processing_charge: No
author:
- first_name: Sebastian
full_name: Altmeyer, Sebastian
id: 2EE67FDC-F248-11E8-B48F-1D18A9856A87
last_name: Altmeyer
orcid: 0000-0001-5964-0203
- first_name: Younghae
full_name: Do, Younghae
last_name: Do
- first_name: Ying
full_name: Lai, Ying
last_name: Lai
citation:
ama: Altmeyer S, Do Y, Lai Y. Ring-bursting behavior en route to turbulence in narrow-gap
Taylor-Couette flows. Physical Review E. 2015;92(5). doi:10.1103/PhysRevE.92.053018
apa: Altmeyer, S., Do, Y., & Lai, Y. (2015). Ring-bursting behavior en route
to turbulence in narrow-gap Taylor-Couette flows. Physical Review E. American
Physical Society. https://doi.org/10.1103/PhysRevE.92.053018
chicago: Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Ring-Bursting Behavior
En Route to Turbulence in Narrow-Gap Taylor-Couette Flows.” Physical Review
E. American Physical Society, 2015. https://doi.org/10.1103/PhysRevE.92.053018.
ieee: S. Altmeyer, Y. Do, and Y. Lai, “Ring-bursting behavior en route to turbulence
in narrow-gap Taylor-Couette flows,” Physical Review E, vol. 92, no. 5.
American Physical Society, 2015.
ista: Altmeyer S, Do Y, Lai Y. 2015. Ring-bursting behavior en route to turbulence
in narrow-gap Taylor-Couette flows. Physical Review E. 92(5), 053018.
mla: Altmeyer, Sebastian, et al. “Ring-Bursting Behavior En Route to Turbulence
in Narrow-Gap Taylor-Couette Flows.” Physical Review E, vol. 92, no. 5,
053018, American Physical Society, 2015, doi:10.1103/PhysRevE.92.053018.
short: S. Altmeyer, Y. Do, Y. Lai, Physical Review E 92 (2015).
corr_author: '1'
date_created: 2018-12-11T11:52:53Z
date_published: 2015-11-24T00:00:00Z
date_updated: 2025-09-23T10:37:52Z
day: '24'
department:
- _id: BjHo
doi: 10.1103/PhysRevE.92.053018
external_id:
isi:
- '000365520500010'
intvolume: ' 92'
isi: 1
issue: '5'
language:
- iso: eng
month: '11'
oa_version: None
publication: Physical Review E
publication_status: published
publisher: American Physical Society
publist_id: '5583'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ring-bursting behavior en route to turbulence in narrow-gap Taylor-Couette
flows
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 92
year: '2015'
...
---
_id: '1589'
abstract:
- lang: eng
text: We investigate the dynamics of ferrofluidic wavy vortex flows in the counter-rotating
Taylor-Couette system, with a focus on wavy flows with a mixture of the dominant
azimuthal modes. Without external magnetic field flows are stable and pro-grade
with respect to the rotation of the inner cylinder. More complex behaviors can
arise when an axial or a transverse magnetic field is applied. Depending on the
direction and strength of the field, multi-stable wavy states and bifurcations
can occur. We uncover the phenomenon of flow pattern reversal as the strength
of the magnetic field is increased through a critical value. In between the regimes
of pro-grade and retrograde flow rotations, standing waves with zero angular velocities
can emerge. A striking finding is that, under a transverse magnetic field, a second
reversal in the flow pattern direction can occur, where the flow pattern evolves
into pro-grade rotation again from a retrograde state. Flow reversal is relevant
to intriguing phenomena in nature such as geomagnetic reversal. Our results suggest
that, in ferrofluids, flow pattern reversal can be induced by varying a magnetic
field in a controlled manner, which can be realized in laboratory experiments
with potential applications in the development of modern fluid devices.
article_number: '18589'
article_processing_charge: No
article_type: original
author:
- first_name: Sebastian
full_name: Altmeyer, Sebastian
id: 2EE67FDC-F248-11E8-B48F-1D18A9856A87
last_name: Altmeyer
orcid: 0000-0001-5964-0203
- first_name: Younghae
full_name: Do, Younghae
last_name: Do
- first_name: Ying
full_name: Lai, Ying
last_name: Lai
citation:
ama: Altmeyer S, Do Y, Lai Y. Magnetic field induced flow pattern reversal in a
ferrofluidic Taylor-Couette system. Scientific Reports. 2015;5. doi:10.1038/srep18589
apa: Altmeyer, S., Do, Y., & Lai, Y. (2015). Magnetic field induced flow pattern
reversal in a ferrofluidic Taylor-Couette system. Scientific Reports. Nature
Publishing Group. https://doi.org/10.1038/srep18589
chicago: Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Magnetic Field Induced
Flow Pattern Reversal in a Ferrofluidic Taylor-Couette System.” Scientific
Reports. Nature Publishing Group, 2015. https://doi.org/10.1038/srep18589.
ieee: S. Altmeyer, Y. Do, and Y. Lai, “Magnetic field induced flow pattern reversal
in a ferrofluidic Taylor-Couette system,” Scientific Reports, vol. 5. Nature
Publishing Group, 2015.
ista: Altmeyer S, Do Y, Lai Y. 2015. Magnetic field induced flow pattern reversal
in a ferrofluidic Taylor-Couette system. Scientific Reports. 5, 18589.
mla: Altmeyer, Sebastian, et al. “Magnetic Field Induced Flow Pattern Reversal in
a Ferrofluidic Taylor-Couette System.” Scientific Reports, vol. 5, 18589,
Nature Publishing Group, 2015, doi:10.1038/srep18589.
short: S. Altmeyer, Y. Do, Y. Lai, Scientific Reports 5 (2015).
date_created: 2018-12-11T11:52:53Z
date_published: 2015-12-21T00:00:00Z
date_updated: 2025-09-23T09:32:24Z
day: '21'
ddc:
- '530'
- '540'
department:
- _id: BjHo
doi: 10.1038/srep18589
external_id:
isi:
- '000367075500002'
file:
- access_level: open_access
checksum: 927e151674347661ce36eae2818dafdc
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:49Z
date_updated: 2020-07-14T12:45:03Z
file_id: '5036'
file_name: IST-2016-472-v1+1_srep18589.pdf
file_size: 2771236
relation: main_file
file_date_updated: 2020-07-14T12:45:03Z
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_status: published
publisher: Nature Publishing Group
publist_id: '5582'
pubrep_id: '472'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Magnetic field induced flow pattern reversal in a ferrofluidic Taylor-Couette
system
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: 5
year: '2015'
...
---
_id: '1590'
abstract:
- lang: eng
text: 'The straight skeleton of a polygon is the geometric graph obtained by tracing
the vertices during a mitered offsetting process. It is known that the straight
skeleton of a simple polygon is a tree, and one can naturally derive directions
on the edges of the tree from the propagation of the shrinking process. In this
paper, we ask the reverse question: Given a tree with directed edges, can it be
the straight skeleton of a polygon? And if so, can we find a suitable simple polygon?
We answer these questions for all directed trees where the order of edges around
each node is fixed.'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Thomas
full_name: Hackl, Thomas
last_name: Hackl
- first_name: Martin
full_name: Held, Martin
last_name: Held
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Peter
full_name: Palfrader, Peter
last_name: Palfrader
- first_name: Birgit
full_name: Vogtenhuber, Birgit
last_name: Vogtenhuber
citation:
ama: 'Aichholzer O, Biedl T, Hackl T, et al. Representing directed trees as straight
skeletons. In: Graph Drawing and Network Visualization. Vol 9411. Springer
Nature; 2015:335-347. doi:10.1007/978-3-319-27261-0_28'
apa: 'Aichholzer, O., Biedl, T., Hackl, T., Held, M., Huber, S., Palfrader, P.,
& Vogtenhuber, B. (2015). Representing directed trees as straight skeletons.
In Graph Drawing and Network Visualization (Vol. 9411, pp. 335–347). Los
Angeles, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-319-27261-0_28'
chicago: Aichholzer, Oswin, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber,
Peter Palfrader, and Birgit Vogtenhuber. “Representing Directed Trees as Straight
Skeletons.” In Graph Drawing and Network Visualization, 9411:335–47. Springer
Nature, 2015. https://doi.org/10.1007/978-3-319-27261-0_28.
ieee: O. Aichholzer et al., “Representing directed trees as straight skeletons,”
in Graph Drawing and Network Visualization, vol. 9411, Springer Nature,
2015, pp. 335–347.
ista: 'Aichholzer O, Biedl T, Hackl T, Held M, Huber S, Palfrader P, Vogtenhuber
B. 2015.Representing directed trees as straight skeletons. In: Graph Drawing and
Network Visualization. LNCS, vol. 9411, 335–347.'
mla: Aichholzer, Oswin, et al. “Representing Directed Trees as Straight Skeletons.”
Graph Drawing and Network Visualization, vol. 9411, Springer Nature, 2015,
pp. 335–47, doi:10.1007/978-3-319-27261-0_28.
short: O. Aichholzer, T. Biedl, T. Hackl, M. Held, S. Huber, P. Palfrader, B. Vogtenhuber,
in:, Graph Drawing and Network Visualization, Springer Nature, 2015, pp. 335–347.
conference:
end_date: 2015-09-26
location: Los Angeles, CA, United States
name: 'GD: Graph Drawing and Network Visualization'
start_date: 2015-09-24
date_created: 2018-12-11T11:52:54Z
date_published: 2015-11-27T00:00:00Z
date_updated: 2025-09-23T10:35:07Z
day: '27'
department:
- _id: HeEd
doi: 10.1007/978-3-319-27261-0_28
external_id:
arxiv:
- '1508.01076'
isi:
- '000373628600028'
intvolume: ' 9411'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1508.01076
month: '11'
oa: 1
oa_version: Preprint
page: 335 - 347
publication: Graph Drawing and Network Visualization
publication_identifier:
eisbn:
- 978-3-319-27261-0
isbn:
- 978-3-319-27260-3
publication_status: published
publisher: Springer Nature
publist_id: '5581'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Representing directed trees as straight skeletons
type: book_chapter
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9411
year: '2015'
...
---
_id: '1593'
abstract:
- lang: eng
text: 'Plants are sessile organisms that are permanently restricted to their site
of germination. To compensate for their lack of mobility, plants evolved unique
mechanisms enabling them to rapidly react to ever changing environmental conditions
and flexibly adapt their postembryonic developmental program. A prominent demonstration
of this developmental plasticity is their ability to bend organs in order to reach
the position most optimal for growth and utilization of light, nutrients, and
other resources. Shortly after germination, dicotyledonous seedlings form a bended
structure, the so-called apical hook, to protect the delicate shoot meristem and
cotyledons from damage when penetrating through the soil. Upon perception of a
light stimulus, the apical hook rapidly opens and the photomorphogenic developmental
program is activated. After germination, plant organs are able to align their
growth with the light source and adopt the most favorable orientation through
bending, in a process named phototropism. On the other hand, when roots and shoots
are diverted from their upright orientation, they immediately detect a change
in the gravity vector and bend to maintain a vertical growth direction. Noteworthy,
despite the diversity of external stimuli perceived by different plant organs,
all plant tropic movements share a common mechanistic basis: differential cell
growth. In our review, we will discuss the molecular principles underlying various
tropic responses with the focus on mechanisms mediating the perception of external
signals, transduction cascades and downstream responses that regulate differential
cell growth and consequently, organ bending. In particular, we highlight common
and specific features of regulatory pathways in control of the bending of organs
and a role for the plant hormone auxin as a key regulatory component.'
article_processing_charge: No
author:
- first_name: Petra
full_name: Žádníková, Petra
last_name: Žádníková
- first_name: Dajo
full_name: Smet, Dajo
last_name: Smet
- first_name: Qiang
full_name: Zhu, Qiang
id: 40A4B9E6-F248-11E8-B48F-1D18A9856A87
last_name: Zhu
- first_name: Dominique
full_name: Van Der Straeten, Dominique
last_name: Van Der Straeten
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: 'Žádníková P, Smet D, Zhu Q, Van Der Straeten D, Benková E. Strategies of seedlings
to overcome their sessile nature: Auxin in mobility control. Frontiers in Plant
Science. 2015;6(4). doi:10.3389/fpls.2015.00218'
apa: 'Žádníková, P., Smet, D., Zhu, Q., Van Der Straeten, D., & Benková, E.
(2015). Strategies of seedlings to overcome their sessile nature: Auxin in mobility
control. Frontiers in Plant Science. Frontiers Research Foundation. https://doi.org/10.3389/fpls.2015.00218'
chicago: 'Žádníková, Petra, Dajo Smet, Qiang Zhu, Dominique Van Der Straeten, and
Eva Benková. “Strategies of Seedlings to Overcome Their Sessile Nature: Auxin
in Mobility Control.” Frontiers in Plant Science. Frontiers Research Foundation,
2015. https://doi.org/10.3389/fpls.2015.00218.'
ieee: 'P. Žádníková, D. Smet, Q. Zhu, D. Van Der Straeten, and E. Benková, “Strategies
of seedlings to overcome their sessile nature: Auxin in mobility control,” Frontiers
in Plant Science, vol. 6, no. 4. Frontiers Research Foundation, 2015.'
ista: 'Žádníková P, Smet D, Zhu Q, Van Der Straeten D, Benková E. 2015. Strategies
of seedlings to overcome their sessile nature: Auxin in mobility control. Frontiers
in Plant Science. 6(4).'
mla: 'Žádníková, Petra, et al. “Strategies of Seedlings to Overcome Their Sessile
Nature: Auxin in Mobility Control.” Frontiers in Plant Science, vol. 6,
no. 4, Frontiers Research Foundation, 2015, doi:10.3389/fpls.2015.00218.'
short: P. Žádníková, D. Smet, Q. Zhu, D. Van Der Straeten, E. Benková, Frontiers
in Plant Science 6 (2015).
corr_author: '1'
date_created: 2018-12-11T11:52:55Z
date_published: 2015-04-14T00:00:00Z
date_updated: 2025-09-23T10:49:06Z
day: '14'
ddc:
- '570'
department:
- _id: EvBe
doi: 10.3389/fpls.2015.00218
ec_funded: 1
external_id:
isi:
- '000353577800001'
file:
- access_level: open_access
checksum: c454d642e18dfa86820b97a86cd6d3cc
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:23Z
date_updated: 2020-07-14T12:45:03Z
file_id: '5142'
file_name: IST-2016-471-v1+1_fpls-06-00218.pdf
file_size: 965690
relation: main_file
file_date_updated: 2020-07-14T12:45:03Z
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 253FCA6A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '207362'
name: Hormonal cross-talk in plant organogenesis
publication: Frontiers in Plant Science
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '5578'
pubrep_id: '471'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Strategies of seedlings to overcome their sessile nature: Auxin in mobility
control'
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: 6
year: '2015'
...
---
_id: '1594'
abstract:
- lang: eng
text: Quantitative extensions of temporal logics have recently attracted significant
attention. In this work, we study frequency LTL (fLTL), an extension of LTL which
allows to speak about frequencies of events along an execution. Such an extension
is particularly useful for probabilistic systems that often cannot fulfil strict
qualitative guarantees on the behaviour. It has been recently shown that controller
synthesis for Markov decision processes and fLTL is decidable when all the bounds
on frequencies are 1. As a step towards a complete quantitative solution, we show
that the problem is decidable for the fragment fLTL\GU, where U does not occur
in the scope of G (but still F can). Our solution is based on a novel translation
of such quantitative formulae into equivalent deterministic automata.
acknowledgement: "This work is partly supported by the German Research Council (DFG)
as part of the Transregional Collaborative Research Center AVACS (SFB/TR 14), by
the Czech Science Foundation under grant agreement P202/12/G061, by the EU 7th Framework
Programme under grant agreement no. 295261 (MEALS) and 318490 (SENSATION), by the
CDZ project 1023 (CAP), by the CAS/SAFEA International Partnership Program for Creative
Research Teams, by the EPSRC grant EP/M023656/1, by the People Programme (Marie
Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013)
REA Grant No 291734, by the Austrian Science Fund (FWF) S11407-N23 (RiSE/SHiNE),
and by the ERC Start Grant (279307: Graph Games).\r\n"
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Vojtěch
full_name: Forejt, Vojtěch
last_name: Forejt
- first_name: Jan
full_name: Krčál, Jan
last_name: Krčál
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: 'Forejt V, Krčál J, Kretinsky J. Controller synthesis for MDPs and frequency
LTL\GU. In: Vol 9450. Springer; 2015:162-177. doi:10.1007/978-3-662-48899-7_12'
apa: 'Forejt, V., Krčál, J., & Kretinsky, J. (2015). Controller synthesis for
MDPs and frequency LTL\GU (Vol. 9450, pp. 162–177). Presented at the LPAR: Logic
for Programming, Artificial Intelligence, and Reasoning, Suva, Fiji: Springer.
https://doi.org/10.1007/978-3-662-48899-7_12'
chicago: Forejt, Vojtěch, Jan Krčál, and Jan Kretinsky. “Controller Synthesis for
MDPs and Frequency LTL\GU,” 9450:162–77. Springer, 2015. https://doi.org/10.1007/978-3-662-48899-7_12.
ieee: 'V. Forejt, J. Krčál, and J. Kretinsky, “Controller synthesis for MDPs and
frequency LTL\GU,” presented at the LPAR: Logic for Programming, Artificial Intelligence,
and Reasoning, Suva, Fiji, 2015, vol. 9450, pp. 162–177.'
ista: 'Forejt V, Krčál J, Kretinsky J. 2015. Controller synthesis for MDPs and frequency
LTL\GU. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS,
vol. 9450, 162–177.'
mla: Forejt, Vojtěch, et al. Controller Synthesis for MDPs and Frequency LTL\GU.
Vol. 9450, Springer, 2015, pp. 162–77, doi:10.1007/978-3-662-48899-7_12.
short: V. Forejt, J. Krčál, J. Kretinsky, in:, Springer, 2015, pp. 162–177.
conference:
end_date: 2015-11-28
location: Suva, Fiji
name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning'
start_date: 2015-11-24
date_created: 2018-12-11T11:52:55Z
date_published: 2015-11-22T00:00:00Z
date_updated: 2025-09-23T08:21:59Z
day: '22'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-662-48899-7_12
ec_funded: 1
external_id:
isi:
- '000375574900012'
intvolume: ' 9450'
isi: 1
language:
- iso: eng
month: '11'
oa_version: None
page: 162 - 177
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _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: Springer
publist_id: '5577'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Controller synthesis for MDPs and frequency LTL\GU
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9450
year: '2015'
...
---
_id: '1595'
abstract:
- lang: eng
text: 'A drawing of a graph G is radial if the vertices of G are placed on concentric
circles C1, . . . , Ck with common center c, and edges are drawn radially: every
edge intersects every circle centered at c at most once. G is radial planar if
it has a radial embedding, that is, a crossing- free radial drawing. If the vertices
of G are ordered or partitioned into ordered levels (as they are for leveled graphs),
we require that the assignment of vertices to circles corresponds to the given
ordering or leveling. We show that a graph G is radial planar if G has a radial
drawing in which every two edges cross an even number of times; the radial embedding
has the same leveling as the radial drawing. In other words, we establish the
weak variant of the Hanani-Tutte theorem for radial planarity. This generalizes
a result by Pach and Tóth.'
acknowledgement: The research leading to these results has received funding from the
People Programme (Marie Curie Actions) of the European Union’s Seventh Framework
Programme (FP7/2007-2013) under REA grant agreement no [291734].
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Michael
full_name: Pelsmajer, Michael
last_name: Pelsmajer
- first_name: Marcus
full_name: Schaefer, Marcus
last_name: Schaefer
citation:
ama: 'Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. In: Vol
9411. Springer; 2015:99-110. doi:10.1007/978-3-319-27261-0_9'
apa: 'Fulek, R., Pelsmajer, M., & Schaefer, M. (2015). Hanani-Tutte for radial
planarity (Vol. 9411, pp. 99–110). Presented at the GD: Graph Drawing and Network
Visualization, Los Angeles, CA, USA: Springer. https://doi.org/10.1007/978-3-319-27261-0_9'
chicago: Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte
for Radial Planarity,” 9411:99–110. Springer, 2015. https://doi.org/10.1007/978-3-319-27261-0_9.
ieee: 'R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,”
presented at the GD: Graph Drawing and Network Visualization, Los Angeles, CA,
USA, 2015, vol. 9411, pp. 99–110.'
ista: 'Fulek R, Pelsmajer M, Schaefer M. 2015. Hanani-Tutte for radial planarity.
GD: Graph Drawing and Network Visualization, LNCS, vol. 9411, 99–110.'
mla: Fulek, Radoslav, et al. Hanani-Tutte for Radial Planarity. Vol. 9411,
Springer, 2015, pp. 99–110, doi:10.1007/978-3-319-27261-0_9.
short: R. Fulek, M. Pelsmajer, M. Schaefer, in:, Springer, 2015, pp. 99–110.
conference:
end_date: 2015-09-26
location: Los Angeles, CA, USA
name: 'GD: Graph Drawing and Network Visualization'
start_date: 2015-09-24
date_created: 2018-12-11T11:52:55Z
date_published: 2015-11-27T00:00:00Z
date_updated: 2025-09-23T09:13:43Z
day: '27'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1007/978-3-319-27261-0_9
ec_funded: 1
external_id:
isi:
- '000373628600009'
file:
- access_level: open_access
checksum: 685f91bd077a951ba067d42cce75409e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:36Z
date_updated: 2020-07-14T12:45:03Z
file_id: '4697'
file_name: IST-2016-594-v1+1_HTCylinder_GD_Revision.pdf
file_size: 330135
relation: main_file
file_date_updated: 2020-07-14T12:45:03Z
has_accepted_license: '1'
intvolume: ' 9411'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 99 - 110
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Springer
publist_id: '5576'
pubrep_id: '594'
quality_controlled: '1'
related_material:
record:
- id: '1113'
relation: later_version
status: public
- id: '1164'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Hanani-Tutte for radial planarity
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9411
year: '2015'
...
---
_id: '1596'
abstract:
- lang: eng
text: Let C={C1,...,Cn} denote a collection of translates of a regular convex k-gon
in the plane with the stacking order. The collection C forms a visibility clique
if for everyi < j the intersection Ci and (Ci ∩ Cj)\⋃i<l<jCl =∅.elements
that are stacked between them, i.e., We show that if C forms a visibility clique
its size is bounded from above by O(k4) thereby improving the upper bound of 22k
from the aforementioned paper. We also obtain an upper bound of 22(k/2)+2 on the
size of a visibility clique for homothetes of a convex (not necessarily regular)
k-gon.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Radoš
full_name: Radoičić, Radoš
last_name: Radoičić
citation:
ama: 'Fulek R, Radoičić R. Vertical visibility among parallel polygons in three
dimensions. In: Graph Drawing and Network Visualization. Vol 9411. Springer
Nature; 2015:373-379. doi:10.1007/978-3-319-27261-0_31'
apa: 'Fulek, R., & Radoičić, R. (2015). Vertical visibility among parallel polygons
in three dimensions. In Graph Drawing and Network Visualization (Vol. 9411,
pp. 373–379). Los Angeles, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-319-27261-0_31'
chicago: Fulek, Radoslav, and Radoš Radoičić. “Vertical Visibility among Parallel
Polygons in Three Dimensions.” In Graph Drawing and Network Visualization,
9411:373–79. Springer Nature, 2015. https://doi.org/10.1007/978-3-319-27261-0_31.
ieee: R. Fulek and R. Radoičić, “Vertical visibility among parallel polygons in
three dimensions,” in Graph Drawing and Network Visualization, vol. 9411,
Springer Nature, 2015, pp. 373–379.
ista: 'Fulek R, Radoičić R. 2015.Vertical visibility among parallel polygons in
three dimensions. In: Graph Drawing and Network Visualization. LNCS, vol. 9411,
373–379.'
mla: Fulek, Radoslav, and Radoš Radoičić. “Vertical Visibility among Parallel Polygons
in Three Dimensions.” Graph Drawing and Network Visualization, vol. 9411,
Springer Nature, 2015, pp. 373–79, doi:10.1007/978-3-319-27261-0_31.
short: R. Fulek, R. Radoičić, in:, Graph Drawing and Network Visualization, Springer
Nature, 2015, pp. 373–379.
conference:
end_date: 2015-09-26
location: Los Angeles, CA, United States
name: 'GD: Graph Drawing and Network Visualization'
start_date: 2015-09-24
corr_author: '1'
date_created: 2018-12-11T11:52:56Z
date_published: 2015-11-27T00:00:00Z
date_updated: 2025-09-29T11:05:28Z
day: '27'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1007/978-3-319-27261-0_31
ec_funded: 1
external_id:
isi:
- '000373628600031'
file:
- access_level: open_access
checksum: eec04f86c5921d04f025d5791db9b965
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:06Z
date_updated: 2020-07-14T12:45:04Z
file_id: '5258'
file_name: IST-2016-595-v1+1_VerticalVisibilityGDRevision.pdf
file_size: 312992
relation: main_file
file_date_updated: 2020-07-14T12:45:04Z
has_accepted_license: '1'
intvolume: ' 9411'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 373 - 379
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Graph Drawing and Network Visualization
publication_identifier:
isbn:
- 978-3-319-27260-3
publication_status: published
publisher: Springer Nature
publist_id: '5575'
pubrep_id: '595'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Vertical visibility among parallel polygons in three dimensions
type: book_chapter
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9411
year: '2015'
...
---
_id: '1598'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) with specifications given as
Büchi (liveness) objectives, and examine the problem of computing the set of almost-sure
winning vertices such that the objective can be ensured with probability 1 from
these vertices. We study for the first time the average-case complexity of the
classical algorithm for computing the set of almost-sure winning vertices for
MDPs with Büchi objectives. Our contributions are as follows: First, we show that
for MDPs with constant out-degree the expected number of iterations is at most
logarithmic and the average-case running time is linear (as compared to the worst-case
linear number of iterations and quadratic time complexity). Second, for the average-case
analysis over all MDPs we show that the expected number of iterations is constant
and the average-case running time is linear (again as compared to the worst-case
linear number of iterations and quadratic time complexity). Finally we also show
that when all MDPs are equally likely, the probability that the classical algorithm
requires more than a constant number of iterations is exponentially small.'
acknowledgement: "The research was supported by FWF Grant No. P 23499-N23, FWF NFN
Grant No. S11407-N23 (RiSE), ERC Start Grant (279307: Graph Games), and the Microsoft
Faculty Fellows Award. Nisarg Shah is also supported by NSF Grant CCF-1215883.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Manas
full_name: Joglekar, Manas
last_name: Joglekar
- first_name: Nisarg
full_name: Shah, Nisarg
last_name: Shah
citation:
ama: Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm
for Markov decision processes with Büchi objectives. Theoretical Computer Science.
2015;573(3):71-89. doi:10.1016/j.tcs.2015.01.050
apa: Chatterjee, K., Joglekar, M., & Shah, N. (2015). Average case analysis
of the classical algorithm for Markov decision processes with Büchi objectives.
Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.01.050
chicago: Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case
Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.”
Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.01.050.
ieee: K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical
algorithm for Markov decision processes with Büchi objectives,” Theoretical
Computer Science, vol. 573, no. 3. Elsevier, pp. 71–89, 2015.
ista: Chatterjee K, Joglekar M, Shah N. 2015. Average case analysis of the classical
algorithm for Markov decision processes with Büchi objectives. Theoretical Computer
Science. 573(3), 71–89.
mla: Chatterjee, Krishnendu, et al. “Average Case Analysis of the Classical Algorithm
for Markov Decision Processes with Büchi Objectives.” Theoretical Computer
Science, vol. 573, no. 3, Elsevier, 2015, pp. 71–89, doi:10.1016/j.tcs.2015.01.050.
short: K. Chatterjee, M. Joglekar, N. Shah, Theoretical Computer Science 573 (2015)
71–89.
date_created: 2018-12-11T11:52:56Z
date_published: 2015-03-30T00:00:00Z
date_updated: 2025-09-23T08:00:31Z
day: '30'
department:
- _id: KrCh
doi: 10.1016/j.tcs.2015.01.050
ec_funded: 1
external_id:
arxiv:
- '1202.4175'
isi:
- '000350835500007'
intvolume: ' 573'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1202.4175
month: '03'
oa: 1
oa_version: Preprint
page: 71 - 89
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '5571'
quality_controlled: '1'
related_material:
record:
- id: '2715'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Average case analysis of the classical algorithm for Markov decision processes
with Büchi objectives
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 573
year: '2015'
...
---
_id: '1601'
abstract:
- lang: eng
text: We propose a flexible exchange format for ω-automata, as typically used in
formal verification, and implement support for it in a range of established tools.
Our aim is to simplify the interaction of tools, helping the research community
to build upon other people’s work. A key feature of the format is the use of very
generic acceptance conditions, specified by Boolean combinations of acceptance
primitives, rather than being limited to common cases such as Büchi, Streett,
or Rabin. Such flexibility in the choice of acceptance conditions can be exploited
in applications, for example in probabilistic model checking, and furthermore
encourages the development of acceptance-agnostic tools for automata manipulations.
The format allows acceptance conditions that are either state-based or transition-based,
and also supports alternating automata.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Tomáš
full_name: Babiak, Tomáš
last_name: Babiak
- first_name: František
full_name: Blahoudek, František
last_name: Blahoudek
- first_name: Alexandre
full_name: Duret Lutz, Alexandre
last_name: Duret Lutz
- first_name: Joachim
full_name: Klein, Joachim
last_name: Klein
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Daniel
full_name: Mueller, Daniel
last_name: Mueller
- first_name: David
full_name: Parker, David
last_name: Parker
- first_name: Jan
full_name: Strejček, Jan
last_name: Strejček
citation:
ama: 'Babiak T, Blahoudek F, Duret Lutz A, et al. The Hanoi omega-automata format.
In: Vol 9206. Springer; 2015:479-486. doi:10.1007/978-3-319-21690-4_31'
apa: 'Babiak, T., Blahoudek, F., Duret Lutz, A., Klein, J., Kretinsky, J., Mueller,
D., … Strejček, J. (2015). The Hanoi omega-automata format (Vol. 9206, pp. 479–486).
Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States:
Springer. https://doi.org/10.1007/978-3-319-21690-4_31'
chicago: Babiak, Tomáš, František Blahoudek, Alexandre Duret Lutz, Joachim Klein,
Jan Kretinsky, Daniel Mueller, David Parker, and Jan Strejček. “The Hanoi Omega-Automata
Format,” 9206:479–86. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_31.
ieee: 'T. Babiak et al., “The Hanoi omega-automata format,” presented at
the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015,
vol. 9206, pp. 479–486.'
ista: 'Babiak T, Blahoudek F, Duret Lutz A, Klein J, Kretinsky J, Mueller D, Parker
D, Strejček J. 2015. The Hanoi omega-automata format. CAV: Computer Aided Verification,
LNCS, vol. 9206, 479–486.'
mla: Babiak, Tomáš, et al. The Hanoi Omega-Automata Format. Vol. 9206, Springer,
2015, pp. 479–86, doi:10.1007/978-3-319-21690-4_31.
short: T. Babiak, F. Blahoudek, A. Duret Lutz, J. Klein, J. Kretinsky, D. Mueller,
D. Parker, J. Strejček, in:, Springer, 2015, pp. 479–486.
conference:
end_date: 2015-07-24
location: San Francisco, CA, United States
name: 'CAV: Computer Aided Verification'
start_date: 2015-07-18
date_created: 2018-12-11T11:52:57Z
date_published: 2015-07-16T00:00:00Z
date_updated: 2025-09-23T13:50:55Z
day: '16'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-319-21690-4_31
ec_funded: 1
external_id:
isi:
- '000364182900031'
file:
- access_level: open_access
checksum: 5885236fa88a439baba9ac6f3e801e93
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T08:38:12Z
date_updated: 2020-07-14T12:45:04Z
file_id: '7850'
file_name: 2015_CAV_Babiak.pdf
file_size: 1651779
relation: main_file
file_date_updated: 2020-07-14T12:45:04Z
has_accepted_license: '1'
intvolume: ' 9206'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 479 - 486
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5566'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Hanoi omega-automata format
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9206
year: '2015'
...
---
_id: '1603'
abstract:
- lang: eng
text: "For deterministic systems, a counterexample to a property can simply be an
error trace, whereas counterexamples in probabilistic systems are necessarily
more complex. For instance, a set of erroneous traces with a sufficient cumulative
probability mass can be used. Since these are too large objects to understand
and manipulate, compact representations such as subchains have been considered.
In the case of probabilistic systems with non-determinism, the situation is even
more complex. While a subchain for a given strategy (or scheduler, resolving non-determinism)
is a straightforward choice, we take a different approach. Instead, we focus on
the strategy itself, and extract the most important decisions it makes, and present
its succinct representation.\r\nThe key tools we employ to achieve this are (1)
introducing a concept of importance of a state w.r.t. the strategy, and (2) learning
using decision trees. There are three main consequent advantages of our approach.
Firstly, it exploits the quantitative information on states, stressing the more
important decisions. Secondly, it leads to a greater variability and degree of
freedom in representing the strategies. Thirdly, the representation uses a self-explanatory
data structure. In summary, our approach produces more succinct and more explainable
strategies, as opposed to e.g. binary decision diagrams. Finally, our experimental
results show that we can extract several rules describing the strategy even for
very large systems that do not fit in memory, and based on the rules explain the
erroneous behaviour."
acknowledgement: This research was funded in part by Austrian Science Fund (FWF) Grant
No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE) and Z211-N23 (Wittgenstein Award),
European Research Council (ERC) Grant No 279307 (Graph Games), ERC Grant No 267989
(QUAREM), the Czech Science Foundation Grant No P202/12/G061, and People Programme
(Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013)
REA Grant No 291734.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Andreas
full_name: Fellner, Andreas
id: 42BABFB4-F248-11E8-B48F-1D18A9856A87
last_name: Fellner
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: 'Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. Counterexample
explanation by learning small strategies in Markov decision processes. In: Vol
9206. Springer; 2015:158-177. doi:10.1007/978-3-319-21690-4_10'
apa: 'Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., & Kretinsky, J.
(2015). Counterexample explanation by learning small strategies in Markov decision
processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification,
San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21690-4_10'
chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner,
and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in
Markov Decision Processes,” 9206:158–77. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_10.
ieee: 'T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample
explanation by learning small strategies in Markov decision processes,” presented
at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015,
vol. 9206, pp. 158–177.'
ista: 'Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample
explanation by learning small strategies in Markov decision processes. CAV: Computer
Aided Verification, LNCS, vol. 9206, 158–177.'
mla: Brázdil, Tomáš, et al. Counterexample Explanation by Learning Small Strategies
in Markov Decision Processes. Vol. 9206, Springer, 2015, pp. 158–77, doi:10.1007/978-3-319-21690-4_10.
short: T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, J. Kretinsky, in:, Springer,
2015, pp. 158–177.
conference:
end_date: 2015-07-24
location: San Francisco, CA, United States
name: 'CAV: Computer Aided Verification'
start_date: 2015-07-18
corr_author: '1'
date_created: 2018-12-11T11:52:58Z
date_published: 2015-07-16T00:00:00Z
date_updated: 2025-09-23T08:23:16Z
day: '16'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-21690-4_10
ec_funded: 1
external_id:
arxiv:
- '1502.02834'
isi:
- '000364182900010'
intvolume: ' 9206'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1502.02834
month: '07'
oa: 1
oa_version: Preprint
page: 158 - 177
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: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_identifier:
eisbn:
- 978-3-319-21690-4
publication_status: published
publisher: Springer
publist_id: '5564'
quality_controlled: '1'
related_material:
record:
- id: '5549'
relation: research_paper
status: public
scopus_import: '1'
status: public
title: Counterexample explanation by learning small strategies in Markov decision
processes
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9206
year: '2015'
...
---
_id: '1605'
abstract:
- lang: eng
text: Multiaffine hybrid automata (MHA) represent a powerful formalism to model
complex dynamical systems. This formalism is particularly suited for the representation
of biological systems which often exhibit highly non-linear behavior. In this
paper, we consider the problem of parameter identification for MHA. We present
an abstraction of MHA based on linear hybrid automata, which can be analyzed by
the SpaceEx model checker. This abstraction enables a precise handling of time-dependent
properties. We demonstrate the potential of our approach on a model of a genetic
regulatory network and a myocyte model.
acknowledgement: This work was partly supported by the European Research Council (ERC)
under grant 267989 (QUAREM), by the Austrian Science Fund (FWF) under grants S11402-N23,
S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), and by
the German Research Foundation (DFG) as part of the Transregional Collaborative
Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR
14 AVACS, http://www.avacs.org/).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Grégory
full_name: Batt, Grégory
last_name: Batt
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Bogomolov S, Schilling C, Bartocci E, Batt G, Kong H, Grosu R. Abstraction-based
parameter synthesis for multiaffine systems. In: Vol 9434. Springer; 2015:19-35.
doi:10.1007/978-3-319-26287-1_2'
apa: 'Bogomolov, S., Schilling, C., Bartocci, E., Batt, G., Kong, H., & Grosu,
R. (2015). Abstraction-based parameter synthesis for multiaffine systems (Vol.
9434, pp. 19–35). Presented at the HVC: Haifa Verification Conference, Haifa,
Israel: Springer. https://doi.org/10.1007/978-3-319-26287-1_2'
chicago: Bogomolov, Sergiy, Christian Schilling, Ezio Bartocci, Grégory Batt, Hui
Kong, and Radu Grosu. “Abstraction-Based Parameter Synthesis for Multiaffine Systems,”
9434:19–35. Springer, 2015. https://doi.org/10.1007/978-3-319-26287-1_2.
ieee: 'S. Bogomolov, C. Schilling, E. Bartocci, G. Batt, H. Kong, and R. Grosu,
“Abstraction-based parameter synthesis for multiaffine systems,” presented at
the HVC: Haifa Verification Conference, Haifa, Israel, 2015, vol. 9434, pp. 19–35.'
ista: 'Bogomolov S, Schilling C, Bartocci E, Batt G, Kong H, Grosu R. 2015. Abstraction-based
parameter synthesis for multiaffine systems. HVC: Haifa Verification Conference,
LNCS, vol. 9434, 19–35.'
mla: Bogomolov, Sergiy, et al. Abstraction-Based Parameter Synthesis for Multiaffine
Systems. Vol. 9434, Springer, 2015, pp. 19–35, doi:10.1007/978-3-319-26287-1_2.
short: S. Bogomolov, C. Schilling, E. Bartocci, G. Batt, H. Kong, R. Grosu, in:,
Springer, 2015, pp. 19–35.
conference:
end_date: 2015-11-19
location: Haifa, Israel
name: 'HVC: Haifa Verification Conference'
start_date: 2015-11-17
corr_author: '1'
date_created: 2018-12-11T11:52:59Z
date_published: 2015-11-28T00:00:00Z
date_updated: 2025-04-15T06:26:03Z
day: '28'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-26287-1_2
ec_funded: 1
file:
- access_level: open_access
checksum: 3aab260f3f34641d622030ba22645b3e
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T08:43:19Z
date_updated: 2020-07-14T12:45:05Z
file_id: '7851'
file_name: 2015_LNCS_Bogomolov.pdf
file_size: 1053207
relation: main_file
file_date_updated: 2020-07-14T12:45:05Z
has_accepted_license: '1'
intvolume: ' 9434'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 19 - 35
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5561'
quality_controlled: '1'
scopus_import: 1
status: public
title: Abstraction-based parameter synthesis for multiaffine systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9434
year: '2015'
...
---
_id: '1606'
abstract:
- lang: eng
text: 'In this paper, we present the first steps toward a runtime verification framework
for monitoring hybrid and cyber-physical systems (CPS) development tools based
on randomized differential testing. The development tools include hybrid systems
reachability analysis tools, model-based development environments like Simulink/Stateflow
(SLSF), etc. First, hybrid automaton models are randomly generated. Next, these
hybrid automaton models are translated to a number of different tools (currently,
SpaceEx, dReach, Flow*, HyCreate, and the MathWorks’ Simulink/Stateflow) using
the HyST source transformation and translation tool. Then, the hybrid automaton
models are executed in the different tools and their outputs are parsed. The final
step is the differential comparison: the outputs of the different tools are compared.
If the results do not agree (in the sense that an analysis or verification result
from one tool does not match that of another tool, ignoring timeouts, etc.), a
candidate bug is flagged and the model is saved for future analysis by the user.
The process then repeats and the monitoring continues until the user terminates
the process. We present preliminary results that have been useful in identifying
a few bugs in the analysis methods of different development tools, and in an earlier
version of HyST.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luan
full_name: Nguyen, Luan
last_name: Nguyen
- first_name: Christian
full_name: Schilling, Christian
last_name: Schilling
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Taylor
full_name: Johnson, Taylor
last_name: Johnson
citation:
ama: 'Nguyen L, Schilling C, Bogomolov S, Johnson T. Runtime verification for hybrid
analysis tools. In: 6th International Conference. Vol 9333. Springer Nature;
2015:281-286. doi:10.1007/978-3-319-23820-3_19'
apa: 'Nguyen, L., Schilling, C., Bogomolov, S., & Johnson, T. (2015). Runtime
verification for hybrid analysis tools. In 6th International Conference
(Vol. 9333, pp. 281–286). Vienna, Austria: Springer Nature. https://doi.org/10.1007/978-3-319-23820-3_19'
chicago: Nguyen, Luan, Christian Schilling, Sergiy Bogomolov, and Taylor Johnson.
“Runtime Verification for Hybrid Analysis Tools.” In 6th International Conference,
9333:281–86. Springer Nature, 2015. https://doi.org/10.1007/978-3-319-23820-3_19.
ieee: L. Nguyen, C. Schilling, S. Bogomolov, and T. Johnson, “Runtime verification
for hybrid analysis tools,” in 6th International Conference, Vienna, Austria,
2015, vol. 9333, pp. 281–286.
ista: 'Nguyen L, Schilling C, Bogomolov S, Johnson T. 2015. Runtime verification
for hybrid analysis tools. 6th International Conference. RV: Runtime Verification,
LNCS, vol. 9333, 281–286.'
mla: Nguyen, Luan, et al. “Runtime Verification for Hybrid Analysis Tools.” 6th
International Conference, vol. 9333, Springer Nature, 2015, pp. 281–86, doi:10.1007/978-3-319-23820-3_19.
short: L. Nguyen, C. Schilling, S. Bogomolov, T. Johnson, in:, 6th International
Conference, Springer Nature, 2015, pp. 281–286.
conference:
end_date: 2015-09-25
location: Vienna, Austria
name: 'RV: Runtime Verification'
start_date: 2015-09-22
date_created: 2018-12-11T11:52:59Z
date_published: 2015-11-15T00:00:00Z
date_updated: 2025-09-23T10:41:02Z
day: '15'
department:
- _id: ToHe
doi: 10.1007/978-3-319-23820-3_19
ec_funded: 1
external_id:
isi:
- '000370624400019'
intvolume: ' 9333'
isi: 1
language:
- iso: eng
month: '11'
oa_version: None
page: 281 - 286
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: 6th International Conference
publication_identifier:
isbn:
- 978-3-319-23819-7
publication_status: published
publisher: Springer Nature
publist_id: '5562'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Runtime verification for hybrid analysis tools
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9333
year: '2015'
...
---
_id: '1609'
abstract:
- lang: eng
text: The synthesis problem asks for the automatic construction of a system from
its specification. In the traditional setting, the system is “constructed from
scratch” rather than composed from reusable components. However, this is rare
in practice, and almost every non-trivial software system relies heavily on the
use of libraries of reusable components. Recently, Lustig and Vardi introduced
dataflow and controlflow synthesis from libraries of reusable components. They
proved that dataflow synthesis is undecidable, while controlflow synthesis is
decidable. The problem of controlflow synthesis from libraries of probabilistic
components was considered by Nain, Lustig and Vardi, and was shown to be decidable
for qualitative analysis (that asks that the specification be satisfied with probability
1). Our main contribution for controlflow synthesis from probabilistic components
is to establish better complexity bounds for the qualitative analysis problem,
and to show that the more general quantitative problem is undecidable. For the
qualitative analysis, we show that the problem (i) is EXPTIME-complete when the
specification is given as a deterministic parity word automaton, improving the
previously known 2EXPTIME upper bound; and (ii) belongs to UP ∩ coUP and is parity-games
hard, when the specification is given directly as a parity condition on the components,
improving the previously known EXPTIME upper bound.
acknowledgement: 'This research was supported by Austrian Science Fund (FWF) Grant
No P23499- N23, FWF NFN Grant No S11407-N23 (SHiNE), ERC Start grant (279307: Graph
Games), EU FP7 Project Cassting, NSF grants CNS 1049862 and CCF-1139011, by NSF
Expeditions in Computing project “ExCAPE: Expeditions in Computer Augmented Program
Engineering”, by BSF grant 9800096, and by gift from Intel.'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
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
- first_name: Moshe
full_name: Vardi, Moshe
last_name: Vardi
citation:
ama: 'Chatterjee K, Doyen L, Vardi M. The complexity of synthesis from probabilistic
components. In: 42nd International Colloquium. Vol 9135. Springer Nature;
2015:108-120. doi:10.1007/978-3-662-47666-6_9'
apa: 'Chatterjee, K., Doyen, L., & Vardi, M. (2015). The complexity of synthesis
from probabilistic components. In 42nd International Colloquium (Vol. 9135,
pp. 108–120). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47666-6_9'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Moshe Vardi. “The Complexity
of Synthesis from Probabilistic Components.” In 42nd International Colloquium,
9135:108–20. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47666-6_9.
ieee: K. Chatterjee, L. Doyen, and M. Vardi, “The complexity of synthesis from probabilistic
components,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol.
9135, pp. 108–120.
ista: 'Chatterjee K, Doyen L, Vardi M. 2015. The complexity of synthesis from probabilistic
components. 42nd International Colloquium. ICALP: Automata, Languages and Programming,
LNCS, vol. 9135, 108–120.'
mla: Chatterjee, Krishnendu, et al. “The Complexity of Synthesis from Probabilistic
Components.” 42nd International Colloquium, vol. 9135, Springer Nature,
2015, pp. 108–20, doi:10.1007/978-3-662-47666-6_9.
short: K. Chatterjee, L. Doyen, M. Vardi, in:, 42nd International Colloquium, Springer
Nature, 2015, pp. 108–120.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: Automata, Languages and Programming'
start_date: 2015-07-06
corr_author: '1'
date_created: 2018-12-11T11:53:00Z
date_published: 2015-06-20T00:00:00Z
date_updated: 2025-09-23T13:48:35Z
day: '20'
department:
- _id: KrCh
doi: 10.1007/978-3-662-47666-6_9
ec_funded: 1
external_id:
arxiv:
- '1502.04844'
isi:
- '000364317900009'
intvolume: ' 9135'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1502.04844
month: '06'
oa: 1
oa_version: Preprint
page: 108 - 120
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: 42nd International Colloquium
publication_identifier:
isbn:
- 978-3-662-47665-9
publication_status: published
publisher: Springer Nature
publist_id: '5557'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The complexity of synthesis from probabilistic components
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9135
year: '2015'
...
---
_id: '1611'
abstract:
- lang: eng
text: Biosensors for signaling molecules allow the study of physiological processes
by bringing together the fields of protein engineering, fluorescence imaging,
and cell biology. Construction of genetically encoded biosensors generally relies
on the availability of a binding "core" that is both specific and stable,
which can then be combined with fluorescent molecules to create a sensor. However,
binding proteins with the desired properties are often not available in nature
and substantial improvement to sensors can be required, particularly with regard
to their durability. Ancestral protein reconstruction is a powerful protein-engineering
tool able to generate highly stable and functional proteins. In this work, we
sought to establish the utility of ancestral protein reconstruction to biosensor
development, beginning with the construction of an l-arginine biosensor. l-arginine,
as the immediate precursor to nitric oxide, is an important molecule in many physiological
contexts including brain function. Using a combination of ancestral reconstruction
and circular permutation, we constructed a Förster resonance energy transfer (FRET)
biosensor for l-arginine (cpFLIPR). cpFLIPR displays high sensitivity and specificity,
with a Kd of ∼14 μM and a maximal dynamic range of 35%. Importantly, cpFLIPR was
highly robust, enabling accurate l-arginine measurement at physiological temperatures.
We established that cpFLIPR is compatible with two-photon excitation fluorescence
microscopy and report l-arginine concentrations in brain tissue.
article_processing_charge: No
author:
- first_name: Jason
full_name: Whitfield, Jason
last_name: Whitfield
- first_name: William
full_name: Zhang, William
last_name: Zhang
- first_name: Michel
full_name: Herde, Michel
last_name: Herde
- first_name: Ben
full_name: Clifton, Ben
last_name: Clifton
- first_name: Johanna
full_name: Radziejewski, Johanna
last_name: Radziejewski
- 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: Christian
full_name: Henneberger, Christian
last_name: Henneberger
- first_name: Colin
full_name: Jackson, Colin
last_name: Jackson
citation:
ama: Whitfield J, Zhang W, Herde M, et al. Construction of a robust and sensitive
arginine biosensor through ancestral protein reconstruction. Protein Science.
2015;24(9):1412-1422. doi:10.1002/pro.2721
apa: Whitfield, J., Zhang, W., Herde, M., Clifton, B., Radziejewski, J., Janovjak,
H. L., … Jackson, C. (2015). Construction of a robust and sensitive arginine biosensor
through ancestral protein reconstruction. Protein Science. Wiley. https://doi.org/10.1002/pro.2721
chicago: Whitfield, Jason, William Zhang, Michel Herde, Ben Clifton, Johanna Radziejewski,
Harald L Janovjak, Christian Henneberger, and Colin Jackson. “Construction of
a Robust and Sensitive Arginine Biosensor through Ancestral Protein Reconstruction.”
Protein Science. Wiley, 2015. https://doi.org/10.1002/pro.2721.
ieee: J. Whitfield et al., “Construction of a robust and sensitive arginine
biosensor through ancestral protein reconstruction,” Protein Science, vol.
24, no. 9. Wiley, pp. 1412–1422, 2015.
ista: Whitfield J, Zhang W, Herde M, Clifton B, Radziejewski J, Janovjak HL, Henneberger
C, Jackson C. 2015. Construction of a robust and sensitive arginine biosensor
through ancestral protein reconstruction. Protein Science. 24(9), 1412–1422.
mla: Whitfield, Jason, et al. “Construction of a Robust and Sensitive Arginine Biosensor
through Ancestral Protein Reconstruction.” Protein Science, vol. 24, no.
9, Wiley, 2015, pp. 1412–22, doi:10.1002/pro.2721.
short: J. Whitfield, W. Zhang, M. Herde, B. Clifton, J. Radziejewski, H.L. Janovjak,
C. Henneberger, C. Jackson, Protein Science 24 (2015) 1412–1422.
date_created: 2018-12-11T11:53:01Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2025-09-23T08:21:28Z
day: '01'
department:
- _id: HaJa
doi: 10.1002/pro.2721
external_id:
isi:
- '000360380400008'
pmid:
- '26061224'
intvolume: ' 24'
isi: 1
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4570536/
month: '09'
oa: 1
oa_version: Submitted Version
page: 1412 - 1422
pmid: 1
project:
- _id: 255BFFFA-B435-11E9-9278-68D0E5697425
grant_number: RGY0084/2012
name: In situ real-time imaging of neurotransmitter signaling using designer optical
sensors
publication: Protein Science
publication_status: published
publisher: Wiley
publist_id: '5555'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Construction of a robust and sensitive arginine biosensor through ancestral
protein reconstruction
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 24
year: '2015'
...
---
_id: '1614'
abstract:
- lang: eng
text: 'GABAergic perisoma-inhibiting fast-spiking interneurons (PIIs) effectively
control the activity of large neuron populations by their wide axonal arborizations.
It is generally assumed that the output of one PII to its target cells is strong
and rapid. Here, we show that, unexpectedly, both strength and time course of
PII-mediated perisomatic inhibition change with distance between synaptically
connected partners in the rodent hippocampus. Synaptic signals become weaker due
to lower contact numbers and decay more slowly with distance, very likely resulting
from changes in GABAA receptor subunit composition. When distance-dependent synaptic
inhibition is introduced to a rhythmically active neuronal network model, randomly
driven principal cell assemblies are strongly synchronized by the PIIs, leading
to higher precision in principal cell spike times than in a network with uniform
synaptic inhibition. '
article_processing_charge: No
author:
- first_name: Michael
full_name: Strüber, Michael
last_name: Strüber
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Marlene
full_name: Bartos, Marlene
last_name: Bartos
citation:
ama: Strüber M, Jonas PM, Bartos M. Strength and duration of perisomatic GABAergic
inhibition depend on distance between synaptically connected cells. PNAS.
2015;112(4):1220-1225. doi:10.1073/pnas.1412996112
apa: Strüber, M., Jonas, P. M., & Bartos, M. (2015). Strength and duration of
perisomatic GABAergic inhibition depend on distance between synaptically connected
cells. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1412996112
chicago: Strüber, Michael, Peter M Jonas, and Marlene Bartos. “Strength and Duration
of Perisomatic GABAergic Inhibition Depend on Distance between Synaptically Connected
Cells.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1412996112.
ieee: M. Strüber, P. M. Jonas, and M. Bartos, “Strength and duration of perisomatic
GABAergic inhibition depend on distance between synaptically connected cells,”
PNAS, vol. 112, no. 4. National Academy of Sciences, pp. 1220–1225, 2015.
ista: Strüber M, Jonas PM, Bartos M. 2015. Strength and duration of perisomatic
GABAergic inhibition depend on distance between synaptically connected cells.
PNAS. 112(4), 1220–1225.
mla: Strüber, Michael, et al. “Strength and Duration of Perisomatic GABAergic Inhibition
Depend on Distance between Synaptically Connected Cells.” PNAS, vol. 112,
no. 4, National Academy of Sciences, 2015, pp. 1220–25, doi:10.1073/pnas.1412996112.
short: M. Strüber, P.M. Jonas, M. Bartos, PNAS 112 (2015) 1220–1225.
date_created: 2018-12-11T11:53:02Z
date_published: 2015-01-27T00:00:00Z
date_updated: 2025-09-23T10:49:39Z
day: '27'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1073/pnas.1412996112
ec_funded: 1
external_id:
isi:
- '000348417000066'
pmid:
- '25583495'
file:
- access_level: open_access
checksum: 6703309a1f58493cf5a704211fb6ebed
content_type: application/pdf
creator: dernst
date_created: 2019-01-17T07:52:40Z
date_updated: 2020-07-14T12:45:07Z
file_id: '5838'
file_name: 2015_PNAS_Strueber.pdf
file_size: 1280860
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: ' 112'
isi: 1
issue: '4'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 1220 - 1225
pmid: 1
project:
- _id: 25C26B1E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P24909-B24
name: Mechanisms of transmitter release at GABAergic synapses
- _id: 25C0F108-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '268548'
name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '5552'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strength and duration of perisomatic GABAergic inhibition depend on distance
between synaptically connected cells
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 112
year: '2015'
...
---
_id: '1615'
abstract:
- lang: eng
text: Loss-of-function mutations in the synaptic adhesion protein Neuroligin-4 are
among the most common genetic abnormalities associated with autism spectrum disorders,
but little is known about the function of Neuroligin-4 and the consequences of
its loss. We assessed synaptic and network characteristics in Neuroligin-4 knockout
mice, focusing on the hippocampus as a model brain region with a critical role
in cognition and memory, and found that Neuroligin-4 deletion causes subtle defects
of the protein composition and function of GABAergic synapses in the hippocampal
CA3 region. Interestingly, these subtle synaptic changes are accompanied by pronounced
perturbations of γ-oscillatory network activity, which has been implicated in
cognitive function and is altered in multiple psychiatric and neurodevelopmental
disorders. Our data provide important insights into the mechanisms by which Neuroligin-4-dependent
GABAergic synapses may contribute to autism phenotypes and indicate new strategies
for therapeutic approaches.
acknowledgement: This work was supported by the Max Planck Society (N.B. and H.E.),
the European Commission (EU-AIMS FP7-115300, N.B. and H.E.; Marie Curie IRG, D.K.-B.),
the German Research Foundation (CNMPB, N.B., H.E., and F.V.), the Alexander von
Humboldt-Foundation (D.K.-B.), and the Austrian Fond zur Förderung der Wissenschaftlichen
Forschung (P 24909-B24, P.J.). M.H. was a student of the doctoral program Molecular
Physiology of the Brain. Dr. J.-M. Fritschy generously provided the GABAARγ2 antibody.
We thank F. Benseler, I. Thanhäuser, D. Schwerdtfeger, A. Ronnenberg, and D. Winkler
for valuable advice and excellent technical support. We are grateful to the staff
at the animal facility of the Max Planck Institute of Experimental Medicine for
mouse husbandry.
article_processing_charge: No
author:
- first_name: Matthieu
full_name: Hammer, Matthieu
last_name: Hammer
- first_name: Dilja
full_name: Krueger Burg, Dilja
last_name: Krueger Burg
- first_name: Liam
full_name: Tuffy, Liam
last_name: Tuffy
- first_name: Benjamin
full_name: Cooper, Benjamin
last_name: Cooper
- first_name: Holger
full_name: Taschenberger, Holger
last_name: Taschenberger
- first_name: Sarit
full_name: Goswami, Sarit
id: 3A578F32-F248-11E8-B48F-1D18A9856A87
last_name: Goswami
- first_name: Hannelore
full_name: Ehrenreich, Hannelore
last_name: Ehrenreich
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Frederique
full_name: Varoqueaux, Frederique
last_name: Varoqueaux
- first_name: Jeong
full_name: Rhee, Jeong
last_name: Rhee
- first_name: Nils
full_name: Brose, Nils
last_name: Brose
citation:
ama: Hammer M, Krueger Burg D, Tuffy L, et al. Perturbed hippocampal synaptic inhibition
and γ-oscillations in a neuroligin-4 knockout mouse model of autism. Cell Reports.
2015;13(3):516-523. doi:10.1016/j.celrep.2015.09.011
apa: Hammer, M., Krueger Burg, D., Tuffy, L., Cooper, B., Taschenberger, H., Goswami,
S., … Brose, N. (2015). Perturbed hippocampal synaptic inhibition and γ-oscillations
in a neuroligin-4 knockout mouse model of autism. Cell Reports. Cell Press.
https://doi.org/10.1016/j.celrep.2015.09.011
chicago: Hammer, Matthieu, Dilja Krueger Burg, Liam Tuffy, Benjamin Cooper, Holger
Taschenberger, Sarit Goswami, Hannelore Ehrenreich, et al. “Perturbed Hippocampal
Synaptic Inhibition and γ-Oscillations in a Neuroligin-4 Knockout Mouse Model
of Autism.” Cell Reports. Cell Press, 2015. https://doi.org/10.1016/j.celrep.2015.09.011.
ieee: M. Hammer et al., “Perturbed hippocampal synaptic inhibition and γ-oscillations
in a neuroligin-4 knockout mouse model of autism,” Cell Reports, vol. 13,
no. 3. Cell Press, pp. 516–523, 2015.
ista: Hammer M, Krueger Burg D, Tuffy L, Cooper B, Taschenberger H, Goswami S, Ehrenreich
H, Jonas PM, Varoqueaux F, Rhee J, Brose N. 2015. Perturbed hippocampal synaptic
inhibition and γ-oscillations in a neuroligin-4 knockout mouse model of autism.
Cell Reports. 13(3), 516–523.
mla: Hammer, Matthieu, et al. “Perturbed Hippocampal Synaptic Inhibition and γ-Oscillations
in a Neuroligin-4 Knockout Mouse Model of Autism.” Cell Reports, vol. 13,
no. 3, Cell Press, 2015, pp. 516–23, doi:10.1016/j.celrep.2015.09.011.
short: M. Hammer, D. Krueger Burg, L. Tuffy, B. Cooper, H. Taschenberger, S. Goswami,
H. Ehrenreich, P.M. Jonas, F. Varoqueaux, J. Rhee, N. Brose, Cell Reports 13 (2015)
516–523.
date_created: 2018-12-11T11:53:02Z
date_published: 2015-10-20T00:00:00Z
date_updated: 2025-09-23T09:48:31Z
day: '20'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1016/j.celrep.2015.09.011
external_id:
isi:
- '000363780000008'
file:
- access_level: open_access
checksum: 44d30fbb543774b076b4938bd36af9d7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:23Z
date_updated: 2020-07-14T12:45:07Z
file_id: '5005'
file_name: IST-2016-470-v1+1_1-s2.0-S2211124715010220-main.pdf
file_size: 2314406
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
issue: '3'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 516 - 523
publication: Cell Reports
publication_status: published
publisher: Cell Press
publist_id: '5551'
pubrep_id: '470'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Perturbed hippocampal synaptic inhibition and γ-oscillations in a neuroligin-4
knockout mouse model of autism
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: 13
year: '2015'
...
---
_id: '1618'
abstract:
- lang: eng
text: CCL19 and CCL21 are chemokines involved in the trafficking of immune cells,
particularly within the lymphatic system, through activation of CCR7. Concurrent
expression of PSGL-1 and CCR7 in naive T-cells enhances recruitment of these cells
to secondary lymphoid organs by CCL19 and CCL21. Here the solution structure of
CCL19 is reported. It contains a canonical chemokine domain. Chemical shift mapping
shows the N-termini of PSGL-1 and CCR7 have overlapping binding sites for CCL19
and binding is competitive. Implications for the mechanism of PSGL-1's enhancement
of resting T-cell recruitment are discussed.
article_processing_charge: No
author:
- first_name: Christopher
full_name: Veldkamp, Christopher
last_name: Veldkamp
- first_name: Eva
full_name: Kiermaier, Eva
id: 3EB04B78-F248-11E8-B48F-1D18A9856A87
last_name: Kiermaier
orcid: 0000-0001-6165-5738
- first_name: Skylar
full_name: Gabel Eissens, Skylar
last_name: Gabel Eissens
- first_name: Miranda
full_name: Gillitzer, Miranda
last_name: Gillitzer
- first_name: David
full_name: Lippner, David
last_name: Lippner
- first_name: Frank
full_name: Disilvio, Frank
last_name: Disilvio
- first_name: Casey
full_name: Mueller, Casey
last_name: Mueller
- first_name: Paeton
full_name: Wantuch, Paeton
last_name: Wantuch
- first_name: Gary
full_name: Chaffee, Gary
last_name: Chaffee
- first_name: Michael
full_name: Famiglietti, Michael
last_name: Famiglietti
- first_name: Danielle
full_name: Zgoba, Danielle
last_name: Zgoba
- first_name: Asha
full_name: Bailey, Asha
last_name: Bailey
- first_name: Yaya
full_name: Bah, Yaya
last_name: Bah
- first_name: Samantha
full_name: Engebretson, Samantha
last_name: Engebretson
- first_name: David
full_name: Graupner, David
last_name: Graupner
- first_name: Emily
full_name: Lackner, Emily
last_name: Lackner
- first_name: Vincent
full_name: Larosa, Vincent
last_name: Larosa
- first_name: Tysha
full_name: Medeiros, Tysha
last_name: Medeiros
- first_name: Michael
full_name: Olson, Michael
last_name: Olson
- first_name: Andrew
full_name: Phillips, Andrew
last_name: Phillips
- first_name: Harley
full_name: Pyles, Harley
last_name: Pyles
- first_name: Amanda
full_name: Richard, Amanda
last_name: Richard
- first_name: Scott
full_name: Schoeller, Scott
last_name: Schoeller
- first_name: Boris
full_name: Touzeau, Boris
last_name: Touzeau
- first_name: Larry
full_name: Williams, Larry
last_name: Williams
- 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: Francis
full_name: Peterson, Francis
last_name: Peterson
citation:
ama: Veldkamp C, Kiermaier E, Gabel Eissens S, et al. Solution structure of CCL19
and identification of overlapping CCR7 and PSGL-1 binding sites. Biochemistry.
2015;54(27):4163-4166. doi:10.1021/acs.biochem.5b00560
apa: Veldkamp, C., Kiermaier, E., Gabel Eissens, S., Gillitzer, M., Lippner, D.,
Disilvio, F., … Peterson, F. (2015). Solution structure of CCL19 and identification
of overlapping CCR7 and PSGL-1 binding sites. Biochemistry. American Chemical
Society. https://doi.org/10.1021/acs.biochem.5b00560
chicago: Veldkamp, Christopher, Eva Kiermaier, Skylar Gabel Eissens, Miranda Gillitzer,
David Lippner, Frank Disilvio, Casey Mueller, et al. “Solution Structure of CCL19
and Identification of Overlapping CCR7 and PSGL-1 Binding Sites.” Biochemistry.
American Chemical Society, 2015. https://doi.org/10.1021/acs.biochem.5b00560.
ieee: C. Veldkamp et al., “Solution structure of CCL19 and identification
of overlapping CCR7 and PSGL-1 binding sites,” Biochemistry, vol. 54, no.
27. American Chemical Society, pp. 4163–4166, 2015.
ista: Veldkamp C, Kiermaier E, Gabel Eissens S, Gillitzer M, Lippner D, Disilvio
F, Mueller C, Wantuch P, Chaffee G, Famiglietti M, Zgoba D, Bailey A, Bah Y, Engebretson
S, Graupner D, Lackner E, Larosa V, Medeiros T, Olson M, Phillips A, Pyles H,
Richard A, Schoeller S, Touzeau B, Williams L, Sixt MK, Peterson F. 2015. Solution
structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites.
Biochemistry. 54(27), 4163–4166.
mla: Veldkamp, Christopher, et al. “Solution Structure of CCL19 and Identification
of Overlapping CCR7 and PSGL-1 Binding Sites.” Biochemistry, vol. 54, no.
27, American Chemical Society, 2015, pp. 4163–66, doi:10.1021/acs.biochem.5b00560.
short: C. Veldkamp, E. Kiermaier, S. Gabel Eissens, M. Gillitzer, D. Lippner, F.
Disilvio, C. Mueller, P. Wantuch, G. Chaffee, M. Famiglietti, D. Zgoba, A. Bailey,
Y. Bah, S. Engebretson, D. Graupner, E. Lackner, V. Larosa, T. Medeiros, M. Olson,
A. Phillips, H. Pyles, A. Richard, S. Schoeller, B. Touzeau, L. Williams, M.K.
Sixt, F. Peterson, Biochemistry 54 (2015) 4163–4166.
date_created: 2018-12-11T11:53:03Z
date_published: 2015-06-26T00:00:00Z
date_updated: 2025-09-23T10:47:25Z
day: '26'
department:
- _id: MiSi
doi: 10.1021/acs.biochem.5b00560
ec_funded: 1
external_id:
isi:
- '000358105100001'
pmid:
- '26115234'
intvolume: ' 54'
isi: 1
issue: '27'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4809050/
month: '06'
oa: 1
oa_version: Submitted Version
page: 4163 - 4166
pmid: 1
project:
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281556'
name: Cytoskeletal force generation and force transduction of migrating leukocytes
publication: Biochemistry
publication_status: published
publisher: American Chemical Society
publist_id: '5548'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1
binding sites
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 54
year: '2015'
...