---
_id: '3192'
abstract:
- lang: eng
  text: Many computer vision applications rely on the efficient optimization of challenging,
    so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach
    for optimizing such MRFs known as "roof duality" was recently introduced
    into computer vision. We study two methods which extend this approach. First,
    we discuss an efficient implementation of the "probing" technique introduced
    recently by Boros et al. [5]. It simplifies the MRF while preserving the global
    optimum. Our code is 400-700 faster on some graphs than the implementation of
    [5]. Second, we present a new technique which takes an arbitrary input labeling
    and tries to improve its energy. We give theoretical characterizations of local
    minima of this procedure. We applied both techniques to many applications, including
    image segmentation, new view synthesis, superresolution, diagram recognition,
    parameter learning, texture restoration, and image deconvolution. For several
    applications we see that we are able to find the global minimum very efficiently,
    and considerably outperform the original roof duality approach. In comparison
    to existing techniques, such as graph cut, TRW, BP, ICM, and simulated annealing,
    we nearly always find a lower energy.
author:
- first_name: Carsten
  full_name: Rother, Carsten
  last_name: Rother
- first_name: Vladimir
  full_name: Vladimir Kolmogorov
  id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
  last_name: Kolmogorov
- first_name: Victor
  full_name: Lempitsky, Victor
  last_name: Lempitsky
- first_name: Martin
  full_name: Szummer, Martin
  last_name: Szummer
citation:
  ama: 'Rother C, Kolmogorov V, Lempitsky V, Szummer M. Optimizing binary MRFs via
    extended roof duality. In: IEEE; 2007. doi:<a href="https://doi.org/10.1109/CVPR.2007.383203">10.1109/CVPR.2007.383203</a>'
  apa: 'Rother, C., Kolmogorov, V., Lempitsky, V., &#38; Szummer, M. (2007). Optimizing
    binary MRFs via extended roof duality. Presented at the CVPR: Computer Vision
    and Pattern Recognition, IEEE. <a href="https://doi.org/10.1109/CVPR.2007.383203">https://doi.org/10.1109/CVPR.2007.383203</a>'
  chicago: Rother, Carsten, Vladimir Kolmogorov, Victor Lempitsky, and Martin Szummer.
    “Optimizing Binary MRFs via Extended Roof Duality.” IEEE, 2007. <a href="https://doi.org/10.1109/CVPR.2007.383203">https://doi.org/10.1109/CVPR.2007.383203</a>.
  ieee: 'C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer, “Optimizing binary
    MRFs via extended roof duality,” presented at the CVPR: Computer Vision and Pattern
    Recognition, 2007.'
  ista: 'Rother C, Kolmogorov V, Lempitsky V, Szummer M. 2007. Optimizing binary MRFs
    via extended roof duality. CVPR: Computer Vision and Pattern Recognition.'
  mla: Rother, Carsten, et al. <i>Optimizing Binary MRFs via Extended Roof Duality</i>.
    IEEE, 2007, doi:<a href="https://doi.org/10.1109/CVPR.2007.383203">10.1109/CVPR.2007.383203</a>.
  short: C. Rother, V. Kolmogorov, V. Lempitsky, M. Szummer, in:, IEEE, 2007.
conference:
  name: 'CVPR: Computer Vision and Pattern Recognition'
date_created: 2018-12-11T12:01:55Z
date_published: 2007-07-16T00:00:00Z
date_updated: 2021-01-12T07:41:42Z
day: '16'
doi: 10.1109/CVPR.2007.383203
extern: 1
main_file_link:
- open_access: '0'
  url: http://www.robots.ox.ac.uk/~vilem/QPBOPI.pdf
month: '07'
publication_status: published
publisher: IEEE
publist_id: '3490'
quality_controlled: 0
status: public
title: Optimizing binary MRFs via extended roof duality
type: conference
year: '2007'
...
---
_id: '3193'
abstract:
- lang: eng
  text: 'Optimization techniques based on graph cuts have become a standard tool for
    many vision applications. These techniques allow to minimize efficiently certain
    energy functions corresponding to pairwise Markov Random Fields (MRFs). Currently,
    there is an accepted view within the computer vision community that graph cuts
    can only be used for optimizing a limited class of MRF energies (e.g., submodular
    functions). In this survey, we review some results that show that graph cuts can
    be applied to a much larger class of energy functions (in particular, nonsubmodular
    functions). While these results are well-known in the optimization community,
    to our knowledge they were not used in the context of computer vision and MRF
    optimization. We demonstrate the relevance of these results to vision on the problem
    of binary texture restoration. '
author:
- first_name: Vladimir
  full_name: Vladimir Kolmogorov
  id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
  last_name: Kolmogorov
- first_name: Carsten
  full_name: Rother, Carsten
  last_name: Rother
citation:
  ama: Kolmogorov V, Rother C. Minimizing nonsubmodular functions with graph cuts
    - A review. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>.
    2007;29(7):1274-1279. doi:<a href="https://doi.org/10.1109/TPAMI.2007.1031">10.1109/TPAMI.2007.1031</a>
  apa: Kolmogorov, V., &#38; Rother, C. (2007). Minimizing nonsubmodular functions
    with graph cuts - A review. <i>IEEE Transactions on Pattern Analysis and Machine
    Intelligence</i>. IEEE. <a href="https://doi.org/10.1109/TPAMI.2007.1031">https://doi.org/10.1109/TPAMI.2007.1031</a>
  chicago: Kolmogorov, Vladimir, and Carsten Rother. “Minimizing Nonsubmodular Functions
    with Graph Cuts - A Review.” <i>IEEE Transactions on Pattern Analysis and Machine
    Intelligence</i>. IEEE, 2007. <a href="https://doi.org/10.1109/TPAMI.2007.1031">https://doi.org/10.1109/TPAMI.2007.1031</a>.
  ieee: V. Kolmogorov and C. Rother, “Minimizing nonsubmodular functions with graph
    cuts - A review,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>,
    vol. 29, no. 7. IEEE, pp. 1274–1279, 2007.
  ista: Kolmogorov V, Rother C. 2007. Minimizing nonsubmodular functions with graph
    cuts - A review. IEEE Transactions on Pattern Analysis and Machine Intelligence.
    29(7), 1274–1279.
  mla: Kolmogorov, Vladimir, and Carsten Rother. “Minimizing Nonsubmodular Functions
    with Graph Cuts - A Review.” <i>IEEE Transactions on Pattern Analysis and Machine
    Intelligence</i>, vol. 29, no. 7, IEEE, 2007, pp. 1274–79, doi:<a href="https://doi.org/10.1109/TPAMI.2007.1031">10.1109/TPAMI.2007.1031</a>.
  short: V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine
    Intelligence 29 (2007) 1274–1279.
date_created: 2018-12-11T12:01:56Z
date_published: 2007-07-01T00:00:00Z
date_updated: 2021-01-12T07:41:42Z
day: '01'
doi: 10.1109/TPAMI.2007.1031
extern: 1
intvolume: '        29'
issue: '7'
month: '07'
page: 1274 - 1279
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '3491'
quality_controlled: 0
status: public
title: Minimizing nonsubmodular functions with graph cuts - A review
type: journal_article
volume: 29
year: '2007'
...
---
_id: '3218'
abstract:
- lang: eng
  text: 'A (k, ℓ)-robust combiner for collision-resistant hash-functions is a construction
    which from ℓ hash-functions constructs a hash-function which is collision-resistant
    if at least k of the components are collision-resistant. One trivially gets a
    (k, ℓ)-robust combiner by concatenating the output of any ℓ - k + 1 of the components,
    unfortunately this is not very practical as the length of the output of the combiner
    is quite large. We show that this is unavoidable as no black-box (k, ℓ)-robust
    combiner whose output is significantly shorter than what can be achieved by concatenation
    exists. This answers a question of Boneh and Boyen (Crypto''06). '
acknowledgement: Supported by DIAMANT, the Dutch national mathematics cluster for
  discrete interactive and algorithmic algebra and number theory.
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
  full_name: Krzysztof Pietrzak
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
citation:
  ama: 'Pietrzak KZ. Non-trivial black-box combiners for collision-resistant hash-functions
    don’t exist. In: Vol 4515. Springer; 2007:23-33. doi:<a href="https://doi.org/10.1007/978-3-540-72540-4_2">10.1007/978-3-540-72540-4_2</a>'
  apa: 'Pietrzak, K. Z. (2007). Non-trivial black-box combiners for collision-resistant
    hash-functions don’t exist (Vol. 4515, pp. 23–33). Presented at the EUROCRYPT:
    Theory and Applications of Cryptographic Techniques, Springer. <a href="https://doi.org/10.1007/978-3-540-72540-4_2">https://doi.org/10.1007/978-3-540-72540-4_2</a>'
  chicago: Pietrzak, Krzysztof Z. “Non-Trivial Black-Box Combiners for Collision-Resistant
    Hash-Functions Don’t Exist,” 4515:23–33. Springer, 2007. <a href="https://doi.org/10.1007/978-3-540-72540-4_2">https://doi.org/10.1007/978-3-540-72540-4_2</a>.
  ieee: 'K. Z. Pietrzak, “Non-trivial black-box combiners for collision-resistant
    hash-functions don’t exist,” presented at the EUROCRYPT: Theory and Applications
    of Cryptographic Techniques, 2007, vol. 4515, pp. 23–33.'
  ista: 'Pietrzak KZ. 2007. Non-trivial black-box combiners for collision-resistant
    hash-functions don’t exist. EUROCRYPT: Theory and Applications of Cryptographic
    Techniques, LNCS, vol. 4515, 23–33.'
  mla: Pietrzak, Krzysztof Z. <i>Non-Trivial Black-Box Combiners for Collision-Resistant
    Hash-Functions Don’t Exist</i>. Vol. 4515, Springer, 2007, pp. 23–33, doi:<a href="https://doi.org/10.1007/978-3-540-72540-4_2">10.1007/978-3-540-72540-4_2</a>.
  short: K.Z. Pietrzak, in:, Springer, 2007, pp. 23–33.
conference:
  name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
date_created: 2018-12-11T12:02:05Z
date_published: 2007-06-12T00:00:00Z
date_updated: 2021-01-12T07:41:52Z
day: '12'
doi: 10.1007/978-3-540-72540-4_2
extern: 1
intvolume: '      4515'
month: '06'
page: 23 - 33
publication_status: published
publisher: Springer
publist_id: '3461'
quality_controlled: 0
status: public
title: Non-trivial black-box combiners for collision-resistant hash-functions don't
  exist
