---
_id: '2410'
abstract:
- lang: eng
  text: 'Here, we describe a novel virulent bacteriophage that infects Bacillus weihenstephanensis,
    isolated from soil in Austria. It is the first phage to be discovered that infects
    this species. Here, we present the complete genome sequence of this podovirus. '
author:
- first_name: Rodrigo A
  full_name: Fernandes Redondo, Rodrigo A
  id: 409D5C96-F248-11E8-B48F-1D18A9856A87
  last_name: Fernandes Redondo
  orcid: 0000-0002-5837-2793
- first_name: Anne
  full_name: Kupczok, Anne
  id: 2BB22BC2-F248-11E8-B48F-1D18A9856A87
  last_name: Kupczok
- first_name: Gertraud
  full_name: Stift, Gertraud
  id: 2DB195CA-F248-11E8-B48F-1D18A9856A87
  last_name: Stift
- first_name: Jonathan P
  full_name: Bollback, Jonathan P
  id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
  last_name: Bollback
  orcid: 0000-0002-4624-4612
citation:
  ama: Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. Complete genome sequence
    of the novel phage MG-B1 infecting bacillus weihenstephanensis. <i>Genome Announcements</i>.
    2013;1(3). doi:<a href="https://doi.org/10.1128/genomeA.00216-13">10.1128/genomeA.00216-13</a>
  apa: Fernandes Redondo, R. A., Kupczok, A., Stift, G., &#38; Bollback, J. P. (2013).
    Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis.
    <i>Genome Announcements</i>. American Society for Microbiology. <a href="https://doi.org/10.1128/genomeA.00216-13">https://doi.org/10.1128/genomeA.00216-13</a>
  chicago: Fernandes Redondo, Rodrigo A, Anne Kupczok, Gertraud Stift, and Jonathan
    P Bollback. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus
    Weihenstephanensis.” <i>Genome Announcements</i>. American Society for Microbiology,
    2013. <a href="https://doi.org/10.1128/genomeA.00216-13">https://doi.org/10.1128/genomeA.00216-13</a>.
  ieee: R. A. Fernandes Redondo, A. Kupczok, G. Stift, and J. P. Bollback, “Complete
    genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis,”
    <i>Genome Announcements</i>, vol. 1, no. 3. American Society for Microbiology,
    2013.
  ista: Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. 2013. Complete genome
    sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome
    Announcements. 1(3).
  mla: Fernandes Redondo, Rodrigo A., et al. “Complete Genome Sequence of the Novel
    Phage MG-B1 Infecting Bacillus Weihenstephanensis.” <i>Genome Announcements</i>,
    vol. 1, no. 3, American Society for Microbiology, 2013, doi:<a href="https://doi.org/10.1128/genomeA.00216-13">10.1128/genomeA.00216-13</a>.
  short: R.A. Fernandes Redondo, A. Kupczok, G. Stift, J.P. Bollback, Genome Announcements
    1 (2013).
date_created: 2018-12-11T11:57:30Z
date_published: 2013-06-13T00:00:00Z
date_updated: 2021-01-12T06:57:19Z
day: '13'
ddc:
- '576'
department:
- _id: JoBo
- _id: LifeSc
doi: 10.1128/genomeA.00216-13
file:
- access_level: open_access
  checksum: 0751ec74b695567e0cdf02aaf9c26829
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:36Z
  date_updated: 2020-07-14T12:45:40Z
  file_id: '5291'
  file_name: IST-2015-398-v1+1_Genome_Announc.-2013-Redondo-.pdf
  file_size: 130026
  relation: main_file
file_date_updated: 2020-07-14T12:45:40Z
has_accepted_license: '1'
intvolume: '         1'
issue: '3'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Genome Announcements
publication_status: published
publisher: American Society for Microbiology
publist_id: '4516'
pubrep_id: '398'
quality_controlled: '1'
scopus_import: 1
status: public
title: Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2013'
...
---
_id: '2412'
abstract:
- lang: eng
  text: 'Background: The CRISPR/Cas system is known to act as an adaptive and heritable
    immune system in Eubacteria and Archaea. Immunity is encoded in an array of spacer
    sequences. Each spacer can provide specific immunity to invasive elements that
    carry the same or a similar sequence. Even in closely related strains, spacer
    content is very dynamic and evolves quickly. Standard models of nucleotide evolutioncannot
    be applied to quantify its rate of change since processes other than single nucleotide
    changes determine its evolution.Methods We present probabilistic models that are
    specific for spacer content evolution. They account for the different processes
    of insertion and deletion. Insertions can be constrained to occur on one end only
    or are allowed to occur throughout the array. One deletion event can affect one
    spacer or a whole fragment of adjacent spacers. Parameters of the underlying models
    are estimated for a pair of arrays by maximum likelihood using explicit ancestor
    enumeration.Results Simulations show that parameters are well estimated on average
    under the models presented here. There is a bias in the rate estimation when including
    fragment deletions. The models also estimate times between pairs of strains. But
    with increasing time, spacer overlap goes to zero, and thus there is an upper
    bound on the distance that can be estimated. Spacer content similarities are displayed
    in a distance based phylogeny using the estimated times.We use the presented models
    to analyze different Yersinia pestis data sets and find that the results among
    them are largely congruent. The models also capture the variation in diversity
    of spacers among the data sets. A comparison of spacer-based phylogenies and Cas
    gene phylogenies shows that they resolve very different time scales for this data
    set.Conclusions The simulations and data analyses show that the presented models
    are useful for quantifying spacer content evolution and for displaying spacer
    content similarities of closely related strains in a phylogeny. This allows for
    comparisons of different CRISPR arrays or for comparisons between CRISPR arrays
    and nucleotide substitution rates.'
author:
- first_name: Anne
  full_name: Kupczok, Anne
  id: 2BB22BC2-F248-11E8-B48F-1D18A9856A87
  last_name: Kupczok
- first_name: Jonathan P
  full_name: Bollback, Jonathan P
  id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
  last_name: Bollback
  orcid: 0000-0002-4624-4612
citation:
  ama: Kupczok A, Bollback JP. Probabilistic models for CRISPR spacer content evolution
    . <i>BMC Evolutionary Biology</i>. 2013;13(1):54-54. doi:<a href="https://doi.org/10.1186/1471-2148-13-54">10.1186/1471-2148-13-54</a>
  apa: Kupczok, A., &#38; Bollback, J. P. (2013). Probabilistic models for CRISPR
    spacer content evolution . <i>BMC Evolutionary Biology</i>. BioMed Central. <a
    href="https://doi.org/10.1186/1471-2148-13-54">https://doi.org/10.1186/1471-2148-13-54</a>
  chicago: Kupczok, Anne, and Jonathan P Bollback. “Probabilistic Models for CRISPR
    Spacer Content Evolution .” <i>BMC Evolutionary Biology</i>. BioMed Central, 2013.
    <a href="https://doi.org/10.1186/1471-2148-13-54">https://doi.org/10.1186/1471-2148-13-54</a>.
  ieee: A. Kupczok and J. P. Bollback, “Probabilistic models for CRISPR spacer content
    evolution ,” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1. BioMed Central,
    pp. 54–54, 2013.
  ista: Kupczok A, Bollback JP. 2013. Probabilistic models for CRISPR spacer content
    evolution . BMC Evolutionary Biology. 13(1), 54–54.
  mla: Kupczok, Anne, and Jonathan P. Bollback. “Probabilistic Models for CRISPR Spacer
    Content Evolution .” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1, BioMed Central,
    2013, pp. 54–54, doi:<a href="https://doi.org/10.1186/1471-2148-13-54">10.1186/1471-2148-13-54</a>.
  short: A. Kupczok, J.P. Bollback, BMC Evolutionary Biology 13 (2013) 54–54.
date_created: 2018-12-11T11:57:31Z
date_published: 2013-02-26T00:00:00Z
date_updated: 2021-01-12T06:57:20Z
day: '26'
ddc:
- '576'
department:
- _id: JoBo
doi: 10.1186/1471-2148-13-54
file:
- access_level: open_access
  checksum: 029c7e0b198c19312b66ecce3cabb22f
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:15Z
  date_updated: 2020-07-14T12:45:40Z
  file_id: '5268'
  file_name: IST-2015-397-v1+1_1471-2148-13-54.pdf
  file_size: 518729
  relation: main_file
file_date_updated: 2020-07-14T12:45:40Z
has_accepted_license: '1'
intvolume: '        13'
issue: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '02'
oa: 1
oa_version: Published Version
page: 54 - 54
publication: BMC Evolutionary Biology
publication_status: published
publisher: BioMed Central
publist_id: '4514'
pubrep_id: '397'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Probabilistic models for CRISPR spacer content evolution '
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: 13
year: '2013'
...
---
_id: '2445'
abstract:
- lang: eng
  text: We develop program synthesis techniques that can help programmers fix concurrency-related
    bugs. We make two new contributions to synthesis for concurrency, the first improving
    the efficiency of the synthesized code, and the second improving the efficiency
    of the synthesis procedure itself. The first contribution is to have the synthesis
    procedure explore a variety of (sequential) semantics-preserving program transformations.
    Classically, only one such transformation has been considered, namely, the insertion
    of synchronization primitives (such as locks). Based on common manual bug-fixing
    techniques used by Linux device-driver developers, we explore additional, more
    efficient transformations, such as the reordering of independent instructions.
    The second contribution is to speed up the counterexample-guided removal of concurrency
    bugs within the synthesis procedure by considering partial-order traces (instead
    of linear traces) as counterexamples. A partial-order error trace represents a
    set of linear (interleaved) traces of a concurrent program all of which lead to
    the same error. By eliminating a partial-order error trace, we eliminate in a
    single iteration of the synthesis procedure all linearizations of the partial-order
    trace. We evaluated our techniques on several simplified examples of real concurrency
    bugs that occurred in Linux device drivers.
alternative_title:
- LNCS
author:
- first_name: Pavol
  full_name: Cerny, Pavol
  id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
  last_name: Cerny
- 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: Arjun
  full_name: Radhakrishna, Arjun
  id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
  last_name: Radhakrishna
- first_name: Leonid
  full_name: Ryzhyk, Leonid
  last_name: Ryzhyk
- first_name: Thorsten
  full_name: Tarrach, Thorsten
  id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87
  last_name: Tarrach
  orcid: 0000-0003-4409-8487
