---
_id: '10416'
abstract:
- lang: eng
  text: 'A fundamental algorithmic problem at the heart of static analysis is Dyck
    reachability. The input is a graph where the edges are labeled with different
    types of opening and closing parentheses, and the reachability information is
    computed via paths whose parentheses are properly matched. We present new results
    for Dyck reachability problems with applications to alias analysis and data-dependence
    analysis. Our main contributions, that include improved upper bounds as well as
    lower bounds that establish optimality guarantees, are as follows: First, we consider
    Dyck reachability on bidirected graphs, which is the standard way of performing
    field-sensitive points-to analysis. Given a bidirected graph with n nodes and
    m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)),
    where α(n) is the inverse Ackermann function, improving the previously known O(n2)
    time bound; (ii) a matching lower bound that shows that our algorithm is optimal
    wrt to worst-case complexity; and (iii) an optimal average-case upper bound of
    O(m) time, improving the previously known O(m · logn) bound. Second, we consider
    the problem of context-sensitive data-dependence analysis, where the task is to
    obtain analysis summaries of library code in the presence of callbacks. Our algorithm
    preprocesses libraries in almost linear time, after which the contribution of
    the library in the complexity of the client analysis is only linear, and only
    wrt the number of call sites. Third, we prove that combinatorial algorithms for
    Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained
    without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication,
    which is a long-standing open problem. Thus we establish that the existing combinatorial
    algorithms for Dyck reachability are (conditionally) optimal for general graphs.
    We also show that the same hardness holds for graphs of constant treewidth. Finally,
    we provide a prototype implementation of our algorithms for both alias analysis
    and data-dependence analysis. Our experimental evaluation demonstrates that the
    new algorithms significantly outperform all existing methods on the two problems,
    over real-world benchmarks.'
acknowledgement: "The research was partly supported by Austrian Science Fund (FWF)
  Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant
  (279307: Graph Games).\r\n"
article_number: '30'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Bhavya
  full_name: Choudhary, Bhavya
  last_name: Choudhary
- first_name: Andreas
  full_name: Pavlogiannis, Andreas
  id: 49704004-F248-11E8-B48F-1D18A9856A87
  last_name: Pavlogiannis
  orcid: 0000-0002-8943-0722
citation:
  ama: Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence
    and Alias analysis. <i>Proceedings of the ACM on Programming Languages</i>. 2017;2(POPL).
    doi:<a href="https://doi.org/10.1145/3158118">10.1145/3158118</a>
  apa: 'Chatterjee, K., Choudhary, B., &#38; Pavlogiannis, A. (2017). Optimal Dyck
    reachability for data-dependence and Alias analysis. <i>Proceedings of the ACM
    on Programming Languages</i>. Los Angeles, CA, United States: Association for
    Computing Machinery. <a href="https://doi.org/10.1145/3158118">https://doi.org/10.1145/3158118</a>'
  chicago: Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal
    Dyck Reachability for Data-Dependence and Alias Analysis.” <i>Proceedings of the
    ACM on Programming Languages</i>. Association for Computing Machinery, 2017. <a
    href="https://doi.org/10.1145/3158118">https://doi.org/10.1145/3158118</a>.
  ieee: K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability
    for data-dependence and Alias analysis,” <i>Proceedings of the ACM on Programming
    Languages</i>, vol. 2, no. POPL. Association for Computing Machinery, 2017.
  ista: Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability
    for data-dependence and Alias analysis. Proceedings of the ACM on Programming
    Languages. 2(POPL), 30.
  mla: Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence
    and Alias Analysis.” <i>Proceedings of the ACM on Programming Languages</i>, vol.
    2, no. POPL, 30, Association for Computing Machinery, 2017, doi:<a href="https://doi.org/10.1145/3158118">10.1145/3158118</a>.
  short: K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming
    Languages 2 (2017).
conference:
  end_date: 2018-01-13
  location: Los Angeles, CA, United States
  name: 'POPL: Programming Languages'
  start_date: 2018-01-07
corr_author: '1'
date_created: 2021-12-05T23:01:48Z
date_published: 2017-12-27T00:00:00Z
date_updated: 2025-04-15T07:26:20Z
day: '27'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3158118
ec_funded: 1
external_id:
  arxiv:
  - '1910.00241'
file:
- access_level: open_access
  checksum: faa3f7b3fe8aab84b50ed805c26a0ee5
  content_type: application/pdf
  creator: cchlebak
  date_created: 2021-12-07T08:06:28Z
  date_updated: 2021-12-07T08:06:28Z
  file_id: '10421'
  file_name: 2017_ACMProgLang_Chatterjee.pdf
  file_size: 460188
  relation: main_file
  success: 1
file_date_updated: 2021-12-07T08:06:28Z
fulldoi: https://doi.org/10.1145/3158118
has_accepted_license: '1'
intvolume: '         2'
issue: POPL
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P 23499-N23
  name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
  eissn:
  - 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
  record:
  - id: '5455'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Optimal Dyck reachability for data-dependence and Alias analysis
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 2
year: '2017'
...
---
_id: '10418'
abstract:
- lang: eng
  text: We present a new proof rule for proving almost-sure termination of probabilistic
    programs, including those that contain demonic non-determinism. An important question
    for a probabilistic program is whether the probability mass of all its diverging
    runs is zero, that is that it terminates "almost surely". Proving that can be
    hard, and this paper presents a new method for doing so. It applies directly to
    the program's source code, even if the program contains demonic choice. Like others,
    we use variant functions (a.k.a. "super-martingales") that are real-valued and
    decrease randomly on each loop iteration; but our key innovation is that the amount
    as well as the probability of the decrease are parametric. We prove the soundness
    of the new rule, indicate where its applicability goes beyond existing rules,
    and explain its connection to classical results on denumerable (non-demonic) Markov
    chains.
acknowledgement: "McIver and Morgan are grateful to David Basin and the Information
  Security Group at ETH Zürich for hosting a six-month stay in Switzerland, during
  part of which this work began. And thanks particularly to Andreas Lochbihler, who
  shared with us the probabilistic termination problem that led to it. They acknowledge
  the support of ARC grant DP140101119. Part of this work was carried out during the
  Workshop on Probabilistic Programming Semantics\r\nat McGill University’s Bellairs
  Research Institute on Barbados organised by Alexandra Silva and\r\nPrakash Panangaden.
  Kaminski and Katoen are grateful to Sebastian Junges for spotting a flaw in §5.4."
article_number: '33'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Annabelle
  full_name: Mciver, Annabelle
  last_name: Mciver
- first_name: Carroll
  full_name: Morgan, Carroll
  last_name: Morgan
- first_name: Benjamin Lucien
  full_name: Kaminski, Benjamin Lucien
  last_name: Kaminski
- first_name: Joost P
  full_name: Katoen, Joost P
  id: 4524F760-F248-11E8-B48F-1D18A9856A87
  last_name: Katoen
  orcid: 0000-0002-6143-1926
citation:
  ama: Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure
    termination. <i>Proceedings of the ACM on Programming Languages</i>. 2017;2(POPL).
    doi:<a href="https://doi.org/10.1145/3158121">10.1145/3158121</a>
  apa: 'Mciver, A., Morgan, C., Kaminski, B. L., &#38; Katoen, J. P. (2017). A new
    proof rule for almost-sure termination. <i>Proceedings of the ACM on Programming
    Languages</i>. Los Angeles, CA, United States: Association for Computing Machinery.
    <a href="https://doi.org/10.1145/3158121">https://doi.org/10.1145/3158121</a>'
  chicago: Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost
    P Katoen. “A New Proof Rule for Almost-Sure Termination.” <i>Proceedings of the
    ACM on Programming Languages</i>. Association for Computing Machinery, 2017. <a
    href="https://doi.org/10.1145/3158121">https://doi.org/10.1145/3158121</a>.
  ieee: A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule
    for almost-sure termination,” <i>Proceedings of the ACM on Programming Languages</i>,
    vol. 2, no. POPL. Association for Computing Machinery, 2017.
  ista: Mciver A, Morgan C, Kaminski BL, Katoen JP. 2017. A new proof rule for almost-sure
    termination. Proceedings of the ACM on Programming Languages. 2(POPL), 33.
  mla: Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” <i>Proceedings
    of the ACM on Programming Languages</i>, vol. 2, no. POPL, 33, Association for
    Computing Machinery, 2017, doi:<a href="https://doi.org/10.1145/3158121">10.1145/3158121</a>.
  short: A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM
    on Programming Languages 2 (2017).
conference:
  end_date: 2018-01-13
  location: Los Angeles, CA, United States
  name: 'POPL: Programming Languages'
  start_date: 2018-01-07
corr_author: '1'
date_created: 2021-12-05T23:01:49Z
date_published: 2017-12-07T00:00:00Z
date_updated: 2026-06-18T08:40:04Z
day: '07'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/3158121
external_id:
  arxiv:
  - '1711.03588'
fulldoi: https://doi.org/10.1145/3158121
intvolume: '         2'
issue: POPL
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://dl.acm.org/doi/10.1145/3158121
month: '12'
oa: 1
oa_version: Published Version
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
  eissn:
  - 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: A new proof rule for almost-sure termination
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2017'
...
---
_id: '1061'
abstract:
- lang: eng
  text: 'Background: Metabolic engineering and synthetic biology of cyanobacteria
    offer a promising sustainable alternative approach for fossil-based ethylene production,
    by using sunlight via oxygenic photosynthesis, to convert carbon dioxide directly
    into ethylene. Towards this, both well-studied cyanobacteria, i.e., Synechocystis
    sp PCC 6803 and Synechococcus elongatus PCC 7942, have been engineered to produce
    ethylene by introducing the ethylene-forming enzyme (Efe) from Pseudomonas syringae
    pv. phaseolicola PK2 (the Kudzu strain), which catalyzes the conversion of the
    ubiquitous tricarboxylic acid cycle intermediate 2-oxoglutarate into ethylene.
    Results: This study focuses on Synechocystis sp PCC 6803 and shows stable ethylene
    production through the integration of a codon-optimized version of the efe gene
    under control of the Ptrc promoter and the core Shine-Dalgarno sequence (5\''-AGGAGG-3\'')
    as the ribosome-binding site (RBS), at the slr0168 neutral site. We have increased
    ethylene production twofold by RBS screening and further investigated improving
    ethylene production from a single gene copy of efe, using multiple tandem promoters
    and by putting our best construct on an RSF1010-based broad-host-self-replicating
    plasmid, which has a higher copy number than the genome. Moreover, to raise the
    intracellular amounts of the key Efe substrate, 2-oxoglutarate, from which ethylene
    is formed, we constructed a glycogen-synthesis knockout mutant (glgC) and introduced
    the ethylene biosynthetic pathway in it. Under nitrogen limiting conditions, the
    glycogen knockout strain has increased intracellular 2-oxoglutarate levels; however,
    surprisingly, ethylene production was lower in this strain than in the wild-type
    background. Conclusion: Making use of different RBS sequences, production of ethylene
    ranging over a 20-fold difference has been achieved. However, a further increase
    of production through multiple tandem promoters and a broad-host plasmid was not
    achieved speculating that the transcription strength and the gene copy number
    are not the limiting factors in our system.'