type: conference
volume: 4515
year: '2007'
...
---
_id: '3219'
abstract:
- lang: eng
  text: 'Many aspects of cryptographic security proofs can be seen as the proof that
    a certain system (e.g. a block cipher) is indistinguishable from an ideal system
    (e.g. a random permutation), for different types of distinguishers. This paper
    presents a new generic approach to proving upper bounds on the information-theoretic
    distinguishing advantage (from an ideal system) for a combined system, assuming
    upper bounds of certain types for the component systems. For a general type of
    combination operation of systems, including the XOR of functions or the cascade
    of permutations, we prove two amplification theorems. The first is a product theorem,
    in the spirit of XOR-lemmas: The distinguishing advantage of the combination of
    two systems is at most twice the product of the individual distinguishing advantages.
    This bound is optimal. The second theorem states that the combination of systems
    is secure against some strong class of distinguishers, assuming only that the
    components are secure against some weaker class of distinguishers. A key technical
    tool of the paper is the proof of a tight two-way correspondence, previously only
    known to hold in one direction, between the distinguishing advantage of two systems
    and the probability of winning an appropriately defined game. © International
    Association for Cryptologic Research 2007.'
alternative_title:
- LNCS
author:
- first_name: Ueli
  full_name: Maurer, Ueli M
  last_name: Maurer
- first_name: Krzysztof Z
  full_name: Krzysztof Pietrzak
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
- first_name: Renato
  full_name: Renner, Renato
  last_name: Renner
citation:
  ama: 'Maurer U, Pietrzak KZ, Renner R. Indistinguishability amplification. In: Vol
    4622. Springer; 2007:130-149. doi:<a href="https://doi.org/10.1007/978-3-540-74143-5_8">10.1007/978-3-540-74143-5_8</a>'
  apa: 'Maurer, U., Pietrzak, K. Z., &#38; Renner, R. (2007). Indistinguishability
    amplification (Vol. 4622, pp. 130–149). Presented at the CRYPTO: International
    Cryptology Conference, Springer. <a href="https://doi.org/10.1007/978-3-540-74143-5_8">https://doi.org/10.1007/978-3-540-74143-5_8</a>'
  chicago: Maurer, Ueli, Krzysztof Z Pietrzak, and Renato Renner. “Indistinguishability
    Amplification,” 4622:130–49. Springer, 2007. <a href="https://doi.org/10.1007/978-3-540-74143-5_8">https://doi.org/10.1007/978-3-540-74143-5_8</a>.
  ieee: 'U. Maurer, K. Z. Pietrzak, and R. Renner, “Indistinguishability amplification,”
    presented at the CRYPTO: International Cryptology Conference, 2007, vol. 4622,
    pp. 130–149.'
  ista: 'Maurer U, Pietrzak KZ, Renner R. 2007. Indistinguishability amplification.
    CRYPTO: International Cryptology Conference, LNCS, vol. 4622, 130–149.'
  mla: Maurer, Ueli, et al. <i>Indistinguishability Amplification</i>. Vol. 4622,
    Springer, 2007, pp. 130–49, doi:<a href="https://doi.org/10.1007/978-3-540-74143-5_8">10.1007/978-3-540-74143-5_8</a>.
  short: U. Maurer, K.Z. Pietrzak, R. Renner, in:, Springer, 2007, pp. 130–149.
conference:
  name: 'CRYPTO: International Cryptology Conference'
date_created: 2018-12-11T12:02:05Z
date_published: 2007-10-03T00:00:00Z
date_updated: 2021-01-12T07:41:53Z
day: '03'
doi: 10.1007/978-3-540-74143-5_8
extern: 1
intvolume: '      4622'
month: '10'
page: 130 - 149
publication_status: published
publisher: Springer
publist_id: '3462'
quality_controlled: 0
status: public
title: Indistinguishability amplification
type: conference
volume: 4622
year: '2007'
...
---
_id: '3220'
abstract:
- lang: eng
  text: We introduce a new primitive called intrusion-resilient secret sharing (IRSS),
    whose security proof exploits the fact that there exist functions which can be
    efficiently computed interactively using low communication complexity in k, but
    not in k-1 rounds. IRSS is a means of sharing a secret message amongst a set of
    players which comes with a very strong security guarantee. The shares in an IRSS
    are made artificially large so that it is hard to retrieve them completely, and
    the reconstruction procedure is interactive requiring the players to exchange
    k short messages. The adversaries considered can attack the scheme in rounds,
    where in each round the adversary chooses some player to corrupt and some function,
    and retrieves the output of that function applied to the share of the corrupted
    player. This model captures for example computers connected to a network which
    can occasionally he infected by malicious software like viruses, which can compute
    any function on the infected machine, but cannot sent out a huge amount of data.
    Using methods from the bounded-retrieval model, we construct an IRSS scheme which
    is secure against any computationally unbounded adversary as long as the total
    amount of information retrieved by the adversary is somewhat less than the length
    of the shares, and the adversary makes at most k-1 corruption rounds (as described
    above, where k rounds are necessary for reconstruction). We extend our basic scheme
    in several ways in order to allow the shares sent by the dealer to be short (the
    players then blow them up locally) and to handle even stronger adversaries who
    can learn some of the shares completely. As mentioned, there is an obvious connection
    between IRSS schemes and the fact that there exist functions with an exponential
    gap in their communication complexity for k and k-1 rounds. Our scheme implies
    such a separation which is in several aspects stronger than the previously known
    ones.
author:
- first_name: Stefan
  full_name: Dziembowski, Stefan
  last_name: Dziembowski
- first_name: Krzysztof Z
  full_name: Krzysztof Pietrzak
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
citation:
  ama: 'Dziembowski S, Pietrzak KZ. Intrusion resilient secret sharing. In: IEEE;
    2007:227-237. doi:<a href="https://doi.org/10.1109/FOCS.2007.63">10.1109/FOCS.2007.63</a>'
  apa: 'Dziembowski, S., &#38; Pietrzak, K. Z. (2007). Intrusion resilient secret
    sharing (pp. 227–237). Presented at the FOCS: Foundations of Computer Science,
    IEEE. <a href="https://doi.org/10.1109/FOCS.2007.63">https://doi.org/10.1109/FOCS.2007.63</a>'
  chicago: Dziembowski, Stefan, and Krzysztof Z Pietrzak. “Intrusion Resilient Secret
    Sharing,” 227–37. IEEE, 2007. <a href="https://doi.org/10.1109/FOCS.2007.63">https://doi.org/10.1109/FOCS.2007.63</a>.
  ieee: 'S. Dziembowski and K. Z. Pietrzak, “Intrusion resilient secret sharing,”
    presented at the FOCS: Foundations of Computer Science, 2007, pp. 227–237.'
  ista: 'Dziembowski S, Pietrzak KZ. 2007. Intrusion resilient secret sharing. FOCS:
    Foundations of Computer Science, 227–237.'
  mla: Dziembowski, Stefan, and Krzysztof Z. Pietrzak. <i>Intrusion Resilient Secret
    Sharing</i>. IEEE, 2007, pp. 227–37, doi:<a href="https://doi.org/10.1109/FOCS.2007.63">10.1109/FOCS.2007.63</a>.
  short: S. Dziembowski, K.Z. Pietrzak, in:, IEEE, 2007, pp. 227–237.
conference:
  name: 'FOCS: Foundations of Computer Science'
date_created: 2018-12-11T12:02:05Z
date_published: 2007-10-23T00:00:00Z
date_updated: 2021-01-12T07:41:54Z
day: '23'
doi: 10.1109/FOCS.2007.63
extern: 1
month: '10'
page: 227 - 237
publication_status: published
publisher: IEEE
publist_id: '3459'
quality_controlled: 0
status: public
title: Intrusion resilient secret sharing
type: conference
year: '2007'
...
---
_id: '3221'
abstract:
- lang: eng
  text: |-
    We investigate a general class of (black-box) constructions for range extension of weak pseudorandom functions: a construction based on m independent functions F 1,...,F m is given by a set of strings over {1,...,m}*, where for example {〈2〉, 〈1,2〉} corresponds to the function X ↦[F 2(X),F 2(F 1(X))]. All efficient constructions for range expansion of weak pseudorandom functions that we are aware of are of this form.
    We completely classify such constructions as good, bad or ugly, where the good constructions are those whose security can be proven via a black-box reduction, the bad constructions are those whose insecurity can be proven via a black-box reduction, and the ugly constructions are those which are neither good nor bad.
    Our classification shows that the range expansion from [10] is optimal, in the sense that it achieves the best possible expansion (2 m  − 1 when using m keys).
    Along the way we show that for weak quasirandom functions (i.e. in the information theoretic setting), all constructions which are not bad – in particular all the ugly ones – are secure.
acknowledgement: This work was partially supported by the Zurich Information Security
  Center. It represents the views of the authors.
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
  full_name: Krzysztof Pietrzak
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
- first_name: Johan
  full_name: Sjödin,  Johan
  last_name: Sjödin
citation:
  ama: 'Pietrzak KZ, Sjödin J. Range extension for weak PRFs the good the bad and
    the ugly. In: Vol 4515. Springer; 2007:517-533. doi:<a href="https://doi.org/10.1007/978-3-540-72540-4_30">10.1007/978-3-540-72540-4_30</a>'
  apa: 'Pietrzak, K. Z., &#38; Sjödin, J. (2007). Range extension for weak PRFs the
    good the bad and the ugly (Vol. 4515, pp. 517–533). Presented at the EUROCRYPT:
    Theory and Applications of Cryptographic Techniques, Springer. <a href="https://doi.org/10.1007/978-3-540-72540-4_30">https://doi.org/10.1007/978-3-540-72540-4_30</a>'
  chicago: Pietrzak, Krzysztof Z, and Johan Sjödin. “Range Extension for Weak PRFs
    the Good the Bad and the Ugly,” 4515:517–33. Springer, 2007. <a href="https://doi.org/10.1007/978-3-540-72540-4_30">https://doi.org/10.1007/978-3-540-72540-4_30</a>.
  ieee: 'K. Z. Pietrzak and J. Sjödin, “Range extension for weak PRFs the good the
    bad and the ugly,” presented at the EUROCRYPT: Theory and Applications of Cryptographic
    Techniques, 2007, vol. 4515, pp. 517–533.'
  ista: 'Pietrzak KZ, Sjödin J. 2007. Range extension for weak PRFs the good the bad
    and the ugly. EUROCRYPT: Theory and Applications of Cryptographic Techniques,
    LNCS, vol. 4515, 517–533.'
  mla: Pietrzak, Krzysztof Z., and Johan Sjödin. <i>Range Extension for Weak PRFs
    the Good the Bad and the Ugly</i>. Vol. 4515, Springer, 2007, pp. 517–33, doi:<a
    href="https://doi.org/10.1007/978-3-540-72540-4_30">10.1007/978-3-540-72540-4_30</a>.
  short: K.Z. Pietrzak, J. Sjödin, in:, Springer, 2007, pp. 517–533.