citation:
  ama: 'Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Efficient synthesis
    for concurrency by semantics-preserving transformations. In: Vol 8044. Springer;
    2013:951-967. doi:<a href="https://doi.org/10.1007/978-3-642-39799-8_68">10.1007/978-3-642-39799-8_68</a>'
  apa: 'Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., &#38; Tarrach,
    T. (2013). Efficient synthesis for concurrency by semantics-preserving transformations
    (Vol. 8044, pp. 951–967). Presented at the CAV: Computer Aided Verification, St.
    Petersburg, Russia: Springer. <a href="https://doi.org/10.1007/978-3-642-39799-8_68">https://doi.org/10.1007/978-3-642-39799-8_68</a>'
  chicago: Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and
    Thorsten Tarrach. “Efficient Synthesis for Concurrency by Semantics-Preserving
    Transformations,” 8044:951–67. Springer, 2013. <a href="https://doi.org/10.1007/978-3-642-39799-8_68">https://doi.org/10.1007/978-3-642-39799-8_68</a>.
  ieee: 'P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Efficient
    synthesis for concurrency by semantics-preserving transformations,” presented
    at the CAV: Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044,
    pp. 951–967.'
  ista: 'Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2013. Efficient
    synthesis for concurrency by semantics-preserving transformations. CAV: Computer
    Aided Verification, LNCS, vol. 8044, 951–967.'
  mla: Cerny, Pavol, et al. <i>Efficient Synthesis for Concurrency by Semantics-Preserving
    Transformations</i>. Vol. 8044, Springer, 2013, pp. 951–67, doi:<a href="https://doi.org/10.1007/978-3-642-39799-8_68">10.1007/978-3-642-39799-8_68</a>.
  short: P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer,
    2013, pp. 951–967.
conference:
  end_date: 2013-07-19
  location: St. Petersburg, Russia
  name: 'CAV: Computer Aided Verification'
  start_date: 2013-07-13
date_created: 2018-12-11T11:57:42Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2023-09-07T11:57:01Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.1007/978-3-642-39799-8_68
ec_funded: 1
file:
- access_level: open_access
  checksum: 70c70ca5487faba82262c63e1b678a27
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:15:37Z
  date_updated: 2020-07-14T12:45:40Z
  file_id: '5158'
  file_name: IST-2014-199-v1+1_cav2013-final.pdf
  file_size: 365548
  relation: main_file
file_date_updated: 2020-07-14T12:45:40Z
has_accepted_license: '1'
intvolume: '      8044'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 951 - 967
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '4458'
pubrep_id: '199'
quality_controlled: '1'
related_material:
  record:
  - id: '1130'
    relation: dissertation_contains
    status: public
scopus_import: 1
status: public
title: Efficient synthesis for concurrency by semantics-preserving transformations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8044
year: '2013'
...
---
_id: '2446'
abstract:
- lang: eng
  text: The model-checking problem for probabilistic systems crucially relies on the
    translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless
    translation [KE12, GKE12] for the LTL(F,G) fragment produces smaller automata
    as compared to the traditional approach. In this work, instead of DRW we consider
    deterministic automata with acceptance condition given as disjunction of generalized
    Rabin pairs (DGRW). The Safraless translation of LTL(F,G) formulas to DGRW results
    in smaller automata as compared to DRW. We present algorithms for probabilistic
    model-checking as well as game solving for DGRW conditions. Our new algorithms
    lead to improvement both in terms of theoretical bounds as well as practical evaluation.
    We compare PRISM with and without our new translation, and show that the new translation
    leads to significant improvements.
alternative_title:
- LNCS
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: Andreas
  full_name: Gaiser, Andreas
  last_name: Gaiser
- first_name: Jan
  full_name: Kretinsky, Jan
  id: 44CEF464-F248-11E8-B48F-1D18A9856A87
  last_name: Kretinsky
  orcid: 0000-0002-8122-2881
citation:
  ama: Chatterjee K, Gaiser A, Kretinsky J. Automata with generalized Rabin pairs
    for probabilistic model checking and LTL synthesis. 2013;8044:559-575. doi:<a
    href="https://doi.org/10.1007/978-3-642-39799-8_37">10.1007/978-3-642-39799-8_37</a>
  apa: 'Chatterjee, K., Gaiser, A., &#38; Kretinsky, J. (2013). Automata with generalized
    Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the
    CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href="https://doi.org/10.1007/978-3-642-39799-8_37">https://doi.org/10.1007/978-3-642-39799-8_37</a>'
  chicago: Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with
    Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.” Lecture
    Notes in Computer Science. Springer, 2013. <a href="https://doi.org/10.1007/978-3-642-39799-8_37">https://doi.org/10.1007/978-3-642-39799-8_37</a>.
  ieee: K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin
    pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer,
    pp. 559–575, 2013.
  ista: Chatterjee K, Gaiser A, Kretinsky J. 2013. Automata with generalized Rabin
    pairs for probabilistic model checking and LTL synthesis. 8044, 559–575.
  mla: Chatterjee, Krishnendu, et al. <i>Automata with Generalized Rabin Pairs for
    Probabilistic Model Checking and LTL Synthesis</i>. Vol. 8044, Springer, 2013,
    pp. 559–75, doi:<a href="https://doi.org/10.1007/978-3-642-39799-8_37">10.1007/978-3-642-39799-8_37</a>.
  short: K. Chatterjee, A. Gaiser, J. Kretinsky, 8044 (2013) 559–575.
conference:
  end_date: 2013-07-19
  location: St. Petersburg, Russia
  name: 'CAV: Computer Aided Verification'
  start_date: 2013-07-13
date_created: 2018-12-11T11:57:42Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2020-08-11T10:09:47Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-39799-8_37
ec_funded: 1
external_id:
  arxiv:
  - '1304.5281'
intvolume: '      8044'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1304.5281
month: '07'
oa: 1
oa_version: Preprint
page: 559 - 575
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P 23499-N23
  name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11407
  name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
  name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '4457'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Automata with generalized Rabin pairs for probabilistic model checking and
  LTL synthesis
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8044
year: '2013'
...
---
_id: '2447'
abstract:
- lang: eng
  text: "Separation logic (SL) has gained widespread popularity because of its ability
    to succinctly express complex invariants of a program’s heap configurations. Several
    specialized provers have been developed for decidable SL fragments. However, these
    provers cannot be easily extended or combined with solvers for other theories
    that are important in program verification, e.g., linear arithmetic. In this paper,
    we present a reduction of decidable SL fragments to a decidable first-order theory
    that fits well into the satisfiability modulo theories (SMT) framework. We show
    how to use this reduction to automate satisfiability, entailment, frame inference,
    and abduction problems for separation logic using SMT solvers. Our approach provides
    a simple method of integrating separation logic into existing verification tools
    that provide SMT backends, and an elegant way of combining SL fragments with other
    decidable first-order theories. We implemented this approach in a verification
    tool and applied it to heap-manipulating programs whose verification involves
    reasoning in theory combinations.\r\n"
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ruzica
  full_name: Piskac, Ruzica
  last_name: Piskac
- first_name: Thomas
  full_name: Wies, Thomas
  id: 447BFB88-F248-11E8-B48F-1D18A9856A87
  last_name: Wies
- first_name: Damien
  full_name: Zufferey, Damien
  id: 4397AC76-F248-11E8-B48F-1D18A9856A87
  last_name: Zufferey
  orcid: 0000-0002-3197-8736
citation:
  ama: Piskac R, Wies T, Zufferey D. Automating separation logic using SMT. 2013;8044:773-789.
    doi:<a href="https://doi.org/10.1007/978-3-642-39799-8_54">10.1007/978-3-642-39799-8_54</a>
  apa: 'Piskac, R., Wies, T., &#38; Zufferey, D. (2013). Automating separation logic
    using SMT. Presented at the CAV: Computer Aided Verification, St. Petersburg,
    Russia: Springer. <a href="https://doi.org/10.1007/978-3-642-39799-8_54">https://doi.org/10.1007/978-3-642-39799-8_54</a>'
  chicago: Piskac, Ruzica, Thomas Wies, and Damien Zufferey. “Automating Separation
    Logic Using SMT.” Lecture Notes in Computer Science. Springer, 2013. <a href="https://doi.org/10.1007/978-3-642-39799-8_54">https://doi.org/10.1007/978-3-642-39799-8_54</a>.
  ieee: R. Piskac, T. Wies, and D. Zufferey, “Automating separation logic using SMT,”
    vol. 8044. Springer, pp. 773–789, 2013.
  ista: Piskac R, Wies T, Zufferey D. 2013. Automating separation logic using SMT.
    8044, 773–789.
  mla: Piskac, Ruzica, et al. <i>Automating Separation Logic Using SMT</i>. Vol. 8044,
    Springer, 2013, pp. 773–89, doi:<a href="https://doi.org/10.1007/978-3-642-39799-8_54">10.1007/978-3-642-39799-8_54</a>.
  short: R. Piskac, T. Wies, D. Zufferey, 8044 (2013) 773–789.
conference:
  end_date: 2013-07-19
  location: St. Petersburg, Russia
  name: 'CAV: Computer Aided Verification'
  start_date: 2013-07-13
date_created: 2018-12-11T11:57:43Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2020-08-11T10:09:47Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-39799-8_54
file:
- access_level: open_access
  checksum: 2e866932ab688f47ecd504acb4d5c7d4
  content_type: application/pdf
  creator: dernst
  date_created: 2020-05-15T11:13:01Z
  date_updated: 2020-07-14T12:45:41Z
  file_id: '7859'
  file_name: 2013_CAV_Piskac.pdf
  file_size: 309182
  relation: main_file
file_date_updated: 2020-07-14T12:45:41Z
has_accepted_license: '1'
intvolume: '      8044'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 773 - 789
publication_status: published
publisher: Springer
publist_id: '4456'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Automating separation logic using SMT
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8044
year: '2013'
...
---
_id: '2448'
abstract:
- lang: eng
  text: Cell-to-cell directional flow of the phytohormone auxin is primarily established
    by polar localization of the PIN auxin transporters, a process tightly regulated
    at multiple levels by auxin itself. We recently reported that, in the context
    of strong auxin flows, activity of the vacuolar ZIFL1.1 transporter is required
    for fine-tuning of polar auxin transport rates in the Arabidopsis root. In particular,
    ZIFL1.1 function protects plasma-membrane stability of the PIN2 carrier in epidermal
    root tip cells under conditions normally triggering PIN2 degradation. Here, we
    show that ZIFL1.1 activity at the root tip also promotes PIN1 plasma-membrane
    abundance in central cylinder cells, thus supporting the notion that ZIFL1.1 acts
    as a general positive modulator of polar auxin transport in roots.
