---
_id: '6680'
abstract:
- lang: eng
  text: This paper analyzes how partial selfing in a large source population influences
    its ability to colonize a new habitat via the introduction of a few founder individuals.
    Founders experience inbreeding depression due to partially recessive deleterious
    alleles as well as maladaptation to the new environment due to selection on a
    large number of additive loci. I first introduce a simplified version of the Inbreeding
    History Model (Kelly, 2007) in order to characterize mutation‐selection balance
    in a large, partially selfing source population under selection involving multiple
    non‐identical loci. I then use individual‐based simulations to study the eco‐evolutionary
    dynamics of founders establishing in the new habitat under a model of hard selection.
    The study explores how selfing rate shapes establishment probabilities of founders
    via effects on both inbreeding depression and adaptability to the new environment,
    and also distinguishes the effects of selfing on the initial fitness of founders
    from its effects on the long‐term adaptive response of the populations they found.
    A high rate of (but not complete) selfing is found to aid establishment over a
    wide range of parameters, even in the absence of mate limitation. The sensitivity
    of the results to assumptions about the nature of polygenic selection are discussed.
article_processing_charge: Yes (via OA deal)
author:
- first_name: Himani
  full_name: Sachdeva, Himani
  id: 42377A0A-F248-11E8-B48F-1D18A9856A87
  last_name: Sachdeva
citation:
  ama: Sachdeva H. Effect of partial selfing and polygenic selection on establishment
    in a new habitat. <i>Evolution</i>. 2019;73(9):1729-1745. doi:<a href="https://doi.org/10.1111/evo.13812">10.1111/evo.13812</a>
  apa: Sachdeva, H. (2019). Effect of partial selfing and polygenic selection on establishment
    in a new habitat. <i>Evolution</i>. Wiley. <a href="https://doi.org/10.1111/evo.13812">https://doi.org/10.1111/evo.13812</a>
  chicago: Sachdeva, Himani. “Effect of Partial Selfing and Polygenic Selection on
    Establishment in a New Habitat.” <i>Evolution</i>. Wiley, 2019. <a href="https://doi.org/10.1111/evo.13812">https://doi.org/10.1111/evo.13812</a>.
  ieee: H. Sachdeva, “Effect of partial selfing and polygenic selection on establishment
    in a new habitat,” <i>Evolution</i>, vol. 73, no. 9. Wiley, pp. 1729–1745, 2019.
  ista: Sachdeva H. 2019. Effect of partial selfing and polygenic selection on establishment
    in a new habitat. Evolution. 73(9), 1729–1745.
  mla: Sachdeva, Himani. “Effect of Partial Selfing and Polygenic Selection on Establishment
    in a New Habitat.” <i>Evolution</i>, vol. 73, no. 9, Wiley, 2019, pp. 1729–45,
    doi:<a href="https://doi.org/10.1111/evo.13812">10.1111/evo.13812</a>.
  short: H. Sachdeva, Evolution 73 (2019) 1729–1745.
corr_author: '1'
date_created: 2019-07-25T09:08:28Z
date_published: 2019-09-01T00:00:00Z
date_updated: 2024-10-09T20:58:56Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1111/evo.13812
external_id:
  isi:
  - '000481300600001'
file:
- access_level: open_access
  checksum: 772ce7035965153959b946a1033de1ca
  content_type: application/pdf
  creator: kschuh
  date_created: 2019-09-17T10:56:27Z
  date_updated: 2020-07-14T12:47:37Z
  file_id: '6881'
  file_name: 2019_Evolution_Sachdeva.pdf
  file_size: 937573
  relation: main_file
file_date_updated: 2020-07-14T12:47:37Z
fulldoi: https://doi.org/10.1111/evo.13812
has_accepted_license: '1'
intvolume: '        73'
isi: 1
issue: '9'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '09'
oa: 1
oa_version: Published Version
page: 1729-1745
publication: Evolution
publication_identifier:
  eissn:
  - 1558-5646
  issn:
  - 0014-3820
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
  record:
  - id: '9802'
    relation: research_data
    status: public
scopus_import: '1'
status: public
title: Effect of partial selfing and polygenic selection on establishment in a new
  habitat
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 73
year: '2019'
...
---
OA_place: publisher
_id: '6681'
abstract:
- lang: eng
  text: "The first part of the thesis considers the computational aspects of the homotopy
    groups πd(X) of a topological space X. It is well known that there is no algorithm
    to decide whether the fundamental group π1(X) of a given finite simplicial complex
    X is trivial. On the other hand, there are several algorithms that, given a finite
    simplicial complex X that is simply connected (i.e., with π1(X) trivial), compute
    the higher homotopy group πd(X) for any given d ≥ 2.\r\nHowever, these algorithms
    come with a caveat: They compute the isomorphism type of πd(X), d ≥ 2 as an abstract
    finitely generated abelian group given by generators and relations, but they work
    with very implicit representations of the elements of πd(X). We present an algorithm
    that, given a simply connected space X, computes πd(X) and represents its elements
    as simplicial maps from suitable triangulations of the d-sphere Sd to X. For fixed
    d, the algorithm runs in time exponential in size(X), the number of simplices
    of X. Moreover, we prove that this is optimal: For every fixed d ≥ 2,\r\nwe construct
    a family of simply connected spaces X such that for any simplicial map representing
    a generator of πd(X), the size of the triangulation of S d on which the map is
    defined, is exponential in size(X).\r\nIn the second part of the thesis, we prove
    that the following question is algorithmically undecidable for d < ⌊3(k+1)/2⌋,
    k ≥ 5 and (k, d) ̸= (5, 7), which covers essentially everything outside the meta-stable
    range: Given a finite simplicial complex K of dimension k, decide whether there
    exists a piecewise-linear (i.e., linear on an arbitrarily fine subdivision of
    K) embedding f : K ↪→ Rd of K into a d-dimensional Euclidean space."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Stephan Y
  full_name: Zhechev, Stephan Y
  id: 3AA52972-F248-11E8-B48F-1D18A9856A87
  last_name: Zhechev
citation:
  ama: Zhechev SY. Algorithmic aspects of homotopy theory and embeddability. 2019.
    doi:<a href="https://doi.org/10.15479/AT:ISTA:6681">10.15479/AT:ISTA:6681</a>
  apa: Zhechev, S. Y. (2019). <i>Algorithmic aspects of homotopy theory and embeddability</i>.
    Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:6681">https://doi.org/10.15479/AT:ISTA:6681</a>
  chicago: Zhechev, Stephan Y. “Algorithmic Aspects of Homotopy Theory and Embeddability.”
    Institute of Science and Technology Austria, 2019. <a href="https://doi.org/10.15479/AT:ISTA:6681">https://doi.org/10.15479/AT:ISTA:6681</a>.
  ieee: S. Y. Zhechev, “Algorithmic aspects of homotopy theory and embeddability,”
    Institute of Science and Technology Austria, 2019.
  ista: Zhechev SY. 2019. Algorithmic aspects of homotopy theory and embeddability.
    Institute of Science and Technology Austria.
  mla: Zhechev, Stephan Y. <i>Algorithmic Aspects of Homotopy Theory and Embeddability</i>.
    Institute of Science and Technology Austria, 2019, doi:<a href="https://doi.org/10.15479/AT:ISTA:6681">10.15479/AT:ISTA:6681</a>.
  short: S.Y. Zhechev, Algorithmic Aspects of Homotopy Theory and Embeddability, Institute
    of Science and Technology Austria, 2019.
corr_author: '1'
date_created: 2019-07-26T11:14:34Z
date_published: 2019-08-08T00:00:00Z
date_updated: 2026-04-16T12:20:40Z
day: '08'
ddc:
- '514'
degree_awarded: PhD
department:
- _id: UlWa
doi: 10.15479/AT:ISTA:6681
file:
- access_level: open_access
  checksum: 3231e7cbfca3b5687366f84f0a57a0c0
  content_type: application/pdf
  creator: szhechev
  date_created: 2019-08-07T13:02:50Z
  date_updated: 2020-07-14T12:47:37Z
  file_id: '6771'
  file_name: Stephan_Zhechev_thesis.pdf
  file_size: 1464227
  relation: main_file
- access_level: closed
  checksum: 85d65eb27b4377a9e332ee37a70f08b6
  content_type: application/octet-stream
  creator: szhechev
  date_created: 2019-08-07T13:03:22Z
  date_updated: 2020-07-14T12:47:37Z
  file_id: '6772'
  file_name: Stephan_Zhechev_thesis.tex
  file_size: 303988
  relation: source_file
- access_level: closed
  checksum: 86b374d264ca2dd53e712728e253ee75
  content_type: application/zip
  creator: szhechev
  date_created: 2019-08-07T13:03:34Z
  date_updated: 2020-07-14T12:47:37Z
  file_id: '6773'
  file_name: supplementary_material.zip
  file_size: 1087004
  relation: supplementary_material
file_date_updated: 2020-07-14T12:47:37Z
fulldoi: https://doi.org/10.15479/AT:ISTA:6681
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '104'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '6774'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Uli
  full_name: Wagner, Uli
  id: 36690CA2-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
  orcid: 0000-0002-1494-0568
title: Algorithmic aspects of homotopy theory and embeddability
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2019'
...
---
_id: '6710'
abstract:
- lang: eng
  text: Sexual dimorphism in morphology, physiology or life history traits is common
    in dioecious plants at reproductive maturity, but it is typically inconspicuous
    or absent in juveniles. Although plants of different sexes probably begin to diverge
    in gene expression both before their reproduction commences and before dimorphism
    becomes readily apparent, to our knowledge transcriptome-wide differential gene
    expression has yet to be demonstrated for any angiosperm species.
article_processing_charge: No
article_type: original
author:
- first_name: Guillaume
  full_name: Cossard, Guillaume
  last_name: Cossard
- first_name: Melissa A
  full_name: Toups, Melissa A
  id: 4E099E4E-F248-11E8-B48F-1D18A9856A87
  last_name: Toups
  orcid: 0000-0002-9752-7380
- first_name: 'John '
  full_name: 'Pannell, John '
  last_name: Pannell