conference:
  name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
date_created: 2018-12-11T12:02:06Z
date_published: 2007-06-12T00:00:00Z
date_updated: 2021-01-12T07:41:54Z
day: '12'
doi: 10.1007/978-3-540-72540-4_30
extern: 1
intvolume: '      4515'
month: '06'
page: 517 - 533
publication_status: published
publisher: Springer
publist_id: '3460'
quality_controlled: 0
status: public
title: Range extension for weak PRFs the good the bad and the ugly
type: conference
volume: 4515
year: '2007'
...
---
_id: '3222'
abstract:
- lang: eng
  text: |-
    Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs.
    Bellare, Impagliazzo and Naor (1997) show that this is also true for protocols where the soundness only holds against computationally bounded provers (e.g. interactive arguments) if the protocol has at most three rounds.
    On the other hand, for four rounds they give a protocol where this is no longer the case: the error probability does not decrease below some constant even if the protocol is repeated a polynomial number of times. Unfortunately, this protocol is not very convincing as the communication complexity of each instance of the protocol grows linearly with the number of repetitions, and for such protocols the error does not even decrease for some types of interactive proofs. Noticing this, Bellare et al. construct (a quite artificial) oracle relative to which a four round protocol exists whose communication complexity does not depend on the number of parallel repetitions. This shows that there is no “black-box” error reduction theorem for four round protocols.
    In this paper we give the first computationally sound protocol where k-fold parallel repetition does not decrease the error probability below some constant for any polynomial k (and where the communication complexity does not depend on k). The protocol has eight rounds and uses the universal arguments of Barak and Goldreich (2001). We also give another four round protocol relative to an oracle, unlike the artificial oracle of Bellare et al., we just need a generic group. This group can then potentially be instantiated with some real group satisfying some well defined hardness assumptions (we do not know of any candidate for such a group at the moment).
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
  full_name: Krzysztof Pietrzak
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
- first_name: Douglas
  full_name: Wikström, Douglas
  last_name: Wikström
citation:
  ama: 'Pietrzak KZ, Wikström D. Parallel repetition of computationally sound protocols
    revisited. In: Vol 4392. Springer; 2007:86-102. doi:<a href="https://doi.org/10.1007/978-3-540-70936-7_5">10.1007/978-3-540-70936-7_5</a>'
  apa: 'Pietrzak, K. Z., &#38; Wikström, D. (2007). Parallel repetition of computationally
    sound protocols revisited (Vol. 4392, pp. 86–102). Presented at the TCC: Theory
    of Cryptography Conference, Springer. <a href="https://doi.org/10.1007/978-3-540-70936-7_5">https://doi.org/10.1007/978-3-540-70936-7_5</a>'
  chicago: Pietrzak, Krzysztof Z, and Douglas Wikström. “Parallel Repetition of Computationally
    Sound Protocols Revisited,” 4392:86–102. Springer, 2007. <a href="https://doi.org/10.1007/978-3-540-70936-7_5">https://doi.org/10.1007/978-3-540-70936-7_5</a>.
  ieee: 'K. Z. Pietrzak and D. Wikström, “Parallel repetition of computationally sound
    protocols revisited,” presented at the TCC: Theory of Cryptography Conference,
    2007, vol. 4392, pp. 86–102.'
  ista: 'Pietrzak KZ, Wikström D. 2007. Parallel repetition of computationally sound
    protocols revisited. TCC: Theory of Cryptography Conference, LNCS, vol. 4392,
    86–102.'
  mla: Pietrzak, Krzysztof Z., and Douglas Wikström. <i>Parallel Repetition of Computationally
    Sound Protocols Revisited</i>. Vol. 4392, Springer, 2007, pp. 86–102, doi:<a href="https://doi.org/10.1007/978-3-540-70936-7_5">10.1007/978-3-540-70936-7_5</a>.
  short: K.Z. Pietrzak, D. Wikström, in:, Springer, 2007, pp. 86–102.
conference:
  name: 'TCC: Theory of Cryptography Conference'
date_created: 2018-12-11T12:02:06Z
date_published: 2007-03-22T00:00:00Z
date_updated: 2021-01-12T07:41:54Z
day: '22'
doi: 10.1007/978-3-540-70936-7_5
extern: 1
intvolume: '      4392'
month: '03'
page: 86 - 102
publication_status: published
publisher: Springer
publist_id: '3457'
quality_controlled: 0
status: public
title: Parallel repetition of computationally sound protocols revisited
type: conference
volume: 4392
year: '2007'
...
---
_id: '3223'
abstract:
- lang: eng
  text: |-
    “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bit value is encrypted, say with a block-cipher. The security of this scheme is proportional to εq2, where q is the number of MACs the adversary can request. As ε is at least 2−k, the best one can hope for is O(q2/2k) security. Unfortunately, such small ε is not achieved by simple hash functions used in practice, such as the polynomial evaluation or the Merkle-Damg ̊ard construction, where ε grows with the message length L.
    The main insight of this work comes from the fact that, by using ran- domized message preprocessing via a short random salt p (which must then be sent as part of the authentication tag), we can use the “hash then encrypt” paradigm with suboptimal “practical” ε-universal hash func- tions, and still improve its exact security to optimal O(q2/2k). Specif- ically, by using at most an O(logL)-bit salt p, one can always regain the optimal exact security O(q2/2k), even in situations where ε grows polynomially with L. We also give very simple preprocessing maps for popular “suboptimal” hash functions, namely polynomial evaluation and the Merkle-Damg ̊ard construction.
    Our results come from a general extension of the classical Carter- Wegman paradigm, which we believe is of independent interest. On a high level, it shows that public randomization allows one to use the potentially much smaller “average-case” collision probability in place of the “worst-case” collision probability ε.
alternative_title:
- LNCS
author:
- first_name: Yevgeniy
  full_name: Dodis, Yevgeniy
  last_name: Dodis
- first_name: Krzysztof Z
  full_name: Krzysztof Pietrzak
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
citation:
  ama: 'Dodis Y, Pietrzak KZ. Improving the security of MACs via randomized message
    preprocessing. In: Vol 4593. Springer; 2007:414-433. doi:<a href="https://doi.org/10.1007/978-3-540-74619-5_26">10.1007/978-3-540-74619-5_26</a>'
  apa: 'Dodis, Y., &#38; Pietrzak, K. Z. (2007). Improving the security of MACs via
    randomized message preprocessing (Vol. 4593, pp. 414–433). Presented at the FSE:
    Fast Software Encryption, Springer. <a href="https://doi.org/10.1007/978-3-540-74619-5_26">https://doi.org/10.1007/978-3-540-74619-5_26</a>'
  chicago: Dodis, Yevgeniy, and Krzysztof Z Pietrzak. “Improving the Security of MACs
    via Randomized Message Preprocessing,” 4593:414–33. Springer, 2007. <a href="https://doi.org/10.1007/978-3-540-74619-5_26">https://doi.org/10.1007/978-3-540-74619-5_26</a>.
  ieee: 'Y. Dodis and K. Z. Pietrzak, “Improving the security of MACs via randomized
    message preprocessing,” presented at the FSE: Fast Software Encryption, 2007,
    vol. 4593, pp. 414–433.'
  ista: 'Dodis Y, Pietrzak KZ. 2007. Improving the security of MACs via randomized
    message preprocessing. FSE: Fast Software Encryption, LNCS, vol. 4593, 414–433.'
  mla: Dodis, Yevgeniy, and Krzysztof Z. Pietrzak. <i>Improving the Security of MACs
    via Randomized Message Preprocessing</i>. Vol. 4593, Springer, 2007, pp. 414–33,
    doi:<a href="https://doi.org/10.1007/978-3-540-74619-5_26">10.1007/978-3-540-74619-5_26</a>.
  short: Y. Dodis, K.Z. Pietrzak, in:, Springer, 2007, pp. 414–433.
conference:
  name: 'FSE: Fast Software Encryption'
date_created: 2018-12-11T12:02:06Z
date_published: 2007-10-11T00:00:00Z
date_updated: 2021-01-12T07:41:55Z
day: '11'
doi: 10.1007/978-3-540-74619-5_26
extern: 1
intvolume: '      4593'
month: '10'
page: 414 - 433
publication_status: published
publisher: Springer
publist_id: '3458'
quality_controlled: 0
status: public
title: Improving the security of MACs via randomized message preprocessing
type: conference
volume: 4593
year: '2007'
...
---
_id: '3305'
abstract:
- lang: eng
  text: The accumulation of deleterious mutations plays a major role in evolution,
    and key to this are the interactions between their fitness effects, known as epistasis.
    Whether mutations tend to interact synergistically (with multiple mutations being
    more deleterious than would be expected from their individual fitness effects)
    or antagonistically is important for a variety of evolutionary questions, particularly
    the evolution of sex. Unfortunately, the experimental evidence on the prevalence
    and strength of epistasis is mixed and inconclusive. Here we study theoretically
    whether synergistic or antagonistic epistasis is likely to be favored by evolution
    and by how much. We find that in the presence of recombination, evolution favors
    less synergistic or more antagonistic epistasis whenever mutations that change
    the epistasis in this direction are possible. This is because evolution favors
    increased buffering against the effects of deleterious mutations. This suggests
    that we should not expect synergistic epistasis to be widespread in nature and
    hence that the mutational deterministic hypothesis for the advantage of sex may
    not apply widely.
author:
- first_name: Michael
  full_name: Desai, Michael M
  last_name: Desai
- first_name: Daniel
  full_name: Daniel Weissman
  id: 2D0CE020-F248-11E8-B48F-1D18A9856A87
  last_name: Weissman
- first_name: Marcus
  full_name: Feldman, Marcus W
  last_name: Feldman