article_number: e25688
article_processing_charge: No
article_type: original
author:
- first_name: Estelle
  full_name: Remy, Estelle
  last_name: Remy
- first_name: Pawel
  full_name: Baster, Pawel
  id: 3028BD74-F248-11E8-B48F-1D18A9856A87
  last_name: Baster
- first_name: Jirí
  full_name: Friml, Jirí
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
- first_name: Paula
  full_name: Duque, Paula
  last_name: Duque
citation:
  ama: Remy E, Baster P, Friml J, Duque P. ZIFL1.1 transporter modulates polar auxin
    transport by stabilizing membrane abundance of multiple PINs in Arabidopsis root
    tip. <i>Plant Signaling &#38; Behavior</i>. 2013;8(10). doi:<a href="https://doi.org/10.4161/psb.25688">10.4161/psb.25688</a>
  apa: Remy, E., Baster, P., Friml, J., &#38; Duque, P. (2013). ZIFL1.1 transporter
    modulates polar auxin transport by stabilizing membrane abundance of multiple
    PINs in Arabidopsis root tip. <i>Plant Signaling &#38; Behavior</i>. Taylor &#38;
    Francis. <a href="https://doi.org/10.4161/psb.25688">https://doi.org/10.4161/psb.25688</a>
  chicago: Remy, Estelle, Pawel Baster, Jiří Friml, and Paula Duque. “ZIFL1.1 Transporter
    Modulates Polar Auxin Transport by Stabilizing Membrane Abundance of Multiple
    PINs in Arabidopsis Root Tip.” <i>Plant Signaling &#38; Behavior</i>. Taylor &#38;
    Francis, 2013. <a href="https://doi.org/10.4161/psb.25688">https://doi.org/10.4161/psb.25688</a>.
  ieee: E. Remy, P. Baster, J. Friml, and P. Duque, “ZIFL1.1 transporter modulates
    polar auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis
    root tip,” <i>Plant Signaling &#38; Behavior</i>, vol. 8, no. 10. Taylor &#38;
    Francis, 2013.
  ista: Remy E, Baster P, Friml J, Duque P. 2013. ZIFL1.1 transporter modulates polar
    auxin transport by stabilizing membrane abundance of multiple PINs in Arabidopsis
    root tip. Plant Signaling &#38; Behavior. 8(10), e25688.
  mla: Remy, Estelle, et al. “ZIFL1.1 Transporter Modulates Polar Auxin Transport
    by Stabilizing Membrane Abundance of Multiple PINs in Arabidopsis Root Tip.” <i>Plant
    Signaling &#38; Behavior</i>, vol. 8, no. 10, e25688, Taylor &#38; Francis, 2013,
    doi:<a href="https://doi.org/10.4161/psb.25688">10.4161/psb.25688</a>.
  short: E. Remy, P. Baster, J. Friml, P. Duque, Plant Signaling &#38; Behavior 8
    (2013).
date_created: 2018-12-11T11:57:43Z
date_published: 2013-07-10T00:00:00Z
date_updated: 2025-05-07T11:12:32Z
day: '10'
department:
- _id: JiFr
doi: 10.4161/psb.25688
ec_funded: 1
external_id:
  pmid:
  - '23857365'
intvolume: '         8'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4091088/
month: '07'
oa: 1
oa_version: Submitted Version
pmid: 1
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '282300'
  name: Polarity and subcellular dynamics in plants
publication: Plant Signaling & Behavior
publication_status: published
publisher: Taylor & Francis
publist_id: '4455'
quality_controlled: '1'
scopus_import: '1'
status: public
title: ZIFL1.1 transporter modulates polar auxin transport by stabilizing membrane
  abundance of multiple PINs in Arabidopsis root tip
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2013'
...
---
_id: '245'
abstract:
- lang: eng
  text: For given non-zero integers a, b, q we investigate the density of solutions
    (x; y) ∈ ℤ2 to the binary cubic congruence ax2 + by3 ≡ 0 mod q, and use it to
    establish the Manin conjecture for a singular del Pezzo surface of degree 2 defined
    over ℚ.
author:
- first_name: Stephan
  full_name: Baier, Stephan
  last_name: Baier
- first_name: Timothy D
  full_name: Timothy Browning
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
citation:
  ama: Baier S, Browning TD. Inhomogeneous cubic congruences and rational points on
    del Pezzo surfaces. <i>Journal fur die Reine und Angewandte Mathematik</i>. 2013;(680):69-151.
    doi:<a href="https://doi.org/10.1515/crelle.2012.039">10.1515/crelle.2012.039</a>
  apa: Baier, S., &#38; Browning, T. D. (2013). Inhomogeneous cubic congruences and
    rational points on del Pezzo surfaces. <i>Journal Fur Die Reine Und Angewandte
    Mathematik</i>. Walter de Gruyter. <a href="https://doi.org/10.1515/crelle.2012.039">https://doi.org/10.1515/crelle.2012.039</a>
  chicago: Baier, Stephan, and Timothy D Browning. “Inhomogeneous Cubic Congruences
    and Rational Points on Del Pezzo Surfaces.” <i>Journal Fur Die Reine Und Angewandte
    Mathematik</i>. Walter de Gruyter, 2013. <a href="https://doi.org/10.1515/crelle.2012.039">https://doi.org/10.1515/crelle.2012.039</a>.
  ieee: S. Baier and T. D. Browning, “Inhomogeneous cubic congruences and rational
    points on del Pezzo surfaces,” <i>Journal fur die Reine und Angewandte Mathematik</i>,
    no. 680. Walter de Gruyter, pp. 69–151, 2013.
  ista: Baier S, Browning TD. 2013. Inhomogeneous cubic congruences and rational points
    on del Pezzo surfaces. Journal fur die Reine und Angewandte Mathematik. (680),
    69–151.
  mla: Baier, Stephan, and Timothy D. Browning. “Inhomogeneous Cubic Congruences and
    Rational Points on Del Pezzo Surfaces.” <i>Journal Fur Die Reine Und Angewandte
    Mathematik</i>, no. 680, Walter de Gruyter, 2013, pp. 69–151, doi:<a href="https://doi.org/10.1515/crelle.2012.039">10.1515/crelle.2012.039</a>.
  short: S. Baier, T.D. Browning, Journal Fur Die Reine Und Angewandte Mathematik
    (2013) 69–151.
date_created: 2018-12-11T11:45:24Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2021-01-12T06:57:33Z
day: '01'
doi: 10.1515/crelle.2012.039
extern: 1
issue: '680'
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1011.3434
month: '07'
oa: 1
page: 69 - 151
publication: Journal fur die Reine und Angewandte Mathematik
publication_status: published
publisher: Walter de Gruyter
publist_id: '7659'
quality_controlled: 0
status: public
title: Inhomogeneous cubic congruences and rational points on del Pezzo surfaces
type: journal_article
year: '2013'
...
---
_id: '2466'
abstract:
- lang: eng
  text: 'We introduce a new method for efficiently simulating liquid with extreme
    amounts of spatial adaptivity. Our method combines several key components to drastically
    speed up the simulation of large-scale fluid phenomena: We leverage an alternative
    Eulerian tetrahedral mesh discretization to significantly reduce the complexity
    of the pressure solve while increasing the robustness with respect to element
    quality and removing the possibility of locking. Next, we enable subtle free-surface
    phenomena by deriving novel second-order boundary conditions consistent with our
    discretization. We couple this discretization with a spatially adaptive Fluid-Implicit
    Particle (FLIP) method, enabling efficient, robust, minimally-dissipative simulations
    that can undergo sharp changes in spatial resolution while minimizing artifacts.
    Along the way, we provide a new method for generating a smooth and detailed surface
    from a set of particles with variable sizes. Finally, we explore several new sizing
    functions for determining spatially adaptive simulation resolutions, and we show
    how to couple them to our simulator. We combine each of these elements to produce
    a simulation algorithm that is capable of creating animations at high maximum
    resolutions while avoiding common pitfalls like inaccurate boundary conditions
    and inefficient computation.'
article_number: '103'
article_processing_charge: No
author:
- first_name: Ryoichi
  full_name: Ando, Ryoichi
  last_name: Ando
- first_name: Nils
  full_name: Thuerey, Nils
  last_name: Thuerey
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
date_created: 2018-12-11T11:57:50Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2024-11-19T11:56:45Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2461912.2461982
file:
- access_level: open_access
  checksum: aeea6b0ff2b27c695aeb8408c7d2fc50
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:25Z
  date_updated: 2020-07-14T12:45:41Z
  file_id: '5279'
  file_name: IST-2016-605-v1+1_tetflip_fixed.pdf
  file_size: 8601561
  relation: main_file
file_date_updated: 2020-07-14T12:45:41Z
has_accepted_license: '1'
intvolume: '        32'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '4436'
pubrep_id: '605'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Highly adaptive liquid simulations on tetrahedral meshes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2013'
...
---
_id: '2467'
abstract:
- lang: eng
  text: This paper presents a method for computing topology changes for triangle meshes
    in an interactive geometric modeling environment. Most triangle meshes in practice
    do not exhibit desirable geometric properties, so we develop a solution that is
    independent of standard assumptions and robust to geometric errors. Specifically,
    we provide the first method for topology change applicable to arbitrary non-solid,
    non-manifold, non-closed, self-intersecting surfaces. We prove that this new method
    for topology change produces the expected conventional results when applied to
    solid (closed, manifold, non-self-intersecting) surfaces---that is, we prove a
    backwards-compatibility property relative to prior work. Beyond solid surfaces,
    we present empirical evidence that our method remains tolerant to a variety of
    surface aberrations through the incorporation of a novel error correction scheme.
    Finally, we demonstrate how topology change applied to non-solid objects enables
    wholly new and useful behaviors.