article_number: '34'
article_processing_charge: No
author:
- first_name: Vinod
  full_name: Veetil, Vinod
  last_name: Veetil
- first_name: Andreas
  full_name: Angermayr, Andreas
  id: 4677C796-F248-11E8-B48F-1D18A9856A87
  last_name: Angermayr
  orcid: 0000-0001-8619-2223
- first_name: Klaas
  full_name: Hellingwerf, Klaas
  last_name: Hellingwerf
citation:
  ama: Veetil V, Angermayr A, Hellingwerf K. Ethylene production with engineered Synechocystis
    sp PCC 6803 strains. <i>Microbial Cell Factories</i>. 2017;16(1). doi:<a href="https://doi.org/10.1186/s12934-017-0645-5">10.1186/s12934-017-0645-5</a>
  apa: Veetil, V., Angermayr, A., &#38; Hellingwerf, K. (2017). Ethylene production
    with engineered Synechocystis sp PCC 6803 strains. <i>Microbial Cell Factories</i>.
    BioMed Central. <a href="https://doi.org/10.1186/s12934-017-0645-5">https://doi.org/10.1186/s12934-017-0645-5</a>
  chicago: Veetil, Vinod, Andreas Angermayr, and Klaas Hellingwerf. “Ethylene Production
    with Engineered Synechocystis Sp PCC 6803 Strains.” <i>Microbial Cell Factories</i>.
    BioMed Central, 2017. <a href="https://doi.org/10.1186/s12934-017-0645-5">https://doi.org/10.1186/s12934-017-0645-5</a>.
  ieee: V. Veetil, A. Angermayr, and K. Hellingwerf, “Ethylene production with engineered
    Synechocystis sp PCC 6803 strains,” <i>Microbial Cell Factories</i>, vol. 16,
    no. 1. BioMed Central, 2017.
  ista: Veetil V, Angermayr A, Hellingwerf K. 2017. Ethylene production with engineered
    Synechocystis sp PCC 6803 strains. Microbial Cell Factories. 16(1), 34.
  mla: Veetil, Vinod, et al. “Ethylene Production with Engineered Synechocystis Sp
    PCC 6803 Strains.” <i>Microbial Cell Factories</i>, vol. 16, no. 1, 34, BioMed
    Central, 2017, doi:<a href="https://doi.org/10.1186/s12934-017-0645-5">10.1186/s12934-017-0645-5</a>.
  short: V. Veetil, A. Angermayr, K. Hellingwerf, Microbial Cell Factories 16 (2017).
date_created: 2018-12-11T11:49:56Z
date_published: 2017-02-23T00:00:00Z
date_updated: 2023-09-20T12:09:21Z
day: '23'
ddc:
- '579'
doi: 10.1186/s12934-017-0645-5
extern: '1'
external_id:
  isi:
  - '000397733000001'
  pmid:
  - '28231787'
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:16:50Z
  date_updated: 2018-12-12T10:16:50Z
  file_id: '5240'
  file_name: IST-2017-792-v1+1_s12934-017-0645-5.pdf
  file_size: 1361313
  relation: main_file
file_date_updated: 2018-12-12T10:16:50Z
fulldoi: https://doi.org/10.1186/s12934-017-0645-5
has_accepted_license: '1'
intvolume: '        16'
isi: 1
issue: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
pmid: 1
publication: Microbial Cell Factories
publication_identifier:
  issn:
  - '14752859'
publication_status: published
publisher: BioMed Central
publist_id: '6325'
pubrep_id: '792'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ethylene production with engineered Synechocystis sp PCC 6803 strains
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: 16
year: '2017'
...
---
_id: '1062'
abstract:
- lang: eng
  text: Mouse chromaffin cells (MCCs) generate action potential (AP) firing that regulates
    the Ca2+‐dependent release of catecholamines (CAs). Recent findings indicate that
    MCCs possess a variety of spontaneous firing modes that span from the common ‘tonic‐irregular’
    to the less frequent ‘burst’ firing. This latter is evident in a small fraction
    of MCCs but occurs regularly when Nav1.3/1.7 channels are made less available
    or when the Slo1β2‐subunit responsible for BK channel inactivation is deleted.
    Burst firing causes large increases of Ca2+‐entry and potentiates CA release by
    ∼3.5‐fold and thus may be a key mechanism for regulating MCC function. With the
    aim to uncover a physiological role for burst‐firing we investigated the effects
    of acidosis on MCC activity. Lowering the extracellular pH (pHo) from 7.4 to 7.0
    and 6.6 induces cell depolarizations of 10–15 mV that generate repeated bursts.
    Bursts at pHo 6.6 lasted ∼330 ms, occurred at 1–2 Hz and caused an ∼7‐fold increase
    of CA cumulative release. Burst firing originates from the inhibition of the pH‐sensitive
    TASK‐1/TASK‐3 channels and from a 40% BK channel conductance reduction at pHo
    7.0. The same pHo had little or no effect on Nav, Cav, Kv and SK channels that
    support AP firing in MCCs. Burst firing of pHo 6.6 could be mimicked by mixtures
    of the TASK‐1 blocker A1899 (300 nm) and BK blocker paxilline (300 nm) and could
    be prevented by blocking L‐type channels by adding 3 μm nifedipine. Mixtures of
    the two blockers raised cumulative CA‐secretion even more than low pHo (∼12‐fold),
    showing that the action of protons on vesicle release is mainly a result of the
    ionic conductance changes that increase Ca2+‐entry during bursts. Our data provide
    direct evidence suggesting that MCCs respond to low pHo with sustained depolarization,
    burst firing and enhanced CA‐secretion, thus mimicking the physiological response
    of CCs to acute acidosis and hyperkalaemia generated during heavy exercise and
    muscle fatigue.
article_processing_charge: No
author:
- first_name: Laura
  full_name: Guarina, Laura
  last_name: Guarina
- first_name: David H
  full_name: Vandael, David H
  id: 3AE48E0A-F248-11E8-B48F-1D18A9856A87
  last_name: Vandael
  orcid: 0000-0001-7577-1676
- first_name: Valentina
  full_name: Carabelli, Valentina
  last_name: Carabelli
- first_name: Emilio
  full_name: Carbone, Emilio
  last_name: Carbone
citation:
  ama: Guarina L, Vandael DH, Carabelli V, Carbone E. Low pH inf o boosts burst firing
    and catecholamine release by blocking TASK-1 and BK channels while preserving
    Cav1 channels in mouse chromaffin cells. <i>Journal of Physiology</i>. 2017;595(8):2587-2609.
    doi:<a href="https://doi.org/10.1113/JP273735">10.1113/JP273735</a>
  apa: Guarina, L., Vandael, D. H., Carabelli, V., &#38; Carbone, E. (2017). Low pH
    inf o boosts burst firing and catecholamine release by blocking TASK-1 and BK
    channels while preserving Cav1 channels in mouse chromaffin cells. <i>Journal
    of Physiology</i>. Wiley-Blackwell. <a href="https://doi.org/10.1113/JP273735">https://doi.org/10.1113/JP273735</a>
  chicago: Guarina, Laura, David H Vandael, Valentina Carabelli, and Emilio Carbone.
    “Low PH Inf o Boosts Burst Firing and Catecholamine Release by Blocking TASK-1
    and BK Channels While Preserving Cav1 Channels in Mouse Chromaffin Cells.” <i>Journal
    of Physiology</i>. Wiley-Blackwell, 2017. <a href="https://doi.org/10.1113/JP273735">https://doi.org/10.1113/JP273735</a>.
  ieee: L. Guarina, D. H. Vandael, V. Carabelli, and E. Carbone, “Low pH inf o boosts
    burst firing and catecholamine release by blocking TASK-1 and BK channels while
    preserving Cav1 channels in mouse chromaffin cells,” <i>Journal of Physiology</i>,
    vol. 595, no. 8. Wiley-Blackwell, pp. 2587–2609, 2017.
  ista: Guarina L, Vandael DH, Carabelli V, Carbone E. 2017. Low pH inf o boosts burst
    firing and catecholamine release by blocking TASK-1 and BK channels while preserving
    Cav1 channels in mouse chromaffin cells. Journal of Physiology. 595(8), 2587–2609.
  mla: Guarina, Laura, et al. “Low PH Inf o Boosts Burst Firing and Catecholamine
    Release by Blocking TASK-1 and BK Channels While Preserving Cav1 Channels in Mouse
    Chromaffin Cells.” <i>Journal of Physiology</i>, vol. 595, no. 8, Wiley-Blackwell,
    2017, pp. 2587–609, doi:<a href="https://doi.org/10.1113/JP273735">10.1113/JP273735</a>.
  short: L. Guarina, D.H. Vandael, V. Carabelli, E. Carbone, Journal of Physiology
    595 (2017) 2587–2609.
date_created: 2018-12-11T11:49:56Z
date_published: 2017-04-15T00:00:00Z
date_updated: 2023-09-20T12:09:47Z
day: '15'
doi: 10.1113/JP273735
extern: '1'
external_id:
  isi:
  - '000399430300022'
fulldoi: https://doi.org/10.1113/JP273735
intvolume: '       595'
isi: 1
issue: '8'
language:
- iso: eng
month: '04'
oa_version: None
page: '2587 - 2609 '
publication: Journal of Physiology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '6326'
quality_controlled: '1'
status: public
title: Low pH inf o boosts burst firing and catecholamine release by blocking TASK-1
  and BK channels while preserving Cav1 channels in mouse chromaffin cells
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 595
year: '2017'
...
---
_id: '1063'
abstract:
- lang: eng
  text: Severe environmental change can drive a population extinct unless the population
    adapts in time to the new conditions (“evolutionary rescue”). How does biparental
    sexual reproduction influence the chances of population persistence compared to
    clonal reproduction or selfing? In this article, we set up a one‐locus two‐allele
    model for adaptation in diploid species, where rescue is contingent on the establishment
    of the mutant homozygote. Reproduction can occur by random mating, selfing, or
    clonally. Random mating generates and destroys the rescue mutant; selfing is efficient
    at generating it but at the same time depletes the heterozygote, which can lead
    to a low mutant frequency in the standing genetic variation. Due to these (and
    other) antagonistic effects, we find a nontrivial dependence of population survival
    on the rate of sex/selfing, which is strongly influenced by the dominance coefficient
    of the mutation before and after the environmental change. Importantly, since
    mating with the wild‐type breaks the mutant homozygote up, a slow decay of the
    wild‐type population size can impede rescue in randomly mating populations.
article_processing_charge: No
author:
- first_name: Hildegard
  full_name: Uecker, Hildegard
  id: 2DB8F68A-F248-11E8-B48F-1D18A9856A87
  last_name: Uecker
  orcid: 0000-0001-9435-2813