citation:
  ama: Desai M, Weissman D, Feldman M. Evolution can favor antagonistic epistasis.
    <i>Genetics</i>. 2007;177(2):1001-1010. doi:<a href="https://doi.org/10.1534/genetics.107.075812">10.1534/genetics.107.075812</a>
  apa: Desai, M., Weissman, D., &#38; Feldman, M. (2007). Evolution can favor antagonistic
    epistasis. <i>Genetics</i>. Genetics Society of America. <a href="https://doi.org/10.1534/genetics.107.075812">https://doi.org/10.1534/genetics.107.075812</a>
  chicago: Desai, Michael, Daniel Weissman, and Marcus Feldman. “Evolution Can Favor
    Antagonistic Epistasis.” <i>Genetics</i>. Genetics Society of America, 2007. <a
    href="https://doi.org/10.1534/genetics.107.075812">https://doi.org/10.1534/genetics.107.075812</a>.
  ieee: M. Desai, D. Weissman, and M. Feldman, “Evolution can favor antagonistic epistasis,”
    <i>Genetics</i>, vol. 177, no. 2. Genetics Society of America, pp. 1001–10, 2007.
  ista: Desai M, Weissman D, Feldman M. 2007. Evolution can favor antagonistic epistasis.
    Genetics. 177(2), 1001–10.
  mla: Desai, Michael, et al. “Evolution Can Favor Antagonistic Epistasis.” <i>Genetics</i>,
    vol. 177, no. 2, Genetics Society of America, 2007, pp. 1001–10, doi:<a href="https://doi.org/10.1534/genetics.107.075812">10.1534/genetics.107.075812</a>.
  short: M. Desai, D. Weissman, M. Feldman, Genetics 177 (2007) 1001–10.
date_created: 2018-12-11T12:02:34Z
date_published: 2007-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:32Z
day: '01'
doi: 10.1534/genetics.107.075812
extern: 1
intvolume: '       177'
issue: '2'
month: '01'
page: 1001 - 10
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '3335'
quality_controlled: 0
status: public
title: Evolution can favor antagonistic epistasis
type: journal_article
volume: 177
year: '2007'
...
---
_id: '11115'
abstract:
- lang: eng
  text: The formation of the nuclear envelope (NE) around chromatin is a major membrane-remodelling
    event that occurs during cell division of metazoa. It is unclear whether the nuclear
    membrane reforms by the fusion of NE fragments or if it re-emerges from an intact
    tubular network of the endoplasmic reticulum (ER). Here, we show that NE formation
    and expansion requires a tubular ER network and occurs efficiently in the presence
    of the membrane fusion inhibitor GTPγS. Chromatin recruitment of membranes, which
    is initiated by tubule-end binding, followed by the formation, expansion and sealing
    of flat membrane sheets, is mediated by DNA-binding proteins residing in the ER.
    Thus, chromatin plays an active role in reshaping of the ER during NE formation.
article_processing_charge: No
article_type: original
author:
- first_name: Daniel J.
  full_name: Anderson, Daniel J.
  last_name: Anderson
- first_name: Martin W
  full_name: HETZER, Martin W
  id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
  last_name: HETZER
  orcid: 0000-0002-2111-992X
citation:
  ama: Anderson DJ, Hetzer M. Nuclear envelope formation by chromatin-mediated reorganization
    of the endoplasmic reticulum. <i>Nature Cell Biology</i>. 2007;9(10):1160-1166.
    doi:<a href="https://doi.org/10.1038/ncb1636">10.1038/ncb1636</a>
  apa: Anderson, D. J., &#38; Hetzer, M. (2007). Nuclear envelope formation by chromatin-mediated
    reorganization of the endoplasmic reticulum. <i>Nature Cell Biology</i>. Springer
    Nature. <a href="https://doi.org/10.1038/ncb1636">https://doi.org/10.1038/ncb1636</a>
  chicago: Anderson, Daniel J., and Martin Hetzer. “Nuclear Envelope Formation by
    Chromatin-Mediated Reorganization of the Endoplasmic Reticulum.” <i>Nature Cell
    Biology</i>. Springer Nature, 2007. <a href="https://doi.org/10.1038/ncb1636">https://doi.org/10.1038/ncb1636</a>.
  ieee: D. J. Anderson and M. Hetzer, “Nuclear envelope formation by chromatin-mediated
    reorganization of the endoplasmic reticulum,” <i>Nature Cell Biology</i>, vol.
    9, no. 10. Springer Nature, pp. 1160–1166, 2007.
  ista: Anderson DJ, Hetzer M. 2007. Nuclear envelope formation by chromatin-mediated
    reorganization of the endoplasmic reticulum. Nature Cell Biology. 9(10), 1160–1166.
  mla: Anderson, Daniel J., and Martin Hetzer. “Nuclear Envelope Formation by Chromatin-Mediated
    Reorganization of the Endoplasmic Reticulum.” <i>Nature Cell Biology</i>, vol.
    9, no. 10, Springer Nature, 2007, pp. 1160–66, doi:<a href="https://doi.org/10.1038/ncb1636">10.1038/ncb1636</a>.
  short: D.J. Anderson, M. Hetzer, Nature Cell Biology 9 (2007) 1160–1166.
date_created: 2022-04-07T07:56:04Z
date_published: 2007-09-09T00:00:00Z
date_updated: 2022-07-18T08:56:38Z
day: '09'
doi: 10.1038/ncb1636
extern: '1'
external_id:
  pmid:
  - '17828249'
intvolume: '         9'
issue: '10'
keyword:
- Cell Biology
language:
- iso: eng
month: '09'
oa_version: None
page: 1160-1166
pmid: 1
publication: Nature Cell Biology
publication_identifier:
  eissn:
  - 1476-4679
  issn:
  - 1465-7392
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nuclear envelope formation by chromatin-mediated reorganization of the endoplasmic
  reticulum
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 9
year: '2007'
...
---
_id: '11116'
abstract:
- lang: eng
  text: The metazoan nuclear envelope (NE) breaks down and re-forms during each cell
    cycle. Nuclear pore complexes (NPCs), which allow nucleocytoplasmic transport
    during interphase, assemble into the re-forming NE at the end of mitosis. Using
    in vitro NE assembly, we show that the vertebrate homologue of MEL-28 (maternal
    effect lethal), a recently discovered NE component in Caenorhabditis elegans,
    functions in postmitotic NPC assembly. MEL-28 interacts with the Nup107–160 complex
    (Nup for nucleoporin), an important building block of the NPC, and is essential
    for the recruitment of the Nup107–160 complex to chromatin. We suggest that MEL-28
    acts as a seeding point for NPC assembly.
article_processing_charge: No
article_type: original
author:
- first_name: Cerstin
  full_name: Franz, Cerstin
  last_name: Franz
- first_name: Rudolf
  full_name: Walczak, Rudolf
  last_name: Walczak
- first_name: Sevil
  full_name: Yavuz, Sevil
  last_name: Yavuz
- first_name: Rachel
  full_name: Santarella, Rachel
  last_name: Santarella
- first_name: Marc
  full_name: Gentzel, Marc
  last_name: Gentzel
- first_name: Peter
  full_name: Askjaer, Peter
  last_name: Askjaer
- first_name: Vincent
  full_name: Galy, Vincent
  last_name: Galy
- first_name: Martin W
  full_name: HETZER, Martin W
  id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
  last_name: HETZER
  orcid: 0000-0002-2111-992X
- first_name: Iain W
  full_name: Mattaj, Iain W
  last_name: Mattaj
- first_name: Wolfram
  full_name: Antonin, Wolfram
  last_name: Antonin
citation:
  ama: Franz C, Walczak R, Yavuz S, et al. MEL‐28/ELYS is required for the recruitment
    of nucleoporins to chromatin and postmitotic nuclear pore complex assembly. <i>EMBO
    reports</i>. 2007;8(2):165-172. doi:<a href="https://doi.org/10.1038/sj.embor.7400889">10.1038/sj.embor.7400889</a>
  apa: Franz, C., Walczak, R., Yavuz, S., Santarella, R., Gentzel, M., Askjaer, P.,
    … Antonin, W. (2007). MEL‐28/ELYS is required for the recruitment of nucleoporins
    to chromatin and postmitotic nuclear pore complex assembly. <i>EMBO Reports</i>.
    EMBO. <a href="https://doi.org/10.1038/sj.embor.7400889">https://doi.org/10.1038/sj.embor.7400889</a>
  chicago: Franz, Cerstin, Rudolf Walczak, Sevil Yavuz, Rachel Santarella, Marc Gentzel,
    Peter Askjaer, Vincent Galy, Martin Hetzer, Iain W Mattaj, and Wolfram Antonin.
    “MEL‐28/ELYS Is Required for the Recruitment of Nucleoporins to Chromatin and
    Postmitotic Nuclear Pore Complex Assembly.” <i>EMBO Reports</i>. EMBO, 2007. <a
    href="https://doi.org/10.1038/sj.embor.7400889">https://doi.org/10.1038/sj.embor.7400889</a>.
  ieee: C. Franz <i>et al.</i>, “MEL‐28/ELYS is required for the recruitment of nucleoporins
    to chromatin and postmitotic nuclear pore complex assembly,” <i>EMBO reports</i>,
    vol. 8, no. 2. EMBO, pp. 165–172, 2007.
  ista: Franz C, Walczak R, Yavuz S, Santarella R, Gentzel M, Askjaer P, Galy V, Hetzer
    M, Mattaj IW, Antonin W. 2007. MEL‐28/ELYS is required for the recruitment of
    nucleoporins to chromatin and postmitotic nuclear pore complex assembly. EMBO
    reports. 8(2), 165–172.
  mla: Franz, Cerstin, et al. “MEL‐28/ELYS Is Required for the Recruitment of Nucleoporins
    to Chromatin and Postmitotic Nuclear Pore Complex Assembly.” <i>EMBO Reports</i>,
    vol. 8, no. 2, EMBO, 2007, pp. 165–72, doi:<a href="https://doi.org/10.1038/sj.embor.7400889">10.1038/sj.embor.7400889</a>.
  short: C. Franz, R. Walczak, S. Yavuz, R. Santarella, M. Gentzel, P. Askjaer, V.
    Galy, M. Hetzer, I.W. Mattaj, W. Antonin, EMBO Reports 8 (2007) 165–172.
date_created: 2022-04-07T07:56:13Z
date_published: 2007-01-19T00:00:00Z
date_updated: 2022-07-18T08:56:40Z
day: '19'
doi: 10.1038/sj.embor.7400889
extern: '1'
external_id:
  pmid:
  - '17235358'