article_number: '34'
author:
- first_name: Gilbert
  full_name: Bernstein, Gilbert
  last_name: Bernstein
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
citation:
  ama: 'Bernstein G, Wojtan C. Putting holes in holey geometry: Topology change for
    arbitrary surfaces. <i>ACM Transactions on Graphics</i>. 2013;32(4). doi:<a href="https://doi.org/10.1145/2461912.2462027">10.1145/2461912.2462027</a>'
  apa: 'Bernstein, G., &#38; Wojtan, C. (2013). Putting holes in holey geometry: Topology
    change for arbitrary surfaces. <i>ACM Transactions on Graphics</i>. ACM. <a href="https://doi.org/10.1145/2461912.2462027">https://doi.org/10.1145/2461912.2462027</a>'
  chicago: 'Bernstein, Gilbert, and Chris Wojtan. “Putting Holes in Holey Geometry:
    Topology Change for Arbitrary Surfaces.” <i>ACM Transactions on Graphics</i>.
    ACM, 2013. <a href="https://doi.org/10.1145/2461912.2462027">https://doi.org/10.1145/2461912.2462027</a>.'
  ieee: 'G. Bernstein and C. Wojtan, “Putting holes in holey geometry: Topology change
    for arbitrary surfaces,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4.
    ACM, 2013.'
  ista: 'Bernstein G, Wojtan C. 2013. Putting holes in holey geometry: Topology change
    for arbitrary surfaces. ACM Transactions on Graphics. 32(4), 34.'
  mla: 'Bernstein, Gilbert, and Chris Wojtan. “Putting Holes in Holey Geometry: Topology
    Change for Arbitrary Surfaces.” <i>ACM Transactions on Graphics</i>, vol. 32,
    no. 4, 34, ACM, 2013, doi:<a href="https://doi.org/10.1145/2461912.2462027">10.1145/2461912.2462027</a>.'
  short: G. Bernstein, C. Wojtan, ACM Transactions on Graphics 32 (2013).
date_created: 2018-12-11T11:57:50Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2023-02-23T10:44:16Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2461912.2462027
file:
- access_level: open_access
  checksum: 9c8425d62246996ca632c5a01870515b
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:09:43Z
  date_updated: 2020-07-14T12:45:41Z
  file_id: '4768'
  file_name: IST-2016-604-v1+1_toptop2013.pdf
  file_size: 3514674
  relation: main_file
file_date_updated: 2020-07-14T12:45:41Z
has_accepted_license: '1'
intvolume: '        32'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '4435'
pubrep_id: '604'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Putting holes in holey geometry: Topology change for arbitrary surfaces'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2013'
...
---
_id: '2468'
abstract:
- lang: eng
  text: Our work concerns the combination of an Eulerian liquid simulation with a
    high-resolution surface tracker (e.g. the level set method or a Lagrangian triangle
    mesh). The naive application of a high-resolution surface tracker to a low-resolution
    velocity field can produce many visually disturbing physical and topological artifacts
    that limit their use in practice. We address these problems by defining an error
    function which compares the current state of the surface tracker to the set of
    physically valid surface states. By reducing this error with a gradient descent
    technique, we introduce a novel physics-based surface fairing method. Similarly,
    by treating this error function as a potential energy, we derive a new surface
    correction force that mimics the vortex sheet equations. We demonstrate our results
    with both level set and mesh-based surface trackers.
article_number: '68'
author:
- first_name: Morten
  full_name: Bojsen-Hansen, Morten
  id: 439F0C8C-F248-11E8-B48F-1D18A9856A87
  last_name: Bojsen-Hansen
  orcid: 0000-0002-4417-3224
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
citation:
  ama: Bojsen-Hansen M, Wojtan C. Liquid surface tracking with error compensation.
    <i>ACM Transactions on Graphics</i>. 2013;32(4). doi:<a href="https://doi.org/10.1145/2461912.2461991">10.1145/2461912.2461991</a>
  apa: Bojsen-Hansen, M., &#38; Wojtan, C. (2013). Liquid surface tracking with error
    compensation. <i>ACM Transactions on Graphics</i>. ACM. <a href="https://doi.org/10.1145/2461912.2461991">https://doi.org/10.1145/2461912.2461991</a>
  chicago: Bojsen-Hansen, Morten, and Chris Wojtan. “Liquid Surface Tracking with
    Error Compensation.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href="https://doi.org/10.1145/2461912.2461991">https://doi.org/10.1145/2461912.2461991</a>.
  ieee: M. Bojsen-Hansen and C. Wojtan, “Liquid surface tracking with error compensation,”
    <i>ACM Transactions on Graphics</i>, vol. 32, no. 4. ACM, 2013.
  ista: Bojsen-Hansen M, Wojtan C. 2013. Liquid surface tracking with error compensation.
    ACM Transactions on Graphics. 32(4), 68.
  mla: Bojsen-Hansen, Morten, and Chris Wojtan. “Liquid Surface Tracking with Error
    Compensation.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4, 68, ACM, 2013,
    doi:<a href="https://doi.org/10.1145/2461912.2461991">10.1145/2461912.2461991</a>.
  short: M. Bojsen-Hansen, C. Wojtan, ACM Transactions on Graphics 32 (2013).
date_created: 2018-12-11T11:57:50Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2023-02-23T10:44:18Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2461912.2461991
file:
- access_level: open_access
  checksum: 53d905e0180e23ef3e813b969ffed4e1
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:09:37Z
  date_updated: 2020-07-14T12:45:41Z
  file_id: '4761'
  file_name: IST-2016-603-v1+1_liquidError_web.pdf
  file_size: 5813685
  relation: main_file
file_date_updated: 2020-07-14T12:45:41Z
has_accepted_license: '1'
intvolume: '        32'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '4434'
pubrep_id: '603'
quality_controlled: '1'
scopus_import: 1
status: public
title: Liquid surface tracking with error compensation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2013'
...
---
_id: '2469'
abstract:
- lang: eng
  text: Cadherins are transmembrane proteins that mediate cell–cell adhesion in animals.
    By regulating contact formation and stability, cadherins play a crucial role in
    tissue morphogenesis and homeostasis. Here, we review the three major  unctions
    of cadherins in cell–cell contact formation and stability. Two of those functions
    lead to a decrease in interfacial ension at the forming cell–cell contact, thereby
    promoting contact expansion — first, by providing adhesion tension that lowers
    interfacial tension at the cell–cell contact, and second, by signaling to the
    actomyosin cytoskeleton in order to reduce cortex tension and thus interfacial
    tension at the contact. The third function of cadherins in cell–cell contact formation
    is to stabilize the contact by resisting mechanical forces that pull on the contact.
author:
- first_name: Jean-Léon
  full_name: Maître, Jean-Léon
  id: 48F1E0D8-F248-11E8-B48F-1D18A9856A87
  last_name: Maître
  orcid: 0000-0002-3688-1474
- 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: Maître J-L, Heisenberg C-PJ. Three functions of cadherins in cell adhesion.
    <i>Current Biology</i>. 2013;23(14):R626-R633. doi:<a href="https://doi.org/10.1016/j.cub.2013.06.019">10.1016/j.cub.2013.06.019</a>
  apa: Maître, J.-L., &#38; Heisenberg, C.-P. J. (2013). Three functions of cadherins
    in cell adhesion. <i>Current Biology</i>. Cell Press. <a href="https://doi.org/10.1016/j.cub.2013.06.019">https://doi.org/10.1016/j.cub.2013.06.019</a>
  chicago: Maître, Jean-Léon, and Carl-Philipp J Heisenberg. “Three Functions of Cadherins
    in Cell Adhesion.” <i>Current Biology</i>. Cell Press, 2013. <a href="https://doi.org/10.1016/j.cub.2013.06.019">https://doi.org/10.1016/j.cub.2013.06.019</a>.
  ieee: J.-L. Maître and C.-P. J. Heisenberg, “Three functions of cadherins in cell
    adhesion,” <i>Current Biology</i>, vol. 23, no. 14. Cell Press, pp. R626–R633,
    2013.
  ista: Maître J-L, Heisenberg C-PJ. 2013. Three functions of cadherins in cell adhesion.
    Current Biology. 23(14), R626–R633.
  mla: Maître, Jean-Léon, and Carl-Philipp J. Heisenberg. “Three Functions of Cadherins
    in Cell Adhesion.” <i>Current Biology</i>, vol. 23, no. 14, Cell Press, 2013,
    pp. R626–33, doi:<a href="https://doi.org/10.1016/j.cub.2013.06.019">10.1016/j.cub.2013.06.019</a>.
  short: J.-L. Maître, C.-P.J. Heisenberg, Current Biology 23 (2013) R626–R633.
date_created: 2018-12-11T11:57:51Z
date_published: 2013-07-22T00:00:00Z
date_updated: 2021-01-12T06:57:40Z
day: '22'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.1016/j.cub.2013.06.019
external_id:
  pmid:
  - '23885883'
file:
- access_level: open_access
  checksum: 6a424b2f007b41d4955a9135793b2162
  content_type: application/pdf
  creator: dernst
  date_created: 2019-01-24T15:40:22Z
  date_updated: 2020-07-14T12:45:41Z
  file_id: '5881'
  file_name: 2013_CurrentBiology_Maitre.pdf
  file_size: 247320
  relation: main_file
file_date_updated: 2020-07-14T12:45:41Z
has_accepted_license: '1'
intvolume: '        23'
issue: '14'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: R626 - R633
pmid: 1
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '4433'
quality_controlled: '1'
scopus_import: 1
status: public
title: Three functions of cadherins in cell adhesion
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: 23
year: '2013'
...
---
_id: '2470'
abstract:
- lang: eng
  text: Background:Auxin binding protein 1 (ABP1) is a putative auxin receptor and
    its function is indispensable for plant growth and development. ABP1 has been
    shown to be involved in auxin-dependent regulation of cell division and expansion,
    in plasma-membrane-related processes such as changes in transmembrane potential,
    and in the regulation of clathrin-dependent endocytosis. However, the ABP1-regulated
    downstream pathway remains elusive.Methodology/Principal Findings:Using auxin
    transport assays and quantitative analysis of cellular morphology we show that
    ABP1 regulates auxin efflux from tobacco BY-2 cells. The overexpression of ABP1can
    counterbalance increased auxin efflux and auxin starvation phenotypes caused by
    the overexpression of PIN auxin efflux carrier. Relevant mechanism involves the
    ABP1-controlled vesicle trafficking processes, including positive regulation of
    endocytosis of PIN auxin efflux carriers, as indicated by fluorescence recovery
    after photobleaching (FRAP) and pharmacological manipulations.Conclusions/Significance:The
    findings indicate the involvement of ABP1 in control of rate of auxin transport
    across plasma membrane emphasizing the role of ABP1 in regulation of PIN activity
    at the plasma membrane, and highlighting the relevance of ABP1 for the formation
    of developmentally important, PIN-dependent auxin gradients.