biorxivid: 1
citation:
  ama: Uecker H. Evolutionary rescue in randomly mating, selfing, and clonal populations.
    <i>Evolution</i>. 2017;71(4):845-858. doi:<a href="https://doi.org/10.1111/evo.13191">10.1111/evo.13191</a>
  apa: Uecker, H. (2017). Evolutionary rescue in randomly mating, selfing, and clonal
    populations. <i>Evolution</i>. Wiley. <a href="https://doi.org/10.1111/evo.13191">https://doi.org/10.1111/evo.13191</a>
  chicago: Uecker, Hildegard. “Evolutionary Rescue in Randomly Mating, Selfing, and
    Clonal Populations.” <i>Evolution</i>. Wiley, 2017. <a href="https://doi.org/10.1111/evo.13191">https://doi.org/10.1111/evo.13191</a>.
  ieee: H. Uecker, “Evolutionary rescue in randomly mating, selfing, and clonal populations,”
    <i>Evolution</i>, vol. 71, no. 4. Wiley, pp. 845–858, 2017.
  ista: Uecker H. 2017. Evolutionary rescue in randomly mating, selfing, and clonal
    populations. Evolution. 71(4), 845–858.
  mla: Uecker, Hildegard. “Evolutionary Rescue in Randomly Mating, Selfing, and Clonal
    Populations.” <i>Evolution</i>, vol. 71, no. 4, Wiley, 2017, pp. 845–58, doi:<a
    href="https://doi.org/10.1111/evo.13191">10.1111/evo.13191</a>.
  short: H. Uecker, Evolution 71 (2017) 845–858.
das_tickbox: '1'
date_created: 2018-12-11T11:49:57Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2026-06-22T14:05:53Z
day: '01'
department:
- _id: NiBa
doi: 10.1111/evo.13191
ec_funded: 1
external_id:
  biorxivid:
  - 10.1101/081042
  isi:
  - '000398545200003'
fulldoi: https://doi.org/10.1111/evo.13191
intvolume: '        71'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1101/081042
month: '04'
oa: 1
oa_version: Submitted Version
page: 845 - 858
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '250152'
  name: Limits to selection in biology and in evolutionary computation
publication: Evolution
publication_identifier:
  issn:
  - 0014-3820
publication_status: published
publisher: Wiley
publist_id: '6327'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolutionary rescue in randomly mating, selfing, and clonal populations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 71
year: '2017'
...
---
_id: '1065'
abstract:
- lang: eng
  text: 'We consider the problem of reachability in pushdown graphs. We study the
    problem for pushdown graphs with constant treewidth. Even for pushdown graphs
    with treewidth 1, for the reachability problem we establish the following: (i)
    the problem is PTIME-complete, and (ii) any subcubic algorithm for the problem
    would contradict the k-clique conjecture and imply faster combinatorial algorithms
    for cliques in graphs.'
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: Georg F
  full_name: Osang, Georg F
  id: 464B40D6-F248-11E8-B48F-1D18A9856A87
  last_name: Osang
  orcid: 0000-0002-8882-5116
citation:
  ama: Chatterjee K, Osang GF. Pushdown reachability with constant treewidth. <i>Information
    Processing Letters</i>. 2017;122:25-29. doi:<a href="https://doi.org/10.1016/j.ipl.2017.02.003">10.1016/j.ipl.2017.02.003</a>
  apa: Chatterjee, K., &#38; Osang, G. F. (2017). Pushdown reachability with constant
    treewidth. <i>Information Processing Letters</i>. Elsevier. <a href="https://doi.org/10.1016/j.ipl.2017.02.003">https://doi.org/10.1016/j.ipl.2017.02.003</a>
  chicago: Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with
    Constant Treewidth.” <i>Information Processing Letters</i>. Elsevier, 2017. <a
    href="https://doi.org/10.1016/j.ipl.2017.02.003">https://doi.org/10.1016/j.ipl.2017.02.003</a>.
  ieee: K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,”
    <i>Information Processing Letters</i>, vol. 122. Elsevier, pp. 25–29, 2017.
  ista: Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth.
    Information Processing Letters. 122, 25–29.
  mla: Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant
    Treewidth.” <i>Information Processing Letters</i>, vol. 122, Elsevier, 2017, pp.
    25–29, doi:<a href="https://doi.org/10.1016/j.ipl.2017.02.003">10.1016/j.ipl.2017.02.003</a>.
  short: K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.
date_created: 2018-12-11T11:49:57Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-07-10T11:49:53Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
- _id: HeEd
doi: 10.1016/j.ipl.2017.02.003
ec_funded: 1
external_id:
  isi:
  - '000399506600005'
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:13:17Z
  date_updated: 2019-10-15T07:44:51Z
  file_id: '4998'
  file_name: IST-2018-991-v1+2_2018_Chatterjee_Pushdown_PREPRINT.pdf
  file_size: 247657
  relation: main_file
file_date_updated: 2019-10-15T07:44:51Z
fulldoi: https://doi.org/10.1016/j.ipl.2017.02.003
has_accepted_license: '1'
intvolume: '       122'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 25 - 29
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P 23499-N23
  name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11407
  name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
publication: Information Processing Letters
publication_identifier:
  issn:
  - 0020-0190
publication_status: published
publisher: Elsevier
publist_id: '6323'
pubrep_id: '991'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Pushdown reachability with constant treewidth
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 122
year: '2017'
...
---
OA_place: publisher
OA_type: free access
_id: '1066'
abstract:
- lang: eng
  text: "Simulation is an attractive alternative to language inclusion for automata
    as it is an under-approximation of language inclusion, but usually has much lower
    complexity. Simulation has also been extended in two orthogonal directions, namely,
    (1) fair simulation, for simulation over specified set of infinite runs; and (2)
    quantitative simulation, for simulation between weighted automata. While fair
    trace inclusion is PSPACE-complete, fair simulation can be computed in polynomial
    time. For weighted automata, the (quantitative) language inclusion problem is
    undecidable in general, whereas the (quantitative) simulation reduces to quantitative
    games, which admit pseudo-polynomial time algorithms.\r\n\r\nIn this work, we
    study (quantitative) simulation for weighted automata with Büchi acceptance conditions,
    i.e., we generalize fair simulation from non-weighted automata to weighted automata.
    We show that imposing Büchi acceptance conditions on weighted automata changes
    many fundamental properties of the simulation games, yet they still admit pseudo-polynomial
    time algorithms."
acknowledgement: This research was funded in part by the European Research Council
  (ERC) under grant agreements 267989 (QUAREM), 279307 (Graph Games), by the Austrian
  Science Fund (FWF) projects S11402-N23 (RiSE), S11407-N23 (RiSE), P23499-N23, and
  Microsoft faculty fellows award.
article_processing_charge: No
article_type: original
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Jan
  full_name: Otop, Jan
  id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
  last_name: Otop
- first_name: Yaron
  full_name: Velner, Yaron
  last_name: Velner
citation:
  ama: Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative fair simulation
    games. <i>Information and Computation</i>. 2017;254(2):143-166. doi:<a href="https://doi.org/10.1016/j.ic.2016.10.006">10.1016/j.ic.2016.10.006</a>
  apa: Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Velner, Y. (2017). Quantitative
    fair simulation games. <i>Information and Computation</i>. Elsevier. <a href="https://doi.org/10.1016/j.ic.2016.10.006">https://doi.org/10.1016/j.ic.2016.10.006</a>
  chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner.
    “Quantitative Fair Simulation Games.” <i>Information and Computation</i>. Elsevier,
    2017. <a href="https://doi.org/10.1016/j.ic.2016.10.006">https://doi.org/10.1016/j.ic.2016.10.006</a>.
  ieee: K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair
    simulation games,” <i>Information and Computation</i>, vol. 254, no. 2. Elsevier,
    pp. 143–166, 2017.
  ista: Chatterjee K, Henzinger TA, Otop J, Velner Y. 2017. Quantitative fair simulation
    games. Information and Computation. 254(2), 143–166.
  mla: Chatterjee, Krishnendu, et al. “Quantitative Fair Simulation Games.” <i>Information
    and Computation</i>, vol. 254, no. 2, Elsevier, 2017, pp. 143–66, doi:<a href="https://doi.org/10.1016/j.ic.2016.10.006">10.1016/j.ic.2016.10.006</a>.
  short: K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Information and Computation
    254 (2017) 143–166.
corr_author: '1'
date_created: 2018-12-11T11:49:58Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2026-06-18T08:47:01Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.ic.2016.10.006
ec_funded: 1
external_id:
  isi:
  - '000402025600002'
fulldoi: https://doi.org/10.1016/j.ic.2016.10.006
intvolume: '       254'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1016/j.ic.2016.10.006
month: '06'
oa: 1
oa_version: Published Version
page: 143 - 166
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 2584A770-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P 23499-N23
  name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
  name: Microsoft Research Faculty Fellowship
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '6322'
quality_controlled: '1'
related_material:
  record:
  - id: '5428'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Quantitative fair simulation games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 254
year: '2017'
...
---
_id: '10663'
abstract:
- lang: eng
  text: 'The superconducting state of matter enables one to observe quantum effects
    on the macroscopic scale and hosts many fascinating phenomena. Topological defects
    of the superconducting order parameter, such as vortices and fluxoid states in
    multiply connected structures, are often the key ingredients of these phenomena.
    This dissertation describes a new mode of magnetic force microscopy (Φ0-MFM) for
    investigating vortex and fluxoid sates in mesoscopic superconducting (SC) structures.
    The technique relies on the magneto-mechanical coupling of a MFM cantilever to
    the motion of fluxons. The novelty of the technique is that a magnetic particle
    attached to the cantilever is used not only to sense the state of a SC structure,
    but also as a primary source of the inhomogeneous magnetic field which induces
    that state. Φ0-MFM enables us to map the transitions between tip-induced states
    during a scan: at the positions of the tip, where the two lowest energy states
    become degenerate, small oscillations of the tip drive the transitions between
    these states, which causes a significant shift in the resonant frequency and dissipation
    of the cantilever. For narrow-wall aluminum rings, the mapped fluxoid transitions
    form concentric contours on a scan. We show that the changes in the cantilever
    resonant frequency and dissipation are well-described by a stochastic resonance
    (SR) of cantilever-driven thermally activated phase slips (TAPS). The SR model
    allows us to experimentally determine the rate of TAPS and compare it to the Langer-Ambegaokar-McCumber-Halperin
    (LAMH) theory for TAPS in 1D superconducting structures. Further, we use the SR
    model to qualitatively study the effects of a locally applied magnetic field on
    the phase slip rate in rings containing constrictions. The states with multiple
    vortices or winding numbers could be useful for the development of novel superconducting
    devices, or the study of vortex interactions and interference effects. Using Φ0-MFM
    allows us to induce, probe and control fluxoid states in thin wall structures
    comprised of multiple loops. We show that Φ0-MFM images of the fluxoid transitions
    allow us to identify the underlying states and to investigate their energetics
    and dynamics even in complicated structures.'
alternative_title:
- Graduate Dissertations and Theses at Illinois
article_processing_charge: No
author:
- first_name: Hryhoriy
  full_name: Polshyn, Hryhoriy
  id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
  last_name: Polshyn
  orcid: 0000-0001-8223-8896