intvolume: '         8'
issue: '2'
keyword:
- Genetics
- Molecular Biology
- Biochemistry
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1038/sj.embor.7400889
month: '01'
oa: 1
oa_version: Published Version
page: 165-172
pmid: 1
publication: EMBO reports
publication_identifier:
  eissn:
  - 1469-3178
  issn:
  - 1469-221X
publication_status: published
publisher: EMBO
quality_controlled: '1'
scopus_import: '1'
status: public
title: MEL‐28/ELYS is required for the recruitment of nucleoporins to chromatin and
  postmitotic nuclear pore complex assembly
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 8
year: '2007'
...
---
_id: '7780'
abstract:
- lang: eng
  text: 'We used single-channel electrical recordings and Langevin molecular dynamics
    simulations to explore the electrophoretic translocation of various β-hairpin
    peptides across the staphylococcal α-hemolysin (αHL) protein pore at single-molecule
    resolution. The β-hairpin peptides, which varied in their folding properties,
    corresponded to the C terminal residues of the B1 domain of protein G. The translocation
    time was strongly dependent on the electric force and was correlated with the
    folding features of the β-hairpin peptides. Highly unfolded peptides entered the
    pore in an extended conformation, resulting in fast single-file translocation
    events. In contrast, the translocation of the folded β-hairpin peptides occurred
    more slowly. In this case, the β-hairpin peptides traversed the αHL pore in a
    misfolded or fully folded conformation. This study demonstrates that the interaction
    between a polypeptide and a β-barrel protein pore is dependent on the folding
    features of the polypeptide. '
article_processing_charge: No
article_type: original
author:
- first_name: Carl Peter
  full_name: Goodrich, Carl Peter
  id: EB352CD2-F68A-11E9-89C5-A432E6697425
  last_name: Goodrich
  orcid: 0000-0002-1307-5074
- first_name: Serdal
  full_name: Kirmizialtin, Serdal
  last_name: Kirmizialtin
- first_name: Beatrice M.
  full_name: Huyghues-Despointes, Beatrice M.
  last_name: Huyghues-Despointes
- first_name: Aiping
  full_name: Zhu, Aiping
  last_name: Zhu
- first_name: J. Martin
  full_name: Scholtz, J. Martin
  last_name: Scholtz
- first_name: Dmitrii E.
  full_name: Makarov, Dmitrii E.
  last_name: Makarov
- first_name: Liviu
  full_name: Movileanu, Liviu
  last_name: Movileanu
citation:
  ama: Goodrich CP, Kirmizialtin S, Huyghues-Despointes BM, et al. Single-molecule
    electrophoresis of β-hairpin peptides by electrical recordings and Langevin dynamics
    simulations. <i>The Journal of Physical Chemistry B</i>. 2007;111(13):3332-3335.
    doi:<a href="https://doi.org/10.1021/jp071364h">10.1021/jp071364h</a>
  apa: Goodrich, C. P., Kirmizialtin, S., Huyghues-Despointes, B. M., Zhu, A., Scholtz,
    J. M., Makarov, D. E., &#38; Movileanu, L. (2007). Single-molecule electrophoresis
    of β-hairpin peptides by electrical recordings and Langevin dynamics simulations.
    <i>The Journal of Physical Chemistry B</i>. American Chemical Society. <a href="https://doi.org/10.1021/jp071364h">https://doi.org/10.1021/jp071364h</a>
  chicago: Goodrich, Carl Peter, Serdal Kirmizialtin, Beatrice M. Huyghues-Despointes,
    Aiping Zhu, J. Martin Scholtz, Dmitrii E. Makarov, and Liviu Movileanu. “Single-Molecule
    Electrophoresis of β-Hairpin Peptides by Electrical Recordings and Langevin Dynamics
    Simulations.” <i>The Journal of Physical Chemistry B</i>. American Chemical Society,
    2007. <a href="https://doi.org/10.1021/jp071364h">https://doi.org/10.1021/jp071364h</a>.
  ieee: C. P. Goodrich <i>et al.</i>, “Single-molecule electrophoresis of β-hairpin
    peptides by electrical recordings and Langevin dynamics simulations,” <i>The Journal
    of Physical Chemistry B</i>, vol. 111, no. 13. American Chemical Society, pp.
    3332–3335, 2007.
  ista: Goodrich CP, Kirmizialtin S, Huyghues-Despointes BM, Zhu A, Scholtz JM, Makarov
    DE, Movileanu L. 2007. Single-molecule electrophoresis of β-hairpin peptides by
    electrical recordings and Langevin dynamics simulations. The Journal of Physical
    Chemistry B. 111(13), 3332–3335.
  mla: Goodrich, Carl Peter, et al. “Single-Molecule Electrophoresis of β-Hairpin
    Peptides by Electrical Recordings and Langevin Dynamics Simulations.” <i>The Journal
    of Physical Chemistry B</i>, vol. 111, no. 13, American Chemical Society, 2007,
    pp. 3332–35, doi:<a href="https://doi.org/10.1021/jp071364h">10.1021/jp071364h</a>.
  short: C.P. Goodrich, S. Kirmizialtin, B.M. Huyghues-Despointes, A. Zhu, J.M. Scholtz,
    D.E. Makarov, L. Movileanu, The Journal of Physical Chemistry B 111 (2007) 3332–3335.
date_created: 2020-04-30T12:19:15Z
date_published: 2007-03-13T00:00:00Z
date_updated: 2021-01-12T08:15:29Z
day: '13'
doi: 10.1021/jp071364h
extern: '1'
intvolume: '       111'
issue: '13'
language:
- iso: eng
month: '03'
oa_version: None
page: 3332-3335
publication: The Journal of Physical Chemistry B
publication_identifier:
  issn:
  - 1520-6106
  - 1520-5207
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
status: public
title: Single-molecule electrophoresis of β-hairpin peptides by electrical recordings
  and Langevin dynamics simulations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 111
year: '2007'
...
---
_id: '7781'
abstract:
- lang: eng
  text: Males are predicted to compete for reproductive opportunities, with sexual
    selection driving the evolution of large body size and weaponry through the advantage
    they confer for access to females. Few studies have explored potential trade‐offs
    of investment in secondary sexual traits between different components of fitness
    or tested for sexually antagonistic selection pressures. These factors may provide
    explanations for observed polymorphisms in both form and quality of secondary
    sexual traits. We report here an analysis of selection on horn phenotype in a
    feral population of Soay sheep (Ovis aries) on the island of Hirta, St. Kilda,
    Scotland. Soay sheep display a phenotypic polymorphism for horn type with males
    growing either normal or reduced (scurred) horns, and females growing either normal,
    scurred, or no (polled) horns; further variation in size exists within horn morphs.
    We show that horn phenotype and the size of the trait displayed is subject to
    different selection pressures in males and females, generating sexually antagonistic
    selection. Furthermore, there was evidence of a trade‐off between breeding success
    and longevity in normal‐horned males, with both the normal horn type and larger
    horn size being associated with greater annual breeding success but reduced longevity.
    Therefore, selection through lifetime breeding success was not found to act upon
    horn phenotype in males. In females, a negative association of annual breeding
    success within the normal‐horned phenotype did not result in a significant difference
    in lifetime fitness when compared to scurred individuals, as no significant difference
    in longevity was found. However, increased horn size within this group was negatively
    associated with breeding success and longevity. Females without horns (polled)
    suffered reduced longevity and thus reduced lifetime breeding success relative
    the other horn morphs. Our results therefore suggest that trade‐offs between different
    components of fitness and antagonistic selection between the sexes may maintain
    genetic variation for secondary sexual traits within a population.
article_processing_charge: No
article_type: original
author:
- 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: Jill G.
  full_name: Pilkington, Jill G.
  last_name: Pilkington
- first_name: Tim H.
  full_name: Clutton-Brock, Tim H.
  last_name: Clutton-Brock
- first_name: Josephine M.
  full_name: Pemberton, Josephine M.
  last_name: Pemberton
- first_name: Loeske E.B.
  full_name: Kruuk, Loeske E.B.
  last_name: Kruuk
citation:
  ama: 'Robinson MR, Pilkington JG, Clutton-Brock TH, Pemberton JM, Kruuk LEB. Live
    fast, die young: Trade-offs between fitness components and sexually antagonistic
    selection on weaponry in soay sheep. <i>Evolution</i>. 2007;60(10):2168-2181.
    doi:<a href="https://doi.org/10.1111/j.0014-3820.2006.tb01854.x">10.1111/j.0014-3820.2006.tb01854.x</a>'
  apa: 'Robinson, M. R., Pilkington, J. G., Clutton-Brock, T. H., Pemberton, J. M.,
    &#38; Kruuk, L. E. B. (2007). Live fast, die young: Trade-offs between fitness
    components and sexually antagonistic selection on weaponry in soay sheep. <i>Evolution</i>.
    Wiley. <a href="https://doi.org/10.1111/j.0014-3820.2006.tb01854.x">https://doi.org/10.1111/j.0014-3820.2006.tb01854.x</a>'
  chicago: 'Robinson, Matthew Richard, Jill G. Pilkington, Tim H. Clutton-Brock, Josephine
    M. Pemberton, and Loeske E.B. Kruuk. “Live Fast, Die Young: Trade-Offs between
    Fitness Components and Sexually Antagonistic Selection on Weaponry in Soay Sheep.”
    <i>Evolution</i>. Wiley, 2007. <a href="https://doi.org/10.1111/j.0014-3820.2006.tb01854.x">https://doi.org/10.1111/j.0014-3820.2006.tb01854.x</a>.'
  ieee: 'M. R. Robinson, J. G. Pilkington, T. H. Clutton-Brock, J. M. Pemberton, and
    L. E. B. Kruuk, “Live fast, die young: Trade-offs between fitness components and
    sexually antagonistic selection on weaponry in soay sheep,” <i>Evolution</i>,
    vol. 60, no. 10. Wiley, pp. 2168–2181, 2007.'
  ista: 'Robinson MR, Pilkington JG, Clutton-Brock TH, Pemberton JM, Kruuk LEB. 2007.
    Live fast, die young: Trade-offs between fitness components and sexually antagonistic
    selection on weaponry in soay sheep. Evolution. 60(10), 2168–2181.'
  mla: 'Robinson, Matthew Richard, et al. “Live Fast, Die Young: Trade-Offs between
    Fitness Components and Sexually Antagonistic Selection on Weaponry in Soay Sheep.”
    <i>Evolution</i>, vol. 60, no. 10, Wiley, 2007, pp. 2168–81, doi:<a href="https://doi.org/10.1111/j.0014-3820.2006.tb01854.x">10.1111/j.0014-3820.2006.tb01854.x</a>.'
  short: M.R. Robinson, J.G. Pilkington, T.H. Clutton-Brock, J.M. Pemberton, L.E.B.
    Kruuk, Evolution 60 (2007) 2168–2181.