article_number: e70050
author:
- first_name: Milada
  full_name: Čovanová, Milada
  last_name: Čovanová
- first_name: Michael
  full_name: Sauer, Michael
  last_name: Sauer
- first_name: Jan
  full_name: Rychtář, Jan
  last_name: Rychtář
- first_name: Jirí
  full_name: Friml, Jirí
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
- first_name: Jan
  full_name: Petrášek, Jan
  last_name: Petrášek
- first_name: Eva
  full_name: Zažímalová, Eva
  last_name: Zažímalová
citation:
  ama: Čovanová M, Sauer M, Rychtář J, Friml J, Petrášek J, Zažímalová E. Overexpression
    of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco
    cells. <i>PLoS One</i>. 2013;8(7). doi:<a href="https://doi.org/10.1371/journal.pone.0070050">10.1371/journal.pone.0070050</a>
  apa: Čovanová, M., Sauer, M., Rychtář, J., Friml, J., Petrášek, J., &#38; Zažímalová,
    E. (2013). Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent
    auxin transport in tobacco cells. <i>PLoS One</i>. Public Library of Science.
    <a href="https://doi.org/10.1371/journal.pone.0070050">https://doi.org/10.1371/journal.pone.0070050</a>
  chicago: Čovanová, Milada, Michael Sauer, Jan Rychtář, Jiří Friml, Jan Petrášek,
    and Eva Zažímalová. “Overexpression of the Auxin Binding PROTEIN1 Modulates PIN-Dependent
    Auxin Transport in Tobacco Cells.” <i>PLoS One</i>. Public Library of Science,
    2013. <a href="https://doi.org/10.1371/journal.pone.0070050">https://doi.org/10.1371/journal.pone.0070050</a>.
  ieee: M. Čovanová, M. Sauer, J. Rychtář, J. Friml, J. Petrášek, and E. Zažímalová,
    “Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport
    in tobacco cells,” <i>PLoS One</i>, vol. 8, no. 7. Public Library of Science,
    2013.
  ista: Čovanová M, Sauer M, Rychtář J, Friml J, Petrášek J, Zažímalová E. 2013. Overexpression
    of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco
    cells. PLoS One. 8(7), e70050.
  mla: Čovanová, Milada, et al. “Overexpression of the Auxin Binding PROTEIN1 Modulates
    PIN-Dependent Auxin Transport in Tobacco Cells.” <i>PLoS One</i>, vol. 8, no.
    7, e70050, Public Library of Science, 2013, doi:<a href="https://doi.org/10.1371/journal.pone.0070050">10.1371/journal.pone.0070050</a>.
  short: M. Čovanová, M. Sauer, J. Rychtář, J. Friml, J. Petrášek, E. Zažímalová,
    PLoS One 8 (2013).
date_created: 2018-12-11T11:57:51Z
date_published: 2013-07-23T00:00:00Z
date_updated: 2021-01-12T06:57:40Z
day: '23'
ddc:
- '570'
department:
- _id: JiFr
doi: 10.1371/journal.pone.0070050
file:
- access_level: open_access
  checksum: 2d47ef47616ef4de1d517d146548184e
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:08:21Z
  date_updated: 2020-07-14T12:45:41Z
  file_id: '4681'
  file_name: IST-2016-413-v1+1_journal.pone.0070050.pdf
  file_size: 2294955
  relation: main_file
file_date_updated: 2020-07-14T12:45:41Z
has_accepted_license: '1'
intvolume: '         8'
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '4432'
pubrep_id: '413'
quality_controlled: '1'
scopus_import: 1
status: public
title: Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin
  transport in tobacco cells
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2013'
...
---
_id: '2471'
abstract:
- lang: eng
  text: The impact of disulfide bonds on protein stability goes beyond simple equilibrium
    thermodynamics effects associated with the conformational entropy of the unfolded
    state. Indeed, disulfide crosslinks may play a role in the prevention of dysfunctional
    association and strongly affect the rates of irreversible enzyme inactivation,
    highly relevant in biotechnological applications. While these kinetic-stability
    effects remain poorly understood, by analogy with proposed mechanisms for processes
    of protein aggregation and fibrillogenesis, we propose that they may be determined
    by the properties of sparsely-populated, partially-unfolded intermediates. Here
    we report the successful design, on the basis of high temperature molecular-dynamics
    simulations, of six thermodynamically and kinetically stabilized variants of phytase
    from Citrobacter braakii (a biotechnologically important enzyme) with one, two
    or three engineered disulfides. Activity measurements and 3D crystal structure
    determination demonstrate that the engineered crosslinks do not cause dramatic
    alterations in the native structure. The inactivation kinetics for all the variants
    displays a strongly non-Arrhenius temperature dependence, with the time-scale
    for the irreversible denaturation process reaching a minimum at a given temperature
    within the range of the denaturation transition. We show this striking feature
    to be a signature of a key role played by a partially unfolded, intermediate state/ensemble.
    Energetic and mutational analyses confirm that the intermediate is highly unfolded
    (akin to a proposed critical intermediate in the misfolding of the prion protein),
    a result that explains the observed kinetic stabilization. Our results provide
    a rationale for the kinetic-stability consequences of disulfide-crosslink engineering
    and an experimental methodology to arrive at energetic/structural descriptions
    of the sparsely populated and elusive intermediates that play key roles in irreversible
    protein denaturation.
article_number: e70013
author:
- first_name: Inmaculada
  full_name: Sanchez Romero, Inmaculada
  id: 3D9C5D30-F248-11E8-B48F-1D18A9856A87
  last_name: Sanchez Romero
- first_name: Antonio
  full_name: Ariza, Antonio
  last_name: Ariza
- first_name: Keith
  full_name: Wilson, Keith
  last_name: Wilson
- first_name: Michael
  full_name: Skjøt, Michael
  last_name: Skjøt
- first_name: Jesper
  full_name: Vind, Jesper
  last_name: Vind
- first_name: Leonardo
  full_name: De Maria, Leonardo
  last_name: De Maria
- first_name: Lars
  full_name: Skov, Lars
  last_name: Skov
- first_name: Jose
  full_name: Sánchez Ruiz, Jose
  last_name: Sánchez Ruiz
citation:
  ama: Sanchez-Romero I, Ariza A, Wilson K, et al. Mechanism of protein kinetic stabilization
    by engineered disulfide crosslinks. <i>PLoS One</i>. 2013;8(7). doi:<a href="https://doi.org/10.1371/journal.pone.0070013">10.1371/journal.pone.0070013</a>
  apa: Sanchez-Romero, I., Ariza, A., Wilson, K., Skjøt, M., Vind, J., De Maria, L.,
    … Sánchez Ruiz, J. (2013). Mechanism of protein kinetic stabilization by engineered
    disulfide crosslinks. <i>PLoS One</i>. Public Library of Science. <a href="https://doi.org/10.1371/journal.pone.0070013">https://doi.org/10.1371/journal.pone.0070013</a>
  chicago: Sanchez-Romero, Inmaculada, Antonio Ariza, Keith Wilson, Michael Skjøt,
    Jesper Vind, Leonardo De Maria, Lars Skov, and Jose Sánchez Ruiz. “Mechanism of
    Protein Kinetic Stabilization by Engineered Disulfide Crosslinks.” <i>PLoS One</i>.
    Public Library of Science, 2013. <a href="https://doi.org/10.1371/journal.pone.0070013">https://doi.org/10.1371/journal.pone.0070013</a>.
  ieee: I. Sanchez-Romero <i>et al.</i>, “Mechanism of protein kinetic stabilization
    by engineered disulfide crosslinks,” <i>PLoS One</i>, vol. 8, no. 7. Public Library
    of Science, 2013.
  ista: Sanchez-Romero I, Ariza A, Wilson K, Skjøt M, Vind J, De Maria L, Skov L,
    Sánchez Ruiz J. 2013. Mechanism of protein kinetic stabilization by engineered
    disulfide crosslinks. PLoS One. 8(7), e70013.
  mla: Sanchez-Romero, Inmaculada, et al. “Mechanism of Protein Kinetic Stabilization
    by Engineered Disulfide Crosslinks.” <i>PLoS One</i>, vol. 8, no. 7, e70013, Public
    Library of Science, 2013, doi:<a href="https://doi.org/10.1371/journal.pone.0070013">10.1371/journal.pone.0070013</a>.
  short: I. Sanchez-Romero, A. Ariza, K. Wilson, M. Skjøt, J. Vind, L. De Maria, L.
    Skov, J. Sánchez Ruiz, PLoS One 8 (2013).
date_created: 2018-12-11T11:57:51Z
date_published: 2013-07-30T00:00:00Z
date_updated: 2021-01-12T06:57:41Z
day: '30'
ddc:
- '570'
department:
- _id: HaJa
doi: 10.1371/journal.pone.0070013
file:
- access_level: open_access
  checksum: c0c96cc76ed7ef0d036a31a7e33c9a37
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:15:07Z
  date_updated: 2020-07-14T12:45:41Z
  file_id: '5124'
  file_name: IST-2016-414-v1+1_journal.pone.0070013.pdf
  file_size: 1323666
  relation: main_file