citation:
  ama: Cossard G, Toups MA, Pannell J. Sexual dimorphism and rapid turnover in gene
    expression in pre-reproductive seedlings of a dioecious herb. <i>Annals of botany</i>.
    2019;123(7):1119-1131. doi:<a href="https://doi.org/10.1093/aob/mcy183">10.1093/aob/mcy183</a>
  apa: Cossard, G., Toups, M. A., &#38; Pannell, J. (2019). Sexual dimorphism and
    rapid turnover in gene expression in pre-reproductive seedlings of a dioecious
    herb. <i>Annals of Botany</i>. Oxford University Press. <a href="https://doi.org/10.1093/aob/mcy183">https://doi.org/10.1093/aob/mcy183</a>
  chicago: Cossard, Guillaume, Melissa A Toups, and John  Pannell. “Sexual Dimorphism
    and Rapid Turnover in Gene Expression in Pre-Reproductive Seedlings of a Dioecious
    Herb.” <i>Annals of Botany</i>. Oxford University Press, 2019. <a href="https://doi.org/10.1093/aob/mcy183">https://doi.org/10.1093/aob/mcy183</a>.
  ieee: G. Cossard, M. A. Toups, and J. Pannell, “Sexual dimorphism and rapid turnover
    in gene expression in pre-reproductive seedlings of a dioecious herb,” <i>Annals
    of botany</i>, vol. 123, no. 7. Oxford University Press, pp. 1119–1131, 2019.
  ista: Cossard G, Toups MA, Pannell J. 2019. Sexual dimorphism and rapid turnover
    in gene expression in pre-reproductive seedlings of a dioecious herb. Annals of
    botany. 123(7), 1119–1131.
  mla: Cossard, Guillaume, et al. “Sexual Dimorphism and Rapid Turnover in Gene Expression
    in Pre-Reproductive Seedlings of a Dioecious Herb.” <i>Annals of Botany</i>, vol.
    123, no. 7, Oxford University Press, 2019, pp. 1119–31, doi:<a href="https://doi.org/10.1093/aob/mcy183">10.1093/aob/mcy183</a>.
  short: G. Cossard, M.A. Toups, J. Pannell, Annals of Botany 123 (2019) 1119–1131.
date_created: 2019-07-28T21:59:15Z
date_published: 2019-06-04T00:00:00Z
date_updated: 2026-06-18T19:11:56Z
day: '04'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1093/aob/mcy183
external_id:
  isi:
  - '000493043500004'
  pmid:
  - '30289430'
fulldoi: https://doi.org/10.1093/aob/mcy183
intvolume: '       123'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1093/aob/mcy183
month: '06'
oa: 1
oa_version: Published Version
page: 1119-1131
pmid: 1
publication: Annals of botany
publication_identifier:
  eissn:
  - 1095-8290
  issn:
  - 0305-7364
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sexual dimorphism and rapid turnover in gene expression in pre-reproductive
  seedlings of a dioecious herb
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 123
year: '2019'
...
---
_id: '6717'
abstract:
- lang: eng
  text: With the recent publication by Silpe and Bassler (2019), considering phage
    detection of a bacterial quorum-sensing (QS) autoinducer, we now have as many
    as five examples of phage-associated intercellular communication (Table 1). Each
    potentially involves ecological inferences by phages as to concentrations of surrounding
    phage-infected or uninfected bacteria. While the utility of phage detection of
    bacterial QS molecules may at first glance appear to be straightforward, we suggest
    in this commentary that the underlying ecological explanation is unlikely to be
    simple.
article_number: '1171'
article_processing_charge: Yes (via OA deal)
author:
- first_name: Claudia
  full_name: Igler, Claudia
  id: 46613666-F248-11E8-B48F-1D18A9856A87
  last_name: Igler
- first_name: Stephen T.
  full_name: Abedon, Stephen T.
  last_name: Abedon
citation:
  ama: 'Igler C, Abedon ST. Commentary: A host-produced quorum-sensing autoinducer
    controls a phage lysis-lysogeny decision. <i>Frontiers in Microbiology</i>. 2019;10.
    doi:<a href="https://doi.org/10.3389/fmicb.2019.01171">10.3389/fmicb.2019.01171</a>'
  apa: 'Igler, C., &#38; Abedon, S. T. (2019). Commentary: A host-produced quorum-sensing
    autoinducer controls a phage lysis-lysogeny decision. <i>Frontiers in Microbiology</i>.
    Frontiers. <a href="https://doi.org/10.3389/fmicb.2019.01171">https://doi.org/10.3389/fmicb.2019.01171</a>'
  chicago: 'Igler, Claudia, and Stephen T. Abedon. “Commentary: A Host-Produced Quorum-Sensing
    Autoinducer Controls a Phage Lysis-Lysogeny Decision.” <i>Frontiers in Microbiology</i>.
    Frontiers, 2019. <a href="https://doi.org/10.3389/fmicb.2019.01171">https://doi.org/10.3389/fmicb.2019.01171</a>.'
  ieee: 'C. Igler and S. T. Abedon, “Commentary: A host-produced quorum-sensing autoinducer
    controls a phage lysis-lysogeny decision,” <i>Frontiers in Microbiology</i>, vol.
    10. Frontiers, 2019.'
  ista: 'Igler C, Abedon ST. 2019. Commentary: A host-produced quorum-sensing autoinducer
    controls a phage lysis-lysogeny decision. Frontiers in Microbiology. 10, 1171.'
  mla: 'Igler, Claudia, and Stephen T. Abedon. “Commentary: A Host-Produced Quorum-Sensing
    Autoinducer Controls a Phage Lysis-Lysogeny Decision.” <i>Frontiers in Microbiology</i>,
    vol. 10, 1171, Frontiers, 2019, doi:<a href="https://doi.org/10.3389/fmicb.2019.01171">10.3389/fmicb.2019.01171</a>.'
  short: C. Igler, S.T. Abedon, Frontiers in Microbiology 10 (2019).
date_created: 2019-07-28T21:59:18Z
date_published: 2019-06-03T00:00:00Z
date_updated: 2025-04-14T13:38:17Z
day: '03'
ddc:
- '570'
department:
- _id: CaGu
doi: 10.3389/fmicb.2019.01171
external_id:
  isi:
  - '000470131200001'
file:
- access_level: open_access
  checksum: 317a06067e9a8e717bb55f23e0d77ba7
  content_type: application/pdf
  creator: apreinsp
  date_created: 2019-07-29T07:51:54Z
  date_updated: 2020-07-14T12:47:38Z
  file_id: '6722'
  file_name: 2019_Frontiers_Igler.pdf
  file_size: 246151
  relation: main_file
file_date_updated: 2020-07-14T12:47:38Z
fulldoi: https://doi.org/10.3389/fmicb.2019.01171
has_accepted_license: '1'
intvolume: '        10'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 251EE76E-B435-11E9-9278-68D0E5697425
  grant_number: '24573'
  name: Design principles underlying genetic switch architecture
publication: Frontiers in Microbiology
publication_status: published
publisher: Frontiers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Commentary: A host-produced quorum-sensing autoinducer controls a phage lysis-lysogeny
  decision'
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 10
year: '2019'
...
---
_id: '6725'
abstract:
- lang: eng
  text: "A Valued Constraint Satisfaction Problem (VCSP) provides a common framework
    that can express a wide range of discrete optimization problems. A VCSP instance
    is given by a finite set of variables, a finite domain of labels, and an objective
    function to be minimized. This function is represented as a sum of terms where
    each term depends on a subset of the variables. To obtain different classes of
    optimization problems, one can restrict all terms to come from a fixed set Γ of
    cost functions, called a language. \r\nRecent breakthrough results have established
    a complete complexity classification of such classes with respect to language
    Γ: if all cost functions in Γ satisfy a certain algebraic condition then all Γ-instances
    can be solved in polynomial time, otherwise the problem is NP-hard. Unfortunately,
    testing this condition for a given language Γ is known to be NP-hard. We thus
    study exponential algorithms for this meta-problem. We show that the tractability
    condition of a finite-valued language Γ can be tested in O(3‾√3|D|⋅poly(size(Γ)))
    time, where D is the domain of Γ and poly(⋅) is some fixed polynomial. We also
    obtain a matching lower bound under the Strong Exponential Time Hypothesis (SETH).
    More precisely, we prove that for any constant δ<1 there is no O(3‾√3δ|D|) algorithm,
    assuming that SETH holds."
alternative_title:
- LIPIcs
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
  full_name: Kolmogorov, Vladimir
  id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
  last_name: Kolmogorov