date_created: 2020-04-30T13:01:47Z
date_published: 2007-05-08T00:00:00Z
date_updated: 2021-01-12T08:15:30Z
day: '08'
doi: 10.1111/j.0014-3820.2006.tb01854.x
extern: '1'
intvolume: '        60'
issue: '10'
language:
- iso: eng
month: '05'
oa_version: None
page: 2168-2181
publication: Evolution
publication_identifier:
  issn:
  - 0014-3820
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: 'Live fast, die young: Trade-offs between fitness components and sexually antagonistic
  selection on weaponry in soay sheep'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 60
year: '2007'
...
---
_id: '8027'
abstract:
- lang: eng
  text: Gating deficits and hallucinatory sensations are prominent symptoms of schizophrenia.
    Comparing these abnormalities with the failure modes of network models is an interesting
    way to explore how they arise. We present a network model that can both propagate
    and gate signals. The model exhibits effects reminiscent of clinically observed
    pathologies when the balance between excitation and inhibition that it requires
    is not properly maintained.
article_processing_charge: No
article_type: original
author:
- first_name: Tim P
  full_name: Vogels, Tim P
  id: CB6FF8D2-008F-11EA-8E08-2637E6697425
  last_name: Vogels
  orcid: 0000-0003-3295-6181
- first_name: L.
  full_name: Abbott, L.
  last_name: Abbott
citation:
  ama: 'Vogels TP, Abbott L. Gating deficits in model networks: A path to schizophrenia?
    <i>Pharmacopsychiatry</i>. 2007;40(S 1):S73-S77. doi:<a href="https://doi.org/10.1055/s-2007-992130">10.1055/s-2007-992130</a>'
  apa: 'Vogels, T. P., &#38; Abbott, L. (2007). Gating deficits in model networks:
    A path to schizophrenia? <i>Pharmacopsychiatry</i>. Thieme. <a href="https://doi.org/10.1055/s-2007-992130">https://doi.org/10.1055/s-2007-992130</a>'
  chicago: 'Vogels, Tim P, and L. Abbott. “Gating Deficits in Model Networks: A Path
    to Schizophrenia?” <i>Pharmacopsychiatry</i>. Thieme, 2007. <a href="https://doi.org/10.1055/s-2007-992130">https://doi.org/10.1055/s-2007-992130</a>.'
  ieee: 'T. P. Vogels and L. Abbott, “Gating deficits in model networks: A path to
    schizophrenia?,” <i>Pharmacopsychiatry</i>, vol. 40, no. S 1. Thieme, pp. S73–S77,
    2007.'
  ista: 'Vogels TP, Abbott L. 2007. Gating deficits in model networks: A path to schizophrenia?
    Pharmacopsychiatry. 40(S 1), S73–S77.'
  mla: 'Vogels, Tim P., and L. Abbott. “Gating Deficits in Model Networks: A Path
    to Schizophrenia?” <i>Pharmacopsychiatry</i>, vol. 40, no. S 1, Thieme, 2007,
    pp. S73–77, doi:<a href="https://doi.org/10.1055/s-2007-992130">10.1055/s-2007-992130</a>.'
  short: T.P. Vogels, L. Abbott, Pharmacopsychiatry 40 (2007) S73–S77.
date_created: 2020-06-25T13:11:37Z
date_published: 2007-12-01T00:00:00Z
date_updated: 2021-01-12T08:16:36Z
day: '01'
doi: 10.1055/s-2007-992130
extern: '1'
external_id:
  pmid:
  - '18080946'
intvolume: '        40'
issue: S 1
language:
- iso: eng
month: '12'
oa_version: None
page: S73-S77
pmid: 1
publication: Pharmacopsychiatry
publication_identifier:
  issn:
  - 0176-3679
  - 1439-0795
publication_status: published
publisher: Thieme
quality_controlled: '1'
status: public
title: 'Gating deficits in model networks: A path to schizophrenia?'
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 40
year: '2007'
...
---
_id: '8483'
abstract:
- lang: eng
  text: Atom-resolved real-time studies of kinetic processes in proteins have been
    hampered in the past by the lack of experimental techniques that yield sufficient
    temporal and atomic resolution. Here we present band-selective optimized flip-angle
    short transient (SOFAST) real-time 2D NMR spectroscopy, a method that allows simultaneous
    observation of reaction kinetics for a large number of nuclear sites along the
    polypeptide chain of a protein with an unprecedented time resolution of a few
    seconds. SOFAST real-time 2D NMR spectroscopy combines fast NMR data acquisition
    techniques with rapid sample mixing inside the NMR magnet to initiate the kinetic
    event. We demonstrate the use of SOFAST real-time 2D NMR to monitor the conformational
    transition of α-lactalbumin from a molten globular to the native state for a large
    number of amide sites along the polypeptide chain. The kinetic behavior observed
    for the disappearance of the molten globule and the appearance of the native state
    is monoexponential and uniform along the polypeptide chain. This observation confirms
    previous findings that a single transition state ensemble controls folding of
    α-lactalbumin from the molten globule to the native state. In a second application,
    the spontaneous unfolding of native ubiquitin under nondenaturing conditions is
    characterized by amide hydrogen exchange rate constants measured at high pH by
    using SOFAST real-time 2D NMR. Our data reveal that ubiquitin unfolds in a gradual
    manner with distinct unfolding regimes.
article_processing_charge: No
article_type: original
author:
- first_name: Paul
  full_name: Schanda, Paul
  id: 7B541462-FAF6-11E9-A490-E8DFE5697425
  last_name: Schanda
  orcid: 0000-0002-9350-7606
- first_name: V.
  full_name: Forge, V.
  last_name: Forge
- first_name: B.
  full_name: Brutscher, B.
  last_name: Brutscher
citation:
  ama: Schanda P, Forge V, Brutscher B. Protein folding and unfolding studied at atomic
    resolution by fast two-dimensional NMR spectroscopy. <i>Proceedings of the National
    Academy of Sciences</i>. 2007;104(27):11257-11262. doi:<a href="https://doi.org/10.1073/pnas.0702069104">10.1073/pnas.0702069104</a>
  apa: Schanda, P., Forge, V., &#38; Brutscher, B. (2007). Protein folding and unfolding
    studied at atomic resolution by fast two-dimensional NMR spectroscopy. <i>Proceedings
    of the National Academy of Sciences</i>. National Academy of Sciences. <a href="https://doi.org/10.1073/pnas.0702069104">https://doi.org/10.1073/pnas.0702069104</a>
  chicago: Schanda, Paul, V. Forge, and B. Brutscher. “Protein Folding and Unfolding
    Studied at Atomic Resolution by Fast Two-Dimensional NMR Spectroscopy.” <i>Proceedings
    of the National Academy of Sciences</i>. National Academy of Sciences, 2007. <a
    href="https://doi.org/10.1073/pnas.0702069104">https://doi.org/10.1073/pnas.0702069104</a>.
  ieee: P. Schanda, V. Forge, and B. Brutscher, “Protein folding and unfolding studied
    at atomic resolution by fast two-dimensional NMR spectroscopy,” <i>Proceedings
    of the National Academy of Sciences</i>, vol. 104, no. 27. National Academy of
    Sciences, pp. 11257–11262, 2007.
  ista: Schanda P, Forge V, Brutscher B. 2007. Protein folding and unfolding studied
    at atomic resolution by fast two-dimensional NMR spectroscopy. Proceedings of
    the National Academy of Sciences. 104(27), 11257–11262.
  mla: Schanda, Paul, et al. “Protein Folding and Unfolding Studied at Atomic Resolution
    by Fast Two-Dimensional NMR Spectroscopy.” <i>Proceedings of the National Academy
    of Sciences</i>, vol. 104, no. 27, National Academy of Sciences, 2007, pp. 11257–62,
    doi:<a href="https://doi.org/10.1073/pnas.0702069104">10.1073/pnas.0702069104</a>.
  short: P. Schanda, V. Forge, B. Brutscher, Proceedings of the National Academy of
    Sciences 104 (2007) 11257–11262.
date_created: 2020-09-18T10:12:54Z
date_published: 2007-07-03T00:00:00Z
date_updated: 2021-01-12T08:19:35Z
day: '03'
doi: 10.1073/pnas.0702069104
extern: '1'
intvolume: '       104'
issue: '27'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '07'
oa_version: None
page: 11257-11262
publication: Proceedings of the National Academy of Sciences
publication_identifier:
  eissn:
  - 1091-6490
  issn:
  - 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
status: public
title: Protein folding and unfolding studied at atomic resolution by fast two-dimensional
  NMR spectroscopy
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 104
year: '2007'
...
---
_id: '8484'
abstract:
- lang: eng
  text: A series of sequential, intra-residue, and bi-directional BEST H–N–CA, H–N–CO,
    and H–N–CB pulse sequences is presented that extends the BEST concept introduced
    recently for fast multidimensional protein NMR [Schanda et al., J. Am. Chem. Soc.
    128 (2006) 9042] to the complete set of experiments required for sequential resonance
    assignment. We demonstrate for the protein ubiquitin that 3D BEST H–N–C correlation
    spectra can be recorded on a 600 MHz NMR spectrometer equipped with a cryogenic
    probe in only a few minutes of acquisition time with sufficient sensitivity to
    detect all expected cross peaks.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Ewen
  full_name: Lescop, Ewen
  last_name: Lescop
- first_name: Paul
  full_name: Schanda, Paul
  id: 7B541462-FAF6-11E9-A490-E8DFE5697425
  last_name: Schanda
  orcid: 0000-0002-9350-7606
- first_name: Bernhard
  full_name: Brutscher, Bernhard
  last_name: Brutscher