file_date_updated: 2020-07-14T12:45:41Z
has_accepted_license: '1'
intvolume: '         8'
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '4430'
pubrep_id: '414'
quality_controlled: '1'
scopus_import: 1
status: public
title: Mechanism of protein kinetic stabilization by engineered disulfide crosslinks
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: '2013'
...
---
_id: '2472'
abstract:
- lang: eng
  text: Plant-specific PIN-formed (PIN) efflux transporters for the plant hormone
    auxin are required for tissue-specific directional auxin transport and cellular
    auxin homeostasis. The Arabidopsis PIN protein family has been shown to play important
    roles in developmental processes such as embryogenesis, organogenesis, vascular
    tissue differentiation, root meristem patterning and tropic growth. Here we analyzed
    roles of the less characterised Arabidopsis PIN6 auxin transporter. PIN6 is auxin-inducible
    and is expressed during multiple auxin-regulated developmental processes. Loss
    of pin6 function interfered with primary root growth and lateral root development.
    Misexpression of PIN6 affected auxin transport and interfered with auxin homeostasis
    in other growth processes such as shoot apical dominance, lateral root primordia
    development, adventitious root formation, root hair outgrowth and root waving.
    These changes in auxin-regulated growth correlated with a reduction in total auxin
    transport as well as with an altered activity of DR5-GUS auxin response reporter.
    Overall, the data indicate that PIN6 regulates auxin homeostasis during plant
    development.
article_number: e70069
author:
- first_name: Christopher
  full_name: Cazzonelli, Christopher
  last_name: Cazzonelli
- first_name: Marleen
  full_name: Vanstraelen, Marleen
  last_name: Vanstraelen
- first_name: Sibu
  full_name: Simon, Sibu
  id: 4542EF9A-F248-11E8-B48F-1D18A9856A87
  last_name: Simon
  orcid: 0000-0002-1998-6741
- first_name: Kuide
  full_name: Yin, Kuide
  last_name: Yin
- first_name: Ashley
  full_name: Carron Arthur, Ashley
  last_name: Carron Arthur
- first_name: Nazia
  full_name: Nisar, Nazia
  last_name: Nisar
- first_name: Gauri
  full_name: Tarle, Gauri
  last_name: Tarle
- first_name: Abby
  full_name: Cuttriss, Abby
  last_name: Cuttriss
- first_name: Iain
  full_name: Searle, Iain
  last_name: Searle
- first_name: Eva
  full_name: Benková, Eva
  id: 38F4F166-F248-11E8-B48F-1D18A9856A87
  last_name: Benková
  orcid: 0000-0002-8510-9739
- first_name: Ulrike
  full_name: Mathesius, Ulrike
  last_name: Mathesius
- first_name: Josette
  full_name: Masle, Josette
  last_name: Masle
- first_name: Jirí
  full_name: Friml, Jirí
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
- first_name: Barry
  full_name: Pogson, Barry
  last_name: Pogson
citation:
  ama: Cazzonelli C, Vanstraelen M, Simon S, et al. Role of the Arabidopsis PIN6 auxin
    transporter in auxin homeostasis and auxin-mediated development. <i>PLoS One</i>.
    2013;8(7). doi:<a href="https://doi.org/10.1371/journal.pone.0070069">10.1371/journal.pone.0070069</a>
  apa: Cazzonelli, C., Vanstraelen, M., Simon, S., Yin, K., Carron Arthur, A., Nisar,
    N., … Pogson, B. (2013). Role of the Arabidopsis PIN6 auxin transporter in auxin
    homeostasis and auxin-mediated development. <i>PLoS One</i>. Public Library of
    Science. <a href="https://doi.org/10.1371/journal.pone.0070069">https://doi.org/10.1371/journal.pone.0070069</a>
  chicago: Cazzonelli, Christopher, Marleen Vanstraelen, Sibu Simon, Kuide Yin, Ashley
    Carron Arthur, Nazia Nisar, Gauri Tarle, et al. “Role of the Arabidopsis PIN6
    Auxin Transporter in Auxin Homeostasis and Auxin-Mediated Development.” <i>PLoS
    One</i>. Public Library of Science, 2013. <a href="https://doi.org/10.1371/journal.pone.0070069">https://doi.org/10.1371/journal.pone.0070069</a>.
  ieee: C. Cazzonelli <i>et al.</i>, “Role of the Arabidopsis PIN6 auxin transporter
    in auxin homeostasis and auxin-mediated development,” <i>PLoS One</i>, vol. 8,
    no. 7. Public Library of Science, 2013.
  ista: Cazzonelli C, Vanstraelen M, Simon S, Yin K, Carron Arthur A, Nisar N, Tarle
    G, Cuttriss A, Searle I, Benková E, Mathesius U, Masle J, Friml J, Pogson B. 2013.
    Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated
    development. PLoS One. 8(7), e70069.
  mla: Cazzonelli, Christopher, et al. “Role of the Arabidopsis PIN6 Auxin Transporter
    in Auxin Homeostasis and Auxin-Mediated Development.” <i>PLoS One</i>, vol. 8,
    no. 7, e70069, Public Library of Science, 2013, doi:<a href="https://doi.org/10.1371/journal.pone.0070069">10.1371/journal.pone.0070069</a>.
  short: C. Cazzonelli, M. Vanstraelen, S. Simon, K. Yin, A. Carron Arthur, N. Nisar,
    G. Tarle, A. Cuttriss, I. Searle, E. Benková, U. Mathesius, J. Masle, J. Friml,
    B. Pogson, PLoS One 8 (2013).
date_created: 2018-12-11T11:57:52Z
date_published: 2013-07-29T00:00:00Z
date_updated: 2021-01-12T06:57:41Z
day: '29'
ddc:
- '580'
- '570'
department:
- _id: JiFr
- _id: EvBe
doi: 10.1371/journal.pone.0070069
ec_funded: 1
file:
- access_level: open_access
  checksum: 3be71828b6c2ba9c90eb7056e3f7f57a
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:16:34Z
  date_updated: 2020-07-14T12:45:41Z
  file_id: '5222'
  file_name: IST-2015-393-v1+1_journal.pone.0070069.pdf
  file_size: 9003465
  relation: main_file
file_date_updated: 2020-07-14T12:45:41Z
has_accepted_license: '1'
intvolume: '         8'
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 253FCA6A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '207362'
  name: Hormonal cross-talk in plant organogenesis
- _id: 25716A02-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '282300'
  name: Polarity and subcellular dynamics in plants
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '4431'
pubrep_id: '393'
quality_controlled: '1'
scopus_import: 1
status: public
title: Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated
  development
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: '2013'
...
---
_id: '2473'
abstract:
- lang: eng
  text: 'When a mutation with selective advantage s spreads through a panmictic population,
    it may cause two lineages at a linked locus to coalesce; the probability of coalescence
    is exp(−2rT), where T∼log(2Ns)/s is the time to fixation, N is the number of haploid
    individuals, and r is the recombination rate. Population structure delays fixation,
    and so weakens the effect of a selective sweep. However, favourable alleles spread
    through a spatially continuous population behind a narrow wavefront; ancestral
    lineages are confined at the tip of this front, and so coalesce rapidly. In extremely
    dense populations, coalescence is dominated by rare fluctuations ahead of the
    front. However, we show that for moderate densities, a simple quasi-deterministic
    approximation applies: the rate of coalescence within the front is λ∼2g(η)/(ρℓ),
    where ρ is the population density and  is the characteristic scale of the wavefront;
    g(η) depends only on the strength of random drift,  . The net effect of a sweep
    on coalescence also depends crucially on whether two lineages are ever both within
    the wavefront at the same time: even in the extreme case when coalescence within
    the front is instantaneous, the net rate of coalescence may be lower than in a
    single panmictic population. Sweeps can also have a substantial impact on the
    rate of gene flow. A single lineage will jump to a new location when it is hit
    by a sweep, with mean square displacement  ; this can be substantial if the species’
    range, L, is large, even if the species-wide rate of sweeps per map length, Λ/R,
    is small. This effect is half as strong in two dimensions. In contrast, the rate
    of coalescence between lineages, at random locations in space and on the genetic
    map, is proportional to (c/L)(Λ/R), where c is the wavespeed: thus, on average,
    one-dimensional structure is likely to reduce coalescence due to sweeps, relative
    to panmixis. In two dimensions, genes must move along the front before they can
    coalesce; this process is rapid, being dominated by rare fluctuations. This leads
    to a dramatically higher rate of coalescence within the wavefront than if lineages
    simply diffused along the front. Nevertheless, the net rate of coalescence due
    to a sweep through a two-dimensional population is likely to be lower than it
    would be with panmixis.'
author:
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
- first_name: Alison
  full_name: Etheridge, Alison
  last_name: Etheridge
- first_name: Jerome
  full_name: Kelleher, Jerome
  last_name: Kelleher
- first_name: Amandine
  full_name: Véber, Amandine
  last_name: Véber
citation:
  ama: Barton NH, Etheridge A, Kelleher J, Véber A. Genetic hitch-hiking in spatially
    extended populations. <i>Theoretical Population Biology</i>. 2013;87(8):75-89.
    doi:<a href="https://doi.org/10.1016/j.tpb.2012.12.001">10.1016/j.tpb.2012.12.001</a>
  apa: Barton, N. H., Etheridge, A., Kelleher, J., &#38; Véber, A. (2013). Genetic
    hitch-hiking in spatially extended populations. <i>Theoretical Population Biology</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.tpb.2012.12.001">https://doi.org/10.1016/j.tpb.2012.12.001</a>
  chicago: Barton, Nicholas H, Alison Etheridge, Jerome Kelleher, and Amandine Véber.
    “Genetic Hitch-Hiking in Spatially Extended Populations.” <i>Theoretical Population
    Biology</i>. Elsevier, 2013. <a href="https://doi.org/10.1016/j.tpb.2012.12.001">https://doi.org/10.1016/j.tpb.2012.12.001</a>.
  ieee: N. H. Barton, A. Etheridge, J. Kelleher, and A. Véber, “Genetic hitch-hiking
    in spatially extended populations,” <i>Theoretical Population Biology</i>, vol.
    87, no. 8. Elsevier, pp. 75–89, 2013.
  ista: Barton NH, Etheridge A, Kelleher J, Véber A. 2013. Genetic hitch-hiking in
    spatially extended populations. Theoretical Population Biology. 87(8), 75–89.
  mla: Barton, Nicholas H., et al. “Genetic Hitch-Hiking in Spatially Extended Populations.”
    <i>Theoretical Population Biology</i>, vol. 87, no. 8, Elsevier, 2013, pp. 75–89,
    doi:<a href="https://doi.org/10.1016/j.tpb.2012.12.001">10.1016/j.tpb.2012.12.001</a>.
  short: N.H. Barton, A. Etheridge, J. Kelleher, A. Véber, Theoretical Population
    Biology 87 (2013) 75–89.