citation:
  ama: Polshyn H. Magnetic force microscopy studies of mesoscopic superconducting
    structures. 2017.
  apa: Polshyn, H. (2017). <i>Magnetic force microscopy studies of mesoscopic superconducting
    structures</i>. University of Illinois at Urbana-Champaign.
  chicago: Polshyn, Hryhoriy. “Magnetic Force Microscopy Studies of Mesoscopic Superconducting
    Structures.” University of Illinois at Urbana-Champaign, 2017.
  ieee: H. Polshyn, “Magnetic force microscopy studies of mesoscopic superconducting
    structures,” University of Illinois at Urbana-Champaign, 2017.
  ista: Polshyn H. 2017. Magnetic force microscopy studies of mesoscopic superconducting
    structures. University of Illinois at Urbana-Champaign.
  mla: Polshyn, Hryhoriy. <i>Magnetic Force Microscopy Studies of Mesoscopic Superconducting
    Structures</i>. University of Illinois at Urbana-Champaign, 2017.
  short: H. Polshyn, Magnetic Force Microscopy Studies of Mesoscopic Superconducting
    Structures, University of Illinois at Urbana-Champaign, 2017.
date_created: 2022-01-25T14:54:14Z
date_published: 2017-09-18T00:00:00Z
date_updated: 2024-10-14T11:13:43Z
day: '18'
degree_awarded: PhD
extern: '1'
keyword:
- physics
- superconductivity
- magnetic force microscopy
- phase slips
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://hdl.handle.net/2142/99178
month: '09'
oa: 1
oa_version: Published Version
page: '103'
publication_status: published
publisher: University of Illinois at Urbana-Champaign
status: public
supervisor:
- first_name: Raffi
  full_name: Budakian, Raffi
  last_name: Budakian
title: Magnetic force microscopy studies of mesoscopic superconducting structures
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '1067'
abstract:
- lang: eng
  text: Embryo morphogenesis relies on highly coordinated movements of different tissues.
    However, remarkably little is known about how tissues coordinate their movements
    to shape the embryo. In zebrafish embryogenesis, coordinated tissue movements
    first become apparent during “doming,” when the blastoderm begins to spread over
    the yolk sac, a process involving coordinated epithelial surface cell layer expansion
    and mesenchymal deep cell intercalations. Here, we find that active surface cell
    expansion represents the key process coordinating tissue movements during doming.
    By using a combination of theory and experiments, we show that epithelial surface
    cells not only trigger blastoderm expansion by reducing tissue surface tension,
    but also drive blastoderm thinning by inducing tissue contraction through radial
    deep cell intercalations. Thus, coordinated tissue expansion and thinning during
    doming relies on surface cells simultaneously controlling tissue surface tension
    and radial tissue contraction.
acknowledged_ssus:
- _id: PreCl
article_processing_charge: No
author:
- first_name: Hitoshi
  full_name: Morita, Hitoshi
  id: 4C6E54C6-F248-11E8-B48F-1D18A9856A87
  last_name: Morita
- first_name: Silvia
  full_name: Grigolon, Silvia
  last_name: Grigolon
- first_name: Martin
  full_name: Bock, Martin
  last_name: Bock
- first_name: Gabriel
  full_name: Krens, Gabriel
  id: 2B819732-F248-11E8-B48F-1D18A9856A87
  last_name: Krens
  orcid: 0000-0003-4761-5996
- first_name: Guillaume
  full_name: Salbreux, Guillaume
  last_name: Salbreux
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
citation:
  ama: Morita H, Grigolon S, Bock M, Krens G, Salbreux G, Heisenberg C-PJ. The physical
    basis of coordinated tissue spreading in zebrafish gastrulation. <i>Developmental
    Cell</i>. 2017;40(4):354-366. doi:<a href="https://doi.org/10.1016/j.devcel.2017.01.010">10.1016/j.devcel.2017.01.010</a>
  apa: Morita, H., Grigolon, S., Bock, M., Krens, G., Salbreux, G., &#38; Heisenberg,
    C.-P. J. (2017). The physical basis of coordinated tissue spreading in zebrafish
    gastrulation. <i>Developmental Cell</i>. Cell Press. <a href="https://doi.org/10.1016/j.devcel.2017.01.010">https://doi.org/10.1016/j.devcel.2017.01.010</a>
  chicago: Morita, Hitoshi, Silvia Grigolon, Martin Bock, Gabriel Krens, Guillaume
    Salbreux, and Carl-Philipp J Heisenberg. “The Physical Basis of Coordinated Tissue
    Spreading in Zebrafish Gastrulation.” <i>Developmental Cell</i>. Cell Press, 2017.
    <a href="https://doi.org/10.1016/j.devcel.2017.01.010">https://doi.org/10.1016/j.devcel.2017.01.010</a>.
  ieee: H. Morita, S. Grigolon, M. Bock, G. Krens, G. Salbreux, and C.-P. J. Heisenberg,
    “The physical basis of coordinated tissue spreading in zebrafish gastrulation,”
    <i>Developmental Cell</i>, vol. 40, no. 4. Cell Press, pp. 354–366, 2017.
  ista: Morita H, Grigolon S, Bock M, Krens G, Salbreux G, Heisenberg C-PJ. 2017.
    The physical basis of coordinated tissue spreading in zebrafish gastrulation.
    Developmental Cell. 40(4), 354–366.
  mla: Morita, Hitoshi, et al. “The Physical Basis of Coordinated Tissue Spreading
    in Zebrafish Gastrulation.” <i>Developmental Cell</i>, vol. 40, no. 4, Cell Press,
    2017, pp. 354–66, doi:<a href="https://doi.org/10.1016/j.devcel.2017.01.010">10.1016/j.devcel.2017.01.010</a>.
  short: H. Morita, S. Grigolon, M. Bock, G. Krens, G. Salbreux, C.-P.J. Heisenberg,
    Developmental Cell 40 (2017) 354–366.
corr_author: '1'
date_created: 2018-12-11T11:49:58Z
date_published: 2017-02-27T00:00:00Z
date_updated: 2025-07-10T11:49:55Z
day: '27'
ddc:
- '572'
- '597'
department:
- _id: CaHe
doi: 10.1016/j.devcel.2017.01.010
ec_funded: 1
external_id:
  isi:
  - '000395368300007'
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:10:57Z
  date_updated: 2018-12-12T10:10:57Z
  file_id: '4849'
  file_name: IST-2017-869-v1+1_1-s2.0-S1534580717300370-main.pdf
  file_size: 6866187
  relation: main_file
file_date_updated: 2018-12-12T10:10:57Z
fulldoi: https://doi.org/10.1016/j.devcel.2017.01.010
has_accepted_license: '1'
intvolume: '        40'
isi: 1
issue: '4'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 354 - 366
project:
- _id: 2524F500-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '201439'
  name: Developing High-Throughput Bioassays for Human Cancers in Zebrafish
publication: Developmental Cell
publication_identifier:
  issn:
  - 1534-5807
publication_status: published
publisher: Cell Press
publist_id: '6320'
pubrep_id: '869'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The physical basis of coordinated tissue spreading in zebrafish gastrulation
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: 40
year: '2017'
...
---
_id: '1072'
abstract:
- lang: eng
  text: Given a finite set of points in Rn and a radius parameter, we study the Čech,
    Delaunay–Čech, Delaunay (or alpha), and Wrap complexes in the light of generalized
    discrete Morse theory. Establishing the Čech and Delaunay complexes as sublevel
    sets of generalized discrete Morse functions, we prove that the four complexes
    are simple-homotopy equivalent by a sequence of simplicial collapses, which are
    explicitly described by a single discrete gradient field.
acknowledgement: This research has been supported by the EU project Toposys(FP7-ICT-318493-STREP),
  by ESF under the ACAT Research Network Programme, by the Russian Government under
  mega project 11.G34.31.0053, and by the DFG Collaborative Research Center SFB/TRR
  109 “Discretization in Geometry and Dynamics”.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Ulrich
  full_name: Bauer, Ulrich
  id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
  last_name: Bauer
  orcid: 0000-0002-9683-0724
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
citation:
  ama: Bauer U, Edelsbrunner H. The Morse theory of Čech and delaunay complexes. <i>Transactions
    of the American Mathematical Society</i>. 2017;369(5):3741-3762. doi:<a href="https://doi.org/10.1090/tran/6991">10.1090/tran/6991</a>
  apa: Bauer, U., &#38; Edelsbrunner, H. (2017). The Morse theory of Čech and delaunay
    complexes. <i>Transactions of the American Mathematical Society</i>. American
    Mathematical Society. <a href="https://doi.org/10.1090/tran/6991">https://doi.org/10.1090/tran/6991</a>
  chicago: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and
    Delaunay Complexes.” <i>Transactions of the American Mathematical Society</i>.
    American Mathematical Society, 2017. <a href="https://doi.org/10.1090/tran/6991">https://doi.org/10.1090/tran/6991</a>.
  ieee: U. Bauer and H. Edelsbrunner, “The Morse theory of Čech and delaunay complexes,”
    <i>Transactions of the American Mathematical Society</i>, vol. 369, no. 5. American
    Mathematical Society, pp. 3741–3762, 2017.
  ista: Bauer U, Edelsbrunner H. 2017. The Morse theory of Čech and delaunay complexes.
    Transactions of the American Mathematical Society. 369(5), 3741–3762.
  mla: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay
    Complexes.” <i>Transactions of the American Mathematical Society</i>, vol. 369,
    no. 5, American Mathematical Society, 2017, pp. 3741–62, doi:<a href="https://doi.org/10.1090/tran/6991">10.1090/tran/6991</a>.
  short: U. Bauer, H. Edelsbrunner, Transactions of the American Mathematical Society
    369 (2017) 3741–3762.
date_created: 2018-12-11T11:49:59Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2025-04-15T08:37:54Z
day: '01'
department:
- _id: HeEd
doi: 10.1090/tran/6991
ec_funded: 1
external_id:
  arxiv:
  - '1312.1231'
  isi:
  - '000398030400024'
fulldoi: https://doi.org/10.1090/tran/6991
intvolume: '       369'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1312.1231
month: '05'
oa: 1
oa_version: Preprint
page: 3741 - 3762
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '318493'
  name: Topological Complex Systems
publication: Transactions of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
publist_id: '6311'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Morse theory of Čech and delaunay complexes
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 369
year: '2017'
...
---
_id: '1073'
abstract:
- lang: eng
  text: Let X and Y be finite simplicial sets (e.g. finite simplicial complexes),
    both equipped with a free simplicial action of a finite group G. Assuming that
    Y is d-connected and dimX≤2d, for some d≥1, we provide an algorithm that computes
    the set of all equivariant homotopy classes of equivariant continuous maps |X|→|Y|;
    the existence of such a map can be decided even for dimX≤2d+1. This yields the
    first algorithm for deciding topological embeddability of a k-dimensional finite
    simplicial complex into Rn under the condition k≤23n−1. More generally, we present
    an algorithm that, given a lifting-extension problem satisfying an appropriate
    stability assumption, computes the set of all homotopy classes of solutions. This
    result is new even in the non-equivariant situation.
article_processing_charge: No
arxiv: 1
author:
- first_name: Martin
  full_name: Čadek, Martin
  last_name: Čadek
