---
_id: '9917'
abstract:
- lang: eng
text: Adaptive divergence and speciation may happen despite opposition by gene flow.
Identifying the genomic basis underlying divergence with gene flow is a major
task in evolutionary genomics. Most approaches (e.g., outlier scans) focus on
genomic regions of high differentiation. However, not all genomic architectures
potentially underlying divergence are expected to show extreme differentiation.
Here, we develop an approach that combines hybrid zone analysis (i.e., focuses
on spatial patterns of allele frequency change) with system-specific simulations
to identify loci inconsistent with neutral evolution. We apply this to a genome-wide
SNP set from an ideally suited study organism, the intertidal snail Littorina
saxatilis, which shows primary divergence between ecotypes associated with different
shore habitats. We detect many SNPs with clinal patterns, most of which are consistent
with neutrality. Among non-neutral SNPs, most are located within three large putative
inversions differentiating ecotypes. Many non-neutral SNPs show relatively low
levels of differentiation. We discuss potential reasons for this pattern, including
loose linkage to selected variants, polygenic adaptation and a component of balancing
selection within populations (which may be expected for inversions). Our work
is in line with theory predicting a role for inversions in divergence, and emphasizes
that genomic regions contributing to divergence may not always be accessible with
methods purely based on allele frequency differences. These conclusions call for
approaches that take spatial patterns of allele frequency change into account
in other systems.
acknowledgement: We are very grateful to people who helped with fieldwork, snail processing,
and DNA extractions, particularly Laura Brettell, Mårten Duvetorp, Juan Galindo,
Anne-Lise Liabot and Irena Senčić. We would also like to thank Magnus Alm Rosenblad
and Mats Töpel for their contribution to assembling the Littorina saxatilis genome,
Carl André, Pasi Rastas, and Romain Villoutreix for discussion, and two anonymous
reviewers for their helpful comments on the manuscript. We are grateful to RapidGenomics
for library preparation and sequencing. We thank the Natural Environment Research
Council, the European Research Council and the Swedish Research Councils VR and
Formas (Linnaeus grant to the Centre for Marine Evolutionary Biology and Tage Erlander
Guest Professorship) for funding. P.C. was funded by the University of Sheffield
Vice-chancellor's India scholarship. R.F. is funded by the European Union's Horizon
2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement
no. 706376. M. Raf. was supported by the Adlerbert Research Foundation.
article_processing_charge: Yes
article_type: letter_note
author:
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Marina
full_name: Rafajlović, Marina
last_name: Rafajlović
- first_name: Pragya
full_name: Chaube, Pragya
last_name: Chaube
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Tomas
full_name: Larsson, Tomas
last_name: Larsson
- first_name: Marina
full_name: Panova, Marina
last_name: Panova
- first_name: Mark
full_name: Ravinet, Mark
last_name: Ravinet
- first_name: Anders
full_name: Blomberg, Anders
last_name: Blomberg
- first_name: Bernhard
full_name: Mehlig, Bernhard
last_name: Mehlig
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Roger
full_name: Butlin, Roger
last_name: Butlin
citation:
ama: 'Westram AM, Rafajlović M, Chaube P, et al. Clines on the seashore: The genomic
architecture underlying rapid divergence in the face of gene flow. Evolution
Letters. 2018;2(4):297-309. doi:10.1002/evl3.74'
apa: 'Westram, A. M., Rafajlović, M., Chaube, P., Faria, R., Larsson, T., Panova,
M., … Butlin, R. (2018). Clines on the seashore: The genomic architecture underlying
rapid divergence in the face of gene flow. Evolution Letters. Wiley. https://doi.org/10.1002/evl3.74'
chicago: 'Westram, Anja M, Marina Rafajlović, Pragya Chaube, Rui Faria, Tomas Larsson,
Marina Panova, Mark Ravinet, et al. “Clines on the Seashore: The Genomic Architecture
Underlying Rapid Divergence in the Face of Gene Flow.” Evolution Letters.
Wiley, 2018. https://doi.org/10.1002/evl3.74.'
ieee: 'A. M. Westram et al., “Clines on the seashore: The genomic architecture
underlying rapid divergence in the face of gene flow,” Evolution Letters,
vol. 2, no. 4. Wiley, pp. 297–309, 2018.'
ista: 'Westram AM, Rafajlović M, Chaube P, Faria R, Larsson T, Panova M, Ravinet
M, Blomberg A, Mehlig B, Johannesson K, Butlin R. 2018. Clines on the seashore:
The genomic architecture underlying rapid divergence in the face of gene flow.
Evolution Letters. 2(4), 297–309.'
mla: 'Westram, Anja M., et al. “Clines on the Seashore: The Genomic Architecture
Underlying Rapid Divergence in the Face of Gene Flow.” Evolution Letters,
vol. 2, no. 4, Wiley, 2018, pp. 297–309, doi:10.1002/evl3.74.'
short: A.M. Westram, M. Rafajlović, P. Chaube, R. Faria, T. Larsson, M. Panova,
M. Ravinet, A. Blomberg, B. Mehlig, K. Johannesson, R. Butlin, Evolution Letters
2 (2018) 297–309.
date_created: 2021-08-16T07:45:38Z
date_published: 2018-08-20T00:00:00Z
date_updated: 2023-09-19T15:08:25Z
day: '20'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1002/evl3.74
external_id:
isi:
- '000446774400004'
pmid:
- '30283683'
file:
- access_level: open_access
checksum: 8524e72507d521416be3f8ccfcd5e3f5
content_type: application/pdf
creator: asandaue
date_created: 2021-08-16T07:48:03Z
date_updated: 2021-08-16T07:48:03Z
file_id: '9918'
file_name: 2018_EvolutionLetters_Westram.pdf
file_size: 764299
relation: main_file
success: 1
file_date_updated: 2021-08-16T07:48:03Z
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 297-309
pmid: 1
publication: Evolution Letters
publication_identifier:
eissn:
- 2056-3744
issn:
- 2056-3744
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '9930'
relation: research_data
status: public
status: public
title: 'Clines on the seashore: The genomic architecture underlying rapid divergence
in the face of gene flow'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2
year: '2018'
...
---
_id: '9915'
abstract:
- lang: eng
text: 'The evolution of assortative mating is a key part of the speciation process.
Stronger assortment, or greater divergence in mating traits, between species pairs
with overlapping ranges is commonly observed, but possible causes of this pattern
of reproductive character displacement are difficult to distinguish. We use a
multidisciplinary approach to provide a rare example where it is possible to distinguish
among hypotheses concerning the evolution of reproductive character displacement.
We build on an earlier comparative analysis that illustrated a strong pattern
of greater divergence in penis form between pairs of sister species with overlapping
ranges than between allopatric sister-species pairs, in a large clade of marine
gastropods (Littorinidae). We investigate both assortative mating and divergence
in male genitalia in one of the sister-species pairs, discriminating among three
contrasting processes each of which can generate a pattern of reproductive character
displacement: reinforcement, reproductive interference and the Templeton effect.
We demonstrate reproductive character displacement in assortative mating, but
not in genital form between this pair of sister species and use demographic models
to distinguish among the different processes. Our results support a model with
no gene flow since secondary contact and thus favor reproductive interference
as the cause of reproductive character displacement for mate choice, rather than
reinforcement. High gene flow within species argues against the Templeton effect.
Secondary contact appears to have had little impact on genital divergence.'
acknowledgement: The authors express a special thanks to Dr Richard Willan at the
Museum and Art Gallery of the Northern Territory for guidance and support in the
field, and to Carole Smadja for reading and commenting on the manuscript. The authors
thank the Government of Western Australia Department of Parks and Wildlife (license
no. 009254) and Fishery Research Division (exemption no. 2262) for assistance with
permits. Khalid Belkhir modified the coalescent sampler msnsam for the specific
needs of this project and Martin Hirsch helped to set up the ABC pipeline and to
modify the summary statistic calculator mscalc. The authors are grateful to the
Crafoord Foundation for supporting this project. R.K.B., A.M.W., and L.D. were supported
by grants from the Natural Environment Research Council, R.K.B. and A.M.W. were
also supported by the European Research Council and R.K.B. and L.D. by the Leverhulme
Trust. M.M.R. was supported by Consejo Nacional de Ciencia y Tecnología and Secretaría
de Educación Pública, Mexico. G.B. was supported by the Centre for Animal Movement
Research (CAnMove) financed by a Linnaeus grant (No. 349-2007-8690) from the Swedish
Research Council and Lund University.
article_processing_charge: Yes
article_type: letter_note
author:
- first_name: Johan
full_name: Hollander, Johan
last_name: Hollander
- first_name: Mauricio
full_name: Montaño-Rendón, Mauricio
last_name: Montaño-Rendón
- first_name: Giuseppe
full_name: Bianco, Giuseppe
last_name: Bianco
- first_name: Xi
full_name: Yang, Xi
last_name: Yang
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Ludovic
full_name: Duvaux, Ludovic
last_name: Duvaux
- first_name: David G.
full_name: Reid, David G.
last_name: Reid
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
citation:
ama: Hollander J, Montaño-Rendón M, Bianco G, et al. Are assortative mating and
genital divergence driven by reinforcement? Evolution Letters. 2018;2(6):557-566.
doi:10.1002/evl3.85
apa: Hollander, J., Montaño-Rendón, M., Bianco, G., Yang, X., Westram, A. M., Duvaux,
L., … Butlin, R. K. (2018). Are assortative mating and genital divergence driven
by reinforcement? Evolution Letters. Wiley. https://doi.org/10.1002/evl3.85
chicago: Hollander, Johan, Mauricio Montaño-Rendón, Giuseppe Bianco, Xi Yang, Anja
M Westram, Ludovic Duvaux, David G. Reid, and Roger K. Butlin. “Are Assortative
Mating and Genital Divergence Driven by Reinforcement?” Evolution Letters.
Wiley, 2018. https://doi.org/10.1002/evl3.85.
ieee: J. Hollander et al., “Are assortative mating and genital divergence
driven by reinforcement?,” Evolution Letters, vol. 2, no. 6. Wiley, pp.
557–566, 2018.
ista: Hollander J, Montaño-Rendón M, Bianco G, Yang X, Westram AM, Duvaux L, Reid
DG, Butlin RK. 2018. Are assortative mating and genital divergence driven by reinforcement?
Evolution Letters. 2(6), 557–566.
mla: Hollander, Johan, et al. “Are Assortative Mating and Genital Divergence Driven
by Reinforcement?” Evolution Letters, vol. 2, no. 6, Wiley, 2018, pp. 557–66,
doi:10.1002/evl3.85.
short: J. Hollander, M. Montaño-Rendón, G. Bianco, X. Yang, A.M. Westram, L. Duvaux,
D.G. Reid, R.K. Butlin, Evolution Letters 2 (2018) 557–566.
date_created: 2021-08-16T07:30:00Z
date_published: 2018-12-13T00:00:00Z
date_updated: 2023-09-19T15:08:53Z
day: '13'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1002/evl3.85
external_id:
isi:
- '000452990000002'
pmid:
- '30564439'
file:
- access_level: open_access
checksum: 997a78ac41c809975ca69cbdea441f88
content_type: application/pdf
creator: asandaue
date_created: 2021-08-16T07:37:28Z
date_updated: 2021-08-16T07:37:28Z
file_id: '9916'
file_name: 2018_EvolutionLetters_Hollander.pdf
file_size: 584606
relation: main_file
success: 1
file_date_updated: 2021-08-16T07:37:28Z
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
issue: '6'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 557-566
pmid: 1
publication: Evolution Letters
publication_identifier:
eissn:
- 2056-3744
issn:
- ' 2056-3744'
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '9929'
relation: research_data
status: public
status: public
title: Are assortative mating and genital divergence driven by reinforcement?
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2
year: '2018'
...
---
_id: '8618'
abstract:
- lang: eng
text: The reversibly switchable fluorescent proteins (RSFPs) commonly used for RESOLFT
nanoscopy have been developed from fluorescent proteins of the GFP superfamily.
These proteins are bright, but exhibit several drawbacks such as relatively large
size, oxygen-dependence, sensitivity to low pH, and limited switching speed. Therefore,
RSFPs from other origins with improved properties need to be explored. Here, we
report the development of two RSFPs based on the LOV domain of the photoreceptor
protein YtvA from Bacillus subtilis. LOV domains obtain their fluorescence by
association with the abundant cellular cofactor flavin mononucleotide (FMN). Under
illumination with blue and ultraviolet light, they undergo a photocycle, making
these proteins inherently photoswitchable. Our first improved variant, rsLOV1,
can be used for RESOLFT imaging, whereas rsLOV2 proved useful for STED nanoscopy
of living cells with a resolution of down to 50 nm. In addition to their smaller
size compared to GFP-related proteins (17 kDa instead of 27 kDa) and their usability
at low pH, rsLOV1 and rsLOV2 exhibit faster switching kinetics, switching on and
off 3 times faster than rsEGFP2, the fastest-switching RSFP reported to date.
Therefore, LOV-domain-based RSFPs have potential for applications where the switching
speed of GFP-based proteins is limiting.
article_number: '2724'
article_processing_charge: No
article_type: original
author:
- first_name: Carola
full_name: Gregor, Carola
last_name: Gregor
- first_name: Sven C.
full_name: Sidenstein, Sven C.
last_name: Sidenstein
- first_name: Martin
full_name: Andresen, Martin
last_name: Andresen
- first_name: Steffen J.
full_name: Sahl, Steffen J.
last_name: Sahl
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Stefan W.
full_name: Hell, Stefan W.
last_name: Hell
citation:
ama: Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. Novel reversibly
switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from
the bacterial photoreceptor YtvA. Scientific Reports. 2018;8. doi:10.1038/s41598-018-19947-1
apa: Gregor, C., Sidenstein, S. C., Andresen, M., Sahl, S. J., Danzl, J. G., &
Hell, S. W. (2018). Novel reversibly switchable fluorescent proteins for RESOLFT
and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific
Reports. Springer Nature. https://doi.org/10.1038/s41598-018-19947-1
chicago: Gregor, Carola, Sven C. Sidenstein, Martin Andresen, Steffen J. Sahl, Johann
G Danzl, and Stefan W. Hell. “Novel Reversibly Switchable Fluorescent Proteins
for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.”
Scientific Reports. Springer Nature, 2018. https://doi.org/10.1038/s41598-018-19947-1.
ieee: C. Gregor, S. C. Sidenstein, M. Andresen, S. J. Sahl, J. G. Danzl, and S.
W. Hell, “Novel reversibly switchable fluorescent proteins for RESOLFT and STED
nanoscopy engineered from the bacterial photoreceptor YtvA,” Scientific Reports,
vol. 8. Springer Nature, 2018.
ista: Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. 2018. Novel
reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered
from the bacterial photoreceptor YtvA. Scientific Reports. 8, 2724.
mla: Gregor, Carola, et al. “Novel Reversibly Switchable Fluorescent Proteins for
RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.”
Scientific Reports, vol. 8, 2724, Springer Nature, 2018, doi:10.1038/s41598-018-19947-1.
short: C. Gregor, S.C. Sidenstein, M. Andresen, S.J. Sahl, J.G. Danzl, S.W. Hell,
Scientific Reports 8 (2018).
date_created: 2020-10-06T16:33:37Z
date_published: 2018-02-09T00:00:00Z
date_updated: 2023-09-19T15:04:49Z
day: '09'
ddc:
- '570'
department:
- _id: JoDa
doi: 10.1038/s41598-018-19947-1
external_id:
isi:
- '000424630400037'
pmid:
- '29426833'
file:
- access_level: open_access
checksum: e642080fcbde9584c63544f587c74f03
content_type: application/pdf
creator: dernst
date_created: 2020-10-06T16:35:16Z
date_updated: 2020-10-06T16:35:16Z
file_id: '8619'
file_name: 2018_ScientificReports_Gregor.pdf
file_size: 2818077
relation: main_file
success: 1
file_date_updated: 2020-10-06T16:35:16Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
keyword:
- Multidisciplinary
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
pmid: 1
publication: Scientific Reports
publication_identifier:
issn:
- 2045-2322
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy
engineered from the bacterial photoreceptor YtvA
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 8
year: '2018'
...
---
_id: '10881'
abstract:
- lang: eng
text: Strigolactones (SLs) are a relatively recent addition to the list of plant
hormones that control different aspects of plant development. SL signalling is
perceived by an α/β hydrolase, DWARF 14 (D14). A close homolog of D14, KARRIKIN
INSENSTIVE2 (KAI2), is involved in perception of an uncharacterized molecule called
karrikin (KAR). Recent studies in Arabidopsis identified the SUPPRESSOR OF MAX2
1 (SMAX1) and SMAX1-LIKE 7 (SMXL7) to be potential SCF–MAX2 complex-mediated proteasome
targets of KAI2 and D14, respectively. Genetic studies on SMXL7 and SMAX1 demonstrated
distinct developmental roles for each, but very little is known about these repressors
in terms of their sequence features. In this study, we performed an extensive
comparative analysis of SMXLs and determined their phylogenetic and evolutionary
history in the plant lineage. Our results show that SMXL family members can be
sub-divided into four distinct phylogenetic clades/classes, with an ancient SMAX1.
Further, we identified the clade-specific motifs that have evolved and that might
act as determinants of SL-KAR signalling specificity. These specificities resulted
from functional diversities among the clades. Our results suggest that a gradual
co-evolution of SMXL members with their upstream receptors D14/KAI2 provided an
increased specificity to both the SL perception and response in land plants.
acknowledgement: "This project received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Actions
and it is co-financed by the South Moravian Region under grant agreement No. 665860
(SS). Access to computing and storage facilities owned by parties and projects contributing
to the national grid infrastructure, MetaCentrum, provided under the program ‘Projects
of Large Infrastructure for Research, Development, and Innovations’ (LM2010005)
was greatly appreciated (RSV). The project was funded by The Ministry of Education,
Youth and Sports/MES of the Czech Republic under the project CEITEC 2020 (LQ1601)
(TN, TRM). JF was supported by the European Research Council (project ERC-2011-StG
20101109-PSDP) and the Czech Science Foundation GAČR (GA13-40637S). We thank Dr
Kamel Chibani for active discussions on the evolutionary analysis and Nandan Mysore
Vardarajan for his critical comments on the manuscript. This article reflects\r\nonly
the authors’ views, and the EU is not responsible for any use that may be made of
the information it contains. "
article_processing_charge: No
article_type: original
author:
- first_name: Taraka Ramji
full_name: Moturu, Taraka Ramji
last_name: Moturu
- first_name: Sravankumar
full_name: Thula, Sravankumar
last_name: Thula
- first_name: Ravi Kumar
full_name: Singh, Ravi Kumar
last_name: Singh
- first_name: Tomasz
full_name: Nodzyński, Tomasz
last_name: Nodzyński
- first_name: Radka Svobodová
full_name: Vařeková, Radka Svobodová
last_name: Vařeková
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Sibu
full_name: Simon, Sibu
last_name: Simon
citation:
ama: Moturu TR, Thula S, Singh RK, et al. Molecular evolution and diversification
of the SMXL gene family. Journal of Experimental Botany. 2018;69(9):2367-2378.
doi:10.1093/jxb/ery097
apa: Moturu, T. R., Thula, S., Singh, R. K., Nodzyński, T., Vařeková, R. S., Friml,
J., & Simon, S. (2018). Molecular evolution and diversification of the SMXL
gene family. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/ery097
chicago: Moturu, Taraka Ramji, Sravankumar Thula, Ravi Kumar Singh, Tomasz Nodzyński,
Radka Svobodová Vařeková, Jiří Friml, and Sibu Simon. “Molecular Evolution and
Diversification of the SMXL Gene Family.” Journal of Experimental Botany.
Oxford University Press, 2018. https://doi.org/10.1093/jxb/ery097.
ieee: T. R. Moturu et al., “Molecular evolution and diversification of the
SMXL gene family,” Journal of Experimental Botany, vol. 69, no. 9. Oxford
University Press, pp. 2367–2378, 2018.
ista: Moturu TR, Thula S, Singh RK, Nodzyński T, Vařeková RS, Friml J, Simon S.
2018. Molecular evolution and diversification of the SMXL gene family. Journal
of Experimental Botany. 69(9), 2367–2378.
mla: Moturu, Taraka Ramji, et al. “Molecular Evolution and Diversification of the
SMXL Gene Family.” Journal of Experimental Botany, vol. 69, no. 9, Oxford
University Press, 2018, pp. 2367–78, doi:10.1093/jxb/ery097.
short: T.R. Moturu, S. Thula, R.K. Singh, T. Nodzyński, R.S. Vařeková, J. Friml,
S. Simon, Journal of Experimental Botany 69 (2018) 2367–2378.
date_created: 2022-03-18T12:43:22Z
date_published: 2018-04-13T00:00:00Z
date_updated: 2023-09-19T15:10:43Z
day: '13'
department:
- _id: JiFr
doi: 10.1093/jxb/ery097
ec_funded: 1
external_id:
isi:
- '000430727000016'
pmid:
- '29538714'
intvolume: ' 69'
isi: 1
issue: '9'
keyword:
- Plant Science
- Physiology
language:
- iso: eng
month: '04'
oa_version: None
page: 2367-2378
pmid: 1
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Journal of Experimental Botany
publication_identifier:
eissn:
- 1460-2431
issn:
- 0022-0957
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Molecular evolution and diversification of the SMXL gene family
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 69
year: '2018'
...
---
_id: '10880'
abstract:
- lang: eng
text: Acquisition of evolutionary novelties is a fundamental process for adapting
to the external environment and invading new niches and results in the diversification
of life, which we can see in the world today. How such novel phenotypic traits
are acquired in the course of evolution and are built up in developing embryos
has been a central question in biology. Whole-genome duplication (WGD) is a process
of genome doubling that supplies raw genetic materials and increases genome complexity.
Recently, it has been gradually revealed that WGD and subsequent fate changes
of duplicated genes can facilitate phenotypic evolution. Here, we review the current
understanding of the relationship between WGD and the acquisition of evolutionary
novelties. We show some examples of this link and discuss how WGD and subsequent
duplicated genes can facilitate phenotypic evolution as well as when such genomic
doubling can be advantageous for adaptation.
acknowledgement: This work was supported by JSPS overseas research fellowships (Y.M.)
and SENSHIN Medical Research Foundation (K.K.T.).
article_processing_charge: No
article_type: original
author:
- first_name: Moriyama
full_name: Yuuta, Moriyama
id: 4968E7C8-F248-11E8-B48F-1D18A9856A87
last_name: Yuuta
orcid: 0000-0002-2853-8051
- first_name: Kazuko
full_name: Koshiba-Takeuchi, Kazuko
last_name: Koshiba-Takeuchi
citation:
ama: Yuuta M, Koshiba-Takeuchi K. Significance of whole-genome duplications on the
emergence of evolutionary novelties. Briefings in Functional Genomics.
2018;17(5):329-338. doi:10.1093/bfgp/ely007
apa: Yuuta, M., & Koshiba-Takeuchi, K. (2018). Significance of whole-genome
duplications on the emergence of evolutionary novelties. Briefings in Functional
Genomics. Oxford University Press. https://doi.org/10.1093/bfgp/ely007
chicago: Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome
Duplications on the Emergence of Evolutionary Novelties.” Briefings in Functional
Genomics. Oxford University Press, 2018. https://doi.org/10.1093/bfgp/ely007.
ieee: M. Yuuta and K. Koshiba-Takeuchi, “Significance of whole-genome duplications
on the emergence of evolutionary novelties,” Briefings in Functional Genomics,
vol. 17, no. 5. Oxford University Press, pp. 329–338, 2018.
ista: Yuuta M, Koshiba-Takeuchi K. 2018. Significance of whole-genome duplications
on the emergence of evolutionary novelties. Briefings in Functional Genomics.
17(5), 329–338.
mla: Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome
Duplications on the Emergence of Evolutionary Novelties.” Briefings in Functional
Genomics, vol. 17, no. 5, Oxford University Press, 2018, pp. 329–38, doi:10.1093/bfgp/ely007.
short: M. Yuuta, K. Koshiba-Takeuchi, Briefings in Functional Genomics 17 (2018)
329–338.
date_created: 2022-03-18T12:40:35Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-19T15:11:22Z
day: '01'
department:
- _id: CaHe
doi: 10.1093/bfgp/ely007
external_id:
isi:
- '000456054400004'
pmid:
- '29579140'
intvolume: ' 17'
isi: 1
issue: '5'
keyword:
- Genetics
- Molecular Biology
- Biochemistry
- General Medicine
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1093/bfgp/ely007
month: '09'
oa: 1
oa_version: Published Version
page: 329-338
pmid: 1
publication: Briefings in Functional Genomics
publication_identifier:
eissn:
- 2041-2657
issn:
- 2041-2649
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Significance of whole-genome duplications on the emergence of evolutionary
novelties
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 17
year: '2018'
...
---
_id: '9930'
abstract:
- lang: eng
text: Adaptive divergence and speciation may happen despite opposition by gene flow.
Identifying the genomic basis underlying divergence with gene flow is a major
task in evolutionary genomics. Most approaches (e.g. outlier scans) focus on genomic
regions of high differentiation. However, not all genomic architectures potentially
underlying divergence are expected to show extreme differentiation. Here, we develop
an approach that combines hybrid zone analysis (i.e. focuses on spatial patterns
of allele frequency change) with system-specific simulations to identify loci
inconsistent with neutral evolution. We apply this to a genome-wide SNP set from
an ideally-suited study organism, the intertidal snail Littorina saxatilis, which
shows primary divergence between ecotypes associated with different shore habitats.
We detect many SNPs with clinal patterns, most of which are consistent with neutrality.
Among non-neutral SNPs, most are located within three large putative inversions
differentiating ecotypes. Many non-neutral SNPs show relatively low levels of
differentiation. We discuss potential reasons for this pattern, including loose
linkage to selected variants, polygenic adaptation and a component of balancing
selection within populations (which may be expected for inversions). Our work
is in line with theory predicting a role for inversions in divergence, and emphasises
that genomic regions contributing to divergence may not always be accessible with
methods purely based on allele frequency differences. These conclusions call for
approaches that take spatial patterns of allele frequency change into account
in other systems.
article_processing_charge: No
author:
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Marina
full_name: Rafajlović, Marina
last_name: Rafajlović
- first_name: Pragya
full_name: Chaube, Pragya
last_name: Chaube
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Tomas
full_name: Larsson, Tomas
last_name: Larsson
- first_name: Marina
full_name: Panova, Marina
last_name: Panova
- first_name: Mark
full_name: Ravinet, Mark
last_name: Ravinet
- first_name: Anders
full_name: Blomberg, Anders
last_name: Blomberg
- first_name: Bernhard
full_name: Mehlig, Bernhard
last_name: Mehlig
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Roger
full_name: Butlin, Roger
last_name: Butlin
citation:
ama: 'Westram AM, Rafajlović M, Chaube P, et al. Data from: Clines on the seashore:
the genomic architecture underlying rapid divergence in the face of gene flow.
2018. doi:10.5061/dryad.bp25b65'
apa: 'Westram, A. M., Rafajlović, M., Chaube, P., Faria, R., Larsson, T., Panova,
M., … Butlin, R. (2018). Data from: Clines on the seashore: the genomic architecture
underlying rapid divergence in the face of gene flow. Dryad. https://doi.org/10.5061/dryad.bp25b65'
chicago: 'Westram, Anja M, Marina Rafajlović, Pragya Chaube, Rui Faria, Tomas Larsson,
Marina Panova, Mark Ravinet, et al. “Data from: Clines on the Seashore: The Genomic
Architecture Underlying Rapid Divergence in the Face of Gene Flow.” Dryad, 2018.
https://doi.org/10.5061/dryad.bp25b65.'
ieee: 'A. M. Westram et al., “Data from: Clines on the seashore: the genomic
architecture underlying rapid divergence in the face of gene flow.” Dryad, 2018.'
ista: 'Westram AM, Rafajlović M, Chaube P, Faria R, Larsson T, Panova M, Ravinet
M, Blomberg A, Mehlig B, Johannesson K, Butlin R. 2018. Data from: Clines on the
seashore: the genomic architecture underlying rapid divergence in the face of
gene flow, Dryad, 10.5061/dryad.bp25b65.'
mla: 'Westram, Anja M., et al. Data from: Clines on the Seashore: The Genomic
Architecture Underlying Rapid Divergence in the Face of Gene Flow. Dryad,
2018, doi:10.5061/dryad.bp25b65.'
short: A.M. Westram, M. Rafajlović, P. Chaube, R. Faria, T. Larsson, M. Panova,
M. Ravinet, A. Blomberg, B. Mehlig, K. Johannesson, R. Butlin, (2018).
date_created: 2021-08-17T08:58:47Z
date_published: 2018-07-23T00:00:00Z
date_updated: 2023-09-19T15:08:24Z
day: '23'
department:
- _id: BeVi
doi: 10.5061/dryad.bp25b65
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.bp25b65
month: '07'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '9917'
relation: used_in_publication
status: public
status: public
title: 'Data from: Clines on the seashore: the genomic architecture underlying rapid
divergence in the face of gene flow'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2018'
...
---
_id: '9929'
abstract:
- lang: eng
text: 'The evolution of assortative mating is a key part of the speciation process.
Stronger assortment, or greater divergence in mating traits, between species pairs
with overlapping ranges is commonly observed, but possible causes of this pattern
of reproductive character displacement are difficult to distinguish. We use a
multidisciplinary approach to provide a rare example where it is possible to distinguish
among hypotheses concerning the evolution of reproductive character displacement.
We build on an earlier comparative analysis that illustrated a strong pattern
of greater divergence in penis form between pairs of sister species with overlapping
ranges than between allopatric sister-species pairs, in a large clade of marine
gastropods (Littorinidae). We investigate both assortative mating and divergence
in male genitalia in one of the sister-species pairs, discriminating among three
contrasting processes each of which can generate a pattern of reproductive character
displacement: reinforcement, reproductive interference and the Templeton effect.
We demonstrate reproductive character displacement in assortative mating, but
not in genital form between this pair of sister species and use demographic models
to distinguish among the different processes. Our results support a model with
no gene flow since secondary contact and thus favour reproductive interference
as the cause of reproductive character displacement for mate choice, rather than
reinforcement. High gene flow within species argues against the Templeton effect.
Secondary contact appears to have had little impact on genital divergence.'
article_processing_charge: No
author:
- first_name: Johan
full_name: Hollander, Johan
last_name: Hollander
- first_name: Mauricio
full_name: Montaño-Rendón, Mauricio
last_name: Montaño-Rendón
- first_name: Giuseppe
full_name: Bianco, Giuseppe
last_name: Bianco
- first_name: Xi
full_name: Yang, Xi
last_name: Yang
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Ludovic
full_name: Duvaux, Ludovic
last_name: Duvaux
- first_name: David G.
full_name: Reid, David G.
last_name: Reid
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
citation:
ama: 'Hollander J, Montaño-Rendón M, Bianco G, et al. Data from: Are assortative
mating and genital divergence driven by reinforcement? 2018. doi:10.5061/dryad.51sd2p5'
apa: 'Hollander, J., Montaño-Rendón, M., Bianco, G., Yang, X., Westram, A. M., Duvaux,
L., … Butlin, R. K. (2018). Data from: Are assortative mating and genital divergence
driven by reinforcement? Dryad. https://doi.org/10.5061/dryad.51sd2p5'
chicago: 'Hollander, Johan, Mauricio Montaño-Rendón, Giuseppe Bianco, Xi Yang, Anja
M Westram, Ludovic Duvaux, David G. Reid, and Roger K. Butlin. “Data from: Are
Assortative Mating and Genital Divergence Driven by Reinforcement?” Dryad, 2018.
https://doi.org/10.5061/dryad.51sd2p5.'
ieee: 'J. Hollander et al., “Data from: Are assortative mating and genital
divergence driven by reinforcement?” Dryad, 2018.'
ista: 'Hollander J, Montaño-Rendón M, Bianco G, Yang X, Westram AM, Duvaux L, Reid
DG, Butlin RK. 2018. Data from: Are assortative mating and genital divergence
driven by reinforcement?, Dryad, 10.5061/dryad.51sd2p5.'
mla: 'Hollander, Johan, et al. Data from: Are Assortative Mating and Genital
Divergence Driven by Reinforcement? Dryad, 2018, doi:10.5061/dryad.51sd2p5.'
short: J. Hollander, M. Montaño-Rendón, G. Bianco, X. Yang, A.M. Westram, L. Duvaux,
D.G. Reid, R.K. Butlin, (2018).
date_created: 2021-08-17T08:51:06Z
date_published: 2018-10-17T00:00:00Z
date_updated: 2023-09-19T15:08:53Z
day: '17'
department:
- _id: BeVi
doi: 10.5061/dryad.51sd2p5
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.51sd2p5
month: '10'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '9915'
relation: used_in_publication
status: public
status: public
title: 'Data from: Are assortative mating and genital divergence driven by reinforcement?'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2018'
...
---
_id: '10882'
abstract:
- lang: eng
text: 'We introduce Intelligent Annotation Dialogs for bounding box annotation.
We train an agent to automatically choose a sequence of actions for a human annotator
to produce a bounding box in a minimal amount of time. Specifically, we consider
two actions: box verification [34], where the annotator verifies a box generated
by an object detector, and manual box drawing. We explore two kinds of agents,
one based on predicting the probability that a box will be positively verified,
and the other based on reinforcement learning. We demonstrate that (1) our agents
are able to learn efficient annotation strategies in several scenarios, automatically
adapting to the image difficulty, the desired quality of the boxes, and the detector
strength; (2) in all scenarios the resulting annotation dialogs speed up annotation
compared to manual box drawing alone and box verification alone, while also outperforming
any fixed combination of verification and drawing in most scenarios; (3) in a
realistic scenario where the detector is iteratively re-trained, our agents evolve
a series of strategies that reflect the shifting trade-off between verification
and drawing as the detector grows stronger.'
article_processing_charge: No
author:
- first_name: Jasper
full_name: Uijlings, Jasper
last_name: Uijlings
- first_name: Ksenia
full_name: Konyushkova, Ksenia
last_name: Konyushkova
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Vittorio
full_name: Ferrari, Vittorio
last_name: Ferrari
citation:
ama: 'Uijlings J, Konyushkova K, Lampert C, Ferrari V. Learning intelligent dialogs
for bounding box annotation. In: 2018 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. IEEE; 2018:9175-9184. doi:10.1109/cvpr.2018.00956'
apa: 'Uijlings, J., Konyushkova, K., Lampert, C., & Ferrari, V. (2018). Learning
intelligent dialogs for bounding box annotation. In 2018 IEEE/CVF Conference
on Computer Vision and Pattern Recognition (pp. 9175–9184). Salt Lake City,
UT, United States: IEEE. https://doi.org/10.1109/cvpr.2018.00956'
chicago: Uijlings, Jasper, Ksenia Konyushkova, Christoph Lampert, and Vittorio Ferrari.
“Learning Intelligent Dialogs for Bounding Box Annotation.” In 2018 IEEE/CVF
Conference on Computer Vision and Pattern Recognition, 9175–84. IEEE, 2018.
https://doi.org/10.1109/cvpr.2018.00956.
ieee: J. Uijlings, K. Konyushkova, C. Lampert, and V. Ferrari, “Learning intelligent
dialogs for bounding box annotation,” in 2018 IEEE/CVF Conference on Computer
Vision and Pattern Recognition, Salt Lake City, UT, United States, 2018, pp.
9175–9184.
ista: 'Uijlings J, Konyushkova K, Lampert C, Ferrari V. 2018. Learning intelligent
dialogs for bounding box annotation. 2018 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. CVF: Conference on Computer Vision and Pattern Recognition,
9175–9184.'
mla: Uijlings, Jasper, et al. “Learning Intelligent Dialogs for Bounding Box Annotation.”
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE,
2018, pp. 9175–84, doi:10.1109/cvpr.2018.00956.
short: J. Uijlings, K. Konyushkova, C. Lampert, V. Ferrari, in:, 2018 IEEE/CVF Conference
on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–9184.
conference:
end_date: 2018-06-23
location: Salt Lake City, UT, United States
name: 'CVF: Conference on Computer Vision and Pattern Recognition'
start_date: 2018-06-18
date_created: 2022-03-18T12:45:09Z
date_published: 2018-12-17T00:00:00Z
date_updated: 2023-09-19T15:11:49Z
day: '17'
department:
- _id: ChLa
doi: 10.1109/cvpr.2018.00956
external_id:
arxiv:
- '1712.08087'
isi:
- '000457843609036'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1712.08087'
month: '12'
oa: 1
oa_version: Preprint
page: 9175-9184
publication: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition
publication_identifier:
eissn:
- 2575-7075
isbn:
- '9781538664209'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning intelligent dialogs for bounding box annotation
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '6558'
abstract:
- lang: eng
text: This paper studies the problem of distributed stochastic optimization in an
adversarial setting where, out of m machines which allegedly compute stochastic
gradients every iteration, an α-fraction are Byzantine, and may behave adversarially.
Our main result is a variant of stochastic gradient descent (SGD) which finds
ε-approximate minimizers of convex functions in T=O~(1/ε²m+α²/ε²) iterations.
In contrast, traditional mini-batch SGD needs T=O(1/ε²m) iterations, but cannot
tolerate Byzantine failures. Further, we provide a lower bound showing that, up
to logarithmic factors, our algorithm is information-theoretically optimal both
in terms of sample complexity and time complexity.
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Zeyuan
full_name: Allen-Zhu, Zeyuan
last_name: Allen-Zhu
- first_name: Jerry
full_name: Li, Jerry
last_name: Li
citation:
ama: 'Alistarh D-A, Allen-Zhu Z, Li J. Byzantine stochastic gradient descent. In:
Advances in Neural Information Processing Systems. Vol 2018. Neural Information
Processing Systems Foundation; 2018:4613-4623.'
apa: 'Alistarh, D.-A., Allen-Zhu, Z., & Li, J. (2018). Byzantine stochastic
gradient descent. In Advances in Neural Information Processing Systems
(Vol. 2018, pp. 4613–4623). Montreal, Canada: Neural Information Processing Systems
Foundation.'
chicago: Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic
Gradient Descent.” In Advances in Neural Information Processing Systems,
2018:4613–23. Neural Information Processing Systems Foundation, 2018.
ieee: D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine stochastic gradient descent,”
in Advances in Neural Information Processing Systems, Montreal, Canada,
2018, vol. 2018, pp. 4613–4623.
ista: 'Alistarh D-A, Allen-Zhu Z, Li J. 2018. Byzantine stochastic gradient descent.
Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural
Information Processing Systems vol. 2018, 4613–4623.'
mla: Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” Advances
in Neural Information Processing Systems, vol. 2018, Neural Information Processing
Systems Foundation, 2018, pp. 4613–23.
short: D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, Advances in Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2018, pp.
4613–4623.
conference:
end_date: 2018-12-08
location: Montreal, Canada
name: 'NeurIPS: Conference on Neural Information Processing Systems'
start_date: 2018-12-02
date_created: 2019-06-13T08:22:37Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-09-19T15:12:45Z
day: '01'
department:
- _id: DaAl
external_id:
arxiv:
- '1803.08917'
isi:
- '000461823304061'
intvolume: ' 2018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.08917
month: '12'
oa: 1
oa_version: Published Version
page: 4613-4623
publication: Advances in Neural Information Processing Systems
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Byzantine stochastic gradient descent
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2018
year: '2018'
...
---
_id: '6032'
abstract:
- lang: eng
text: The main result of this article is a generalization of the classical blossom
algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean
CSPs where each variable appears in exactly two constraints (we call it edge CSP)
and all constraints are even Δ-matroid relations (represented by lists of tuples).
As a consequence of this, we settle the complexity classification of planar Boolean
CSPs started by Dvorak and Kupec. Using a reduction to even Δ-matroids, we then
extend the tractability result to larger classes of Δ-matroids that we call efficiently
coverable. It properly includes classes that were known to be tractable before,
namely, co-independent, compact, local, linear, and binary, with the following
caveat:We represent Δ-matroids by lists of tuples, while the last two use a representation
by matrices. Since an n ×n matrix can represent exponentially many tuples, our
tractability result is not strictly stronger than the known algorithm for linear
and binary Δ-matroids.
article_number: '22'
article_processing_charge: No
article_type: original
author:
- first_name: Alexandr
full_name: Kazda, Alexandr
id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87
last_name: Kazda
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of
planar boolean CSPs. ACM Transactions on Algorithms. 2018;15(2). doi:10.1145/3230649
apa: Kazda, A., Kolmogorov, V., & Rolinek, M. (2018). Even delta-matroids and
the complexity of planar boolean CSPs. ACM Transactions on Algorithms.
ACM. https://doi.org/10.1145/3230649
chicago: Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids
and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms.
ACM, 2018. https://doi.org/10.1145/3230649.
ieee: A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity
of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2.
ACM, 2018.
ista: Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity
of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.
mla: Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean
CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649.
short: A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).
date_created: 2019-02-17T22:59:25Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-09-20T11:20:26Z
day: '01'
department:
- _id: VlKo
doi: 10.1145/3230649
ec_funded: 1
external_id:
arxiv:
- '1602.03124'
isi:
- '000468036500007'
intvolume: ' 15'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.03124
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: ACM Transactions on Algorithms
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '1192'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Even delta-matroids and the complexity of planar boolean CSPs
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 15
year: '2018'
...
---
_id: '200'
abstract:
- lang: eng
text: This thesis is concerned with the inference of current population structure
based on geo-referenced genetic data. The underlying idea is that population structure
affects its spatial genetic structure. Therefore, genotype information can be
utilized to estimate important demographic parameters such as migration rates.
These indirect estimates of population structure have become very attractive,
as genotype data is now widely available. However, there also has been much concern
about these approaches. Importantly, genetic structure can be influenced by many
complex patterns, which often cannot be disentangled. Moreover, many methods merely
fit heuristic patterns of genetic structure, and do not build upon population
genetics theory. Here, I describe two novel inference methods that address these
shortcomings. In Chapter 2, I introduce an inference scheme based on a new type
of signal, identity by descent (IBD) blocks. Recently, it has become feasible
to detect such long blocks of genome shared between pairs of samples. These blocks
are direct traces of recent coalescence events. As such, they contain ample signal
for inferring recent demography. I examine sharing of IBD blocks in two-dimensional
populations with local migration. Using a diffusion approximation, I derive formulas
for an isolation by distance pattern of long IBD blocks and show that sharing
of long IBD blocks approaches rapid exponential decay for growing sample distance.
I describe an inference scheme based on these results. It can robustly estimate
the dispersal rate and population density, which is demonstrated on simulated
data. I also show an application to estimate mean migration and the rate of recent
population growth within Eastern Europe. Chapter 3 is about a novel method to
estimate barriers to gene flow in a two dimensional population. This inference
scheme utilizes geographically localized allele frequency fluctuations - a classical
isolation by distance signal. The strength of these local fluctuations increases
on average next to a barrier, and there is less correlation across it. I again
use a framework of diffusion of ancestral lineages to model this effect, and provide
an efficient numerical implementation to fit the results to geo-referenced biallelic
SNP data. This inference scheme is able to robustly estimate strong barriers to
gene flow, as tests on simulated data confirm.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Harald
full_name: Ringbauer, Harald
id: 417FCFF4-F248-11E8-B48F-1D18A9856A87
last_name: Ringbauer
orcid: 0000-0002-4884-9682
citation:
ama: Ringbauer H. Inferring recent demography from spatial genetic structure. 2018.
doi:10.15479/AT:ISTA:th_963
apa: Ringbauer, H. (2018). Inferring recent demography from spatial genetic structure.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_963
chicago: Ringbauer, Harald. “Inferring Recent Demography from Spatial Genetic Structure.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_963.
ieee: H. Ringbauer, “Inferring recent demography from spatial genetic structure,”
Institute of Science and Technology Austria, 2018.
ista: Ringbauer H. 2018. Inferring recent demography from spatial genetic structure.
Institute of Science and Technology Austria.
mla: Ringbauer, Harald. Inferring Recent Demography from Spatial Genetic Structure.
Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_963.
short: H. Ringbauer, Inferring Recent Demography from Spatial Genetic Structure,
Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:45:10Z
date_published: 2018-02-21T00:00:00Z
date_updated: 2023-09-20T12:00:56Z
day: '21'
ddc:
- '576'
degree_awarded: PhD
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:th_963
file:
- access_level: open_access
checksum: 8cc534d2b528ae017acf80874cce48c9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:55Z
date_updated: 2020-07-14T12:45:23Z
file_id: '5111'
file_name: IST-2018-963-v1+1_thesis.pdf
file_size: 5792935
relation: main_file
- access_level: closed
checksum: 6af18d7e5a7e2728ceda2f41ee24f628
content_type: application/zip
creator: dernst
date_created: 2019-04-05T09:30:12Z
date_updated: 2020-07-14T12:45:23Z
file_id: '6224'
file_name: 2018_thesis_ringbauer_source.zip
file_size: 113365
relation: source_file
file_date_updated: 2020-07-14T12:45:23Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '146'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7713'
pubrep_id: '963'
related_material:
record:
- id: '563'
relation: part_of_dissertation
status: public
- id: '1074'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
title: Inferring recent demography from spatial genetic structure
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '1064'
abstract:
- lang: eng
text: 'In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by
P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it
is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot
be separated into two subfamilies by a straight line disjoint from the disks.
In this note we show that essentially the same idea may work for different analogues
and generalizations of their result. In particular, we prove the following: Given
a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety
coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate
of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane
disjoint from the homothets.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Alexey
full_name: Balitskiy, Alexey
last_name: Balitskiy
- first_name: Mikhail
full_name: Grigorev, Mikhail
last_name: Grigorev
citation:
ama: Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W.
Goodman and R.E. Goodman. Discrete & Computational Geometry. 2018;59(4):1001-1009.
doi:10.1007/s00454-017-9883-x
apa: Akopyan, A., Balitskiy, A., & Grigorev, M. (2018). On the circle covering
theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry.
Springer. https://doi.org/10.1007/s00454-017-9883-x
chicago: Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle
Covering Theorem by A.W. Goodman and R.E. Goodman.” Discrete & Computational
Geometry. Springer, 2018. https://doi.org/10.1007/s00454-017-9883-x.
ieee: A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem
by A.W. Goodman and R.E. Goodman,” Discrete & Computational Geometry,
vol. 59, no. 4. Springer, pp. 1001–1009, 2018.
ista: Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by
A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. 59(4), 1001–1009.
mla: Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and
R.E. Goodman.” Discrete & Computational Geometry, vol. 59, no. 4, Springer,
2018, pp. 1001–09, doi:10.1007/s00454-017-9883-x.
short: A. Akopyan, A. Balitskiy, M. Grigorev, Discrete & Computational Geometry
59 (2018) 1001–1009.
date_created: 2018-12-11T11:49:57Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-20T12:08:51Z
day: '01'
ddc:
- '516'
- '000'
department:
- _id: HeEd
doi: 10.1007/s00454-017-9883-x
ec_funded: 1
external_id:
isi:
- '000432205500011'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T09:27:36Z
date_updated: 2019-01-18T09:27:36Z
file_id: '5844'
file_name: 2018_DiscreteComp_Akopyan.pdf
file_size: 482518
relation: main_file
success: 1
file_date_updated: 2019-01-18T09:27:36Z
has_accepted_license: '1'
intvolume: ' 59'
isi: 1
issue: '4'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1001-1009
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- '14320444'
issn:
- '01795376'
publication_status: published
publisher: Springer
publist_id: '6324'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the circle covering theorem by A.W. Goodman and R.E. Goodman
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 59
year: '2018'
...
---
_id: '418'
abstract:
- lang: eng
text: "The aim of this thesis was the development of new strategies for optical
and optogenetic control of proliferative and pro-survival signaling, and characterizing
them from the molecular mechanism up to cellular effects. These new light-based
methods have unique features, such as red light as an activator, or the avoidance
of gene delivery, which enable to overcome current limitations, such as light
delivery to target tissues and feasibility as therapeutic approach. A special
focus was placed on implementing these new light-based approaches in pancreatic
β-cells, as β-cells are the key players in diabetes and especially their loss
in number negatively affects disease progression. Currently no treatment options
are available to compensate the lack of functional β-cells in diabetic patients.\r\nIn
a first approach, red-light-activated growth factor receptors, in particular receptor
tyrosine kinases were engineered and characterized. Receptor activation with light
allows spatio-temporal control compared to ligand-based activation, and especially
red light exhibits deeper tissue penetration than other wavelengths of the visible
spectrum. Red-light-activated receptor tyrosine kinases robustly activated major
growth factor related signaling pathways with a high temporal resolution. Moreover,
the remote activation of the proliferative MAPK/Erk pathway by red-light-activated
receptor tyrosine kinases in a pancreatic β-cell line was also achieved, through
one centimeter thick mouse tissue. Although red-light-activated receptor tyrosine
kinases are particularly attractive for applications in animal models due to the
deep tissue penetration of red light, a drawback, especially with regard to translation
into humans, is the requirement of gene therapy.\r\nIn a second approach an endogenous
light-sensitive mechanism was identified and its potential to promote proliferative
and pro-survival signals was explored, towards light-based tissue regeneration
without the need for gene transfer. Blue-green light illumination was found to
be sufficient for the activation of proliferation and survival promoting signaling
pathways in primary pancreatic murine and human islets. Blue-green light also
led to an increase in proliferation of primary islet cells, an effect which was
shown to be mostly β-cell specific in human islets. Moreover, it was demonstrated
that this approach of pancreatic β-cell expansion did not have any negative effect
on the β-cell function, in particular on their insulin secretion capacity. In
contrast, a trend for enhanced insulin secretion under high glucose conditions
after illumination was detected. In order to unravel the detailed characteristics
of this endogenous light-sensitive mechanism, the precise light requirements were
determined. In addition, the expression of light sensing proteins, OPN3 and rhodopsin,
was detected. The observed effects were found to be independent of handling effects
such as temperature differences and cytochrome c oxidase dependent ATP increase,
but they were found to be enhanced through the knockout of OPN3. The exact mechanism
of how islets cells sense light and the identity of the photoreceptor remains
unknown.\r\nSummarized two new light-based systems with unique features were established
that enable the activation of proliferative and pro-survival signaling pathways.
While red-light-activated receptor tyrosine kinases open a new avenue for optogenetics
research, by allowing non-invasive control of signaling in vivo, the identified
endogenous light-sensitive mechanism has the potential to be the basis of a gene
therapy-free therapeutical approach for light-based β-cell expansion."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Eva
full_name: Gschaider-Reichhart, Eva
id: 3FEE232A-F248-11E8-B48F-1D18A9856A87
last_name: Gschaider-Reichhart
orcid: 0000-0002-7218-7738
citation:
ama: Gschaider-Reichhart E. Optical and optogenetic control of proliferation and
survival . 2018. doi:10.15479/AT:ISTA:th_913
apa: Gschaider-Reichhart, E. (2018). Optical and optogenetic control of proliferation
and survival . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_913
chicago: Gschaider-Reichhart, Eva. “Optical and Optogenetic Control of Proliferation
and Survival .” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_913.
ieee: E. Gschaider-Reichhart, “Optical and optogenetic control of proliferation
and survival ,” Institute of Science and Technology Austria, 2018.
ista: Gschaider-Reichhart E. 2018. Optical and optogenetic control of proliferation
and survival . Institute of Science and Technology Austria.
mla: Gschaider-Reichhart, Eva. Optical and Optogenetic Control of Proliferation
and Survival . Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_913.
short: E. Gschaider-Reichhart, Optical and Optogenetic Control of Proliferation
and Survival , Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:46:22Z
date_published: 2018-01-08T00:00:00Z
date_updated: 2023-09-22T09:20:10Z
day: '08'
ddc:
- '571'
- '570'
degree_awarded: PhD
department:
- _id: HaJa
doi: 10.15479/AT:ISTA:th_913
file:
- access_level: closed
checksum: 697fa72ca36fb1b8ceabc133d58a73e5
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T09:28:03Z
date_updated: 2020-07-14T12:46:24Z
file_id: '6222'
file_name: 2018_THESIS_Gschaider-Reichhart_source.docx
file_size: 7012495
relation: source_file
- access_level: open_access
checksum: 58d7d1e9e58aeb7f061ab686b1d8a48c
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T09:28:03Z
date_updated: 2020-07-14T12:46:24Z
file_id: '6223'
file_name: 2018_THESIS_Gschaider-Reichhart.pdf
file_size: 6355280
relation: main_file
file_date_updated: 2020-07-14T12:46:24Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '107'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7405'
pubrep_id: '913'
related_material:
record:
- id: '1441'
relation: part_of_dissertation
status: public
- id: '1678'
relation: part_of_dissertation
status: public
- id: '2084'
relation: part_of_dissertation
status: public
- id: '1028'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
title: 'Optical and optogenetic control of proliferation and survival '
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '1012'
abstract:
- lang: eng
text: We prove a new central limit theorem (CLT) for the difference of linear eigenvalue
statistics of a Wigner random matrix H and its minor H and find that the fluctuation
is much smaller than the fluctuations of the individual linear statistics, as
a consequence of the strong correlation between the eigenvalues of H and H. In
particular, our theorem identifies the fluctuation of Kerov's rectangular Young
diagrams, defined by the interlacing eigenvalues ofH and H, around their asymptotic
shape, the Vershik'Kerov'Logan'Shepp curve. Young diagrams equipped with the Plancherel
measure follow the same limiting shape. For this, algebraically motivated, ensemble
a CLT has been obtained in Ivanov and Olshanski [20] which is structurally similar
to our result but the variance is different, indicating that the analogy between
the two models has its limitations. Moreover, our theorem shows that Borodin's
result [7] on the convergence of the spectral distribution of Wigner matrices
to a Gaussian free field also holds in derivative sense.
article_processing_charge: No
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Erdös L, Schröder DJ. Fluctuations of rectangular young diagrams of interlacing
wigner eigenvalues. International Mathematics Research Notices. 2018;2018(10):3255-3298.
doi:10.1093/imrn/rnw330
apa: Erdös, L., & Schröder, D. J. (2018). Fluctuations of rectangular young
diagrams of interlacing wigner eigenvalues. International Mathematics Research
Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnw330
chicago: Erdös, László, and Dominik J Schröder. “Fluctuations of Rectangular Young
Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research
Notices. Oxford University Press, 2018. https://doi.org/10.1093/imrn/rnw330.
ieee: L. Erdös and D. J. Schröder, “Fluctuations of rectangular young diagrams of
interlacing wigner eigenvalues,” International Mathematics Research Notices,
vol. 2018, no. 10. Oxford University Press, pp. 3255–3298, 2018.
ista: Erdös L, Schröder DJ. 2018. Fluctuations of rectangular young diagrams of
interlacing wigner eigenvalues. International Mathematics Research Notices. 2018(10),
3255–3298.
mla: Erdös, László, and Dominik J. Schröder. “Fluctuations of Rectangular Young
Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research
Notices, vol. 2018, no. 10, Oxford University Press, 2018, pp. 3255–98, doi:10.1093/imrn/rnw330.
short: L. Erdös, D.J. Schröder, International Mathematics Research Notices 2018
(2018) 3255–3298.
date_created: 2018-12-11T11:49:41Z
date_published: 2018-05-18T00:00:00Z
date_updated: 2023-09-22T09:44:21Z
day: '18'
department:
- _id: LaEr
doi: 10.1093/imrn/rnw330
ec_funded: 1
external_id:
arxiv:
- '1608.05163'
isi:
- '000441668300009'
intvolume: ' 2018'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1608.05163
month: '05'
oa: 1
oa_version: Preprint
page: 3255-3298
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: International Mathematics Research Notices
publication_identifier:
issn:
- '10737928'
publication_status: published
publisher: Oxford University Press
publist_id: '6383'
quality_controlled: '1'
related_material:
record:
- id: '6179'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2018
year: '2018'
...
---
_id: '6006'
abstract:
- lang: eng
text: 'Network games (NGs) are played on directed graphs and are extensively used
in network design and analysis. Search problems for NGs include finding special
strategy profiles such as a Nash equilibrium and a globally-optimal solution.
The networks modeled by NGs may be huge. In formal verification, abstraction has
proven to be an extremely effective technique for reasoning about systems with
big and even infinite state spaces. We describe an abstraction-refinement methodology
for reasoning about NGs. Our methodology is based on an abstraction function that
maps the state space of an NG to a much smaller state space. We search for a global
optimum and a Nash equilibrium by reasoning on an under- and an over-approximation
defined on top of this smaller state space. When the approximations are too coarse
to find such profiles, we refine the abstraction function. We extend the abstraction-refinement
methodology to labeled networks, where the objectives of the players are regular
languages. Our experimental results demonstrate the effectiveness of the methodology. '
article_number: '39'
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning
about network games. Games. 2018;9(3). doi:10.3390/g9030039
apa: Avni, G., Guha, S., & Kupferman, O. (2018). An abstraction-refinement methodology
for reasoning about network games. Games. MDPI AG. https://doi.org/10.3390/g9030039
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement
Methodology for Reasoning about Network Games.” Games. MDPI AG, 2018. https://doi.org/10.3390/g9030039.
ieee: G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology
for reasoning about network games,” Games, vol. 9, no. 3. MDPI AG, 2018.
ista: Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for
reasoning about network games. Games. 9(3), 39.
mla: Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about
Network Games.” Games, vol. 9, no. 3, 39, MDPI AG, 2018, doi:10.3390/g9030039.
short: G. Avni, S. Guha, O. Kupferman, Games 9 (2018).
date_created: 2019-02-14T14:17:54Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-22T09:48:59Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.3390/g9030039
file:
- access_level: open_access
checksum: 749d65ca4ce74256a029d9644a1b1cb0
content_type: application/pdf
creator: kschuh
date_created: 2019-02-14T14:20:31Z
date_updated: 2020-07-14T12:47:16Z
file_id: '6008'
file_name: 2018_MDPI_Avni.pdf
file_size: 505155
relation: main_file
file_date_updated: 2020-07-14T12:47:16Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Games
publication_identifier:
issn:
- 2073-4336
publication_status: published
publisher: MDPI AG
quality_controlled: '1'
related_material:
record:
- id: '1003'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: An abstraction-refinement methodology for reasoning about network games
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2018'
...
---
_id: '35'
abstract:
- lang: eng
text: 'We consider planning problems for graphs, Markov decision processes (MDPs),
and games on graphs. While graphs represent the most basic planning model, MDPs
represent interaction with nature and games on graphs represent interaction with
an adversarial environment. We consider two planning problems where there are
k different target sets, and the problems are as follows: (a) the coverage problem
asks whether there is a plan for each individual target set; and (b) the sequential
target reachability problem asks whether the targets can be reached in sequence.
For the coverage problem, we present a linear-time algorithm for graphs, and quadratic
conditional lower bound for MDPs and games on graphs. For the sequential target
problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm
for MDPs, and a quadratic conditional lower bound for games on graphs. Our results
with conditional lower bounds establish (i) model-separation results showing that
for the coverage problem MDPs and games on graphs are harder than graphs and for
the sequential reachability problem games on graphs are harder than MDPs and graphs;
and (ii) objective-separation results showing that for MDPs the coverage problem
is harder than the sequential target problem.'
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: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Algorithms and conditional
lower bounds for planning problems. In: 28th International Conference on Automated
Planning and Scheduling . AAAI Press; 2018.'
apa: 'Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2018). Algorithms
and conditional lower bounds for planning problems. In 28th International Conference
on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander
Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th
International Conference on Automated Planning and Scheduling . AAAI Press,
2018.
ieee: K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Algorithms and
conditional lower bounds for planning problems,” in 28th International Conference
on Automated Planning and Scheduling , Delft, Netherlands, 2018.
ista: 'Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2018. Algorithms and conditional
lower bounds for planning problems. 28th International Conference on Automated
Planning and Scheduling . ICAPS: International Conference on Automated Planning
and Scheduling.'
mla: Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for
Planning Problems.” 28th International Conference on Automated Planning and
Scheduling , AAAI Press, 2018.
short: K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, 28th International
Conference on Automated Planning and Scheduling , AAAI Press, 2018.
conference:
end_date: 2018-06-29
location: Delft, Netherlands
name: 'ICAPS: International Conference on Automated Planning and Scheduling'
start_date: 2018-06-24
date_created: 2018-12-11T11:44:17Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-26T10:41:41Z
day: '01'
department:
- _id: KrCh
ec_funded: 1
external_id:
arxiv:
- '1804.07031'
isi:
- '000492986200007'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.07031
month: '06'
oa: 1
oa_version: None
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'
publication: '28th International Conference on Automated Planning and Scheduling '
publication_status: published
publisher: AAAI Press
publist_id: '8020'
quality_controlled: '1'
related_material:
record:
- id: '9293'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Algorithms and conditional lower bounds for planning problems
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '738'
abstract:
- lang: eng
text: 'This paper is devoted to automatic competitive analysis of real-time scheduling
algorithms for firm-deadline tasksets, where only completed tasks con- tribute
some utility to the system. Given such a taskset T , the competitive ratio of
an on-line scheduling algorithm A for T is the worst-case utility ratio of A over
the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative
graph games to address the competitive analysis and competitive synthesis problems.
For the competitive analysis case, given any taskset T and any finite-memory on-
line scheduling algorithm A , we show that the competitive ratio of A in T can
be computed in polynomial time in the size of the state space of A . Our approach
is flexible as it also provides ways to model meaningful constraints on the released
task sequences that determine the competitive ratio. We provide an experimental
study of many well-known on-line scheduling algorithms, which demonstrates the
feasibility of our competitive analysis approach that effectively replaces human
ingenuity (required Preliminary versions of this paper have appeared in Chatterjee
et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu
Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid
s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria),
Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group,
Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time
Syst for finding worst-case scenarios) by computing power. For the competitive
synthesis case, we are just given a taskset T , and the goal is to automatically
synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees
the largest competitive ratio possible for T . We show how the competitive synthesis
problem can be reduced to a two-player graph game with partial information, and
establish that the compu- tational complexity of solving this game is Np -complete.
The competitive synthesis problem is hence in Np in the size of the state space
of the non-deterministic labeled transition system encoding the taskset. Overall,
the proposed framework assists in the selection of suitable scheduling algorithms
for a given taskset, which is in fact the most common situation in real-time systems
design. '
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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Alexander
full_name: Kößler, Alexander
last_name: Kößler
- first_name: Ulrich
full_name: Schmid, Ulrich
last_name: Schmid
citation:
ama: Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis
of real time scheduling with graph games. Real-Time Systems. 2018;54(1):166-207.
doi:10.1007/s11241-017-9293-4
apa: Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated
competitive analysis of real time scheduling with graph games. Real-Time Systems.
Springer. https://doi.org/10.1007/s11241-017-9293-4
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich
Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.”
Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4.
ieee: K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive
analysis of real time scheduling with graph games,” Real-Time Systems,
vol. 54, no. 1. Springer, pp. 166–207, 2018.
ista: Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive
analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.
mla: Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time
Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer,
2018, pp. 166–207, doi:10.1007/s11241-017-9293-4.
short: K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54
(2018) 166–207.
date_created: 2018-12-11T11:48:14Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2023-09-27T12:52:38Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/s11241-017-9293-4
ec_funded: 1
external_id:
isi:
- '000419955500006'
file:
- access_level: open_access
checksum: c2590ef160709d8054cf29ee173f1454
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:14Z
date_updated: 2020-07-14T12:47:56Z
file_id: '5267'
file_name: IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf
file_size: 1163507
relation: main_file
file_date_updated: 2020-07-14T12:47:56Z
has_accepted_license: '1'
intvolume: ' 54'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 166 - 207
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _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: Real-Time Systems
publication_status: published
publisher: Springer
publist_id: '6929'
pubrep_id: '960'
quality_controlled: '1'
related_material:
record:
- id: '2820'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Automated competitive analysis of real time scheduling with graph games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 54
year: '2018'
...
---
_id: '52'
abstract:
- lang: eng
text: In this thesis we will discuss systems of point interacting fermions, their
stability and other spectral properties. Whereas for bosons a point interacting
system is always unstable this ques- tion is more subtle for a gas of two species
of fermions. In particular the answer depends on the mass ratio between these
two species. Most of this work will be focused on the N + M model which consists
of two species of fermions with N, M particles respectively which interact via
point interactions. We will introduce this model using a formal limit and discuss
the N + 1 system in more detail. In particular, we will show that for mass ratios
above a critical one, which does not depend on the particle number, the N + 1
system is stable. In the context of this model we will prove rigorous versions
of Tan relations which relate various quantities of the point-interacting model.
By restricting the N + 1 system to a box we define a finite density model with
point in- teractions. In the context of this system we will discuss the energy
change when introducing a point-interacting impurity into a system of non-interacting
fermions. We will see that this change in energy is bounded independently of the
particle number and in particular the bound only depends on the density and the
scattering length. As another special case of the N + M model we will show stability
of the 2 + 2 model for mass ratios in an interval around one. Further we will
investigate a different model of point interactions which was discussed before
in the literature and which is, contrary to the N + M model, not given by a limiting
procedure but is based on a Dirichlet form. We will show that this system behaves
trivially in the thermodynamic limit, i.e. the free energy per particle is the
same as the one of the non-interacting system.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Thomas
full_name: Moser, Thomas
id: 2B5FC9A4-F248-11E8-B48F-1D18A9856A87
last_name: Moser
citation:
ama: Moser T. Point interactions in systems of fermions. 2018. doi:10.15479/AT:ISTA:th_1043
apa: Moser, T. (2018). Point interactions in systems of fermions. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1043
chicago: Moser, Thomas. “Point Interactions in Systems of Fermions.” Institute of
Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1043.
ieee: T. Moser, “Point interactions in systems of fermions,” Institute of Science
and Technology Austria, 2018.
ista: Moser T. 2018. Point interactions in systems of fermions. Institute of Science
and Technology Austria.
mla: Moser, Thomas. Point Interactions in Systems of Fermions. Institute
of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1043.
short: T. Moser, Point Interactions in Systems of Fermions, Institute of Science
and Technology Austria, 2018.
date_created: 2018-12-11T11:44:22Z
date_published: 2018-09-04T00:00:00Z
date_updated: 2023-09-27T12:34:14Z
day: '04'
ddc:
- '515'
- '530'
- '519'
degree_awarded: PhD
department:
- _id: RoSe
doi: 10.15479/AT:ISTA:th_1043
file:
- access_level: open_access
checksum: fbd8c747d148b468a21213b7cf175225
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:45:38Z
date_updated: 2020-07-14T12:46:37Z
file_id: '6256'
file_name: 2018_Thesis_Moser.pdf
file_size: 851164
relation: main_file
- access_level: closed
checksum: c28e16ecfc1126d3ce324ec96493c01e
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:45:38Z
date_updated: 2020-07-14T12:46:37Z
file_id: '6257'
file_name: 2018_Thesis_Moser_Source.zip
file_size: 1531516
relation: source_file
file_date_updated: 2020-07-14T12:46:37Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '115'
project:
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '8002'
pubrep_id: '1043'
related_material:
record:
- id: '5856'
relation: part_of_dissertation
status: public
- id: '154'
relation: part_of_dissertation
status: public
- id: '1198'
relation: part_of_dissertation
status: public
- id: '741'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
title: Point interactions in systems of fermions
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '913'
abstract:
- lang: eng
text: Coordinated cell polarization in developing tissues is a recurrent theme in
multicellular organisms. In plants, a directional distribution of the plant hormone
auxin is at the core of many developmental programs. A feedback regulation of
auxin on the polarized localization of PIN auxin transporters in individual cells
has been proposed as a self-organizing mechanism for coordinated tissue polarization,
but the molecular mechanisms linking auxin signalling to PIN-dependent auxin transport
remain unknown. We performed a microarray-based approach to find regulators of
the auxin-induced PIN relocation in the Arabidopsis thaliana root. We identified
a subset of a family of phosphatidylinositol transfer proteins (PITP), the PATELLINs
(PATL). Here, we show that PATLs are expressed in partially overlapping cells
types in different tissues going through mitosis or initiating differentiation
programs. PATLs are plasma membrane-associated proteins accumulated in Arabidopsis
embryos, primary roots, lateral root primordia, and developing stomata. Higher
order patl mutants display reduced PIN1 repolarization in response to auxin, shorter
root apical meristem, and drastic defects in embryo and seedling development.
This suggests PATLs redundantly play a crucial role in polarity and patterning
in Arabidopsis.
article_number: jcs.204198
article_processing_charge: No
author:
- first_name: Ricardo
full_name: Tejos, Ricardo
last_name: Tejos
- first_name: Cecilia
full_name: Rodríguez Furlán, Cecilia
last_name: Rodríguez Furlán
- first_name: Maciek
full_name: Adamowski, Maciek
id: 45F536D2-F248-11E8-B48F-1D18A9856A87
last_name: Adamowski
orcid: 0000-0001-6463-5257
- first_name: Michael
full_name: Sauer, Michael
last_name: Sauer
- first_name: Lorena
full_name: Norambuena, Lorena
last_name: Norambuena
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J. PATELLINS
are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis
thaliana. Journal of Cell Science. 2018;131(2). doi:10.1242/jcs.204198
apa: Tejos, R., Rodríguez Furlán, C., Adamowski, M., Sauer, M., Norambuena, L.,
& Friml, J. (2018). PATELLINS are regulators of auxin mediated PIN1 relocation
and plant development in Arabidopsis thaliana. Journal of Cell Science.
Company of Biologists. https://doi.org/10.1242/jcs.204198
chicago: Tejos, Ricardo, Cecilia Rodríguez Furlán, Maciek Adamowski, Michael Sauer,
Lorena Norambuena, and Jiří Friml. “PATELLINS Are Regulators of Auxin Mediated
PIN1 Relocation and Plant Development in Arabidopsis Thaliana.” Journal of
Cell Science. Company of Biologists, 2018. https://doi.org/10.1242/jcs.204198.
ieee: R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, and
J. Friml, “PATELLINS are regulators of auxin mediated PIN1 relocation and plant
development in Arabidopsis thaliana,” Journal of Cell Science, vol. 131,
no. 2. Company of Biologists, 2018.
ista: Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J.
2018. PATELLINS are regulators of auxin mediated PIN1 relocation and plant development
in Arabidopsis thaliana. Journal of Cell Science. 131(2), jcs. 204198.
mla: Tejos, Ricardo, et al. “PATELLINS Are Regulators of Auxin Mediated PIN1 Relocation
and Plant Development in Arabidopsis Thaliana.” Journal of Cell Science,
vol. 131, no. 2, jcs. 204198, Company of Biologists, 2018, doi:10.1242/jcs.204198.
short: R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, J.
Friml, Journal of Cell Science 131 (2018).
date_created: 2018-12-11T11:49:10Z
date_published: 2018-01-29T00:00:00Z
date_updated: 2023-09-26T15:47:50Z
day: '29'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.1242/jcs.204198
ec_funded: 1
external_id:
isi:
- '000424842400019'
file:
- access_level: open_access
checksum: bf156c20a4f117b4b932370d54cbac8c
content_type: application/pdf
creator: dernst
date_created: 2019-04-12T08:46:32Z
date_updated: 2020-07-14T12:48:15Z
file_id: '6299'
file_name: 2017_adamowski_PATELLINS_are.pdf
file_size: 14925985
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 131'
isi: 1
issue: '2'
language:
- iso: eng
month: '01'
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: Journal of Cell Science
publication_identifier:
issn:
- '00219533'
publication_status: published
publisher: Company of Biologists
publist_id: '6530'
pubrep_id: '988'
quality_controlled: '1'
scopus_import: '1'
status: public
title: PATELLINS are regulators of auxin mediated PIN1 relocation and plant development
in Arabidopsis thaliana
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 131
year: '2018'
...
---
_id: '69'
abstract:
- lang: eng
text: 'A qubit, a unit of quantum information, is essentially any quantum mechanical
two-level system which can be coherently controlled. Still, to be used for computation,
it has to fulfill criteria. Qubits, regardless of the system in which they are
realized, suffer from decoherence. This leads to loss of the information stored
in the qubit. The upper bound of the time scale on which decoherence happens is
set by the spin relaxation time. In this thesis I studied a two-level system consisting
of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire.
Such Ge hut wires have emerged as a promising material system for the realization
of spin qubits, due to the combination of two significant properties: long spin
coherence time as expected for group IV semiconductors due to the low hyperfine
interaction and a strong valence band spin-orbit coupling. Here, I present how
to fabricate quantum dot devices suitable for electrical transport measurements.
Coupled quantum dot devices allowed the realization of a charge sensor, which
is electrostatically and tunnel coupled to a quantum dot. By integrating the charge
sensor into a radio-frequency reflectometry setup, I performed for the first time
single-shot readout measurements of hole spins and extracted the hole spin relaxation
times in Ge hut wires.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lada
full_name: Vukušić, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukušić
orcid: 0000-0003-2424-8636
citation:
ama: Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires.
2018. doi:10.15479/AT:ISTA:TH_1047
apa: Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in
Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047
chicago: Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge
Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047.
ieee: L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,”
Institute of Science and Technology Austria, 2018.
ista: Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut
wires. Institute of Science and Technology Austria.
mla: Vukušić, Lada. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut
Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047.
short: L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires,
Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:44:28Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-26T15:50:22Z
day: '01'
ddc:
- '530'
- '600'
degree_awarded: PhD
department:
- _id: GeKa
- _id: GradSch
doi: 10.15479/AT:ISTA:TH_1047
file:
- access_level: open_access
checksum: c570b656e30749cd65b1c7e13a9ce0a8
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:00:40Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6247'
file_name: 2018_Thesis_Vukusic.pdf
file_size: 28452385
relation: main_file
- access_level: closed
checksum: 7856771d9cd401fe0b311191076db6e1
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:00:40Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6248'
file_name: 2018_Thesis_Vukusic_source.zip
file_size: 53058704
relation: source_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '103'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7985'
pubrep_id: '1047'
related_material:
record:
- id: '23'
relation: part_of_dissertation
status: public
- id: '840'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: Charge sensing and spin relaxation times of holes in Ge hut wires
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...