citation:
  ama: Lescop E, Schanda P, Brutscher B. A set of BEST triple-resonance experiments
    for time-optimized protein resonance assignment. <i>Journal of Magnetic Resonance</i>.
    2007;187(1):163-169. doi:<a href="https://doi.org/10.1016/j.jmr.2007.04.002">10.1016/j.jmr.2007.04.002</a>
  apa: Lescop, E., Schanda, P., &#38; Brutscher, B. (2007). A set of BEST triple-resonance
    experiments for time-optimized protein resonance assignment. <i>Journal of Magnetic
    Resonance</i>. Elsevier. <a href="https://doi.org/10.1016/j.jmr.2007.04.002">https://doi.org/10.1016/j.jmr.2007.04.002</a>
  chicago: Lescop, Ewen, Paul Schanda, and Bernhard Brutscher. “A Set of BEST Triple-Resonance
    Experiments for Time-Optimized Protein Resonance Assignment.” <i>Journal of Magnetic
    Resonance</i>. Elsevier, 2007. <a href="https://doi.org/10.1016/j.jmr.2007.04.002">https://doi.org/10.1016/j.jmr.2007.04.002</a>.
  ieee: E. Lescop, P. Schanda, and B. Brutscher, “A set of BEST triple-resonance experiments
    for time-optimized protein resonance assignment,” <i>Journal of Magnetic Resonance</i>,
    vol. 187, no. 1. Elsevier, pp. 163–169, 2007.
  ista: Lescop E, Schanda P, Brutscher B. 2007. A set of BEST triple-resonance experiments
    for time-optimized protein resonance assignment. Journal of Magnetic Resonance.
    187(1), 163–169.
  mla: Lescop, Ewen, et al. “A Set of BEST Triple-Resonance Experiments for Time-Optimized
    Protein Resonance Assignment.” <i>Journal of Magnetic Resonance</i>, vol. 187,
    no. 1, Elsevier, 2007, pp. 163–69, doi:<a href="https://doi.org/10.1016/j.jmr.2007.04.002">10.1016/j.jmr.2007.04.002</a>.
  short: E. Lescop, P. Schanda, B. Brutscher, Journal of Magnetic Resonance 187 (2007)
    163–169.
date_created: 2020-09-18T10:13:02Z
date_published: 2007-07-01T00:00:00Z
date_updated: 2021-01-12T08:19:35Z
day: '01'
doi: 10.1016/j.jmr.2007.04.002
extern: '1'
intvolume: '       187'
issue: '1'
language:
- iso: eng
month: '07'
oa_version: None
page: 163-169
publication: Journal of Magnetic Resonance
publication_identifier:
  issn:
  - 1090-7807
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: A set of BEST triple-resonance experiments for time-optimized protein resonance
  assignment
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 187
year: '2007'
...
---
_id: '8485'
abstract:
- lang: eng
  text: High signal to noise is a necessity for the quantification of NMR spectral
    parameters to be translated into accurate and precise restraints on protein structure
    and dynamics. An important source of long-range structural information is obtained
    from 1H–1H residual dipolar couplings (RDCs) measured for weakly aligned molecules.
    For sensitivity reasons, such measurements are generally performed on highly deuterated
    protein samples. Here we show that high sensitivity is also obtained for protonated
    protein samples if the pulse schemes are optimized in terms of longitudinal relaxation
    efficiency and J-mismatch compensated coherence transfer. The new sensitivity-optimized
    quantitative J-correlation experiment yields important signal gains reaching factors
    of 1.5 to 8 for individual correlation peaks when compared to previously proposed
    pulse schemes.
article_processing_charge: No
article_type: original
author:
- first_name: Paul
  full_name: Schanda, Paul
  id: 7B541462-FAF6-11E9-A490-E8DFE5697425
  last_name: Schanda
  orcid: 0000-0002-9350-7606
- first_name: Ewen
  full_name: Lescop, Ewen
  last_name: Lescop
- first_name: Mirjam
  full_name: Falge, Mirjam
  last_name: Falge
- first_name: Rémy
  full_name: Sounier, Rémy
  last_name: Sounier
- first_name: Jérôme
  full_name: Boisbouvier, Jérôme
  last_name: Boisbouvier
- first_name: Bernhard
  full_name: Brutscher, Bernhard
  last_name: Brutscher
citation:
  ama: Schanda P, Lescop E, Falge M, Sounier R, Boisbouvier J, Brutscher B. Sensitivity-optimized
    experiment for the measurement of residual dipolar couplings between amide protons.
    <i>Journal of Biomolecular NMR</i>. 2007;38:47-55. doi:<a href="https://doi.org/10.1007/s10858-006-9138-2">10.1007/s10858-006-9138-2</a>
  apa: Schanda, P., Lescop, E., Falge, M., Sounier, R., Boisbouvier, J., &#38; Brutscher,
    B. (2007). Sensitivity-optimized experiment for the measurement of residual dipolar
    couplings between amide protons. <i>Journal of Biomolecular NMR</i>. Springer
    Nature. <a href="https://doi.org/10.1007/s10858-006-9138-2">https://doi.org/10.1007/s10858-006-9138-2</a>
  chicago: Schanda, Paul, Ewen Lescop, Mirjam Falge, Rémy Sounier, Jérôme Boisbouvier,
    and Bernhard Brutscher. “Sensitivity-Optimized Experiment for the Measurement
    of Residual Dipolar Couplings between Amide Protons.” <i>Journal of Biomolecular
    NMR</i>. Springer Nature, 2007. <a href="https://doi.org/10.1007/s10858-006-9138-2">https://doi.org/10.1007/s10858-006-9138-2</a>.
  ieee: P. Schanda, E. Lescop, M. Falge, R. Sounier, J. Boisbouvier, and B. Brutscher,
    “Sensitivity-optimized experiment for the measurement of residual dipolar couplings
    between amide protons,” <i>Journal of Biomolecular NMR</i>, vol. 38. Springer
    Nature, pp. 47–55, 2007.
  ista: Schanda P, Lescop E, Falge M, Sounier R, Boisbouvier J, Brutscher B. 2007.
    Sensitivity-optimized experiment for the measurement of residual dipolar couplings
    between amide protons. Journal of Biomolecular NMR. 38, 47–55.
  mla: Schanda, Paul, et al. “Sensitivity-Optimized Experiment for the Measurement
    of Residual Dipolar Couplings between Amide Protons.” <i>Journal of Biomolecular
    NMR</i>, vol. 38, Springer Nature, 2007, pp. 47–55, doi:<a href="https://doi.org/10.1007/s10858-006-9138-2">10.1007/s10858-006-9138-2</a>.
  short: P. Schanda, E. Lescop, M. Falge, R. Sounier, J. Boisbouvier, B. Brutscher,
    Journal of Biomolecular NMR 38 (2007) 47–55.
date_created: 2020-09-18T10:13:12Z
date_published: 2007-03-08T00:00:00Z
date_updated: 2021-01-12T08:19:36Z
day: '08'
doi: 10.1007/s10858-006-9138-2
extern: '1'
intvolume: '        38'
keyword:
- Spectroscopy
- Biochemistry
language:
- iso: eng
month: '03'
oa_version: None
page: 47-55
publication: Journal of Biomolecular NMR
publication_identifier:
  issn:
  - 0925-2738
  - 1573-5001
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Sensitivity-optimized experiment for the measurement of residual dipolar couplings
  between amide protons
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 38
year: '2007'
...
---
_id: '8486'
abstract:
- lang: eng
  text: A technique is described that allows reducing acquisition times of multidimensional
    NMR experiments by extensive spectral folding. The method is simple and has many
    interesting applications for NMR studies of molecular structure, dynamics, and
    kinetics.
article_processing_charge: No
article_type: original
author:
- first_name: Ewen
  full_name: Lescop, Ewen
  last_name: Lescop
- first_name: Paul
  full_name: Schanda, Paul
  id: 7B541462-FAF6-11E9-A490-E8DFE5697425
  last_name: Schanda
  orcid: 0000-0002-9350-7606
- first_name: Rodolfo
  full_name: Rasia, Rodolfo
  last_name: Rasia
- first_name: Bernhard
  full_name: Brutscher, Bernhard
  last_name: Brutscher
citation:
  ama: Lescop E, Schanda P, Rasia R, Brutscher B. Automated spectral compression for
    fast multidimensional NMR and increased time resolution in real-time NMR spectroscopy.
    <i>Journal of the American Chemical Society</i>. 2007;129(10):2756-2757. doi:<a
    href="https://doi.org/10.1021/ja068949u">10.1021/ja068949u</a>
  apa: Lescop, E., Schanda, P., Rasia, R., &#38; Brutscher, B. (2007). Automated spectral
    compression for fast multidimensional NMR and increased time resolution in real-time
    NMR spectroscopy. <i>Journal of the American Chemical Society</i>. American Chemical
    Society. <a href="https://doi.org/10.1021/ja068949u">https://doi.org/10.1021/ja068949u</a>
  chicago: Lescop, Ewen, Paul Schanda, Rodolfo Rasia, and Bernhard Brutscher. “Automated
    Spectral Compression for Fast Multidimensional NMR and Increased Time Resolution
    in Real-Time NMR Spectroscopy.” <i>Journal of the American Chemical Society</i>.
    American Chemical Society, 2007. <a href="https://doi.org/10.1021/ja068949u">https://doi.org/10.1021/ja068949u</a>.
  ieee: E. Lescop, P. Schanda, R. Rasia, and B. Brutscher, “Automated spectral compression
    for fast multidimensional NMR and increased time resolution in real-time NMR spectroscopy,”
    <i>Journal of the American Chemical Society</i>, vol. 129, no. 10. American Chemical
    Society, pp. 2756–2757, 2007.
  ista: Lescop E, Schanda P, Rasia R, Brutscher B. 2007. Automated spectral compression
    for fast multidimensional NMR and increased time resolution in real-time NMR spectroscopy.
    Journal of the American Chemical Society. 129(10), 2756–2757.
  mla: Lescop, Ewen, et al. “Automated Spectral Compression for Fast Multidimensional
    NMR and Increased Time Resolution in Real-Time NMR Spectroscopy.” <i>Journal of
    the American Chemical Society</i>, vol. 129, no. 10, American Chemical Society,
    2007, pp. 2756–57, doi:<a href="https://doi.org/10.1021/ja068949u">10.1021/ja068949u</a>.
  short: E. Lescop, P. Schanda, R. Rasia, B. Brutscher, Journal of the American Chemical
    Society 129 (2007) 2756–2757.