- first_name: Marek
  full_name: Krcál, Marek
  id: 33E21118-F248-11E8-B48F-1D18A9856A87
  last_name: Krcál
- first_name: Lukáš
  full_name: Vokřínek, Lukáš
  last_name: Vokřínek
citation:
  ama: Čadek M, Krcál M, Vokřínek L. Algorithmic solvability of the lifting extension
    problem. <i>Discrete &#38; Computational Geometry</i>. 2017;54(4):915-965. doi:<a
    href="https://doi.org/10.1007/s00454-016-9855-6">10.1007/s00454-016-9855-6</a>
  apa: Čadek, M., Krcál, M., &#38; Vokřínek, L. (2017). Algorithmic solvability of
    the lifting extension problem. <i>Discrete &#38; Computational Geometry</i>. Springer.
    <a href="https://doi.org/10.1007/s00454-016-9855-6">https://doi.org/10.1007/s00454-016-9855-6</a>
  chicago: Čadek, Martin, Marek Krcál, and Lukáš Vokřínek. “Algorithmic Solvability
    of the Lifting Extension Problem.” <i>Discrete &#38; Computational Geometry</i>.
    Springer, 2017. <a href="https://doi.org/10.1007/s00454-016-9855-6">https://doi.org/10.1007/s00454-016-9855-6</a>.
  ieee: M. Čadek, M. Krcál, and L. Vokřínek, “Algorithmic solvability of the lifting
    extension problem,” <i>Discrete &#38; Computational Geometry</i>, vol. 54, no.
    4. Springer, pp. 915–965, 2017.
  ista: Čadek M, Krcál M, Vokřínek L. 2017. Algorithmic solvability of the lifting
    extension problem. Discrete &#38; Computational Geometry. 54(4), 915–965.
  mla: Čadek, Martin, et al. “Algorithmic Solvability of the Lifting Extension Problem.”
    <i>Discrete &#38; Computational Geometry</i>, vol. 54, no. 4, Springer, 2017,
    pp. 915–65, doi:<a href="https://doi.org/10.1007/s00454-016-9855-6">10.1007/s00454-016-9855-6</a>.
  short: M. Čadek, M. Krcál, L. Vokřínek, Discrete &#38; Computational Geometry 54
    (2017) 915–965.
date_created: 2018-12-11T11:50:00Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-06-04T08:11:10Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-016-9855-6
external_id:
  arxiv:
  - '1307.6444'
  isi:
  - '000400072700008'
fulldoi: https://doi.org/10.1007/s00454-016-9855-6
intvolume: '        54'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1307.6444
month: '06'
oa: 1
oa_version: Submitted Version
page: 915 - 965
publication: Discrete & Computational Geometry
publication_identifier:
  issn:
  - '01795376'
publication_status: published
publisher: Springer
publist_id: '6309'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithmic solvability of the lifting extension problem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2017'
...
---
_id: '1074'
abstract:
- lang: eng
  text: Recently it has become feasible to detect long blocks of nearly identical
    sequence shared between pairs of genomes. These IBD blocks are direct traces of
    recent coalescence events and, as such, contain ample signal to infer recent demography.
    Here, we examine sharing of such blocks in two-dimensional populations with local
    migration. Using a diffusion approximation to trace genetic ancestry, we derive
    analytical formulae for patterns of isolation by distance of IBD blocks, which
    can also incorporate recent population density changes. We introduce an inference
    scheme that uses a composite likelihood approach to fit these formulae. We then
    extensively evaluate our theory and inference method on a range of scenarios using
    simulated data. We first validate the diffusion approximation by showing that
    the theoretical results closely match the simulated block sharing patterns. We
    then demonstrate that our inference scheme can accurately and robustly infer dispersal
    rate and effective density, as well as bounds on recent dynamics of population
    density. To demonstrate an application, we use our estimation scheme to explore
    the fit of a diffusion model to Eastern European samples in the POPRES data set.
    We show that ancestry diffusing with a rate of σ ≈ 50–100 km/√gen during the last
    centuries, combined with accelerating population growth, can explain the observed
    exponential decay of block sharing with increasing pairwise sample distance.
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
- first_name: Graham
  full_name: Coop, Graham
  last_name: Coop
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
citation:
  ama: Ringbauer H, Coop G, Barton NH. Inferring recent demography from isolation
    by distance of long shared sequence blocks. <i>Genetics</i>. 2017;205(3):1335-1351.
    doi:<a href="https://doi.org/10.1534/genetics.116.196220">10.1534/genetics.116.196220</a>
  apa: Ringbauer, H., Coop, G., &#38; Barton, N. H. (2017). Inferring recent demography
    from isolation by distance of long shared sequence blocks. <i>Genetics</i>. Genetics
    Society of America. <a href="https://doi.org/10.1534/genetics.116.196220">https://doi.org/10.1534/genetics.116.196220</a>
  chicago: Ringbauer, Harald, Graham Coop, and Nicholas H Barton. “Inferring Recent
    Demography from Isolation by Distance of Long Shared Sequence Blocks.” <i>Genetics</i>.
    Genetics Society of America, 2017. <a href="https://doi.org/10.1534/genetics.116.196220">https://doi.org/10.1534/genetics.116.196220</a>.
  ieee: H. Ringbauer, G. Coop, and N. H. Barton, “Inferring recent demography from
    isolation by distance of long shared sequence blocks,” <i>Genetics</i>, vol. 205,
    no. 3. Genetics Society of America, pp. 1335–1351, 2017.
  ista: Ringbauer H, Coop G, Barton NH. 2017. Inferring recent demography from isolation
    by distance of long shared sequence blocks. Genetics. 205(3), 1335–1351.
  mla: Ringbauer, Harald, et al. “Inferring Recent Demography from Isolation by Distance
    of Long Shared Sequence Blocks.” <i>Genetics</i>, vol. 205, no. 3, Genetics Society
    of America, 2017, pp. 1335–51, doi:<a href="https://doi.org/10.1534/genetics.116.196220">10.1534/genetics.116.196220</a>.
  short: H. Ringbauer, G. Coop, N.H. Barton, Genetics 205 (2017) 1335–1351.
date_created: 2018-12-11T11:50:00Z
date_published: 2017-03-01T00:00:00Z
date_updated: 2026-04-08T14:06:35Z
day: '01'
department:
- _id: NiBa
doi: 10.1534/genetics.116.196220
ec_funded: 1
external_id:
  isi:
  - '000395807200023'
fulldoi: https://doi.org/10.1534/genetics.116.196220
intvolume: '       205'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.biorxiv.org/content/early/2016/09/23/076810
month: '03'
oa: 1
oa_version: Preprint
page: 1335 - 1351
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '250152'
  name: Limits to selection in biology and in evolutionary computation
publication: Genetics
publication_identifier:
  issn:
  - 0016-6731
publication_status: published
publisher: Genetics Society of America
publist_id: '6307'
quality_controlled: '1'
related_material:
  record:
  - id: '200'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Inferring recent demography from isolation by distance of long shared sequence
  blocks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 205
year: '2017'
...
---
_id: '10745'
abstract:
- lang: eng
  text: New ways to investigate and manipulate fluxoid and vortex states of mesoscopic
    superconducting structures are of great interest. The states with multiple vortices
    or winding numbers could be useful for the study of vortex interactions and interference
    effects, the braiding of Majorana bound states by winding vortices, and the development
    of novel superconducting devices. We demonstrate a methodology based on magnetic
    force microscopy that allows us to induce, probe and control fluxoid states in
    thin wall structures comprised of multiple loops. By using micro-magnet as a source
    of inhomogeneous magnetic field, we can efficiently explore the configuration
    space of fluxoid states. Scanning over the structure reveals the energy crossing
    points of the lowest laying fluxoid states. This is due the strong interaction
    of cantilever with thermally activated fluxoid transitions at points of degeneracy.
    We show that measured patterns of fluxoid transitions allow to identify the states,
    investigate their energetics, and manipulate them. Further, we show that the dynamics
    of driven fluxoid transitions can be described by stochastic resonance model,
    which provides a unique way of measuring fluxoid transition rate and related energy
    barrier for chosen transitions even in complicated structures
alternative_title:
- Bulletin of the American Physical Society
article_number: P39.00011
article_processing_charge: No
author:
- first_name: Hryhoriy
  full_name: Polshyn, Hryhoriy
  id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
  last_name: Polshyn
  orcid: 0000-0001-8223-8896
- first_name: Tyler
  full_name: Naibert, Tyler
  last_name: Naibert
- first_name: Raffi
  full_name: Budakian, Raffi
  last_name: Budakian
citation:
  ama: 'Polshyn H, Naibert T, Budakian R.  Probing and controlling fluxoid states
    in multiply-connected mesoscopic superconducting structures. In: <i>APS March
    Meeting 2017</i>. Vol 62. American Physical Society; 2017.'
  apa: 'Polshyn, H., Naibert, T., &#38; Budakian, R. (2017).  Probing and controlling
    fluxoid states in multiply-connected mesoscopic superconducting structures. In
    <i>APS March Meeting 2017</i> (Vol. 62). New Orleans, LA, United States: American
    Physical Society.'
  chicago: Polshyn, Hryhoriy, Tyler Naibert, and Raffi Budakian. “ Probing and Controlling
    Fluxoid States in Multiply-Connected Mesoscopic Superconducting Structures.” In
    <i>APS March Meeting 2017</i>, Vol. 62. American Physical Society, 2017.
  ieee: H. Polshyn, T. Naibert, and R. Budakian, “ Probing and controlling fluxoid
    states in multiply-connected mesoscopic superconducting structures,” in <i>APS
    March Meeting 2017</i>, New Orleans, LA, United States, 2017, vol. 62, no. 4.
  ista: 'Polshyn H, Naibert T, Budakian R. 2017.  Probing and controlling fluxoid
    states in multiply-connected mesoscopic superconducting structures. APS March
    Meeting 2017. APS: American Physical Society, Bulletin of the American Physical
    Society, vol. 62, P39.00011.'
  mla: Polshyn, Hryhoriy, et al. “ Probing and Controlling Fluxoid States in Multiply-Connected
    Mesoscopic Superconducting Structures.” <i>APS March Meeting 2017</i>, vol. 62,
    no. 4, P39.00011, American Physical Society, 2017.
  short: H. Polshyn, T. Naibert, R. Budakian, in:, APS March Meeting 2017, American
    Physical Society, 2017.
conference:
  end_date: 2017-03-17
  location: New Orleans, LA, United States
  name: 'APS: American Physical Society'
  start_date: 2017-03-13
date_created: 2022-02-08T09:49:17Z
date_published: 2017-03-01T00:00:00Z
date_updated: 2022-02-08T10:44:35Z
day: '01'
extern: '1'
intvolume: '        62'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://meetings.aps.org/Meeting/MAR17/Session/P39.11
month: '03'
oa: 1
oa_version: Published Version
publication: APS March Meeting 2017
publication_identifier:
  issn:
  - 0003-0503
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: ' Probing and controlling fluxoid states in multiply-connected mesoscopic superconducting
  structures'
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 62
year: '2017'
...
---
_id: '1075'
alternative_title:
- American Studies in Austria
author:
- first_name: Bernhard
  full_name: Wenzl, Bernhard
  id: 479E9046-F248-11E8-B48F-1D18A9856A87
  last_name: Wenzl