date_created: 2018-12-11T11:57:52Z
date_published: 2013-01-03T00:00:00Z
date_updated: 2021-01-12T06:57:42Z
day: '03'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1016/j.tpb.2012.12.001
ec_funded: 1
file:
- access_level: open_access
  checksum: 4274ec1f433b838a7d5b941cc9684ca7
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:18:54Z
  date_updated: 2020-07-14T12:45:41Z
  file_id: '5376'
  file_name: IST-2013-118-v1+1_bartonetalRevision.pdf
  file_size: 1706282
  relation: main_file
file_date_updated: 2020-07-14T12:45:41Z
has_accepted_license: '1'
intvolume: '        87'
issue: '8'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 75 - 89
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '250152'
  name: Limits to selection in biology and in evolutionary computation
publication: Theoretical Population Biology
publication_status: published
publisher: Elsevier
publist_id: '4428'
pubrep_id: '118'
quality_controlled: '1'
scopus_import: 1
status: public
title: Genetic hitch-hiking in spatially extended populations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 87
year: '2013'
...
---
_id: '250'
abstract:
- lang: eng
  text: Châtelet surfaces provide a rich source of geometrically rational surfaces
    that do not always satisfy the Hasse principle. Restricting attention to a special
    class of Châtelet surfaces, we investigate the frequency that such counter-examples
    arise over the rational numbers.
acknowledgement: While working on this paper, the first author was supported by an
  IUF Junior and ANR while the second author was supported by ERC grant 306457.
author:
- first_name: Régis
  full_name: de la Bretèche, Régis
  last_name: De La Bretèche
- first_name: Timothy D
  full_name: Timothy Browning
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
citation:
  ama: De La Bretèche R, Browning TD. Density of Châtelet surfaces failing the Hasse
    principle. <i>Proceedings of the London Mathematical Society</i>. 2013;108(4):1030-1078.
    doi:<a href="https://doi.org/10.1112/plms/pdt060">10.1112/plms/pdt060</a>
  apa: De La Bretèche, R., &#38; Browning, T. D. (2013). Density of Châtelet surfaces
    failing the Hasse principle. <i>Proceedings of the London Mathematical Society</i>.
    Oxford University Press. <a href="https://doi.org/10.1112/plms/pdt060">https://doi.org/10.1112/plms/pdt060</a>
  chicago: De La Bretèche, Régis, and Timothy D Browning. “Density of Châtelet Surfaces
    Failing the Hasse Principle.” <i>Proceedings of the London Mathematical Society</i>.
    Oxford University Press, 2013. <a href="https://doi.org/10.1112/plms/pdt060">https://doi.org/10.1112/plms/pdt060</a>.
  ieee: R. De La Bretèche and T. D. Browning, “Density of Châtelet surfaces failing
    the Hasse principle,” <i>Proceedings of the London Mathematical Society</i>, vol.
    108, no. 4. Oxford University Press, pp. 1030–1078, 2013.
  ista: De La Bretèche R, Browning TD. 2013. Density of Châtelet surfaces failing
    the Hasse principle. Proceedings of the London Mathematical Society. 108(4), 1030–1078.
  mla: De La Bretèche, Régis, and Timothy D. Browning. “Density of Châtelet Surfaces
    Failing the Hasse Principle.” <i>Proceedings of the London Mathematical Society</i>,
    vol. 108, no. 4, Oxford University Press, 2013, pp. 1030–78, doi:<a href="https://doi.org/10.1112/plms/pdt060">10.1112/plms/pdt060</a>.
  short: R. De La Bretèche, T.D. Browning, Proceedings of the London Mathematical
    Society 108 (2013) 1030–1078.
date_created: 2018-12-11T11:45:26Z
date_published: 2013-11-29T00:00:00Z
date_updated: 2021-01-12T06:57:51Z
day: '29'
doi: 10.1112/plms/pdt060
extern: 1
intvolume: '       108'
issue: '4'
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1210.4010
month: '11'
oa: 1
page: 1030 - 1078
publication: Proceedings of the London Mathematical Society
publication_status: published
publisher: Oxford University Press
publist_id: '7652'
quality_controlled: 0
status: public
title: Density of Châtelet surfaces failing the Hasse principle
type: journal_article
volume: 108
year: '2013'
...
---
_id: '2517'
abstract:
- lang: eng
  text: 'Traditional formal methods are based on a Boolean satisfaction notion: a
    reactive system satisfies, or not, a given specification. We generalize formal
    methods to also address the quality of systems. As an adequate specification formalism
    we introduce the linear temporal logic LTL[F]. The satisfaction value of an LTL[F]
    formula is a number between 0 and 1, describing the quality of the satisfaction.
    The logic generalizes traditional LTL by augmenting it with a (parameterized)
    set F of arbitrary functions over the interval [0,1]. For example, F may contain
    the maximum or minimum between the satisfaction values of subformulas, their product,
    and their average. The classical decision problems in formal methods, such as
    satisfiability, model checking, and synthesis, are generalized to search and optimization
    problems in the quantitative setting. For example, model checking asks for the
    quality in which a specification is satisfied, and synthesis returns a system
    satisfying the specification with the highest quality. Reasoning about quality
    gives rise to other natural questions, like the distance between specifications.
    We formalize these basic questions and study them for LTL[F]. By extending the
    automata-theoretic approach for LTL to a setting that takes quality into an account,
    we are able to solve the above problems and show that reasoning about LTL[F] has
    roughly the same complexity as reasoning about traditional LTL.'
acknowledgement: 'ERC Grant QUALITY. '
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Shaull
  full_name: Almagor, Shaull
  last_name: Almagor
- first_name: Udi
  full_name: Boker, Udi
  id: 31E297B6-F248-11E8-B48F-1D18A9856A87
  last_name: Boker
- first_name: Orna
  full_name: Kupferman, Orna
  last_name: Kupferman
citation:
  ama: Almagor S, Boker U, Kupferman O. Formalizing and reasoning about quality. 2013;7966(Part
    2):15-27. doi:<a href="https://doi.org/10.1007/978-3-642-39212-2_3">10.1007/978-3-642-39212-2_3</a>
  apa: 'Almagor, S., Boker, U., &#38; Kupferman, O. (2013). Formalizing and reasoning
    about quality. Presented at the ICALP: Automata, Languages and Programming, Riga,
    Latvia: Springer. <a href="https://doi.org/10.1007/978-3-642-39212-2_3">https://doi.org/10.1007/978-3-642-39212-2_3</a>'
  chicago: Almagor, Shaull, Udi Boker, and Orna Kupferman. “Formalizing and Reasoning
    about Quality.” Lecture Notes in Computer Science. Springer, 2013. <a href="https://doi.org/10.1007/978-3-642-39212-2_3">https://doi.org/10.1007/978-3-642-39212-2_3</a>.
  ieee: S. Almagor, U. Boker, and O. Kupferman, “Formalizing and reasoning about quality,”
    vol. 7966, no. Part 2. Springer, pp. 15–27, 2013.
  ista: Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality.
    7966(Part 2), 15–27.
  mla: Almagor, Shaull, et al. <i>Formalizing and Reasoning about Quality</i>. Vol.
    7966, no. Part 2, Springer, 2013, pp. 15–27, doi:<a href="https://doi.org/10.1007/978-3-642-39212-2_3">10.1007/978-3-642-39212-2_3</a>.
  short: S. Almagor, U. Boker, O. Kupferman, 7966 (2013) 15–27.
conference:
  end_date: 2013-07-12
  location: Riga, Latvia
  name: 'ICALP: Automata, Languages and Programming'
  start_date: 2013-07-08
date_created: 2018-12-11T11:58:08Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2020-08-11T10:09:47Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-39212-2_3
ec_funded: 1
file:
- access_level: open_access
  checksum: 85afbf6c18a2c7e377c52c9410e2d824
  content_type: application/pdf
  creator: dernst
  date_created: 2020-05-15T11:16:12Z
  date_updated: 2020-07-14T12:45:42Z
  file_id: '7860'
  file_name: 2013_ICALP_Almagor.pdf
  file_size: 363031
  relation: main_file
file_date_updated: 2020-07-14T12:45:42Z
has_accepted_license: '1'
intvolume: '      7966'
issue: Part 2
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 15 - 27
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
publication_status: published
publisher: Springer
publist_id: '4384'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Formalizing and reasoning about quality
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7966
year: '2013'
...
---
_id: '2518'
abstract:
- lang: eng
  text: A class of valued constraint satisfaction problems (VCSPs) is characterised
    by a valued constraint language, a fixed set of cost functions on a finite domain.
    An instance of the problem is specified by a sum of cost functions from the language
    with the goal to minimise the sum. We study which classes of finite-valued languages
    can be solved exactly by the basic linear programming relaxation (BLP). Thapper
    and Živný showed [20] that if BLP solves the language then the language admits
    a binary commutative fractional polymorphism. We prove that the converse is also
    true. This leads to a necessary and a sufficient condition which can be checked
    in polynomial time for a given language. In contrast, the previous necessary and
    sufficient condition due to [20] involved infinitely many inequalities. More recently,
    Thapper and Živný [21] showed (using, in particular, a technique introduced in
    this paper) that core languages that do not satisfy our condition are NP-hard.
    Taken together, these results imply that a finite-valued language can either be
    solved using Linear Programming or is NP-hard.
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Vladimir
  full_name: Kolmogorov, Vladimir
  id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
  last_name: Kolmogorov
citation:
  ama: 'Kolmogorov V. The power of linear programming for finite-valued CSPs: A constructive
    characterization. In: Vol 7965. Springer; 2013:625-636. doi:<a href="https://doi.org/10.1007/978-3-642-39206-1_53">10.1007/978-3-642-39206-1_53</a>'
  apa: 'Kolmogorov, V. (2013). The power of linear programming for finite-valued CSPs:
    A constructive characterization (Vol. 7965, pp. 625–636). Presented at the ICALP:
    Automata, Languages and Programming, Riga, Latvia: Springer. <a href="https://doi.org/10.1007/978-3-642-39206-1_53">https://doi.org/10.1007/978-3-642-39206-1_53</a>'
  chicago: 'Kolmogorov, Vladimir. “The Power of Linear Programming for Finite-Valued
    CSPs: A Constructive Characterization,” 7965:625–36. Springer, 2013. <a href="https://doi.org/10.1007/978-3-642-39206-1_53">https://doi.org/10.1007/978-3-642-39206-1_53</a>.'
  ieee: 'V. Kolmogorov, “The power of linear programming for finite-valued CSPs: A
    constructive characterization,” presented at the ICALP: Automata, Languages and
    Programming, Riga, Latvia, 2013, vol. 7965, no. 1, pp. 625–636.'
  ista: 'Kolmogorov V. 2013. The power of linear programming for finite-valued CSPs:
    A constructive characterization. ICALP: Automata, Languages and Programming, LNCS,
    vol. 7965, 625–636.'
  mla: 'Kolmogorov, Vladimir. <i>The Power of Linear Programming for Finite-Valued
    CSPs: A Constructive Characterization</i>. Vol. 7965, no. 1, Springer, 2013, pp.
    625–36, doi:<a href="https://doi.org/10.1007/978-3-642-39206-1_53">10.1007/978-3-642-39206-1_53</a>.'
  short: V. Kolmogorov, in:, Springer, 2013, pp. 625–636.