date_created: 2020-09-18T10:13:21Z
date_published: 2007-02-17T00:00:00Z
date_updated: 2021-01-12T08:19:36Z
day: '17'
doi: 10.1021/ja068949u
extern: '1'
intvolume: '       129'
issue: '10'
keyword:
- Colloid and Surface Chemistry
- Biochemistry
- General Chemistry
- Catalysis
language:
- iso: eng
month: '02'
oa_version: None
page: 2756-2757
publication: Journal of the American Chemical Society
publication_identifier:
  issn:
  - 0002-7863
  - 1520-5126
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
status: public
title: Automated spectral compression for fast multidimensional NMR and increased
  time resolution in real-time NMR spectroscopy
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 129
year: '2007'
...
---
_id: '8487'
abstract:
- lang: eng
  text: Following unidirectional biophysical events such as the folding of proteins
    or the equilibration of binding interactions, requires experimental methods that
    yield information at both atomic-level resolution and at high repetition rates.
    Toward this end a number of different approaches enabling the rapid acquisition
    of 2D NMR spectra have been recently introduced, including spatially encoded “ultrafast”
    2D NMR spectroscopy and SOFAST HMQC NMR. Whereas the former accelerates acquisitions
    by reducing the number of scans that are necessary for completing arbitrary 2D
    NMR experiments, the latter operates by reducing the delay between consecutive
    scans while preserving sensitivity. Given the complementarities between these
    two approaches it seems natural to combine them into a single tool, enabling the
    acquisition of full 2D protein NMR spectra at high repetition rates. We demonstrate
    here this capability with the introduction of “ultraSOFAST” HMQC NMR, a spatially
    encoded and relaxation-optimized approach that can provide 2D protein correlation
    spectra at ∼1 s repetition rates for samples in the ∼2 mM concentration range.
    The principles, relative advantages, and current limitations of this new approach
    are discussed, and its application is exemplified with a study of the fast hydrogen−deuterium
    exchange characterizing amide sites in Ubiquitin.
article_processing_charge: No
article_type: original
author:
- first_name: Maayan
  full_name: Gal, Maayan
  last_name: Gal
- first_name: Paul
  full_name: Schanda, Paul
  id: 7B541462-FAF6-11E9-A490-E8DFE5697425
  last_name: Schanda
  orcid: 0000-0002-9350-7606
- first_name: Bernhard
  full_name: Brutscher, Bernhard
  last_name: Brutscher
- first_name: Lucio
  full_name: Frydman, Lucio
  last_name: Frydman
citation:
  ama: Gal M, Schanda P, Brutscher B, Frydman L. UltraSOFAST HMQC NMR and the repetitive
    acquisition of 2D protein spectra at Hz rates. <i>Journal of the American Chemical
    Society</i>. 2007;129(5):1372-1377. doi:<a href="https://doi.org/10.1021/ja066915g">10.1021/ja066915g</a>
  apa: Gal, M., Schanda, P., Brutscher, B., &#38; Frydman, L. (2007). UltraSOFAST
    HMQC NMR and the repetitive acquisition of 2D protein spectra at Hz rates. <i>Journal
    of the American Chemical Society</i>. American Chemical Society. <a href="https://doi.org/10.1021/ja066915g">https://doi.org/10.1021/ja066915g</a>
  chicago: Gal, Maayan, Paul Schanda, Bernhard Brutscher, and Lucio Frydman. “UltraSOFAST
    HMQC NMR and the Repetitive Acquisition of 2D Protein Spectra at Hz Rates.” <i>Journal
    of the American Chemical Society</i>. American Chemical Society, 2007. <a href="https://doi.org/10.1021/ja066915g">https://doi.org/10.1021/ja066915g</a>.
  ieee: M. Gal, P. Schanda, B. Brutscher, and L. Frydman, “UltraSOFAST HMQC NMR and
    the repetitive acquisition of 2D protein spectra at Hz rates,” <i>Journal of the
    American Chemical Society</i>, vol. 129, no. 5. American Chemical Society, pp.
    1372–1377, 2007.
  ista: Gal M, Schanda P, Brutscher B, Frydman L. 2007. UltraSOFAST HMQC NMR and the
    repetitive acquisition of 2D protein spectra at Hz rates. Journal of the American
    Chemical Society. 129(5), 1372–1377.
  mla: Gal, Maayan, et al. “UltraSOFAST HMQC NMR and the Repetitive Acquisition of
    2D Protein Spectra at Hz Rates.” <i>Journal of the American Chemical Society</i>,
    vol. 129, no. 5, American Chemical Society, 2007, pp. 1372–77, doi:<a href="https://doi.org/10.1021/ja066915g">10.1021/ja066915g</a>.
  short: M. Gal, P. Schanda, B. Brutscher, L. Frydman, Journal of the American Chemical
    Society 129 (2007) 1372–1377.
date_created: 2020-09-18T10:13:27Z
date_published: 2007-01-10T00:00:00Z
date_updated: 2021-01-12T08:19:37Z
day: '10'
doi: 10.1021/ja066915g
extern: '1'
intvolume: '       129'
issue: '5'
keyword:
- Colloid and Surface Chemistry
- Biochemistry
- General Chemistry
- Catalysis
language:
- iso: eng
month: '01'
oa_version: None
page: 1372-1377
publication: Journal of the American Chemical Society
publication_identifier:
  issn:
  - 0002-7863
  - 1520-5126
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
status: public
title: UltraSOFAST HMQC NMR and the repetitive acquisition of 2D protein spectra at
  Hz rates
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 129
year: '2007'
...
---
_id: '8511'
abstract:
- lang: eng
  text: "Here we study an amazing phenomenon discovered by Newhouse [S. Newhouse,
    Non-density of Axiom A(a) on S2, in: Proc. Sympos. Pure Math., vol. 14, Amer.
    Math. Soc., 1970, pp. 191–202; S. Newhouse,\r\nDiffeomorphisms with infinitely
    many sinks, Topology 13 (1974) 9–18; S. Newhouse, The abundance of\r\nwild hyperbolic
    sets and nonsmooth stable sets of diffeomorphisms, Publ. Math. Inst. Hautes Études
    Sci.\r\n50 (1979) 101–151]. It turns out that in the space of Cr smooth diffeomorphisms
    Diffr(M) of a compact\r\nsurface M there is an open set U such that a Baire generic
    diffeomorphism f ∈ U has infinitely many coexisting sinks. In this paper we make
    a step towards understanding “how often does a surface diffeomorphism\r\nhave
    infinitely many sinks.” Our main result roughly says that with probability one
    for any positive D a\r\nsurface diffeomorphism has only finitely many localized
    sinks either of cyclicity bounded by D or those\r\nwhose period is relatively
    large compared to its cyclicity. It verifies a particular case of Palis’ Conjecture\r\nsaying
    that even though diffeomorphisms with infinitely many coexisting sinks are Baire
    generic, they have\r\nprobability zero.\r\nOne of the key points of the proof
    is an application of Newton Interpolation Polynomials to study the dynamics initiated
    in [V. Kaloshin, B. Hunt, A stretched exponential bound on the rate of growth
    of the number\r\nof periodic points for prevalent diffeomorphisms I, Ann. of Math.,
    in press, 92 pp.; V. Kaloshin, A stretched\r\nexponential bound on the rate of
    growth of the number of periodic points for prevalent diffeomorphisms II,\r\npreprint,
    85 pp.]."
article_processing_charge: No
article_type: original
author:
- first_name: A.
  full_name: Gorodetski, A.
  last_name: Gorodetski
- first_name: Vadim
  full_name: Kaloshin, Vadim
  id: FE553552-CDE8-11E9-B324-C0EBE5697425
  last_name: Kaloshin
  orcid: 0000-0002-6051-2628
citation:
  ama: Gorodetski A, Kaloshin V. How often surface diffeomorphisms have infinitely
    many sinks and hyperbolicity of periodic points near a homoclinic tangency. <i>Advances
    in Mathematics</i>. 2007;208(2):710-797. doi:<a href="https://doi.org/10.1016/j.aim.2006.03.012">10.1016/j.aim.2006.03.012</a>
  apa: Gorodetski, A., &#38; Kaloshin, V. (2007). How often surface diffeomorphisms
    have infinitely many sinks and hyperbolicity of periodic points near a homoclinic
    tangency. <i>Advances in Mathematics</i>. Elsevier. <a href="https://doi.org/10.1016/j.aim.2006.03.012">https://doi.org/10.1016/j.aim.2006.03.012</a>
  chicago: Gorodetski, A., and Vadim Kaloshin. “How Often Surface Diffeomorphisms
    Have Infinitely Many Sinks and Hyperbolicity of Periodic Points near a Homoclinic
    Tangency.” <i>Advances in Mathematics</i>. Elsevier, 2007. <a href="https://doi.org/10.1016/j.aim.2006.03.012">https://doi.org/10.1016/j.aim.2006.03.012</a>.
  ieee: A. Gorodetski and V. Kaloshin, “How often surface diffeomorphisms have infinitely
    many sinks and hyperbolicity of periodic points near a homoclinic tangency,” <i>Advances
    in Mathematics</i>, vol. 208, no. 2. Elsevier, pp. 710–797, 2007.
  ista: Gorodetski A, Kaloshin V. 2007. How often surface diffeomorphisms have infinitely
    many sinks and hyperbolicity of periodic points near a homoclinic tangency. Advances
    in Mathematics. 208(2), 710–797.
  mla: Gorodetski, A., and Vadim Kaloshin. “How Often Surface Diffeomorphisms Have
    Infinitely Many Sinks and Hyperbolicity of Periodic Points near a Homoclinic Tangency.”
    <i>Advances in Mathematics</i>, vol. 208, no. 2, Elsevier, 2007, pp. 710–97, doi:<a
    href="https://doi.org/10.1016/j.aim.2006.03.012">10.1016/j.aim.2006.03.012</a>.
  short: A. Gorodetski, V. Kaloshin, Advances in Mathematics 208 (2007) 710–797.
date_created: 2020-09-18T10:48:27Z
date_published: 2007-01-30T00:00:00Z
date_updated: 2021-01-12T08:19:47Z
day: '30'
doi: 10.1016/j.aim.2006.03.012
extern: '1'
intvolume: '       208'
issue: '2'
keyword:
- General Mathematics
language:
- iso: eng
month: '01'
oa_version: None
page: 710-797
publication: Advances in Mathematics
publication_identifier:
  issn:
  - 0001-8708
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: How often surface diffeomorphisms have infinitely many sinks and hyperbolicity
  of periodic points near a homoclinic tangency
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 208
year: '2007'
...