citation:
  ama: 'Wenzl B. An American in Allied-occupied Austria: John Dos Passos Reports on
    &#38;quot;The Vienna Frontier&#38;quot; In: Parker J, Poole R, eds. <i>Austria
    and America: 20th-Century Cross-Cultural Encounters</i>. Vol 15. LIT Verlag Berlin-Münster-Wien-Zürich-London;
    2017:73-80.'
  apa: 'Wenzl, B. (2017). An American in Allied-occupied Austria: John Dos Passos
    Reports on &#38;quot;The Vienna Frontier&#38;quot; In J. Parker &#38; R. Poole
    (Eds.), <i>Austria and America: 20th-Century Cross-Cultural Encounters</i> (Vol.
    15, pp. 73–80). LIT Verlag Berlin-Münster-Wien-Zürich-London.'
  chicago: 'Wenzl, Bernhard. “An American in Allied-Occupied Austria: John Dos Passos
    Reports on &#38;quot;The Vienna Frontier&#38;quot;” In <i>Austria and America:
    20th-Century Cross-Cultural Encounters</i>, edited by Joshua Parker and Ralph
    Poole, 15:73–80. LIT Verlag Berlin-Münster-Wien-Zürich-London, 2017.'
  ieee: 'B. Wenzl, “An American in Allied-occupied Austria: John Dos Passos Reports
    on &#38;quot;The Vienna Frontier&#38;quot;,” in <i>Austria and America: 20th-Century
    Cross-Cultural Encounters</i>, vol. 15, J. Parker and R. Poole, Eds. LIT Verlag
    Berlin-Münster-Wien-Zürich-London, 2017, pp. 73–80.'
  ista: 'Wenzl B. 2017.An American in Allied-occupied Austria: John Dos Passos Reports
    on &#38;quot;The Vienna Frontier&#38;quot; In: Austria and America: 20th-Century
    Cross-Cultural Encounters. American Studies in Austria, vol. 15, 73–80.'
  mla: 'Wenzl, Bernhard. “An American in Allied-Occupied Austria: John Dos Passos
    Reports on &#38;quot;The Vienna Frontier&#38;quot;” <i>Austria and America: 20th-Century
    Cross-Cultural Encounters</i>, edited by Joshua Parker and Ralph Poole, vol. 15,
    LIT Verlag Berlin-Münster-Wien-Zürich-London, 2017, pp. 73–80.'
  short: 'B. Wenzl, in:, J. Parker, R. Poole (Eds.), Austria and America: 20th-Century
    Cross-Cultural Encounters, LIT Verlag Berlin-Münster-Wien-Zürich-London, 2017,
    pp. 73–80.'
date_created: 2018-12-11T11:50:00Z
date_published: 2017-02-01T00:00:00Z
date_updated: 2021-01-12T06:48:06Z
day: '01'
ddc:
- '001'
editor:
- first_name: Joshua
  full_name: Parker, Joshua
  last_name: Parker
- first_name: Ralph
  full_name: Poole, Ralph
  last_name: Poole
extern: '1'
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:08:06Z
  date_updated: 2018-12-12T10:08:06Z
  file_id: '4666'
  file_name: IST-2017-732-v1+1_Austria_and_America_Cross-Cultural_Encounters.pdf
  file_size: 380624
  relation: main_file
file_date_updated: 2018-12-12T10:08:06Z
has_accepted_license: '1'
intvolume: '        15'
language:
- iso: eng
month: '02'
oa: 1
oa_version: None
page: 73 - 80
publication: 'Austria and America: 20th-Century Cross-Cultural Encounters'
publication_identifier:
  isbn:
  - 978-3643908124
publication_status: published
publisher: LIT Verlag Berlin-Münster-Wien-Zürich-London
publist_id: '6306'
status: public
title: 'An American in Allied-occupied Austria: John Dos Passos Reports on &quot;The
  Vienna Frontier&quot;'
type: book_chapter
user_id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2017'
...
---
_id: '1079'
abstract:
- lang: eng
  text: We study the ionization problem in the Thomas-Fermi-Dirac-von Weizsäcker theory
    for atoms and molecules. We prove the nonexistence of minimizers for the energy
    functional when the number of electrons is large and the total nuclear charge
    is small. This nonexistence result also applies to external potentials decaying
    faster than the Coulomb potential. In the case of arbitrary nuclear charges, we
    obtain the nonexistence of stable minimizers and radial minimizers.
article_number: '6'
article_processing_charge: No
arxiv: 1
author:
- first_name: Phan
  full_name: Nam, Phan
  id: 404092F4-F248-11E8-B48F-1D18A9856A87
  last_name: Nam
- first_name: Hanne
  full_name: Van Den Bosch, Hanne
  last_name: Van Den Bosch
citation:
  ama: Nam P, Van Den Bosch H. Nonexistence in Thomas Fermi-Dirac-von Weizsäcker theory
    with small nuclear charges. <i>Mathematical Physics, Analysis and Geometry</i>.
    2017;20(2). doi:<a href="https://doi.org/10.1007/s11040-017-9238-0">10.1007/s11040-017-9238-0</a>
  apa: Nam, P., &#38; Van Den Bosch, H. (2017). Nonexistence in Thomas Fermi-Dirac-von
    Weizsäcker theory with small nuclear charges. <i>Mathematical Physics, Analysis
    and Geometry</i>. Springer. <a href="https://doi.org/10.1007/s11040-017-9238-0">https://doi.org/10.1007/s11040-017-9238-0</a>
  chicago: Nam, Phan, and Hanne Van Den Bosch. “Nonexistence in Thomas Fermi-Dirac-von
    Weizsäcker Theory with Small Nuclear Charges.” <i>Mathematical Physics, Analysis
    and Geometry</i>. Springer, 2017. <a href="https://doi.org/10.1007/s11040-017-9238-0">https://doi.org/10.1007/s11040-017-9238-0</a>.
  ieee: P. Nam and H. Van Den Bosch, “Nonexistence in Thomas Fermi-Dirac-von Weizsäcker
    theory with small nuclear charges,” <i>Mathematical Physics, Analysis and Geometry</i>,
    vol. 20, no. 2. Springer, 2017.
  ista: Nam P, Van Den Bosch H. 2017. Nonexistence in Thomas Fermi-Dirac-von Weizsäcker
    theory with small nuclear charges. Mathematical Physics, Analysis and Geometry.
    20(2), 6.
  mla: Nam, Phan, and Hanne Van Den Bosch. “Nonexistence in Thomas Fermi-Dirac-von
    Weizsäcker Theory with Small Nuclear Charges.” <i>Mathematical Physics, Analysis
    and Geometry</i>, vol. 20, no. 2, 6, Springer, 2017, doi:<a href="https://doi.org/10.1007/s11040-017-9238-0">10.1007/s11040-017-9238-0</a>.
  short: P. Nam, H. Van Den Bosch, Mathematical Physics, Analysis and Geometry 20
    (2017).
date_created: 2018-12-11T11:50:02Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-06-04T08:11:50Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s11040-017-9238-0
external_id:
  arxiv:
  - '1603.07368'
  isi:
  - '000401270000004'
fulldoi: https://doi.org/10.1007/s11040-017-9238-0
intvolume: '        20'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1603.07368
month: '06'
oa: 1
oa_version: Submitted Version
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: Mathematical Physics, Analysis and Geometry
publication_identifier:
  issn:
  - 1385-0172
publication_status: published
publisher: Springer
publist_id: '6300'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nonexistence in Thomas Fermi-Dirac-von Weizsäcker theory with small nuclear
  charges
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '2017'
...
---
_id: '1080'
abstract:
- lang: eng
  text: Reconstructing the evolutionary history of metastases is critical for understanding
    their basic biological principles and has profound clinical implications. Genome-wide
    sequencing data has enabled modern phylogenomic methods to accurately dissect
    subclones and their phylogenies from noisy and impure bulk tumour samples at unprecedented
    depth. However, existing methods are not designed to infer metastatic seeding
    patterns. Here we develop a tool, called Treeomics, to reconstruct the phylogeny
    of metastases and map subclones to their anatomic locations. Treeomics infers
    comprehensive seeding patterns for pancreatic, ovarian, and prostate cancers.
    Moreover, Treeomics correctly disambiguates true seeding patterns from sequencing
    artifacts; 7% of variants were misclassified by conventional statistical methods.
    These artifacts can skew phylogenies by creating illusory tumour heterogeneity
    among distinct samples. In silico benchmarking on simulated tumour phylogenies
    across a wide range of sample purities (15–95%) and sequencing depths (25-800
    × ) demonstrates the accuracy of Treeomics compared with existing methods.
article_number: '14114'
article_processing_charge: No
author:
- first_name: Johannes
  full_name: Reiter, Johannes
  id: 4A918E98-F248-11E8-B48F-1D18A9856A87
  last_name: Reiter
  orcid: 0000-0002-0170-7353
- first_name: Alvin
  full_name: Makohon Moore, Alvin
  last_name: Makohon Moore
- first_name: Jeffrey
  full_name: Gerold, Jeffrey
  last_name: Gerold
- first_name: Ivana
  full_name: Božić, Ivana
  last_name: Božić
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Christine
  full_name: Iacobuzio Donahue, Christine
  last_name: Iacobuzio Donahue
- first_name: Bert
  full_name: Vogelstein, Bert
  last_name: Vogelstein
- first_name: Martin
  full_name: Nowak, Martin
  last_name: Nowak
citation:
  ama: Reiter J, Makohon Moore A, Gerold J, et al. Reconstructing metastatic seeding
    patterns of human cancers. <i>Nature Communications</i>. 2017;8. doi:<a href="https://doi.org/10.1038/ncomms14114">10.1038/ncomms14114</a>
  apa: Reiter, J., Makohon Moore, A., Gerold, J., Božić, I., Chatterjee, K., Iacobuzio
    Donahue, C., … Nowak, M. (2017). Reconstructing metastatic seeding patterns of
    human cancers. <i>Nature Communications</i>. Nature Publishing Group. <a href="https://doi.org/10.1038/ncomms14114">https://doi.org/10.1038/ncomms14114</a>
  chicago: Reiter, Johannes, Alvin Makohon Moore, Jeffrey Gerold, Ivana Božić, Krishnendu
    Chatterjee, Christine Iacobuzio Donahue, Bert Vogelstein, and Martin Nowak. “Reconstructing
    Metastatic Seeding Patterns of Human Cancers.” <i>Nature Communications</i>. Nature
    Publishing Group, 2017. <a href="https://doi.org/10.1038/ncomms14114">https://doi.org/10.1038/ncomms14114</a>.
  ieee: J. Reiter <i>et al.</i>, “Reconstructing metastatic seeding patterns of human
    cancers,” <i>Nature Communications</i>, vol. 8. Nature Publishing Group, 2017.
  ista: Reiter J, Makohon Moore A, Gerold J, Božić I, Chatterjee K, Iacobuzio Donahue
    C, Vogelstein B, Nowak M. 2017. Reconstructing metastatic seeding patterns of
    human cancers. Nature Communications. 8, 14114.
  mla: Reiter, Johannes, et al. “Reconstructing Metastatic Seeding Patterns of Human
    Cancers.” <i>Nature Communications</i>, vol. 8, 14114, Nature Publishing Group,
    2017, doi:<a href="https://doi.org/10.1038/ncomms14114">10.1038/ncomms14114</a>.
  short: J. Reiter, A. Makohon Moore, J. Gerold, I. Božić, K. Chatterjee, C. Iacobuzio
    Donahue, B. Vogelstein, M. Nowak, Nature Communications 8 (2017).