conference:
  end_date: 2013-07-12
  location: Riga, Latvia
  name: 'ICALP: Automata, Languages and Programming'
  start_date: 2013-07-08
date_created: 2018-12-11T11:58:08Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2023-02-23T10:35:42Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/978-3-642-39206-1_53
external_id:
  arxiv:
  - '1207.7213'
intvolume: '      7965'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1207.7213
month: '07'
oa: 1
oa_version: Preprint
page: 625 - 636
publication_status: published
publisher: Springer
publist_id: '4383'
quality_controlled: '1'
related_material:
  record:
  - id: '2271'
    relation: later_version
    status: public
scopus_import: 1
status: public
title: 'The power of linear programming for finite-valued CSPs: A constructive characterization'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7965
year: '2013'
...
---
_id: '2520'
abstract:
- lang: eng
  text: "We propose a probabilistic model to infer supervised latent variables in\r\nthe
    Hamming space from observed data. Our model allows simultaneous\r\ninference of
    the number of binary latent variables, and their values. The\r\nlatent variables
    preserve neighbourhood structure of the data in a sense\r\nthat objects in the
    same semantic concept have similar latent values, and\r\nobjects in different
    concepts have dissimilar latent values. We formulate\r\nthe supervised infinite
    latent variable problem based on an intuitive\r\nprinciple of pulling objects
    together if they are of the same type, and\r\npushing them apart if they are not.
    We then combine this principle with a\r\nflexible Indian Buffet Process prior
    on the latent variables. We show that\r\nthe inferred supervised latent variables
    can be directly used to perform a\r\nnearest neighbour search for the purpose
    of retrieval.  We introduce a new\r\napplication of dynamically extending hash
    codes, and show how to\r\neffectively couple the structure of the hash codes with
    continuously\r\ngrowing structure of the neighbourhood preserving infinite latent
    feature\r\nspace."
author:
- first_name: Novi
  full_name: Quadrianto, Novi
  last_name: Quadrianto
- first_name: Viktoriia
  full_name: Sharmanska, Viktoriia
  id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87
  last_name: Sharmanska
  orcid: 0000-0003-0192-9308
- first_name: David
  full_name: Knowles, David
  last_name: Knowles
- first_name: Zoubin
  full_name: Ghahramani, Zoubin
  last_name: Ghahramani
citation:
  ama: 'Quadrianto N, Sharmanska V, Knowles D, Ghahramani Z. The supervised IBP: Neighbourhood
    preserving infinite latent feature models. In: <i>Proceedings of the 29th Conference
    Uncertainty in Artificial Intelligence</i>. AUAI Press; 2013:527-536.'
  apa: 'Quadrianto, N., Sharmanska, V., Knowles, D., &#38; Ghahramani, Z. (2013).
    The supervised IBP: Neighbourhood preserving infinite latent feature models. In
    <i>Proceedings of the 29th conference uncertainty in Artificial Intelligence</i>
    (pp. 527–536). Bellevue, WA, United States: AUAI Press.'
  chicago: 'Quadrianto, Novi, Viktoriia Sharmanska, David Knowles, and Zoubin Ghahramani.
    “The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models.”
    In <i>Proceedings of the 29th Conference Uncertainty in Artificial Intelligence</i>,
    527–36. AUAI Press, 2013.'
  ieee: 'N. Quadrianto, V. Sharmanska, D. Knowles, and Z. Ghahramani, “The supervised
    IBP: Neighbourhood preserving infinite latent feature models,” in <i>Proceedings
    of the 29th conference uncertainty in Artificial Intelligence</i>, Bellevue, WA,
    United States, 2013, pp. 527–536.'
  ista: 'Quadrianto N, Sharmanska V, Knowles D, Ghahramani Z. 2013. The supervised
    IBP: Neighbourhood preserving infinite latent feature models. Proceedings of the
    29th conference uncertainty in Artificial Intelligence. UAI: Uncertainty in Artificial
    Intelligence, 527–536.'
  mla: 'Quadrianto, Novi, et al. “The Supervised IBP: Neighbourhood Preserving Infinite
    Latent Feature Models.” <i>Proceedings of the 29th Conference Uncertainty in Artificial
    Intelligence</i>, AUAI Press, 2013, pp. 527–36.'
  short: N. Quadrianto, V. Sharmanska, D. Knowles, Z. Ghahramani, in:, Proceedings
    of the 29th Conference Uncertainty in Artificial Intelligence, AUAI Press, 2013,
    pp. 527–536.
conference:
  end_date: 2013-07-15
  location: Bellevue, WA, United States
  name: 'UAI: Uncertainty in Artificial Intelligence'
  start_date: 2013-07-11
date_created: 2018-12-11T11:58:09Z
date_published: 2013-07-11T00:00:00Z
date_updated: 2023-02-23T10:46:36Z
day: '11'
ddc:
- '000'
department:
- _id: ChLa
file:
- access_level: open_access
  checksum: 325f20c4b926bd74d39006b97df572bd
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:15:16Z
  date_updated: 2020-07-14T12:45:42Z
  file_id: '5134'
  file_name: IST-2013-137-v1+1_QuaShaKnoGha13.pdf
  file_size: 1117100
  relation: main_file
file_date_updated: 2020-07-14T12:45:42Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 527 - 536
publication: Proceedings of the 29th conference uncertainty in Artificial Intelligence
publication_identifier:
  isbn:
  - '9780974903996'
publication_status: published
publisher: AUAI Press
publist_id: '4381'
pubrep_id: '137'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'The supervised IBP: Neighbourhood preserving infinite latent feature models'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2697'
abstract:
- lang: eng
  text: We consider Hermitian and symmetric random band matrices H = (h xy ) in d⩾1
    d ⩾ 1 dimensions. The matrix entries h xy , indexed by x,y∈(Z/LZ)d x , y ∈ ( Z
    / L Z ) d , are independent, centred random variables with variances sxy=E|hxy|2
    s x y = E | h x y | 2 . We assume that s xy is negligible if |x − y| exceeds the
    band width W. In one dimension we prove that the eigenvectors of H are delocalized
    if W≫L4/5 W ≫ L 4 / 5 . We also show that the magnitude of the matrix entries
    |Gxy|2 | G x y | 2 of the resolvent G=G(z)=(H−z)−1 G = G ( z ) = ( H - z ) - 1
    is self-averaging and we compute E|Gxy|2 E | G x y | 2 . We show that, as L→∞
    L → ∞ and W≫L4/5 W ≫ L 4 / 5 , the behaviour of E|Gxy|2 E | G x y | 2 is governed
    by a diffusion operator whose diffusion constant we compute. Similar results are
    obtained in higher dimensions.
author:
- first_name: László
  full_name: László Erdös
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
- first_name: Antti
  full_name: Knowles, Antti
  last_name: Knowles
- first_name: Horng
  full_name: Yau, Horng-Tzer
  last_name: Yau
- first_name: Jun
  full_name: Yin, Jun
  last_name: Yin
citation:
  ama: Erdös L, Knowles A, Yau H, Yin J. Delocalization and diffusion profile for
    random band matrices. <i>Communications in Mathematical Physics</i>. 2013;323(1):367-416.
    doi:<a href="https://doi.org/10.1007/s00220-013-1773-3">10.1007/s00220-013-1773-3</a>
  apa: Erdös, L., Knowles, A., Yau, H., &#38; Yin, J. (2013). Delocalization and diffusion
    profile for random band matrices. <i>Communications in Mathematical Physics</i>.
    Springer. <a href="https://doi.org/10.1007/s00220-013-1773-3">https://doi.org/10.1007/s00220-013-1773-3</a>
  chicago: Erdös, László, Antti Knowles, Horng Yau, and Jun Yin. “Delocalization and
    Diffusion Profile for Random Band Matrices.” <i>Communications in Mathematical
    Physics</i>. Springer, 2013. <a href="https://doi.org/10.1007/s00220-013-1773-3">https://doi.org/10.1007/s00220-013-1773-3</a>.
  ieee: L. Erdös, A. Knowles, H. Yau, and J. Yin, “Delocalization and diffusion profile
    for random band matrices,” <i>Communications in Mathematical Physics</i>, vol.
    323, no. 1. Springer, pp. 367–416, 2013.
  ista: Erdös L, Knowles A, Yau H, Yin J. 2013. Delocalization and diffusion profile
    for random band matrices. Communications in Mathematical Physics. 323(1), 367–416.
  mla: Erdös, László, et al. “Delocalization and Diffusion Profile for Random Band
    Matrices.” <i>Communications in Mathematical Physics</i>, vol. 323, no. 1, Springer,
    2013, pp. 367–416, doi:<a href="https://doi.org/10.1007/s00220-013-1773-3">10.1007/s00220-013-1773-3</a>.
  short: L. Erdös, A. Knowles, H. Yau, J. Yin, Communications in Mathematical Physics
    323 (2013) 367–416.
date_created: 2018-12-11T11:59:07Z
date_published: 2013-10-01T00:00:00Z
date_updated: 2021-01-12T06:59:07Z
day: '01'
doi: 10.1007/s00220-013-1773-3
extern: 1
intvolume: '       323'
issue: '1'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1205.5669
month: '10'
oa: 1
page: 367 - 416
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4199'
quality_controlled: 0
status: public
title: Delocalization and diffusion profile for random band matrices
type: journal_article
volume: 323
year: '2013'
...