citation:
  ama: 'Kolmogorov V. Testing the complexity of a valued CSP language. In: <i>46th
    International Colloquium on Automata, Languages and Programming</i>. Vol 132.
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:<a href="https://doi.org/10.4230/LIPICS.ICALP.2019.77">10.4230/LIPICS.ICALP.2019.77</a>'
  apa: 'Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In
    <i>46th International Colloquium on Automata, Languages and Programming</i> (Vol.
    132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    <a href="https://doi.org/10.4230/LIPICS.ICALP.2019.77">https://doi.org/10.4230/LIPICS.ICALP.2019.77</a>'
  chicago: Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.”
    In <i>46th International Colloquium on Automata, Languages and Programming</i>,
    132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href="https://doi.org/10.4230/LIPICS.ICALP.2019.77">https://doi.org/10.4230/LIPICS.ICALP.2019.77</a>.
  ieee: V. Kolmogorov, “Testing the complexity of a valued CSP language,” in <i>46th
    International Colloquium on Automata, Languages and Programming</i>, Patras, Greece,
    2019, vol. 132, p. 77:1-77:12.
  ista: 'Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th
    International Colloquium on Automata, Languages and Programming. ICALP: Automata,
    Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.'
  mla: Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” <i>46th
    International Colloquium on Automata, Languages and Programming</i>, vol. 132,
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:<a
    href="https://doi.org/10.4230/LIPICS.ICALP.2019.77">10.4230/LIPICS.ICALP.2019.77</a>.
  short: V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages
    and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.
conference:
  end_date: 2019-07-12
  location: Patras, Greece
  name: 'ICALP: Automata, Languages and Programming'
  start_date: 2019-07-08
date_created: 2019-07-29T12:23:29Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2025-07-10T11:53:47Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.4230/LIPICS.ICALP.2019.77
ec_funded: 1
external_id:
  arxiv:
  - '1803.02289'
file:
- access_level: open_access
  checksum: f5ebee8eec6ae09e30365578ee63a492
  content_type: application/pdf
  creator: dernst
  date_created: 2019-07-31T07:01:45Z
  date_updated: 2020-07-14T12:47:38Z
  file_id: '6738'
  file_name: 2019_LIPICS_Kolmogorov.pdf
  file_size: 575475
  relation: main_file
file_date_updated: 2020-07-14T12:47:38Z
fulldoi: https://doi.org/10.4230/LIPICS.ICALP.2019.77
has_accepted_license: '1'
intvolume: '       132'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 77:1-77:12
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '616160'
  name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: 46th International Colloquium on Automata, Languages and Programming
publication_identifier:
  isbn:
  - 978-3-95977-109-2
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Testing the complexity of a valued CSP language
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 132
year: '2019'
...
---
_id: '6726'
abstract:
- lang: eng
  text: Randomness is an essential part of any secure cryptosystem, but many constructions
    rely on distributions that are not uniform. This is particularly true for lattice
    based cryptosystems, which more often than not make use of discrete Gaussian distributions
    over the integers. For practical purposes it is crucial to evaluate the impact
    that approximation errors have on the security of a scheme to provide the best
    possible trade-off between security and performance. Recent years have seen surprising
    results allowing to use relatively low precision while maintaining high levels
    of security. A key insight in these results is that sampling a distribution with
    low relative error can provide very strong security guarantees. Since floating
    point numbers provide guarantees on the relative approximation error, they seem
    a suitable tool in this setting, but it is not obvious which sampling algorithms
    can actually profit from them. While previous works have shown that inversion
    sampling can be adapted to provide a low relative error (Pöppelmann et al., CHES
    2014; Prest, ASIACRYPT 2017), other works have called into question if this is
    possible for other sampling techniques (Zheng et al., Eprint report 2018/309).
    In this work, we consider all sampling algorithms that are popular in the cryptographic
    setting and analyze the relationship of floating point precision and the resulting
    relative error. We show that all of the algorithms either natively achieve a low
    relative error or can be adapted to do so.
article_processing_charge: No
author:
- first_name: Michael
  full_name: Walter, Michael
  id: 488F98B0-F248-11E8-B48F-1D18A9856A87
  last_name: Walter
  orcid: 0000-0003-3186-2482
citation:
  ama: 'Walter M. Sampling the integers with low relative error. In: Buchmann J, Nitaj
    A, Rachidi T, eds. <i>Progress in Cryptology – AFRICACRYPT 2019</i>. Vol 11627.
    LNCS. Cham: Springer Nature; 2019:157-180. doi:<a href="https://doi.org/10.1007/978-3-030-23696-0_9">10.1007/978-3-030-23696-0_9</a>'
  apa: 'Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann,
    A. Nitaj, &#38; T. Rachidi (Eds.), <i>Progress in Cryptology – AFRICACRYPT 2019</i>
    (Vol. 11627, pp. 157–180). Cham: Springer Nature. <a href="https://doi.org/10.1007/978-3-030-23696-0_9">https://doi.org/10.1007/978-3-030-23696-0_9</a>'
  chicago: 'Walter, Michael. “Sampling the Integers with Low Relative Error.” In <i>Progress
    in Cryptology – AFRICACRYPT 2019</i>, edited by J Buchmann, A Nitaj, and T Rachidi,
    11627:157–80. LNCS. Cham: Springer Nature, 2019. <a href="https://doi.org/10.1007/978-3-030-23696-0_9">https://doi.org/10.1007/978-3-030-23696-0_9</a>.'
  ieee: 'M. Walter, “Sampling the integers with low relative error,” in <i>Progress
    in Cryptology – AFRICACRYPT 2019</i>, vol. 11627, J. Buchmann, A. Nitaj, and T.
    Rachidi, Eds. Cham: Springer Nature, 2019, pp. 157–180.'
  ista: 'Walter M. 2019.Sampling the integers with low relative error. In: Progress
    in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.'
  mla: Walter, Michael. “Sampling the Integers with Low Relative Error.” <i>Progress
    in Cryptology – AFRICACRYPT 2019</i>, edited by J Buchmann et al., vol. 11627,
    Springer Nature, 2019, pp. 157–80, doi:<a href="https://doi.org/10.1007/978-3-030-23696-0_9">10.1007/978-3-030-23696-0_9</a>.
  short: M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology
    – AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180.
conference:
  end_date: 2019-07-11
  location: Rabat, Morocco
  name: 'AFRICACRYPT: International Conference on Cryptology in Africa'
  start_date: 2019-07-09
date_created: 2019-07-29T12:25:31Z
date_published: 2019-06-29T00:00:00Z
date_updated: 2025-09-10T10:38:28Z
day: '29'
department:
- _id: KrPi
doi: 10.1007/978-3-030-23696-0_9
ec_funded: 1
editor:
- first_name: J
  full_name: Buchmann, J
  last_name: Buchmann
- first_name: A
  full_name: Nitaj, A
  last_name: Nitaj
- first_name: T
  full_name: Rachidi, T
  last_name: Rachidi
external_id:
  isi:
  - '001299240700009'
fulldoi: https://doi.org/10.1007/978-3-030-23696-0_9
intvolume: '     11627'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2019/068
month: '06'
oa: 1
oa_version: Preprint
page: 157-180
place: Cham
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '682815'
  name: Teaching Old Crypto New Tricks
publication: Progress in Cryptology – AFRICACRYPT 2019
publication_identifier:
  eisbn:
  - 978-3-0302-3696-0
  eissn:
  - 1611-3349
  isbn:
  - 978-3-0302-3695-3
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Sampling the integers with low relative error
type: book_chapter
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 11627
year: '2019'
...
---
_id: '6747'
abstract:
- lang: eng
  text: "We establish connections between the problem of learning a two-layer neural
    network and tensor decomposition. We consider a model with feature vectors x∈ℝd,
    r hidden units with weights {wi}1≤i≤r and output y∈ℝ, i.e., y=∑ri=1σ(w\U0001D5B3ix),
    with activation functions given by low-degree polynomials. In particular, if σ(x)=a0+a1x+a3x3,
    we prove that no polynomial-time learning algorithm can outperform the trivial
    predictor that assigns to each example the response variable \U0001D53C(y), when
    d3/2≪r≪d2. Our conclusion holds for a `natural data distribution', namely standard
    Gaussian feature vectors x, and output distributed according to a two-layer neural
    network with random isotropic weights, and under a certain complexity-theoretic
    assumption on tensor decomposition. Roughly speaking, we assume that no polynomial-time
    algorithm can substantially outperform current methods for tensor decomposition
    based on the sum-of-squares hierarchy. We also prove generalizations of this statement
    for higher degree polynomial activations, and non-random weight vectors. Remarkably,
    several existing algorithms for learning two-layer networks with rigorous guarantees
    are based on tensor decomposition. Our results support the idea that this is indeed
    the core computational difficulty in learning such networks, under the stated
    generative model for the data. As a side result, we show that under this model
    learning the network requires accurate learning of its weights, a property that
    does not hold in a more general setting. "
article_processing_charge: No
arxiv: 1
author:
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: Andrea
  full_name: Montanari, Andrea
  last_name: Montanari
citation:
  ama: 'Mondelli M, Montanari A. On the connection between learning two-layers neural
    networks and tensor  decomposition. In: <i>Proceedings of the 22nd International
    Conference on Artificial Intelligence and Statistics</i>. Vol 89. Proceedings
    of Machine Learning Research; 2019:1051-1060.'
  apa: 'Mondelli, M., &#38; Montanari, A. (2019). On the connection between learning
    two-layers neural networks and tensor  decomposition. In <i>Proceedings of the
    22nd International Conference on Artificial Intelligence and Statistics</i> (Vol.
    89, pp. 1051–1060). Naha, Okinawa, Japan: Proceedings of Machine Learning Research.'
  chicago: Mondelli, Marco, and Andrea Montanari. “On the Connection between Learning
    Two-Layers Neural Networks and Tensor  Decomposition.” In <i>Proceedings of the
    22nd International Conference on Artificial Intelligence and Statistics</i>, 89:1051–60.
    Proceedings of Machine Learning Research, 2019.
  ieee: M. Mondelli and A. Montanari, “On the connection between learning two-layers
    neural networks and tensor  decomposition,” in <i>Proceedings of the 22nd International
    Conference on Artificial Intelligence and Statistics</i>, Naha, Okinawa, Japan,
    2019, vol. 89, pp. 1051–1060.
  ista: 'Mondelli M, Montanari A. 2019. On the connection between learning two-layers
    neural networks and tensor  decomposition. Proceedings of the 22nd International
    Conference on Artificial Intelligence and Statistics. AISTATS: Artificial Intelligence
    and Statistics vol. 89, 1051–1060.'
  mla: Mondelli, Marco, and Andrea Montanari. “On the Connection between Learning
    Two-Layers Neural Networks and Tensor  Decomposition.” <i>Proceedings of the 22nd
    International Conference on Artificial Intelligence and Statistics</i>, vol. 89,
    Proceedings of Machine Learning Research, 2019, pp. 1051–60.
  short: M. Mondelli, A. Montanari, in:, Proceedings of the 22nd International Conference
    on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research,
    2019, pp. 1051–1060.
conference:
  end_date: 2019-04-18
  location: Naha, Okinawa, Japan
  name: 'AISTATS: Artificial Intelligence and Statistics'
  start_date: 2019-04-16
date_created: 2019-07-31T09:31:26Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2025-06-26T09:41:13Z
day: '01'
extern: '1'
external_id:
  arxiv:
  - '1802.07301'
intvolume: '        89'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1802.07301
month: '04'
oa: 1
oa_version: Preprint
page: 1051-1060
publication: Proceedings of the 22nd International Conference on Artificial Intelligence
  and Statistics
publication_status: published
publisher: Proceedings of Machine Learning Research
quality_controlled: '1'
status: public
title: On the connection between learning two-layers neural networks and tensor  decomposition
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 89
year: '2019'
...
---
_id: '6750'
abstract:
- lang: eng
  text: 'Polar codes have gained extensive attention during the past few years and
    recently they have been selected for the next generation of wireless communications
    standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC
    list (SCL) and SC flip (SCF), provide a reasonable error performance for polar
    codes at the cost of low decoding speed. Fast SC-based decoders, such as Fast-SSC,
    Fast-SSCL, and Fast-SSCF, identify the special constituent codes in a polar code
    graph off-line, produce a list of operations, store the list in memory, and feed
    the list to the decoder to decode the constituent codes in order efficiently,
    thus increasing the decoding speed. However, the list of operations is dependent
    on the code rate and as the rate changes, a new list is produced, making fast
    SC-based decoders not rate-flexible. In this paper, we propose a completely rate-flexible
    fast SC-based decoder by creating the list of operations directly in hardware,
    with low implementation complexity. We further propose a hardware architecture
    implementing the proposed method and show that the area occupation of the rate-flexible
    fast SC-based decoder in this paper is only 38% of the total area of the memory-based
    base-line decoder when 5G code rates are supported. '
article_number: '8854897'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Seyyed Ali
  full_name: Hashemi, Seyyed Ali
  last_name: Hashemi
- first_name: Carlo
  full_name: Condo, Carlo
  last_name: Condo
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: Warren J
  full_name: Gross, Warren J
  last_name: Gross
citation:
  ama: Hashemi SA, Condo C, Mondelli M, Gross WJ. Rate-flexible fast polar decoders.
    <i>IEEE Transactions on Signal Processing</i>. 2019;67(22). doi:<a href="https://doi.org/10.1109/TSP.2019.2944738">10.1109/TSP.2019.2944738</a>
  apa: Hashemi, S. A., Condo, C., Mondelli, M., &#38; Gross, W. J. (2019). Rate-flexible
    fast polar decoders. <i>IEEE Transactions on Signal Processing</i>. IEEE. <a href="https://doi.org/10.1109/TSP.2019.2944738">https://doi.org/10.1109/TSP.2019.2944738</a>
  chicago: Hashemi, Seyyed Ali, Carlo Condo, Marco Mondelli, and Warren J Gross. “Rate-Flexible
    Fast Polar Decoders.” <i>IEEE Transactions on Signal Processing</i>. IEEE, 2019.
    <a href="https://doi.org/10.1109/TSP.2019.2944738">https://doi.org/10.1109/TSP.2019.2944738</a>.
  ieee: S. A. Hashemi, C. Condo, M. Mondelli, and W. J. Gross, “Rate-flexible fast
    polar decoders,” <i>IEEE Transactions on Signal Processing</i>, vol. 67, no. 22.
    IEEE, 2019.
  ista: Hashemi SA, Condo C, Mondelli M, Gross WJ. 2019. Rate-flexible fast polar
    decoders. IEEE Transactions on Signal Processing. 67(22), 8854897.
  mla: Hashemi, Seyyed Ali, et al. “Rate-Flexible Fast Polar Decoders.” <i>IEEE Transactions
    on Signal Processing</i>, vol. 67, no. 22, 8854897, IEEE, 2019, doi:<a href="https://doi.org/10.1109/TSP.2019.2944738">10.1109/TSP.2019.2944738</a>.
  short: S.A. Hashemi, C. Condo, M. Mondelli, W.J. Gross, IEEE Transactions on Signal
    Processing 67 (2019).
date_created: 2019-07-31T09:51:14Z
date_published: 2019-11-15T00:00:00Z
date_updated: 2025-01-14T14:34:26Z
day: '15'
department:
- _id: MaMo
doi: 10.1109/TSP.2019.2944738
external_id:
  arxiv:
  - '1903.09203'
fulldoi: https://doi.org/10.1109/TSP.2019.2944738
intvolume: '        67'
issue: '22'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1903.09203
month: '11'
oa: 1
oa_version: Preprint
publication: IEEE Transactions on Signal Processing
publication_identifier:
  issn:
  - 1053-587X
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rate-flexible fast polar decoders
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 67
year: '2019'
...
---
_id: '6752'
abstract:
- lang: eng
  text: 'Two-player games on graphs are widely studied in formal methods, as they
    model the interaction between a system and its environment. The game is played
    by moving a token throughout a graph to produce an infinite path. There are several
    common modes to determine how the players move the token through the graph; e.g.,
    in turn-based games the players alternate turns in moving the token. We study
    the bidding mode of moving the token, which, to the best of our knowledge, has
    never been studied in infinite-duration games. The following bidding rule was
    previously defined and called Richman bidding. Both players have separate budgets,
    which sum up to 1. In each turn, a bidding takes place: Both players submit bids
    simultaneously, where a bid is legal if it does not exceed the available budget,
    and the higher bidder pays his bid to the other player and moves the token. The
    central question studied in bidding games is a necessary and sufficient initial
    budget for winning the game: a threshold budget in a vertex is a value t ∈ [0,
    1] such that if Player 1’s budget exceeds t, he can win the game; and if Player
    2’s budget exceeds 1 − t, he can win the game. Threshold budgets were previously
    shown to exist in every vertex of a reachability game, which have an interesting
    connection with random-turn games—a sub-class of simple stochastic games in which
    the player who moves is chosen randomly. We show the existence of threshold budgets
    for a qualitative class of infinite-duration games, namely parity games, and a
    quantitative class, namely mean-payoff games. The key component of the proof is
    a quantitative solution to strongly connected mean-payoff bidding games in which
    we extend the connection with random-turn games to these games, and construct
    explicit optimal strategies for both players.'
article_number: '31'
article_processing_charge: No
arxiv: 1
author:
- first_name: Guy
  full_name: Avni, Guy
  id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
  last_name: Avni
  orcid: 0000-0001-5588-8287
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Ventsislav K
  full_name: Chonev, Ventsislav K
  id: 36CBE2E6-F248-11E8-B48F-1D18A9856A87
  last_name: Chonev
citation:
  ama: Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. <i>Journal
    of the ACM</i>. 2019;66(4). doi:<a href="https://doi.org/10.1145/3340295">10.1145/3340295</a>
  apa: Avni, G., Henzinger, T. A., &#38; Chonev, V. K. (2019). Infinite-duration bidding
    games. <i>Journal of the ACM</i>. ACM. <a href="https://doi.org/10.1145/3340295">https://doi.org/10.1145/3340295</a>
  chicago: Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration
    Bidding Games.” <i>Journal of the ACM</i>. ACM, 2019. <a href="https://doi.org/10.1145/3340295">https://doi.org/10.1145/3340295</a>.
  ieee: G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,”
    <i>Journal of the ACM</i>, vol. 66, no. 4. ACM, 2019.
  ista: Avni G, Henzinger TA, Chonev VK. 2019. Infinite-duration bidding games. Journal
    of the ACM. 66(4), 31.
  mla: Avni, Guy, et al. “Infinite-Duration Bidding Games.” <i>Journal of the ACM</i>,
    vol. 66, no. 4, 31, ACM, 2019, doi:<a href="https://doi.org/10.1145/3340295">10.1145/3340295</a>.
  short: G. Avni, T.A. Henzinger, V.K. Chonev, Journal of the ACM 66 (2019).
date_created: 2019-08-04T21:59:16Z
date_published: 2019-07-16T00:00:00Z
date_updated: 2025-07-10T11:53:47Z
day: '16'
department:
- _id: ToHe
doi: 10.1145/3340295
external_id:
  arxiv:
  - '1705.01433'
  isi:
  - '000487714900008'
fulldoi: https://doi.org/10.1145/3340295
intvolume: '        66'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1705.01433
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11402-N23
  name: Rigorous Systems Engineering
- _id: 264B3912-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: M02369
  name: Formal Methods meets Algorithmic Game Theory
publication: Journal of the ACM
publication_identifier:
  eissn:
  - 1557-735X
  issn:
  - 0004-5411
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
  record:
  - id: '950'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Infinite-duration bidding games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2019'
...
---
_id: '6755'
abstract:
- lang: eng
  text: 'Differentiated sex chromosomes are accompanied by a difference in gene dose
    between X/Z-specific and autosomal genes. At the transcriptomic level, these sex-linked
    genes can lead to expression imbalance, or gene dosage can be compensated by epigenetic
    mechanisms and results into expression level equalization. Schistosoma mansoni
    has been previously described as a ZW species (i.e., female heterogamety, in opposition
    to XY male heterogametic species) with a partial dosage compensation, but underlying
    mechanisms are still unexplored. Here, we combine transcriptomic (RNA-Seq) and
    epigenetic data (ChIP-Seq against H3K4me3, H3K27me3,andH4K20me1histonemarks) in
    free larval cercariae and intravertebrate parasitic stages. For the first time,
    we describe differences in dosage compensation status in ZW females, depending
    on the parasitic status: free cercariae display global dosage compensation, whereas
    intravertebrate stages show a partial dosage compensation. We also highlight regional
    differences of gene expression along the Z chromosome in cercariae, but not in
    the intravertebrate stages. Finally, we feature a consistent permissive chromatin
    landscape of the Z chromosome in both sexes and stages. We argue that dosage compensation
    in schistosomes is characterized by chromatin remodeling mechanisms in the Z-specific
    region.'
acknowledged_ssus:
- _id: CampIT
article_processing_charge: No
article_type: original
author:
- first_name: Marion A L
  full_name: Picard, Marion A L
  id: 2C921A7A-F248-11E8-B48F-1D18A9856A87
  last_name: Picard
  orcid: 0000-0002-8101-2518
- first_name: Beatriz
  full_name: Vicoso, Beatriz
  id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
  last_name: Vicoso
  orcid: 0000-0002-4579-8306
- first_name: David
  full_name: Roquis, David
  last_name: Roquis
- first_name: Ingo
  full_name: Bulla, Ingo
  last_name: Bulla
- first_name: Ronaldo C.
  full_name: Augusto, Ronaldo C.
  last_name: Augusto
- first_name: Nathalie
  full_name: Arancibia, Nathalie
  last_name: Arancibia
- first_name: Christoph
  full_name: Grunau, Christoph
  last_name: Grunau
- first_name: Jérôme
  full_name: Boissier, Jérôme
  last_name: Boissier
- first_name: Céline
  full_name: Cosseau, Céline
  last_name: Cosseau
citation:
  ama: 'Picard MAL, Vicoso B, Roquis D, et al. Dosage compensation throughout the
    Schistosoma mansoni lifecycle: Specific chromatin landscape of the Z chromosome.
    <i>Genome biology and evolution</i>. 2019;11(7):1909-1922. doi:<a href="https://doi.org/10.1093/gbe/evz133">10.1093/gbe/evz133</a>'
  apa: 'Picard, M. A. L., Vicoso, B., Roquis, D., Bulla, I., Augusto, R. C., Arancibia,
    N., … Cosseau, C. (2019). Dosage compensation throughout the Schistosoma mansoni
    lifecycle: Specific chromatin landscape of the Z chromosome. <i>Genome Biology
    and Evolution</i>. Oxford University Press. <a href="https://doi.org/10.1093/gbe/evz133">https://doi.org/10.1093/gbe/evz133</a>'
  chicago: 'Picard, Marion A L, Beatriz Vicoso, David Roquis, Ingo Bulla, Ronaldo
    C. Augusto, Nathalie Arancibia, Christoph Grunau, Jérôme Boissier, and Céline
    Cosseau. “Dosage Compensation throughout the Schistosoma Mansoni Lifecycle: Specific
    Chromatin Landscape of the Z Chromosome.” <i>Genome Biology and Evolution</i>.
    Oxford University Press, 2019. <a href="https://doi.org/10.1093/gbe/evz133">https://doi.org/10.1093/gbe/evz133</a>.'
  ieee: 'M. A. L. Picard <i>et al.</i>, “Dosage compensation throughout the Schistosoma
    mansoni lifecycle: Specific chromatin landscape of the Z chromosome,” <i>Genome
    biology and evolution</i>, vol. 11, no. 7. Oxford University Press, pp. 1909–1922,
    2019.'
  ista: 'Picard MAL, Vicoso B, Roquis D, Bulla I, Augusto RC, Arancibia N, Grunau
    C, Boissier J, Cosseau C. 2019. Dosage compensation throughout the Schistosoma
    mansoni lifecycle: Specific chromatin landscape of the Z chromosome. Genome biology
    and evolution. 11(7), 1909–1922.'
  mla: 'Picard, Marion A. L., et al. “Dosage Compensation throughout the Schistosoma
    Mansoni Lifecycle: Specific Chromatin Landscape of the Z Chromosome.” <i>Genome
    Biology and Evolution</i>, vol. 11, no. 7, Oxford University Press, 2019, pp.
    1909–22, doi:<a href="https://doi.org/10.1093/gbe/evz133">10.1093/gbe/evz133</a>.'
  short: M.A.L. Picard, B. Vicoso, D. Roquis, I. Bulla, R.C. Augusto, N. Arancibia,
    C. Grunau, J. Boissier, C. Cosseau, Genome Biology and Evolution 11 (2019) 1909–1922.
date_created: 2019-08-04T21:59:18Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2025-05-14T11:08:50Z
day: '01'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1093/gbe/evz133
external_id:
  isi:
  - '000484039500018'
  pmid:
  - '31273378'
file:
- access_level: open_access
  checksum: f9e8f6863a406dcc5a36b2be001c138c
  content_type: application/pdf
  creator: dernst
  date_created: 2019-08-05T07:55:02Z
  date_updated: 2020-07-14T12:47:39Z
  file_id: '6765'
  file_name: 2019_GenomeBiology_Picard.pdf
  file_size: 580205
  relation: main_file
file_date_updated: 2020-07-14T12:47:39Z
fulldoi: https://doi.org/10.1093/gbe/evz133
has_accepted_license: '1'
intvolume: '        11'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 1909-1922
pmid: 1
publication: Genome biology and evolution
publication_identifier:
  eissn:
  - 1759-6653
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Dosage compensation throughout the Schistosoma mansoni lifecycle: Specific
  chromatin landscape of the Z chromosome'
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: 11
year: '2019'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '6759'
abstract:
- lang: eng
  text: "We consider the graph class Grounded-L corresponding to graphs that admit
    an intersection representation by L-shaped curves, where additionally the topmost
    points of each curve are assumed to belong to a common horizontal line. We prove
    that Grounded-L graphs admit an equivalent characterisation in terms of vertex
    ordering with forbidden patterns. \r\nWe also compare this class to related intersection
    classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. max
    point-tolerance graphs), or the outer-1-string graphs. We give constructions showing
    that these classes are all distinct and satisfy only trivial or previously known
    inclusions."
article_number: P3.17
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Vít
  full_name: Jelínek, Vít
  last_name: Jelínek
- first_name: Martin
  full_name: Töpfer, Martin
  id: 4B865388-F248-11E8-B48F-1D18A9856A87
  last_name: Töpfer
citation:
  ama: Jelínek V, Töpfer M. On grounded L-graphs and their relatives. <i>Electronic
    Journal of Combinatorics</i>. 2019;26(3). doi:<a href="https://doi.org/10.37236/8096">10.37236/8096</a>
  apa: Jelínek, V., &#38; Töpfer, M. (2019). On grounded L-graphs and their relatives.
    <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics.
    <a href="https://doi.org/10.37236/8096">https://doi.org/10.37236/8096</a>
  chicago: Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.”
    <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics,
    2019. <a href="https://doi.org/10.37236/8096">https://doi.org/10.37236/8096</a>.
  ieee: V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” <i>Electronic
    Journal of Combinatorics</i>, vol. 26, no. 3. Electronic Journal of Combinatorics,
    2019.
  ista: Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic
    Journal of Combinatorics. 26(3), P3.17.
  mla: Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.”
    <i>Electronic Journal of Combinatorics</i>, vol. 26, no. 3, P3.17, Electronic
    Journal of Combinatorics, 2019, doi:<a href="https://doi.org/10.37236/8096">10.37236/8096</a>.
  short: V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).
corr_author: '1'
date_created: 2019-08-04T21:59:20Z
date_published: 2019-07-19T00:00:00Z
date_updated: 2025-06-26T12:25:39Z
day: '19'
ddc:
- '510'
department:
- _id: DaAl
doi: 10.37236/8096
ec_funded: 1
external_id:
  arxiv:
  - '1808.04148'
file:
- access_level: open_access
  checksum: 20fc366fc6683ef0b074a019b73a663a
  content_type: application/pdf
  creator: dernst
  date_created: 2019-08-05T06:46:55Z
  date_updated: 2020-07-14T12:47:39Z
  file_id: '6764'
  file_name: 2019_eJourCombinatorics_Jelinek.pdf
  file_size: 533697
  relation: main_file
file_date_updated: 2020-07-14T12:47:39Z
fulldoi: https://doi.org/10.37236/8096
has_accepted_license: '1'
intvolume: '        26'
issue: '3'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
publication: Electronic Journal of Combinatorics
publication_identifier:
  eissn:
  - 1077-8926
publication_status: published
publisher: Electronic Journal of Combinatorics
quality_controlled: '1'
scopus_import: '1'
status: public
title: On grounded L-graphs and their relatives
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: 26
year: '2019'
...
---
_id: '6762'
abstract:
- lang: eng
  text: "We present and study novel optimal control problems motivated by the search
    for photovoltaic materials with high power-conversion efficiency. The material
    must perform the first step: convert light (photons) into electronic excitations.
    We formulate various desirable properties of the excitations as mathematical control
    goals at the Kohn-Sham-DFT level\r\nof theory, with the control being given by
    the nuclear charge distribution. We prove that nuclear distributions exist which
    give rise to optimal HOMO-LUMO excitations, and present illustrative numerical
    simulations for 1D finite nanocrystals. We observe pronounced goal-dependent features
    such as large electron-hole separation, and a hierarchy of length scales: internal
    HOMO and LUMO wavelengths < atomic spacings < (irregular) fluctuations of the
    doping profiles < system size."
article_processing_charge: No
arxiv: 1
author:
- first_name: Gero
  full_name: Friesecke, Gero
  last_name: Friesecke
- first_name: Michael
  full_name: Kniely, Michael
  id: 2CA2C08C-F248-11E8-B48F-1D18A9856A87
  last_name: Kniely
  orcid: 0000-0001-5645-4333
citation:
  ama: Friesecke G, Kniely M. New optimal control problems in density functional theory
    motivated by photovoltaics. <i>Multiscale Modeling and Simulation</i>. 2019;17(3):926-947.
    doi:<a href="https://doi.org/10.1137/18M1207272">10.1137/18M1207272</a>
  apa: Friesecke, G., &#38; Kniely, M. (2019). New optimal control problems in density
    functional theory motivated by photovoltaics. <i>Multiscale Modeling and Simulation</i>.
    SIAM. <a href="https://doi.org/10.1137/18M1207272">https://doi.org/10.1137/18M1207272</a>
  chicago: Friesecke, Gero, and Michael Kniely. “New Optimal Control Problems in Density
    Functional Theory Motivated by Photovoltaics.” <i>Multiscale Modeling and Simulation</i>.
    SIAM, 2019. <a href="https://doi.org/10.1137/18M1207272">https://doi.org/10.1137/18M1207272</a>.
  ieee: G. Friesecke and M. Kniely, “New optimal control problems in density functional
    theory motivated by photovoltaics,” <i>Multiscale Modeling and Simulation</i>,
    vol. 17, no. 3. SIAM, pp. 926–947, 2019.
  ista: Friesecke G, Kniely M. 2019. New optimal control problems in density functional
    theory motivated by photovoltaics. Multiscale Modeling and Simulation. 17(3),
    926–947.
  mla: Friesecke, Gero, and Michael Kniely. “New Optimal Control Problems in Density
    Functional Theory Motivated by Photovoltaics.” <i>Multiscale Modeling and Simulation</i>,
    vol. 17, no. 3, SIAM, 2019, pp. 926–47, doi:<a href="https://doi.org/10.1137/18M1207272">10.1137/18M1207272</a>.
  short: G. Friesecke, M. Kniely, Multiscale Modeling and Simulation 17 (2019) 926–947.
date_created: 2019-08-04T21:59:21Z
date_published: 2019-07-16T00:00:00Z
date_updated: 2025-07-10T11:53:49Z
day: '16'
department:
- _id: JuFi
doi: 10.1137/18M1207272
external_id:
  arxiv:
  - '1808.04200'
  isi:
  - '000487931800002'
fulldoi: https://doi.org/10.1137/18M1207272
intvolume: '        17'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1808.04200
month: '07'
oa: 1
oa_version: Preprint
page: 926-947
publication: Multiscale Modeling and Simulation
publication_identifier:
  eissn:
  - 1540-3467
  issn:
  - 1540-3459
publication_status: published
publisher: SIAM
quality_controlled: '1'
scopus_import: '1'
status: public
title: New optimal control problems in density functional theory motivated by photovoltaics
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2019'
...
---
_id: '6763'
abstract:
- lang: eng
  text: "When grape-sized aqueous dimers are irradiated in a microwave oven, an intense
    electromagnetic hotspot forms at their point of contact, often igniting a plasma.
    Here we show that this irradiation can result in the injection of mechanical energy.
    By examining irradiated hydrogel dimers through high-speed imaging, we find that
    they repeatedly bounce off of each other while irradiated. We determine that an
    average of 1 lJ of mechanical energy is injected into the pair during each collision.
    Furthermore, a characteristic high-pitched audio signal is found to accompany
    each collision.\r\nWe show that both the audio signal and the energy injection
    arise via an interplay between vaporization and elastic deformations in the region
    of contact, the so-called ‘elastic Liedenfrost effect’. Our results establish
    a novel, non-contact method of injecting mechanical energy into soft matter systems,
    suggesting application in fields such as soft robotics."
article_processing_charge: No
article_type: original
author:
- first_name: Hamza K.
  full_name: Khattak, Hamza K.
  last_name: Khattak
- first_name: Scott R
  full_name: Waitukaitis, Scott R
  id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
  last_name: Waitukaitis
  orcid: 0000-0002-2299-3176
- first_name: Aaron D.
  full_name: Slepkov, Aaron D.
  last_name: Slepkov
citation:
  ama: Khattak HK, Waitukaitis SR, Slepkov AD. Microwave induced mechanical activation
    of hydrogel dimers. <i>Soft Matter</i>. 2019;15(29):5804-5809. doi:<a href="https://doi.org/10.1039/c9sm00756c">10.1039/c9sm00756c</a>
  apa: Khattak, H. K., Waitukaitis, S. R., &#38; Slepkov, A. D. (2019). Microwave
    induced mechanical activation of hydrogel dimers. <i>Soft Matter</i>. Royal Society
    of Chemistry. <a href="https://doi.org/10.1039/c9sm00756c">https://doi.org/10.1039/c9sm00756c</a>
  chicago: Khattak, Hamza K., Scott R Waitukaitis, and Aaron D. Slepkov. “Microwave
    Induced Mechanical Activation of Hydrogel Dimers.” <i>Soft Matter</i>. Royal Society
    of Chemistry, 2019. <a href="https://doi.org/10.1039/c9sm00756c">https://doi.org/10.1039/c9sm00756c</a>.
  ieee: H. K. Khattak, S. R. Waitukaitis, and A. D. Slepkov, “Microwave induced mechanical
    activation of hydrogel dimers,” <i>Soft Matter</i>, vol. 15, no. 29. Royal Society
    of Chemistry, pp. 5804–5809, 2019.
  ista: Khattak HK, Waitukaitis SR, Slepkov AD. 2019. Microwave induced mechanical
    activation of hydrogel dimers. Soft Matter. 15(29), 5804–5809.
  mla: Khattak, Hamza K., et al. “Microwave Induced Mechanical Activation of Hydrogel
    Dimers.” <i>Soft Matter</i>, vol. 15, no. 29, Royal Society of Chemistry, 2019,
    pp. 5804–09, doi:<a href="https://doi.org/10.1039/c9sm00756c">10.1039/c9sm00756c</a>.
  short: H.K. Khattak, S.R. Waitukaitis, A.D. Slepkov, Soft Matter 15 (2019) 5804–5809.
date_created: 2019-08-04T21:59:21Z
date_published: 2019-07-15T00:00:00Z
date_updated: 2025-07-10T11:53:49Z
day: '15'
department:
- _id: ScWa
doi: 10.1039/c9sm00756c
external_id:
  isi:
  - '000476909200002'
  pmid:
  - '31305853'
fulldoi: https://doi.org/10.1039/c9sm00756c
intvolume: '        15'
isi: 1
issue: '29'
language:
- iso: eng
month: '07'
oa_version: None
page: 5804-5809
pmid: 1
publication: Soft Matter
publication_identifier:
  eissn:
  - 1744-6848
  issn:
  - 1744-683X
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Microwave induced mechanical activation of hydrogel dimers
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2019'
...
---
_id: '6778'
abstract:
- lang: eng
  text: "An important adaptation during colonization of land by plants is gravitropic
    growth of roots, which enabled roots to reach water and nutrients, and firmly
    anchor plants in the ground. Here we provide insights into the evolution of an
    efficient root gravitropic mechanism in the seed plants. Architectural innovation,
    with gravity perception constrained in the root tips\r\nalong with a shootward
    transport route for the phytohormone auxin, appeared only upon the emergence of
    seed plants. Interspecies complementation and protein domain swapping revealed
    functional innovations within the PIN family of auxin transporters leading to
    the evolution of gravitropism-specific PINs. The unique apical/shootward subcellular
    localization of PIN proteins is the major evolutionary innovation that connected
    the anatomically separated sites of gravity perception and growth response via
    the mobile auxin signal. We conclude that the crucial anatomical and functional
    components emerged hand-in-hand to facilitate the evolution of fast gravitropic
    response, which is one of the major adaptations of seed plants to dry land."
article_number: '3480'
article_processing_charge: No
article_type: original
author:
- first_name: Yuzhou
  full_name: Zhang, Yuzhou
  id: 3B6137F2-F248-11E8-B48F-1D18A9856A87
  last_name: Zhang
  orcid: 0000-0003-2627-6956
- first_name: G
  full_name: Xiao, G
  last_name: Xiao
- first_name: X
  full_name: Wang, X
  last_name: Wang
- first_name: Xixi
  full_name: Zhang, Xixi
  id: 61A66458-47E9-11EA-85BA-8AEAAF14E49A
  last_name: Zhang
  orcid: 0000-0001-7048-4627
- first_name: Jiří
  full_name: Friml, Jiří
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: Zhang Y, Xiao G, Wang X, Zhang X, Friml J. Evolution of fast root gravitropism
    in seed plants. <i>Nature Communications</i>. 2019;10. doi:<a href="https://doi.org/10.1038/s41467-019-11471-8">10.1038/s41467-019-11471-8</a>
  apa: Zhang, Y., Xiao, G., Wang, X., Zhang, X., &#38; Friml, J. (2019). Evolution
    of fast root gravitropism in seed plants. <i>Nature Communications</i>. Springer
    Nature. <a href="https://doi.org/10.1038/s41467-019-11471-8">https://doi.org/10.1038/s41467-019-11471-8</a>
  chicago: Zhang, Yuzhou, G Xiao, X Wang, Xixi Zhang, and Jiří Friml. “Evolution of
    Fast Root Gravitropism in Seed Plants.” <i>Nature Communications</i>. Springer
    Nature, 2019. <a href="https://doi.org/10.1038/s41467-019-11471-8">https://doi.org/10.1038/s41467-019-11471-8</a>.
  ieee: Y. Zhang, G. Xiao, X. Wang, X. Zhang, and J. Friml, “Evolution of fast root
    gravitropism in seed plants,” <i>Nature Communications</i>, vol. 10. Springer
    Nature, 2019.
  ista: Zhang Y, Xiao G, Wang X, Zhang X, Friml J. 2019. Evolution of fast root gravitropism
    in seed plants. Nature Communications. 10, 3480.
  mla: Zhang, Yuzhou, et al. “Evolution of Fast Root Gravitropism in Seed Plants.”
    <i>Nature Communications</i>, vol. 10, 3480, Springer Nature, 2019, doi:<a href="https://doi.org/10.1038/s41467-019-11471-8">10.1038/s41467-019-11471-8</a>.
  short: Y. Zhang, G. Xiao, X. Wang, X. Zhang, J. Friml, Nature Communications 10
    (2019).
date_created: 2019-08-09T08:46:26Z
date_published: 2019-08-02T00:00:00Z
date_updated: 2025-04-14T07:45:04Z
day: '02'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1038/s41467-019-11471-8
ec_funded: 1
external_id:
  isi:
  - '000478576500012'
  pmid:
  - '31375675'
file:
- access_level: open_access
  checksum: d2c654fdb97f33078f606fe0c298bf6e
  content_type: application/pdf
  creator: dernst
  date_created: 2019-08-12T07:09:20Z
  date_updated: 2020-07-14T12:47:40Z
  file_id: '6798'
  file_name: 2019_NatureComm_Zhang.pdf
  file_size: 6406141
  relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
fulldoi: https://doi.org/10.1038/s41467-019-11471-8
has_accepted_license: '1'
intvolume: '        10'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '742985'
  name: Tracing Evolution of Auxin Transport and Polarity in Plants
- _id: 26538374-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I03630
  name: Molecular mechanisms of endocytic cargo recognition in plants
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Nature Communications
publication_identifier:
  issn:
  - 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  link:
  - description: News on IST Homepage
    relation: press_release
    url: https://ist.ac.at/en/news/when-plant-roots-learned-to-follow-gravity/
scopus_import: '1'
status: public
title: Evolution of fast root gravitropism in seed plants
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 10
year: '2019'
...
---
_id: '6779'
abstract:
- lang: eng
  text: "Recent studies suggest that unstable recurrent solutions of the Navier-Stokes
    equation provide new insights\r\ninto dynamics of turbulent flows. In this study,
    we compute an extensive network of dynamical connections\r\nbetween such solutions
    in a weakly turbulent quasi-two-dimensional Kolmogorov flow that lies in the inversion
    symmetric subspace. In particular, we find numerous isolated heteroclinic connections
    between different\r\ntypes of solutions—equilibria, periodic, and quasiperiodic
    orbits—as well as continua of connections forming\r\nhigher-dimensional connecting
    manifolds. We also compute a homoclinic connection of a periodic orbit and\r\nprovide
    strong evidence that the associated homoclinic tangle forms the chaotic repeller
    that underpins transient\r\nturbulence in the symmetric subspace."
article_number: '013112'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Balachandra
  full_name: Suri, Balachandra
  id: 47A5E706-F248-11E8-B48F-1D18A9856A87
  last_name: Suri
- first_name: Ravi Kumar
  full_name: Pallantla, Ravi Kumar
  last_name: Pallantla
- first_name: Michael F.
  full_name: Schatz, Michael F.
  last_name: Schatz
- first_name: Roman O.
  full_name: Grigoriev, Roman O.
  last_name: Grigoriev
citation:
  ama: Suri B, Pallantla RK, Schatz MF, Grigoriev RO. Heteroclinic and homoclinic
    connections in a Kolmogorov-like flow. <i>Physical Review E</i>. 2019;100(1).
    doi:<a href="https://doi.org/10.1103/physreve.100.013112">10.1103/physreve.100.013112</a>
  apa: Suri, B., Pallantla, R. K., Schatz, M. F., &#38; Grigoriev, R. O. (2019). Heteroclinic
    and homoclinic connections in a Kolmogorov-like flow. <i>Physical Review E</i>.
    American Physical Society. <a href="https://doi.org/10.1103/physreve.100.013112">https://doi.org/10.1103/physreve.100.013112</a>
  chicago: Suri, Balachandra, Ravi Kumar Pallantla, Michael F. Schatz, and Roman O.
    Grigoriev. “Heteroclinic and Homoclinic Connections in a Kolmogorov-like Flow.”
    <i>Physical Review E</i>. American Physical Society, 2019. <a href="https://doi.org/10.1103/physreve.100.013112">https://doi.org/10.1103/physreve.100.013112</a>.
  ieee: B. Suri, R. K. Pallantla, M. F. Schatz, and R. O. Grigoriev, “Heteroclinic
    and homoclinic connections in a Kolmogorov-like flow,” <i>Physical Review E</i>,
    vol. 100, no. 1. American Physical Society, 2019.
  ista: Suri B, Pallantla RK, Schatz MF, Grigoriev RO. 2019. Heteroclinic and homoclinic
    connections in a Kolmogorov-like flow. Physical Review E. 100(1), 013112.
  mla: Suri, Balachandra, et al. “Heteroclinic and Homoclinic Connections in a Kolmogorov-like
    Flow.” <i>Physical Review E</i>, vol. 100, no. 1, 013112, American Physical Society,
    2019, doi:<a href="https://doi.org/10.1103/physreve.100.013112">10.1103/physreve.100.013112</a>.
  short: B. Suri, R.K. Pallantla, M.F. Schatz, R.O. Grigoriev, Physical Review E 100
    (2019).
date_created: 2019-08-09T09:40:41Z
date_published: 2019-07-25T00:00:00Z
date_updated: 2025-04-15T06:50:28Z
day: '25'
ddc:
- '532'
department:
- _id: BjHo
doi: 10.1103/physreve.100.013112
ec_funded: 1
external_id:
  arxiv:
  - '1907.05860'
  isi:
  - '000477911800012'
fulldoi: https://doi.org/10.1103/physreve.100.013112
intvolume: '       100'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1907.05860
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Physical Review E
publication_identifier:
  eissn:
  - 2470-0053
  issn:
  - 2470-0045
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Heteroclinic and homoclinic connections in a Kolmogorov-like flow
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 100
year: '2019'
...
---
_id: '6784'
abstract:
- lang: eng
  text: Mathematical models have been used successfully at diverse scales of biological
    organization, ranging from ecology and population dynamics to stochastic reaction
    events occurring between individual molecules in single cells. Generally, many
    biological processes unfold across multiple scales, with mutations being the best
    studied example of how stochasticity at the molecular scale can influence outcomes
    at the population scale. In many other contexts, however, an analogous link between
    micro- and macro-scale remains elusive, primarily due to the challenges involved
    in setting up and analyzing multi-scale models. Here, we employ such a model to
    investigate how stochasticity propagates from individual biochemical reaction
    events in the bacterial innate immune system to the ecology of bacteria and bacterial
    viruses. We show analytically how the dynamics of bacterial populations are shaped
    by the activities of immunity-conferring enzymes in single cells and how the ecological
    consequences imply optimal bacterial defense strategies against viruses. Our results
    suggest that bacterial populations in the presence of viruses can either optimize
    their initial growth rate or their population size, with the first strategy favoring
    simple immunity featuring a single restriction modification system and the second
    strategy favoring complex bacterial innate immunity featuring several simultaneously
    active restriction modification systems.
article_number: e1007168
article_processing_charge: No
article_type: original
author:
- first_name: Jakob
  full_name: Ruess, Jakob
  id: 4A245D00-F248-11E8-B48F-1D18A9856A87
  last_name: Ruess
  orcid: 0000-0003-1615-3282
- first_name: Maros
  full_name: Pleska, Maros
  id: 4569785E-F248-11E8-B48F-1D18A9856A87
  last_name: Pleska
  orcid: 0000-0001-7460-7479
- first_name: Calin C
  full_name: Guet, Calin C
  id: 47F8433E-F248-11E8-B48F-1D18A9856A87
  last_name: Guet
  orcid: 0000-0001-6220-2052
- first_name: Gašper
  full_name: Tkačik, Gašper
  id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
  last_name: Tkačik
  orcid: 0000-0002-6699-1455
citation:
  ama: Ruess J, Pleska M, Guet CC, Tkačik G. Molecular noise of innate immunity shapes
    bacteria-phage ecologies. <i>PLoS Computational Biology</i>. 2019;15(7). doi:<a
    href="https://doi.org/10.1371/journal.pcbi.1007168">10.1371/journal.pcbi.1007168</a>
  apa: Ruess, J., Pleska, M., Guet, C. C., &#38; Tkačik, G. (2019). Molecular noise
    of innate immunity shapes bacteria-phage ecologies. <i>PLoS Computational Biology</i>.
    Public Library of Science. <a href="https://doi.org/10.1371/journal.pcbi.1007168">https://doi.org/10.1371/journal.pcbi.1007168</a>
  chicago: Ruess, Jakob, Maros Pleska, Calin C Guet, and Gašper Tkačik. “Molecular
    Noise of Innate Immunity Shapes Bacteria-Phage Ecologies.” <i>PLoS Computational
    Biology</i>. Public Library of Science, 2019. <a href="https://doi.org/10.1371/journal.pcbi.1007168">https://doi.org/10.1371/journal.pcbi.1007168</a>.
  ieee: J. Ruess, M. Pleska, C. C. Guet, and G. Tkačik, “Molecular noise of innate
    immunity shapes bacteria-phage ecologies,” <i>PLoS Computational Biology</i>,
    vol. 15, no. 7. Public Library of Science, 2019.
  ista: Ruess J, Pleska M, Guet CC, Tkačik G. 2019. Molecular noise of innate immunity
    shapes bacteria-phage ecologies. PLoS Computational Biology. 15(7), e1007168.
  mla: Ruess, Jakob, et al. “Molecular Noise of Innate Immunity Shapes Bacteria-Phage
    Ecologies.” <i>PLoS Computational Biology</i>, vol. 15, no. 7, e1007168, Public
    Library of Science, 2019, doi:<a href="https://doi.org/10.1371/journal.pcbi.1007168">10.1371/journal.pcbi.1007168</a>.
  short: J. Ruess, M. Pleska, C.C. Guet, G. Tkačik, PLoS Computational Biology 15
    (2019).
date_created: 2019-08-11T21:59:19Z
date_published: 2019-07-02T00:00:00Z
date_updated: 2025-04-14T13:46:26Z
day: '02'
ddc:
- '570'
department:
- _id: CaGu
- _id: GaTk
doi: 10.1371/journal.pcbi.1007168
external_id:
  isi:
  - '000481577700032'
file:
- access_level: open_access
  checksum: 7ded4721b41c2a0fc66a1c634540416a
  content_type: application/pdf
  creator: dernst
  date_created: 2019-08-12T12:27:26Z
  date_updated: 2020-07-14T12:47:40Z
  file_id: '6803'
  file_name: 2019_PlosComputBiology_Ruess.pdf
  file_size: 2200003
  relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
fulldoi: https://doi.org/10.1371/journal.pcbi.1007168
has_accepted_license: '1'
intvolume: '        15'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 251D65D8-B435-11E9-9278-68D0E5697425
  grant_number: '24210'
  name: Effects of Stochasticity on the Function of Restriction-Modi cation Systems
    at the Single-Cell Level
- _id: 251BCBEC-B435-11E9-9278-68D0E5697425
  grant_number: RGY0079/2011
  name: Multi-Level Conflicts in Evolutionary Dynamics of Restriction-Modification
    Systems
publication: PLoS Computational Biology
publication_identifier:
  eissn:
  - 1553-7358
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
  record:
  - id: '9786'
    relation: research_data
    status: public
scopus_import: '1'
status: public
title: Molecular noise of innate immunity shapes bacteria-phage ecologies
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 15
year: '2019'
...
---
_id: '6786'
abstract:
- lang: eng
  text: Dipolar coupling plays a fundamental role in the interaction between electrically
    or magnetically polarized species such as magnetic atoms and dipolar molecules
    in a gas or dipolar excitons in the solid state. Unlike Coulomb or contactlike
    interactions found in many atomic, molecular, and condensed-matter systems, this
    interaction is long-ranged and highly anisotropic, as it changes from repulsive
    to attractive depending on the relative positions and orientation of the dipoles.
    Because of this unique property, many exotic, symmetry-breaking collective states
    have been recently predicted for cold dipolar gases, but only a few have been
    experimentally detected and only in dilute atomic dipolar Bose-Einstein condensates.
    Here, we report on the first observation of attractive dipolar coupling between
    excitonic dipoles using a new design of stacked semiconductor bilayers. We show
    that the presence of a dipolar exciton fluid in one bilayer modifies the spatial
    distribution and increases the binding energy of excitonic dipoles in a vertically
    remote layer. The binding energy changes are explained using a many-body polaron
    model describing the deformation of the exciton cloud due to its interaction with
    a remote dipolar exciton. The surprising nonmonotonic dependence on the cloud
    density indicates the important role of dipolar correlations, which is unique
    to dense, strongly interacting dipolar solid-state systems. Our concept provides
    a route for the realization of dipolar lattices with strong anisotropic interactions
    in semiconductor systems, which open the way for the observation of theoretically
    predicted new and exotic collective phases, as well as for engineering and sensing
    their collective excitations.
article_number: '021026'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Colin
  full_name: Hubert, Colin
  last_name: Hubert
- first_name: Yifat
  full_name: Baruchi, Yifat
  last_name: Baruchi
- first_name: Yotam
  full_name: Mazuz-Harpaz, Yotam
  last_name: Mazuz-Harpaz
- first_name: Kobi
  full_name: Cohen, Kobi
  last_name: Cohen
- first_name: Klaus
  full_name: Biermann, Klaus
  last_name: Biermann
- first_name: Mikhail
  full_name: Lemeshko, Mikhail
  id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
  last_name: Lemeshko
  orcid: 0000-0002-6990-7802
- first_name: Ken
  full_name: West, Ken
  last_name: West
- first_name: Loren
  full_name: Pfeiffer, Loren
  last_name: Pfeiffer
- first_name: Ronen
  full_name: Rapaport, Ronen
  last_name: Rapaport
- first_name: Paulo
  full_name: Santos, Paulo
  last_name: Santos
citation:
  ama: Hubert C, Baruchi Y, Mazuz-Harpaz Y, et al. Attractive dipolar coupling between
    stacked exciton fluids. <i>Physical Review X</i>. 2019;9(2). doi:<a href="https://doi.org/10.1103/PhysRevX.9.021026">10.1103/PhysRevX.9.021026</a>
  apa: Hubert, C., Baruchi, Y., Mazuz-Harpaz, Y., Cohen, K., Biermann, K., Lemeshko,
    M., … Santos, P. (2019). Attractive dipolar coupling between stacked exciton fluids.
    <i>Physical Review X</i>. American Physical Society. <a href="https://doi.org/10.1103/PhysRevX.9.021026">https://doi.org/10.1103/PhysRevX.9.021026</a>
  chicago: Hubert, Colin, Yifat Baruchi, Yotam Mazuz-Harpaz, Kobi Cohen, Klaus Biermann,
    Mikhail Lemeshko, Ken West, Loren Pfeiffer, Ronen Rapaport, and Paulo Santos.
    “Attractive Dipolar Coupling between Stacked Exciton Fluids.” <i>Physical Review
    X</i>. American Physical Society, 2019. <a href="https://doi.org/10.1103/PhysRevX.9.021026">https://doi.org/10.1103/PhysRevX.9.021026</a>.
  ieee: C. Hubert <i>et al.</i>, “Attractive dipolar coupling between stacked exciton
    fluids,” <i>Physical Review X</i>, vol. 9, no. 2. American Physical Society, 2019.
  ista: Hubert C, Baruchi Y, Mazuz-Harpaz Y, Cohen K, Biermann K, Lemeshko M, West
    K, Pfeiffer L, Rapaport R, Santos P. 2019. Attractive dipolar coupling between
    stacked exciton fluids. Physical Review X. 9(2), 021026.
  mla: Hubert, Colin, et al. “Attractive Dipolar Coupling between Stacked Exciton
    Fluids.” <i>Physical Review X</i>, vol. 9, no. 2, 021026, American Physical Society,
    2019, doi:<a href="https://doi.org/10.1103/PhysRevX.9.021026">10.1103/PhysRevX.9.021026</a>.
  short: C. Hubert, Y. Baruchi, Y. Mazuz-Harpaz, K. Cohen, K. Biermann, M. Lemeshko,
    K. West, L. Pfeiffer, R. Rapaport, P. Santos, Physical Review X 9 (2019).
date_created: 2019-08-11T21:59:20Z
date_published: 2019-05-08T00:00:00Z
date_updated: 2025-04-15T07:59:29Z
day: '08'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1103/PhysRevX.9.021026
external_id:
  arxiv:
  - '1807.11238'
  isi:
  - '000467402900001'
file:
- access_level: open_access
  checksum: 065ff82ee4a1d2c3773ce4b76ff4213c
  content_type: application/pdf
  creator: dernst
  date_created: 2019-08-12T12:14:18Z
  date_updated: 2020-07-14T12:47:40Z
  file_id: '6802'
  file_name: 2019_PhysReviewX_Hubert.pdf
  file_size: 1193550
  relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
fulldoi: https://doi.org/10.1103/PhysRevX.9.021026
has_accepted_license: '1'
intvolume: '         9'
isi: 1
issue: '2'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 26031614-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P29902
  name: Quantum rotations in the presence of a many-body environment
publication: Physical Review X
publication_identifier:
  eissn:
  - 2160-3308
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Attractive dipolar coupling between stacked exciton fluids
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: '2019'
...
---
_id: '6793'
abstract:
- lang: eng
  text: The Regge symmetry is a set of remarkable relations between two tetrahedra
    whose edge lengths are related in a simple fashion. It was first discovered as
    a consequence of an asymptotic formula in mathematical physics. Here, we give
    a simple geometric proof of Regge symmetries in Euclidean, spherical, and hyperbolic
    geometry.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Arseniy
  full_name: Akopyan, Arseniy
  id: 430D2C90-F248-11E8-B48F-1D18A9856A87
  last_name: Akopyan
  orcid: 0000-0002-2548-617X
- first_name: Ivan
  full_name: Izmestiev, Ivan
  last_name: Izmestiev
citation:
  ama: Akopyan A, Izmestiev I. The Regge symmetry, confocal conics, and the Schläfli
    formula. <i>Bulletin of the London Mathematical Society</i>. 2019;51(5):765-775.
    doi:<a href="https://doi.org/10.1112/blms.12276">10.1112/blms.12276</a>
  apa: Akopyan, A., &#38; Izmestiev, I. (2019). The Regge symmetry, confocal conics,
    and the Schläfli formula. <i>Bulletin of the London Mathematical Society</i>.
    London Mathematical Society. <a href="https://doi.org/10.1112/blms.12276">https://doi.org/10.1112/blms.12276</a>
  chicago: Akopyan, Arseniy, and Ivan Izmestiev. “The Regge Symmetry, Confocal Conics,
    and the Schläfli Formula.” <i>Bulletin of the London Mathematical Society</i>.
    London Mathematical Society, 2019. <a href="https://doi.org/10.1112/blms.12276">https://doi.org/10.1112/blms.12276</a>.
  ieee: A. Akopyan and I. Izmestiev, “The Regge symmetry, confocal conics, and the
    Schläfli formula,” <i>Bulletin of the London Mathematical Society</i>, vol. 51,
    no. 5. London Mathematical Society, pp. 765–775, 2019.
  ista: Akopyan A, Izmestiev I. 2019. The Regge symmetry, confocal conics, and the
    Schläfli formula. Bulletin of the London Mathematical Society. 51(5), 765–775.
  mla: Akopyan, Arseniy, and Ivan Izmestiev. “The Regge Symmetry, Confocal Conics,
    and the Schläfli Formula.” <i>Bulletin of the London Mathematical Society</i>,
    vol. 51, no. 5, London Mathematical Society, 2019, pp. 765–75, doi:<a href="https://doi.org/10.1112/blms.12276">10.1112/blms.12276</a>.
  short: A. Akopyan, I. Izmestiev, Bulletin of the London Mathematical Society 51
    (2019) 765–775.
date_created: 2019-08-11T21:59:23Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2025-07-10T11:53:52Z
day: '01'
department:
- _id: HeEd
doi: 10.1112/blms.12276
ec_funded: 1
external_id:
  arxiv:
  - '1903.04929'
  isi:
  - '000478560200001'
fulldoi: https://doi.org/10.1112/blms.12276
intvolume: '        51'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1903.04929
month: '10'
oa: 1
oa_version: Preprint
page: 765-775
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '788183'
  name: Alpha Shape Theory Extended
publication: Bulletin of the London Mathematical Society
publication_identifier:
  eissn:
  - 1469-2120
  issn:
  - 0024-6093
publication_status: published
publisher: London Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Regge symmetry, confocal conics, and the Schläfli formula
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2019'
...
---
_id: '6795'
abstract:
- lang: eng
  text: The green‐beard effect is one proposed mechanism predicted to underpin the
    evolu‐tion of altruistic behavior. It relies on the recognition and the selective
    help of altruists to each other in order to promote and sustain altruistic behavior.
    However, this mechanism has often been dismissed as unlikely or uncommon, as it
    is assumed that both the signaling trait and altruistic trait need to be encoded
    by the same gene or through tightly linked genes. Here, we use models of indirect
    genetic effects (IGEs) to find the minimum correlation between the signaling and
    altruistic trait required for the evolution of the latter. We show that this correlation
    threshold depends on the strength of the interaction (influence of the green beard
    on the expression of the altruistic trait), as well as the costs and benefits
    of the altruistic behavior. We further show that this correlation does not necessarily
    have to be high and support our analytical results by simulations.
article_processing_charge: No
article_type: original
author:
- first_name: Barbora
  full_name: Trubenova, Barbora
  id: 42302D54-F248-11E8-B48F-1D18A9856A87
  last_name: Trubenova
  orcid: 0000-0002-6873-2967
- first_name: Reinmar
  full_name: Hager, Reinmar
  last_name: Hager
citation:
  ama: Trubenova B, Hager R. Green beards in the light of indirect genetic effects.
    <i>Ecology and Evolution</i>. 2019;9(17):9597-9608. doi:<a href="https://doi.org/10.1002/ece3.5484">10.1002/ece3.5484</a>
  apa: Trubenova, B., &#38; Hager, R. (2019). Green beards in the light of indirect
    genetic effects. <i>Ecology and Evolution</i>. Wiley. <a href="https://doi.org/10.1002/ece3.5484">https://doi.org/10.1002/ece3.5484</a>
  chicago: Trubenova, Barbora, and Reinmar Hager. “Green Beards in the Light of Indirect
    Genetic Effects.” <i>Ecology and Evolution</i>. Wiley, 2019. <a href="https://doi.org/10.1002/ece3.5484">https://doi.org/10.1002/ece3.5484</a>.
  ieee: B. Trubenova and R. Hager, “Green beards in the light of indirect genetic
    effects,” <i>Ecology and Evolution</i>, vol. 9, no. 17. Wiley, pp. 9597–9608,
    2019.
  ista: Trubenova B, Hager R. 2019. Green beards in the light of indirect genetic
    effects. Ecology and Evolution. 9(17), 9597–9608.
  mla: Trubenova, Barbora, and Reinmar Hager. “Green Beards in the Light of Indirect
    Genetic Effects.” <i>Ecology and Evolution</i>, vol. 9, no. 17, Wiley, 2019, pp.
    9597–608, doi:<a href="https://doi.org/10.1002/ece3.5484">10.1002/ece3.5484</a>.
  short: B. Trubenova, R. Hager, Ecology and Evolution 9 (2019) 9597–9608.
date_created: 2019-08-11T21:59:24Z
date_published: 2019-09-01T00:00:00Z
date_updated: 2026-04-03T09:50:31Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1002/ece3.5484
ec_funded: 1
external_id:
  isi:
  - '000479973400001'
file:
- access_level: open_access
  checksum: adcb70af4901977d95b8747eeee01bd7
  content_type: application/pdf
  creator: dernst
  date_created: 2019-08-12T07:30:30Z
  date_updated: 2020-07-14T12:47:40Z
  file_id: '6799'
  file_name: 2019_EcologyEvolution_Trubenova.pdf
  file_size: 2839636
  relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
fulldoi: https://doi.org/10.1002/ece3.5484
has_accepted_license: '1'
intvolume: '         9'
isi: 1
issue: '17'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 9597-9608
project:
- _id: 25AEDD42-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '704172'
  name: Rate of Adaptation in Changing Environment
publication: Ecology and Evolution
publication_identifier:
  eissn:
  - 2045-7758
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Green beards in the light of indirect genetic effects
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 9
year: '2019'
...
---
_id: '6818'
abstract:
- lang: eng
  text: Indigoidine is a blue natural pigment, which can be efficiently synthetized
    in E. coli. In addition to its antioxidant and antimicrobial activities indigoidine
    due to its stability and deep blue color can find an application as an industrial,
    environmentally friendly dye. Moreover, similarly to its counterpart regular indigo
    dye, due to its molecular structure, indigoidine is an organic semiconductor.
    Fully conjugated aromatic moiety and intermolecular hydrogen bonding of indigoidine
    result in an unusually narrow bandgap for such a small molecule. This, in its
    turn, result is tight molecular packing in the solid state and opens a path for
    a wide range of application in organic and bio-electronics, such as electrochemical
    and field effect transistors, organic solar cells, light and bio-sensors etc.
article_number: '107768'
article_processing_charge: No
article_type: original
author:
- first_name: Cigdem
  full_name: Yumusak, Cigdem
  last_name: Yumusak
- first_name: Anna Jancik
  full_name: Prochazkova, Anna Jancik
  last_name: Prochazkova
- first_name: Dogukan H
  full_name: Apaydin, Dogukan H
  id: 2FF891BC-F248-11E8-B48F-1D18A9856A87
  last_name: Apaydin
  orcid: 0000-0002-1075-8857
- first_name: Hathaichanok
  full_name: Seelajaroen, Hathaichanok
  last_name: Seelajaroen
- first_name: Niyazi Serdar
  full_name: Sariciftci, Niyazi Serdar
  last_name: Sariciftci
- first_name: Martin
  full_name: Weiter, Martin
  last_name: Weiter
- first_name: Jozef
  full_name: Krajcovic, Jozef
  last_name: Krajcovic
- first_name: Yong
  full_name: Qin, Yong
  last_name: Qin
- first_name: Wei
  full_name: Zhang, Wei
  last_name: Zhang
- first_name: Jixun
  full_name: Zhan, Jixun
  last_name: Zhan
- first_name: Alexander
  full_name: Kovalenko, Alexander
  last_name: Kovalenko
citation:
  ama: Yumusak C, Prochazkova AJ, Apaydin DH, et al. Indigoidine - Biosynthesized
    organic semiconductor. <i>Dyes and Pigments</i>. 2019;171. doi:<a href="https://doi.org/10.1016/j.dyepig.2019.107768">10.1016/j.dyepig.2019.107768</a>
  apa: Yumusak, C., Prochazkova, A. J., Apaydin, D. H., Seelajaroen, H., Sariciftci,
    N. S., Weiter, M., … Kovalenko, A. (2019). Indigoidine - Biosynthesized organic
    semiconductor. <i>Dyes and Pigments</i>. Elsevier. <a href="https://doi.org/10.1016/j.dyepig.2019.107768">https://doi.org/10.1016/j.dyepig.2019.107768</a>
  chicago: Yumusak, Cigdem, Anna Jancik Prochazkova, Dogukan H Apaydin, Hathaichanok
    Seelajaroen, Niyazi Serdar Sariciftci, Martin Weiter, Jozef Krajcovic, et al.
    “Indigoidine - Biosynthesized Organic Semiconductor.” <i>Dyes and Pigments</i>.
    Elsevier, 2019. <a href="https://doi.org/10.1016/j.dyepig.2019.107768">https://doi.org/10.1016/j.dyepig.2019.107768</a>.
  ieee: C. Yumusak <i>et al.</i>, “Indigoidine - Biosynthesized organic semiconductor,”
    <i>Dyes and Pigments</i>, vol. 171. Elsevier, 2019.
  ista: Yumusak C, Prochazkova AJ, Apaydin DH, Seelajaroen H, Sariciftci NS, Weiter
    M, Krajcovic J, Qin Y, Zhang W, Zhan J, Kovalenko A. 2019. Indigoidine - Biosynthesized
    organic semiconductor. Dyes and Pigments. 171, 107768.
  mla: Yumusak, Cigdem, et al. “Indigoidine - Biosynthesized Organic Semiconductor.”
    <i>Dyes and Pigments</i>, vol. 171, 107768, Elsevier, 2019, doi:<a href="https://doi.org/10.1016/j.dyepig.2019.107768">10.1016/j.dyepig.2019.107768</a>.
  short: C. Yumusak, A.J. Prochazkova, D.H. Apaydin, H. Seelajaroen, N.S. Sariciftci,
    M. Weiter, J. Krajcovic, Y. Qin, W. Zhang, J. Zhan, A. Kovalenko, Dyes and Pigments
    171 (2019).
date_created: 2019-08-18T22:00:39Z
date_published: 2019-12-01T00:00:00Z
date_updated: 2023-08-29T07:11:09Z
day: '01'
department:
- _id: MaIb
doi: 10.1016/j.dyepig.2019.107768
external_id:
  isi:
  - '000484870700099'
fulldoi: https://doi.org/10.1016/j.dyepig.2019.107768
intvolume: '       171'
isi: 1
language:
- iso: eng
month: '12'
oa_version: None
publication: Dyes and Pigments
publication_identifier:
  issn:
  - 0143-7208
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Indigoidine - Biosynthesized organic semiconductor
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 171
year: '2019'
...