date_created: 2018-12-11T11:50:02Z
date_published: 2017-01-31T00:00:00Z
date_updated: 2025-07-10T11:50:00Z
day: '31'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.1038/ncomms14114
ec_funded: 1
external_id:
  isi:
  - '000393096600001'
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:15:15Z
  date_updated: 2018-12-12T10:15:15Z
  file_id: '5133'
  file_name: IST-2017-786-v1+1_ncomms14114.pdf
  file_size: 897050
  relation: main_file
file_date_updated: 2018-12-12T10:15:15Z
fulldoi: https://doi.org/10.1038/ncomms14114
has_accepted_license: '1'
intvolume: '         8'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P 23499-N23
  name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11407
  name: Game Theory
publication: Nature Communications
publication_identifier:
  issn:
  - 2041-1723
publication_status: published
publisher: Nature Publishing Group
publist_id: '6301'
pubrep_id: '786'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reconstructing metastatic seeding patterns of human cancers
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: 8
year: '2017'
...
---
_id: '7725'
abstract:
- lang: eng
  text: Phenotypic plasticity is the ability of an individual genotype to alter aspects
    of its phenotype depending on the current environment. It is central to the persistence,
    resistance and resilience of populations facing variation in physical or biological
    factors. Genetic variation in plasticity is pervasive, which suggests its local
    adaptation is plausible. Existing studies on the adaptation of plasticity typically
    focus on single traits and a few populations, while theory about interactions
    among genes (for example, pleiotropy) suggests that a multi-trait, landscape scale
    (for example, multiple populations) perspective is required. We present data from
    a landscape scale, replicated, multi-trait experiment using a classic predator–prey
    system centred on the water flea Daphnia pulex. We find predator regime-driven
    differences in genetic variation of multivariate plasticity. These differences
    are associated with strong divergent selection linked to a predation regime. Our
    findings are evidence for local adaptation of plasticity, suggesting that responses
    of populations to environmental variation depend on the conditions in which they
    evolved in the past.
article_processing_charge: No
article_type: original
author:
- first_name: Julia
  full_name: Reger, Julia
  last_name: Reger
- first_name: Martin I.
  full_name: Lind, Martin I.
  last_name: Lind
- first_name: Matthew Richard
  full_name: Robinson, Matthew Richard
  id: E5D42276-F5DA-11E9-8E24-6303E6697425
  last_name: Robinson
  orcid: 0000-0001-8982-8813
- first_name: Andrew P.
  full_name: Beckerman, Andrew P.
  last_name: Beckerman
citation:
  ama: Reger J, Lind MI, Robinson MR, Beckerman AP. Predation drives local adaptation
    of phenotypic plasticity. <i>Nature Ecology &#38; Evolution</i>. 2017;2:100-107.
    doi:<a href="https://doi.org/10.1038/s41559-017-0373-6">10.1038/s41559-017-0373-6</a>
  apa: Reger, J., Lind, M. I., Robinson, M. R., &#38; Beckerman, A. P. (2017). Predation
    drives local adaptation of phenotypic plasticity. <i>Nature Ecology &#38; Evolution</i>.
    Springer Nature. <a href="https://doi.org/10.1038/s41559-017-0373-6">https://doi.org/10.1038/s41559-017-0373-6</a>
  chicago: Reger, Julia, Martin I. Lind, Matthew Richard Robinson, and Andrew P. Beckerman.
    “Predation Drives Local Adaptation of Phenotypic Plasticity.” <i>Nature Ecology
    &#38; Evolution</i>. Springer Nature, 2017. <a href="https://doi.org/10.1038/s41559-017-0373-6">https://doi.org/10.1038/s41559-017-0373-6</a>.
  ieee: J. Reger, M. I. Lind, M. R. Robinson, and A. P. Beckerman, “Predation drives
    local adaptation of phenotypic plasticity,” <i>Nature Ecology &#38; Evolution</i>,
    vol. 2. Springer Nature, pp. 100–107, 2017.
  ista: Reger J, Lind MI, Robinson MR, Beckerman AP. 2017. Predation drives local
    adaptation of phenotypic plasticity. Nature Ecology &#38; Evolution. 2, 100–107.
  mla: Reger, Julia, et al. “Predation Drives Local Adaptation of Phenotypic Plasticity.”
    <i>Nature Ecology &#38; Evolution</i>, vol. 2, Springer Nature, 2017, pp. 100–07,
    doi:<a href="https://doi.org/10.1038/s41559-017-0373-6">10.1038/s41559-017-0373-6</a>.
  short: J. Reger, M.I. Lind, M.R. Robinson, A.P. Beckerman, Nature Ecology &#38;
    Evolution 2 (2017) 100–107.
date_created: 2020-04-30T10:46:02Z
date_published: 2017-11-27T00:00:00Z
date_updated: 2021-01-12T08:15:07Z
day: '27'
doi: 10.1038/s41559-017-0373-6
extern: '1'
fulldoi: https://doi.org/10.1038/s41559-017-0373-6
intvolume: '         2'
language:
- iso: eng
month: '11'
oa_version: None
page: 100-107
publication: Nature Ecology & Evolution
publication_identifier:
  issn:
  - 2397-334X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Predation drives local adaptation of phenotypic plasticity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2017'
...
---
_id: '7727'
abstract:
- lang: eng
  text: Genes of the major histocompatibility complex (MHC) have been shown to influence
    social signalling and mate preferences in many species, including humans. First
    observations suggest that MHC signalling may also affect female fertility. To
    test this hypothesis, we exposed 191 female horses (Equus caballus) to either
    an MHC-similar or an MHC-dissimilar stimulus male around the time of ovulation
    and conception. A within-subject experimental design controlled for non-MHC-linked
    male characteristics, and instrumental insemination with semen of other males
    (n = 106) controlled for potential confounding effects of semen or embryo characteristics.
    We found that females were more likely to become pregnant if exposed to an MHC-dissimilar
    than to an MHC-similar male, while overall genetic distance to the stimulus males
    (based on microsatellite markers on 20 chromosomes) had no effect. Our results
    demonstrate that early pregnancy failures can be due to maternal life-history
    decisions (cryptic female choice) influenced by MHC-linked social signalling.
article_number: '20171824'
article_processing_charge: No
article_type: original
author:
- first_name: D.
  full_name: Burger, D.
  last_name: Burger
- first_name: S.
  full_name: Thomas, S.
  last_name: Thomas
- first_name: H.
  full_name: Aepli, H.
  last_name: Aepli
- first_name: M.
  full_name: Dreyer, M.
  last_name: Dreyer
- first_name: G.
  full_name: Fabre, G.
  last_name: Fabre
- first_name: E.
  full_name: Marti, E.
  last_name: Marti
- first_name: H.
  full_name: Sieme, H.
  last_name: Sieme
- first_name: Matthew Richard
  full_name: Robinson, Matthew Richard
  id: E5D42276-F5DA-11E9-8E24-6303E6697425
  last_name: Robinson
  orcid: 0000-0001-8982-8813
- first_name: C.
  full_name: Wedekind, C.
  last_name: Wedekind
citation:
  ama: 'Burger D, Thomas S, Aepli H, et al. Major histocompatibility complex-linked
    social signalling affects female fertility. <i>Proceedings of the Royal Society
    B: Biological Sciences</i>. 2017;284(1868). doi:<a href="https://doi.org/10.1098/rspb.2017.1824">10.1098/rspb.2017.1824</a>'
  apa: 'Burger, D., Thomas, S., Aepli, H., Dreyer, M., Fabre, G., Marti, E., … Wedekind,
    C. (2017). Major histocompatibility complex-linked social signalling affects female
    fertility. <i>Proceedings of the Royal Society B: Biological Sciences</i>. The
    Royal Society. <a href="https://doi.org/10.1098/rspb.2017.1824">https://doi.org/10.1098/rspb.2017.1824</a>'
  chicago: 'Burger, D., S. Thomas, H. Aepli, M. Dreyer, G. Fabre, E. Marti, H. Sieme,
    Matthew Richard Robinson, and C. Wedekind. “Major Histocompatibility Complex-Linked
    Social Signalling Affects Female Fertility.” <i>Proceedings of the Royal Society
    B: Biological Sciences</i>. The Royal Society, 2017. <a href="https://doi.org/10.1098/rspb.2017.1824">https://doi.org/10.1098/rspb.2017.1824</a>.'
  ieee: 'D. Burger <i>et al.</i>, “Major histocompatibility complex-linked social
    signalling affects female fertility,” <i>Proceedings of the Royal Society B: Biological
    Sciences</i>, vol. 284, no. 1868. The Royal Society, 2017.'
  ista: 'Burger D, Thomas S, Aepli H, Dreyer M, Fabre G, Marti E, Sieme H, Robinson
    MR, Wedekind C. 2017. Major histocompatibility complex-linked social signalling
    affects female fertility. Proceedings of the Royal Society B: Biological Sciences.
    284(1868), 20171824.'
  mla: 'Burger, D., et al. “Major Histocompatibility Complex-Linked Social Signalling
    Affects Female Fertility.” <i>Proceedings of the Royal Society B: Biological Sciences</i>,
    vol. 284, no. 1868, 20171824, The Royal Society, 2017, doi:<a href="https://doi.org/10.1098/rspb.2017.1824">10.1098/rspb.2017.1824</a>.'
  short: 'D. Burger, S. Thomas, H. Aepli, M. Dreyer, G. Fabre, E. Marti, H. Sieme,
    M.R. Robinson, C. Wedekind, Proceedings of the Royal Society B: Biological Sciences
    284 (2017).'
date_created: 2020-04-30T10:46:43Z
date_published: 2017-12-06T00:00:00Z
date_updated: 2021-01-12T08:15:08Z
day: '06'
doi: 10.1098/rspb.2017.1824
extern: '1'
external_id:
  pmid:
  - '29212724'
fulldoi: https://doi.org/10.1098/rspb.2017.1824
intvolume: '       284'
issue: '1868'
language:
- iso: eng
month: '12'
oa_version: None
pmid: 1
publication: 'Proceedings of the Royal Society B: Biological Sciences'
publication_identifier:
  issn:
  - 0962-8452
  - 1471-2954
publication_status: published
publisher: The Royal Society
quality_controlled: '1'
status: public
title: Major histocompatibility complex-linked social signalling affects female fertility
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 284
year: '2017'
...
---
_id: '7728'
abstract:
- lang: eng
  text: 'Meta-analyses of genome-wide association studies, which dominate genetic
    discovery, are based on data from diverse historical time periods and populations.
    Genetic scores derived from genome-wide association studies explain only a fraction
    of the heritability estimates obtained from whole-genome studies on single populations,
    known as the ‘hidden heritability’ puzzle. Using seven sampling populations (n = 35,062),
    we test whether hidden heritability is attributed to heterogeneity across sampling
    populations and time, showing that estimates are substantially smaller across
    populations compared with within populations. We show that the hidden heritability
    varies substantially: from zero for height to 20% for body mass index, 37% for
    education, 40% for age at first birth and up to 75% for number of children. Simulations
    demonstrate that our results are more likely to reflect heterogeneity in phenotypic
    measurement or gene–environment interactions than genetic heterogeneity. These
    findings have substantial implications for genetic discovery, suggesting that
    large homogenous datasets are required for behavioural phenotypes and that gene–environment
    interaction may be a central challenge for genetic discovery.'
article_processing_charge: No
article_type: original
author:
- first_name: Felix C.
  full_name: Tropf, Felix C.
  last_name: Tropf
- first_name: S. Hong
  full_name: Lee, S. Hong
  last_name: Lee
- first_name: Renske M.
  full_name: Verweij, Renske M.
  last_name: Verweij
- first_name: Gert
  full_name: Stulp, Gert
  last_name: Stulp
- first_name: Peter J.
  full_name: van der Most, Peter J.
  last_name: van der Most
- first_name: Ronald
  full_name: de Vlaming, Ronald
  last_name: de Vlaming
- first_name: Andrew
  full_name: Bakshi, Andrew
  last_name: Bakshi
- first_name: Daniel A.
  full_name: Briley, Daniel A.
  last_name: Briley
- first_name: Charles
  full_name: Rahal, Charles
  last_name: Rahal
- first_name: Robert
  full_name: Hellpap, Robert
  last_name: Hellpap
- first_name: Anastasia N.
  full_name: Iliadou, Anastasia N.
  last_name: Iliadou
- first_name: Tõnu
  full_name: Esko, Tõnu
  last_name: Esko
- first_name: Andres
  full_name: Metspalu, Andres
  last_name: Metspalu
- first_name: Sarah E.
  full_name: Medland, Sarah E.
  last_name: Medland
- first_name: Nicholas G.
  full_name: Martin, Nicholas G.
  last_name: Martin
- first_name: Nicola
  full_name: Barban, Nicola
  last_name: Barban
- first_name: Harold
  full_name: Snieder, Harold
  last_name: Snieder
- first_name: Matthew Richard
  full_name: Robinson, Matthew Richard
  id: E5D42276-F5DA-11E9-8E24-6303E6697425
  last_name: Robinson
  orcid: 0000-0001-8982-8813
- first_name: Melinda C.
  full_name: Mills, Melinda C.
  last_name: Mills
citation:
  ama: Tropf FC, Lee SH, Verweij RM, et al. Hidden heritability due to heterogeneity
    across seven populations. <i>Nature Human Behaviour</i>. 2017;1(10):757-765. doi:<a
    href="https://doi.org/10.1038/s41562-017-0195-1">10.1038/s41562-017-0195-1</a>
  apa: Tropf, F. C., Lee, S. H., Verweij, R. M., Stulp, G., van der Most, P. J., de
    Vlaming, R., … Mills, M. C. (2017). Hidden heritability due to heterogeneity across
    seven populations. <i>Nature Human Behaviour</i>. Springer Nature. <a href="https://doi.org/10.1038/s41562-017-0195-1">https://doi.org/10.1038/s41562-017-0195-1</a>
  chicago: Tropf, Felix C., S. Hong Lee, Renske M. Verweij, Gert Stulp, Peter J. van
    der Most, Ronald de Vlaming, Andrew Bakshi, et al. “Hidden Heritability Due to
    Heterogeneity across Seven Populations.” <i>Nature Human Behaviour</i>. Springer
    Nature, 2017. <a href="https://doi.org/10.1038/s41562-017-0195-1">https://doi.org/10.1038/s41562-017-0195-1</a>.
  ieee: F. C. Tropf <i>et al.</i>, “Hidden heritability due to heterogeneity across
    seven populations,” <i>Nature Human Behaviour</i>, vol. 1, no. 10. Springer Nature,
    pp. 757–765, 2017.
  ista: Tropf FC, Lee SH, Verweij RM, Stulp G, van der Most PJ, de Vlaming R, Bakshi
    A, Briley DA, Rahal C, Hellpap R, Iliadou AN, Esko T, Metspalu A, Medland SE,
    Martin NG, Barban N, Snieder H, Robinson MR, Mills MC. 2017. Hidden heritability
    due to heterogeneity across seven populations. Nature Human Behaviour. 1(10),
    757–765.
  mla: Tropf, Felix C., et al. “Hidden Heritability Due to Heterogeneity across Seven
    Populations.” <i>Nature Human Behaviour</i>, vol. 1, no. 10, Springer Nature,
    2017, pp. 757–65, doi:<a href="https://doi.org/10.1038/s41562-017-0195-1">10.1038/s41562-017-0195-1</a>.
  short: F.C. Tropf, S.H. Lee, R.M. Verweij, G. Stulp, P.J. van der Most, R. de Vlaming,
    A. Bakshi, D.A. Briley, C. Rahal, R. Hellpap, A.N. Iliadou, T. Esko, A. Metspalu,
    S.E. Medland, N.G. Martin, N. Barban, H. Snieder, M.R. Robinson, M.C. Mills, Nature
    Human Behaviour 1 (2017) 757–765.
date_created: 2020-04-30T10:47:02Z
date_published: 2017-09-11T00:00:00Z
date_updated: 2021-01-12T08:15:08Z
day: '11'
doi: 10.1038/s41562-017-0195-1
extern: '1'
fulldoi: https://doi.org/10.1038/s41562-017-0195-1
intvolume: '         1'
issue: '10'
language:
- iso: eng
month: '09'
oa_version: None
page: 757-765
publication: Nature Human Behaviour
publication_identifier:
  issn:
  - 2397-3374
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Hidden heritability due to heterogeneity across seven populations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2017'
...
---
_id: '7729'
abstract:
- lang: eng
  text: Quantifying the effects of inbreeding is critical to characterizing the genetic
    architecture of complex traits. This study highlights through theory and simulations
    the strengths and shortcomings of three SNP-based inbreeding measures commonly
    used to estimate inbreeding depression (ID). We demonstrate that heterogeneity
    in linkage disequilibrium (LD) between causal variants and SNPs biases ID estimates,
    and we develop an approach to correct this bias using LD and minor allele frequency
    stratified inference (LDMS). We quantified ID in 25 traits measured in ∼140,000
    participants of the UK Biobank, using LDMS, and confirmed previously published
    ID for 4 traits. We find unique evidence of ID for handgrip strength, waist/hip
    ratio, and visual and auditory acuity (ID between −2.3 and −5.2 phenotypic SDs
    for complete inbreeding; P<0.001). Our results illustrate that a careful choice
    of the measure of inbreeding combined with LDMS stratification improves both detection
    and quantification of ID using SNP data.
article_processing_charge: No
article_type: original
author:
- first_name: Loic
  full_name: Yengo, Loic
  last_name: Yengo
- first_name: Zhihong
  full_name: Zhu, Zhihong
  last_name: Zhu
- first_name: Naomi R.
  full_name: Wray, Naomi R.
  last_name: Wray
- first_name: Bruce S.
  full_name: Weir, Bruce S.
  last_name: Weir
- first_name: Jian
  full_name: Yang, Jian
  last_name: Yang
- first_name: Matthew Richard
  full_name: Robinson, Matthew Richard
  id: E5D42276-F5DA-11E9-8E24-6303E6697425
  last_name: Robinson
  orcid: 0000-0001-8982-8813
- first_name: Peter M.
  full_name: Visscher, Peter M.
  last_name: Visscher
citation:
  ama: Yengo L, Zhu Z, Wray NR, et al. Detection and quantification of inbreeding
    depression for complex traits from SNP data. <i>Proceedings of the National Academy
    of Sciences</i>. 2017;114(32):8602-8607. doi:<a href="https://doi.org/10.1073/pnas.1621096114">10.1073/pnas.1621096114</a>
  apa: Yengo, L., Zhu, Z., Wray, N. R., Weir, B. S., Yang, J., Robinson, M. R., &#38;
    Visscher, P. M. (2017). Detection and quantification of inbreeding depression
    for complex traits from SNP data. <i>Proceedings of the National Academy of Sciences</i>.
    Proceedings of the National Academy of Sciences. <a href="https://doi.org/10.1073/pnas.1621096114">https://doi.org/10.1073/pnas.1621096114</a>
  chicago: Yengo, Loic, Zhihong Zhu, Naomi R. Wray, Bruce S. Weir, Jian Yang, Matthew
    Richard Robinson, and Peter M. Visscher. “Detection and Quantification of Inbreeding
    Depression for Complex Traits from SNP Data.” <i>Proceedings of the National Academy
    of Sciences</i>. Proceedings of the National Academy of Sciences, 2017. <a href="https://doi.org/10.1073/pnas.1621096114">https://doi.org/10.1073/pnas.1621096114</a>.
  ieee: L. Yengo <i>et al.</i>, “Detection and quantification of inbreeding depression
    for complex traits from SNP data,” <i>Proceedings of the National Academy of Sciences</i>,
    vol. 114, no. 32. Proceedings of the National Academy of Sciences, pp. 8602–8607,
    2017.
  ista: Yengo L, Zhu Z, Wray NR, Weir BS, Yang J, Robinson MR, Visscher PM. 2017.
    Detection and quantification of inbreeding depression for complex traits from
    SNP data. Proceedings of the National Academy of Sciences. 114(32), 8602–8607.
  mla: Yengo, Loic, et al. “Detection and Quantification of Inbreeding Depression
    for Complex Traits from SNP Data.” <i>Proceedings of the National Academy of Sciences</i>,
    vol. 114, no. 32, Proceedings of the National Academy of Sciences, 2017, pp. 8602–07,
    doi:<a href="https://doi.org/10.1073/pnas.1621096114">10.1073/pnas.1621096114</a>.
  short: L. Yengo, Z. Zhu, N.R. Wray, B.S. Weir, J. Yang, M.R. Robinson, P.M. Visscher,
    Proceedings of the National Academy of Sciences 114 (2017) 8602–8607.
date_created: 2020-04-30T10:47:19Z
date_published: 2017-08-08T00:00:00Z
date_updated: 2021-01-12T08:15:09Z
day: '08'
doi: 10.1073/pnas.1621096114
extern: '1'
fulldoi: https://doi.org/10.1073/pnas.1621096114
intvolume: '       114'
issue: '32'
language:
- iso: eng
month: '08'
oa_version: None
page: 8602-8607
publication: Proceedings of the National Academy of Sciences
publication_identifier:
  issn:
  - 0027-8424
  - 1091-6490
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
related_material:
  link:
  - relation: other
    url: https://doi.org/10.1073/pnas.1718598115
status: public
title: Detection and quantification of inbreeding depression for complex traits from
  SNP data
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2017'
...
