---
_id: '3044'
abstract:
- lang: eng
text: 'The signalling molecule auxin controls plant morphogenesis via its activity
gradients, which are produced by intercellular auxin transport. Cellular auxin
efflux is the rate-limiting step in this process and depends on PIN and phosphoglycoprotein
(PGP) auxin transporters. Mutual roles for these proteins in auxin transport are
unclear, as is the significance of their interactions for plant development. Here,
we have analysed the importance of the functional interaction between PIN- and
PGP-dependent auxin transport in development. We show by analysis of inducible
overexpression lines that PINs and PGPs define distinct auxin transport mechanisms:
both mediate auxin efflux but they play diverse developmental roles. Components
of both systems are expressed during embryogenesis, organogenesis and tropisms,
and they interact genetically in both synergistic and antagonistic fashions. A
concerted action of PIN- and PGP-dependent efflux systems is required for asymmetric
auxin distribution during these processes. We propose a model in which PGP-mediated
efflux controls auxin levels in auxin channel-forming cells and, thus, auxin availability
for PIN-dependent vectorial auxin movement.'
author:
- first_name: Jozef
full_name: Mravec, Jozef
last_name: Mravec
- first_name: Martin
full_name: Kubeš, Martin
last_name: Kubeš
- first_name: Agnieszka
full_name: Bielach, Agnieszka
last_name: Bielach
- first_name: Vassilena
full_name: Gaykova, Vassilena
last_name: Gaykova
- first_name: Jan
full_name: Petrášek, Jan
last_name: Petrášek
- first_name: Petr
full_name: Skůpa, Petr
last_name: Skůpa
- first_name: Suresh
full_name: Chand, Suresh
last_name: Chand
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Eva
full_name: Zažímalová, Eva
last_name: Zažímalová
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Mravec J, Kubeš M, Bielach A, et al. Interaction of PIN and PGP transport mechanisms
in auxin distribution-dependent development. Development. 2008;135(20):3345-3354.
doi:10.1242/dev.021071
apa: Mravec, J., Kubeš, M., Bielach, A., Gaykova, V., Petrášek, J., Skůpa, P., …
Friml, J. (2008). Interaction of PIN and PGP transport mechanisms in auxin distribution-dependent
development. Development. Company of Biologists. https://doi.org/10.1242/dev.021071
chicago: Mravec, Jozef, Martin Kubeš, Agnieszka Bielach, Vassilena Gaykova, Jan
Petrášek, Petr Skůpa, Suresh Chand, Eva Benková, Eva Zažímalová, and Jiří Friml.
“Interaction of PIN and PGP Transport Mechanisms in Auxin Distribution-Dependent
Development.” Development. Company of Biologists, 2008. https://doi.org/10.1242/dev.021071.
ieee: J. Mravec et al., “Interaction of PIN and PGP transport mechanisms
in auxin distribution-dependent development,” Development, vol. 135, no.
20. Company of Biologists, pp. 3345–3354, 2008.
ista: Mravec J, Kubeš M, Bielach A, Gaykova V, Petrášek J, Skůpa P, Chand S, Benková
E, Zažímalová E, Friml J. 2008. Interaction of PIN and PGP transport mechanisms
in auxin distribution-dependent development. Development. 135(20), 3345–3354.
mla: Mravec, Jozef, et al. “Interaction of PIN and PGP Transport Mechanisms in Auxin
Distribution-Dependent Development.” Development, vol. 135, no. 20, Company
of Biologists, 2008, pp. 3345–54, doi:10.1242/dev.021071.
short: J. Mravec, M. Kubeš, A. Bielach, V. Gaykova, J. Petrášek, P. Skůpa, S. Chand,
E. Benková, E. Zažímalová, J. Friml, Development 135 (2008) 3345–3354.
date_created: 2018-12-11T12:01:02Z
date_published: 2008-10-15T00:00:00Z
date_updated: 2021-01-12T07:40:39Z
day: '15'
doi: 10.1242/dev.021071
extern: 1
intvolume: ' 135'
issue: '20'
month: '10'
page: 3345 - 3354
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '3658'
quality_controlled: 0
status: public
title: Interaction of PIN and PGP transport mechanisms in auxin distribution-dependent
development
type: journal_article
volume: 135
year: '2008'
...
---
_id: '3045'
abstract:
- lang: eng
text: Dynamically polarized membrane proteins define different cell boundaries and
have an important role in intercellular communication - a vital feature of multicellular
development. Efflux carriers for the signalling molecule auxin from the PIN family
are landmarks of cell polarity in plants and have a crucial involvement in auxin
distribution-dependent development including embryo patterning, organogenesis
and tropisms. Polar PIN localization determines the direction of intercellular
auxin flow, yet the mechanisms generating PIN polarity remain unclear. Here we
identify an endocytosis-dependent mechanism of PIN polarity generation and analyse
its developmental implications. Real-time PIN tracking showed that after synthesis,
PINs are initially delivered to the plasma membrane in a non-polar manner and
their polarity is established by subsequent endocytic recycling. Interference
with PIN endocytosis either by auxin or by manipulation of the Arabidopsis Rab5
GTPase pathway prevents PIN polarization. Failure of PIN polarization transiently
alters asymmetric auxin distribution during embryogenesis and increases the local
auxin response in apical embryo regions. This results in ectopic expression of
auxin pathway-associated root-forming master regulators in embryonic leaves and
promotes homeotic transformation of leaves to roots. Our results indicate a two-step
mechanism for the generation of PIN polar localization and the essential role
of endocytosis in this process. It also highlights the link between endocytosis-dependent
polarity of individual cells and auxin distribution-dependent cell fate establishment
for multicellular patterning.
author:
- first_name: Pankaj
full_name: Dhonukshe, Pankaj
last_name: Dhonukshe
- first_name: Hirokazu
full_name: Tanaka, Hirokazu
last_name: Tanaka
- first_name: Tatsuaki
full_name: Goh, Tatsuaki
last_name: Goh
- first_name: Kazuo
full_name: Ebine, Kazuo
last_name: Ebine
- first_name: Ari
full_name: Mähönen, Ari Pekka
last_name: Mähönen
- first_name: Kalika
full_name: Prasad, Kalika
last_name: Prasad
- first_name: Ikram
full_name: Blilou, Ikram
last_name: Blilou
- first_name: Niko
full_name: Geldner, Niko
last_name: Geldner
- first_name: Jian
full_name: Xu, Jian
last_name: Xu
- first_name: Tomohiro
full_name: Uemura, Tomohiro
last_name: Uemura
- first_name: Joanne
full_name: Chory, Joanne
last_name: Chory
- first_name: Takashi
full_name: Ueda, Takashi
last_name: Ueda
- first_name: Akihiko
full_name: Nakano, Akihiko
last_name: Nakano
- first_name: Ben
full_name: Scheres, Ben
last_name: Scheres
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Dhonukshe P, Tanaka H, Goh T, et al. Generation of cell polarity in plants
links endocytosis auxin distribution and cell fate decisions. Nature. 2008;456(7224):962-966.
doi:10.1038/nature07409
apa: Dhonukshe, P., Tanaka, H., Goh, T., Ebine, K., Mähönen, A., Prasad, K., … Friml,
J. (2008). Generation of cell polarity in plants links endocytosis auxin distribution
and cell fate decisions. Nature. Nature Publishing Group. https://doi.org/10.1038/nature07409
chicago: Dhonukshe, Pankaj, Hirokazu Tanaka, Tatsuaki Goh, Kazuo Ebine, Ari Mähönen,
Kalika Prasad, Ikram Blilou, et al. “Generation of Cell Polarity in Plants Links
Endocytosis Auxin Distribution and Cell Fate Decisions.” Nature. Nature
Publishing Group, 2008. https://doi.org/10.1038/nature07409.
ieee: P. Dhonukshe et al., “Generation of cell polarity in plants links endocytosis
auxin distribution and cell fate decisions,” Nature, vol. 456, no. 7224.
Nature Publishing Group, pp. 962–966, 2008.
ista: Dhonukshe P, Tanaka H, Goh T, Ebine K, Mähönen A, Prasad K, Blilou I, Geldner
N, Xu J, Uemura T, Chory J, Ueda T, Nakano A, Scheres B, Friml J. 2008. Generation
of cell polarity in plants links endocytosis auxin distribution and cell fate
decisions. Nature. 456(7224), 962–966.
mla: Dhonukshe, Pankaj, et al. “Generation of Cell Polarity in Plants Links Endocytosis
Auxin Distribution and Cell Fate Decisions.” Nature, vol. 456, no. 7224,
Nature Publishing Group, 2008, pp. 962–66, doi:10.1038/nature07409.
short: P. Dhonukshe, H. Tanaka, T. Goh, K. Ebine, A. Mähönen, K. Prasad, I. Blilou,
N. Geldner, J. Xu, T. Uemura, J. Chory, T. Ueda, A. Nakano, B. Scheres, J. Friml,
Nature 456 (2008) 962–966.
date_created: 2018-12-11T12:01:02Z
date_published: 2008-12-18T00:00:00Z
date_updated: 2021-01-12T07:40:40Z
day: '18'
doi: 10.1038/nature07409
extern: 1
intvolume: ' 456'
issue: '7224'
month: '12'
page: 962 - 966
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '3657'
quality_controlled: 0
status: public
title: Generation of cell polarity in plants links endocytosis auxin distribution
and cell fate decisions
type: journal_article
volume: 456
year: '2008'
...
---
_id: '3194'
abstract:
- lang: eng
text: We consider the problem of optimizing multilabel MRFs, which is in general
NP-hard and ubiquitous in low-level computer vision. One approach for its solution
is to formulate it as an integer linear programming and relax the integrality
constraints. The approach we consider in this paper is to first convert the multi-label
MRF into an equivalent binary-label MRF and then to relax it. The resulting relaxation
can be efficiently solved using a maximum flow algorithm. Its solution provides
us with a partially optimal labelling of the binary variables. This partial labelling
is then easily transferred to the multi-label problem. We study the theoretical
properties of the new relaxation and compare it with the standard one. Specifically,
we compare tightness, and characterize a subclass of problems where the two relaxations
coincide. We propose several combined algorithms based on the technique and demonstrate
their performance on challenging computer vision problems.
author:
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Alexander
full_name: Shekhovtsov, Alexander
last_name: Shekhovtsov
- 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: Philip
full_name: Torr, Philip H
last_name: Torr
citation:
ama: 'Kohli P, Shekhovtsov A, Rother C, Kolmogorov V, Torr P. On partial optimality
in multi label MRFs. In: Omnipress; 2008:480-487. doi:10.1145/1390156.1390217'
apa: 'Kohli, P., Shekhovtsov, A., Rother, C., Kolmogorov, V., & Torr, P. (2008).
On partial optimality in multi label MRFs (pp. 480–487). Presented at the ICML:
International Conference on Machine Learning, Omnipress. https://doi.org/10.1145/1390156.1390217'
chicago: Kohli, Pushmeet, Alexander Shekhovtsov, Carsten Rother, Vladimir Kolmogorov,
and Philip Torr. “On Partial Optimality in Multi Label MRFs,” 480–87. Omnipress,
2008. https://doi.org/10.1145/1390156.1390217.
ieee: 'P. Kohli, A. Shekhovtsov, C. Rother, V. Kolmogorov, and P. Torr, “On partial
optimality in multi label MRFs,” presented at the ICML: International Conference
on Machine Learning, 2008, pp. 480–487.'
ista: 'Kohli P, Shekhovtsov A, Rother C, Kolmogorov V, Torr P. 2008. On partial
optimality in multi label MRFs. ICML: International Conference on Machine Learning,
480–487.'
mla: Kohli, Pushmeet, et al. On Partial Optimality in Multi Label MRFs. Omnipress,
2008, pp. 480–87, doi:10.1145/1390156.1390217.
short: P. Kohli, A. Shekhovtsov, C. Rother, V. Kolmogorov, P. Torr, in:, Omnipress,
2008, pp. 480–487.
conference:
name: 'ICML: International Conference on Machine Learning'
date_created: 2018-12-11T12:01:56Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:41:42Z
day: '01'
doi: 10.1145/1390156.1390217
extern: 1
main_file_link:
- open_access: '0'
url: http://research.microsoft.com/pubs/77356/icml08-partoptmrf.pdf
month: '01'
page: 480 - 487
publication_status: published
publisher: Omnipress
publist_id: '3486'
quality_controlled: 0
status: public
title: On partial optimality in multi label MRFs
type: conference
year: '2008'
...
---
_id: '3195'
abstract:
- lang: eng
text: 'Graph cut is a popular technique for interactive image segmentation. However,
it has certain shortcomings. In particular, graph cut has problems with segmenting
thin elongated objects due to the ldquoshrinking biasrdquo. To overcome this problem,
we propose to impose an additional connectivity prior, which is a very natural
assumption about objects. We formulate several versions of the connectivity constraint
and show that the corresponding optimization problems are all NP-hard. For some
of these versions we propose two optimization algorithms: (i) a practical heuristic
technique which we call DijkstraGC, and (ii) a slow method based on problem decomposition
which provides a lower bound on the problem. We use the second technique to verify
that for some practical examples DijkstraGC is able to find the global minimum.'
author:
- first_name: Sara
full_name: Vicente, Sara
last_name: Vicente
- 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: 'Vicente S, Kolmogorov V, Rother C. Graph cut based image segmentation with
connectivity priors. In: IEEE; 2008. doi:10.1109/CVPR.2008.4587440'
apa: 'Vicente, S., Kolmogorov, V., & Rother, C. (2008). Graph cut based image
segmentation with connectivity priors. Presented at the CVPR: Computer Vision
and Pattern Recognition, IEEE. https://doi.org/10.1109/CVPR.2008.4587440'
chicago: Vicente, Sara, Vladimir Kolmogorov, and Carsten Rother. “Graph Cut Based
Image Segmentation with Connectivity Priors.” IEEE, 2008. https://doi.org/10.1109/CVPR.2008.4587440.
ieee: 'S. Vicente, V. Kolmogorov, and C. Rother, “Graph cut based image segmentation
with connectivity priors,” presented at the CVPR: Computer Vision and Pattern
Recognition, 2008.'
ista: 'Vicente S, Kolmogorov V, Rother C. 2008. Graph cut based image segmentation
with connectivity priors. CVPR: Computer Vision and Pattern Recognition.'
mla: Vicente, Sara, et al. Graph Cut Based Image Segmentation with Connectivity
Priors. IEEE, 2008, doi:10.1109/CVPR.2008.4587440.
short: S. Vicente, V. Kolmogorov, C. Rother, in:, IEEE, 2008.
conference:
name: 'CVPR: Computer Vision and Pattern Recognition'
date_created: 2018-12-11T12:01:57Z
date_published: 2008-08-05T00:00:00Z
date_updated: 2021-01-12T07:41:43Z
day: '05'
doi: 10.1109/CVPR.2008.4587440
extern: 1
main_file_link:
- open_access: '0'
url: http://research.microsoft.com/pubs/80485/CVPR08-ConnectedGC.pdf
month: '08'
publication_status: published
publisher: IEEE
publist_id: '3487'
quality_controlled: 0
status: public
title: Graph cut based image segmentation with connectivity priors
type: conference
year: '2008'
...
---
_id: '3196'
abstract:
- lang: eng
text: 'Among the most exciting advances in early vision has been the development
of efficient energy minimization algorithms for pixel-labeling tasks such as depth
or texture computation. It has been known for decades that such problems can be
elegantly expressed as Markov random fields, yet the resulting energy minimization
problems have been widely viewed as intractable. Algorithms such as graph cuts
and loopy belief propagation (LBP) have proven to be very powerful: For example,
such methods form the basis for almost all the top-performing stereo methods.
However, the trade-offs among different energy minimization algorithms are still
not well understood. In this paper, we describe a set of energy minimization benchmarks
and use them to compare the solution quality and runtime of several common energy
minimization algorithms. We investigate three promising methods-graph cuts, LBP,
and tree-reweighted message passing-in addition to the well-known older iterated
conditional mode (ICM) algorithm. Our benchmark problems are drawn from published
energy functions used for stereo, image stitching, interactive segmentation, and
denoising. We also provide a general-purpose software interface that allows vision
researchers to easily switch between optimization methods. The benchmarks, code,
images, and results are available at http://vision.middlebury.edu/MRF/.'
author:
- first_name: Richard
full_name: Szeliski, Richard S
last_name: Szeliski
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
- first_name: Daniel
full_name: Scharstein, Daniel
last_name: Scharstein
- first_name: Olga
full_name: Veksler, Olga
last_name: Veksler
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Aseem
full_name: Agarwala, Aseem
last_name: Agarwala
- first_name: Marshall
full_name: Tappen, Marshall F
last_name: Tappen
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: Szeliski R, Zabih R, Scharstein D, et al. A comparative study of energy minimization
methods for Markov random fields with smoothness-based priors. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 2008;30(6):1068-1080. doi:10.1109/TPAMI.2007.70844
apa: Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala,
A., … Rother, C. (2008). A comparative study of energy minimization methods for
Markov random fields with smoothness-based priors. IEEE Transactions on Pattern
Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2007.70844
chicago: Szeliski, Richard, Ramin Zabih, Daniel Scharstein, Olga Veksler, Vladimir
Kolmogorov, Aseem Agarwala, Marshall Tappen, and Carsten Rother. “A Comparative
Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based
Priors.” IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE, 2008. https://doi.org/10.1109/TPAMI.2007.70844.
ieee: R. Szeliski et al., “A comparative study of energy minimization methods
for Markov random fields with smoothness-based priors,” IEEE Transactions on
Pattern Analysis and Machine Intelligence, vol. 30, no. 6. IEEE, pp. 1068–1080,
2008.
ista: Szeliski R, Zabih R, Scharstein D, Veksler O, Kolmogorov V, Agarwala A, Tappen
M, Rother C. 2008. A comparative study of energy minimization methods for Markov
random fields with smoothness-based priors. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 30(6), 1068–1080.
mla: Szeliski, Richard, et al. “A Comparative Study of Energy Minimization Methods
for Markov Random Fields with Smoothness-Based Priors.” IEEE Transactions on
Pattern Analysis and Machine Intelligence, vol. 30, no. 6, IEEE, 2008, pp.
1068–80, doi:10.1109/TPAMI.2007.70844.
short: R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala,
M. Tappen, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence
30 (2008) 1068–1080.
date_created: 2018-12-11T12:01:57Z
date_published: 2008-06-01T00:00:00Z
date_updated: 2021-01-12T07:41:43Z
day: '01'
doi: 10.1109/TPAMI.2007.70844
extern: 1
intvolume: ' 30'
issue: '6'
month: '06'
page: 1068 - 1080
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '3488'
quality_controlled: 0
status: public
title: A comparative study of energy minimization methods for Markov random fields
with smoothness-based priors
type: journal_article
volume: 30
year: '2008'
...
---
_id: '3198'
abstract:
- lang: eng
text: 'In this paper we present a new approach for establishing correspondences
between sparse image features related by an unknown non-rigid mapping and corrupted
by clutter and occlusion, such as points extracted from a pair of images containing
a human figure in distinct poses. We formulate this matching task as an energy
minimization problem by defining a complex objective function of the appearance
and the spatial arrangement of the features. Optimization of this energy is an
instance of graph matching, which is in general a NP-hard problem. We describe
a novel graph matching optimization technique, which we refer to as dual decomposition
(DD), and demonstrate on a variety of examples that this method outperforms existing
graph matching algorithms. In the majority of our examples DD is able to find
the global minimum within a minute. The ability to globally optimize the objective
allows us to accurately learn the parameters of our matching model from training
examples. We show on several matching tasks that our learned model yields results
superior to those of state-of-the-art methods. '
alternative_title:
- LNCS
author:
- first_name: Lorenzo
full_name: Torresani, Lorenzo
last_name: Torresani
- 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: 'Torresani L, Kolmogorov V, Rother C. Feature correspondence via graph matching:
Models and global optimization. In: Vol 5303. Springer; 2008:596-609. doi:10.1007/978-3-540-88688-4_44'
apa: 'Torresani, L., Kolmogorov, V., & Rother, C. (2008). Feature correspondence
via graph matching: Models and global optimization (Vol. 5303, pp. 596–609). Presented
at the ECCV: European Conference on Computer Vision, Springer. https://doi.org/10.1007/978-3-540-88688-4_44'
chicago: 'Torresani, Lorenzo, Vladimir Kolmogorov, and Carsten Rother. “Feature
Correspondence via Graph Matching: Models and Global Optimization,” 5303:596–609.
Springer, 2008. https://doi.org/10.1007/978-3-540-88688-4_44.'
ieee: 'L. Torresani, V. Kolmogorov, and C. Rother, “Feature correspondence via graph
matching: Models and global optimization,” presented at the ECCV: European Conference
on Computer Vision, 2008, vol. 5303, pp. 596–609.'
ista: 'Torresani L, Kolmogorov V, Rother C. 2008. Feature correspondence via graph
matching: Models and global optimization. ECCV: European Conference on Computer
Vision, LNCS, vol. 5303, 596–609.'
mla: 'Torresani, Lorenzo, et al. Feature Correspondence via Graph Matching: Models
and Global Optimization. Vol. 5303, Springer, 2008, pp. 596–609, doi:10.1007/978-3-540-88688-4_44.'
short: L. Torresani, V. Kolmogorov, C. Rother, in:, Springer, 2008, pp. 596–609.
conference:
name: 'ECCV: European Conference on Computer Vision'
date_created: 2018-12-11T12:01:58Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:41:44Z
day: '01'
doi: 10.1007/978-3-540-88688-4_44
extern: 1
intvolume: ' 5303'
main_file_link:
- open_access: '0'
url: http://research-srv.microsoft.com/pubs/70610/eccv08-MatchingMRF.pdf
month: '01'
page: 596 - 609
publication_status: published
publisher: Springer
publist_id: '3485'
quality_controlled: 0
status: public
title: 'Feature correspondence via graph matching: Models and global optimization'
type: conference
volume: 5303
year: '2008'
...
---
_id: '3224'
abstract:
- lang: eng
text: 'We propose a new mode of operation, enciphered CBC, for domain extension
of length-preserving functions (like block ciphers), which is a variation on the
popular CBC mode of operation. Our new mode is twice slower than CBC, but has
many (property-preserving) properties not enjoyed by CBC and other known modes.
Most notably, it yields the first constant-rate Variable Input Length (VIL) MAC
from any length preserving Fixed Input Length (FIL) MAC. This answers the question
of Dodis and Puniya from Eurocrypt 2007. Further, our mode is a secure domain
extender for PRFs (with basically the same security as encrypted CBC). This provides
a hedge against the security of the block cipher: if the block cipher is pseudorandom,
one gets a VIL-PRF, while if it is "only" unpredictable, one "at
least" gets a VIL-MAC. Additionally, our mode yields a VIL random oracle
(and, hence, a collision-resistant hash function) when instantiated with length-preserving
random functions, or even random permutations (which can be queried from both
sides). This means that one does not have to re-key the block cipher during the
computation, which was critically used in most previous constructions (analyzed
in the ideal cipher model). '
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
- first_name: Prashant
full_name: Puniya, Prashant
last_name: Puniya
citation:
ama: 'Dodis Y, Pietrzak KZ, Puniya P. A new mode of operation for block ciphers
and length preserving MACs. In: Vol 4965. Springer; 2008:198-219. doi:10.1007/978-3-540-78967-3_12'
apa: 'Dodis, Y., Pietrzak, K. Z., & Puniya, P. (2008). A new mode of operation
for block ciphers and length preserving MACs (Vol. 4965, pp. 198–219). Presented
at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer.
https://doi.org/10.1007/978-3-540-78967-3_12'
chicago: Dodis, Yevgeniy, Krzysztof Z Pietrzak, and Prashant Puniya. “A New Mode
of Operation for Block Ciphers and Length Preserving MACs,” 4965:198–219. Springer,
2008. https://doi.org/10.1007/978-3-540-78967-3_12.
ieee: 'Y. Dodis, K. Z. Pietrzak, and P. Puniya, “A new mode of operation for block
ciphers and length preserving MACs,” presented at the EUROCRYPT: Theory and Applications
of Cryptographic Techniques, 2008, vol. 4965, pp. 198–219.'
ista: 'Dodis Y, Pietrzak KZ, Puniya P. 2008. A new mode of operation for block ciphers
and length preserving MACs. EUROCRYPT: Theory and Applications of Cryptographic
Techniques, LNCS, vol. 4965, 198–219.'
mla: Dodis, Yevgeniy, et al. A New Mode of Operation for Block Ciphers and Length
Preserving MACs. Vol. 4965, Springer, 2008, pp. 198–219, doi:10.1007/978-3-540-78967-3_12.
short: Y. Dodis, K.Z. Pietrzak, P. Puniya, in:, Springer, 2008, pp. 198–219.
conference:
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
date_created: 2018-12-11T12:02:07Z
date_published: 2008-04-28T00:00:00Z
date_updated: 2021-01-12T07:41:55Z
day: '28'
doi: 10.1007/978-3-540-78967-3_12
extern: 1
intvolume: ' 4965'
month: '04'
page: 198 - 219
publication_status: published
publisher: Springer
publist_id: '3456'
quality_controlled: 0
status: public
title: A new mode of operation for block ciphers and length preserving MACs
type: conference
volume: 4965
year: '2008'
...
---
_id: '3225'
abstract:
- lang: eng
text: 'A robust multi-property combiner for a set of security properties merges
two hash functions such that the resulting function satisfies each of the properties
which at least one of the two starting functions has. Fischlin and Lehmann (TCC
2008) recently constructed a combiner which simultaneously preserves collision-resistance,
target collision-resistance, message authentication, pseudorandomness and indifferentiability
from a random oracle (IRO). Their combiner produces outputs of 5n bits, where
n denotes the output length of the underlying hash functions. In this paper we
propose improved combiners with shorter outputs. By sacrificing the indifferentiability
from random oracles we obtain a combiner which preserves all of the other aforementioned
properties but with output length 2n only. This matches a lower bound for black-box
combiners for collision-resistance as the only property, showing that the other
properties can be achieved without penalizing the length of the hash values. We
then propose a combiner which also preserves the IRO property, slightly increasing
the output length to 2n + ω(logn). Finally, we show that a twist on our combiners
also makes them robust for one-wayness (but at the price of a fixed input length). '
alternative_title:
- LNCS
author:
- first_name: Marc
full_name: Fischlin, Marc
last_name: Fischlin
- first_name: Anja
full_name: Lehmann, Anja
last_name: Lehmann
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Fischlin M, Lehmann A, Pietrzak KZ. Robust multi property combiners for hash
functions revisited. In: Vol 5126. Springer; 2008:655-666. doi:10.1007/978-3-540-70583-3_53'
apa: 'Fischlin, M., Lehmann, A., & Pietrzak, K. Z. (2008). Robust multi property
combiners for hash functions revisited (Vol. 5126, pp. 655–666). Presented at
the ICALP: Automata, Languages and Programming, Springer. https://doi.org/10.1007/978-3-540-70583-3_53'
chicago: Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi Property
Combiners for Hash Functions Revisited,” 5126:655–66. Springer, 2008. https://doi.org/10.1007/978-3-540-70583-3_53.
ieee: 'M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi property combiners
for hash functions revisited,” presented at the ICALP: Automata, Languages and
Programming, 2008, vol. 5126, no. PART 2, pp. 655–666.'
ista: 'Fischlin M, Lehmann A, Pietrzak KZ. 2008. Robust multi property combiners
for hash functions revisited. ICALP: Automata, Languages and Programming, LNCS,
vol. 5126, 655–666.'
mla: Fischlin, Marc, et al. Robust Multi Property Combiners for Hash Functions
Revisited. Vol. 5126, no. PART 2, Springer, 2008, pp. 655–66, doi:10.1007/978-3-540-70583-3_53.
short: M. Fischlin, A. Lehmann, K.Z. Pietrzak, in:, Springer, 2008, pp. 655–666.
conference:
name: 'ICALP: Automata, Languages and Programming'
date_created: 2018-12-11T12:02:07Z
date_published: 2008-08-06T00:00:00Z
date_updated: 2023-02-23T11:01:10Z
day: '06'
doi: 10.1007/978-3-540-70583-3_53
extern: 1
intvolume: ' 5126'
issue: PART 2
month: '08'
page: 655 - 666
publication_status: published
publisher: Springer
publist_id: '3454'
quality_controlled: 0
related_material:
record:
- id: '2852'
relation: later_version
status: public
status: public
title: Robust multi property combiners for hash functions revisited
type: conference
volume: 5126
year: '2008'
...
---
_id: '3226'
abstract:
- lang: eng
text: 'A family of functions is weakly pseudorandom if a random member of the family
is indistinguishable from a uniform random function when queried on random inputs.
We point out a subtle ambiguity in the definition of weak PRFs: there are natural
weak PRFs whose security breaks down if the randomness used to sample the inputs
is revealed. To capture this ambiguity we distinguish between public-coin and
secret-coin weak PRFs. We show that the existence of a secret-coin weak PRF which
is not also a public-coin weak PRF implies the existence of two pass key-agreement
(i.e. public-key encryption). So in Minicrypt, i.e. under the assumption that
one-way functions exist but public-key cryptography does not, the notion of public-
and secret-coin weak PRFs coincide. Previous to this paper all positive cryptographic
statements known to hold exclusively in Minicrypt concerned the adaptive security
of constructions using non-adaptively secure components. Weak PRFs give rise to
a new set of statements having this property. As another example we consider the
problem of range extension for weak PRFs. We show that in Minicrypt one can beat
the best possible range expansion factor (using a fixed number of distinct keys)
for a very general class of constructions (in particular, this class contains
all constructions that are known today). '
acknowledgement: This work was partially supported by the Zurich Information Security
Center.
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. Weak pseudorandom functions in minicrypt. In: Vol 5126.
Springer; 2008:423-436. doi:10.1007/978-3-540-70583-3_35'
apa: 'Pietrzak, K. Z., & Sjödin, J. (2008). Weak pseudorandom functions in minicrypt
(Vol. 5126, pp. 423–436). Presented at the ICALP: Automata, Languages and Programming,
Springer. https://doi.org/10.1007/978-3-540-70583-3_35'
chicago: Pietrzak, Krzysztof Z, and Johan Sjödin. “Weak Pseudorandom Functions in
Minicrypt,” 5126:423–36. Springer, 2008. https://doi.org/10.1007/978-3-540-70583-3_35.
ieee: 'K. Z. Pietrzak and J. Sjödin, “Weak pseudorandom functions in minicrypt,”
presented at the ICALP: Automata, Languages and Programming, 2008, vol. 5126,
no. PART 2, pp. 423–436.'
ista: 'Pietrzak KZ, Sjödin J. 2008. Weak pseudorandom functions in minicrypt. ICALP:
Automata, Languages and Programming, LNCS, vol. 5126, 423–436.'
mla: Pietrzak, Krzysztof Z., and Johan Sjödin. Weak Pseudorandom Functions in
Minicrypt. Vol. 5126, no. PART 2, Springer, 2008, pp. 423–36, doi:10.1007/978-3-540-70583-3_35.
short: K.Z. Pietrzak, J. Sjödin, in:, Springer, 2008, pp. 423–436.
conference:
name: 'ICALP: Automata, Languages and Programming'
date_created: 2018-12-11T12:02:07Z
date_published: 2008-08-06T00:00:00Z
date_updated: 2021-01-12T07:41:56Z
day: '06'
doi: 10.1007/978-3-540-70583-3_35
extern: 1
intvolume: ' 5126'
issue: PART 2
month: '08'
page: 423 - 436
publication_status: published
publisher: Springer
publist_id: '3455'
quality_controlled: 0
status: public
title: Weak pseudorandom functions in minicrypt
type: conference
volume: 5126
year: '2008'
...
---
_id: '3227'
abstract:
- lang: eng
text: Large amount of data management can cause a lot of troubles which can be solved
by dedicated computer system. To facilitate management of measurement data which
are gathered in Institute of Power Engineering - Insulation Department a special
system called Elektrowiz® was developed. It allows storing measurement results
which concern partial discharges in insulation of turbo- and hydrogenerators in
power stations. Multilayer architecture of the system allows reaching gathered
data independently on user localization. There are possible different access methods
to the system and dependency on current requirements data exploration can be realized
with read-only or edit rights.
author:
- first_name: Piotr
full_name: Zubielik, Piotr
last_name: Zubielik
- first_name: Jerzy
full_name: Nadaczny, Jerzy
last_name: Nadaczny
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Marcin
full_name: Lawenda, Marcin
last_name: Lawenda
citation:
ama: Zubielik P, Nadaczny J, Pietrzak KZ, Lawenda M. Elektrowiz – system of measurement
data management. Przeglad Elektrotechniczny. 2008;84(10):239-242.
apa: Zubielik, P., Nadaczny, J., Pietrzak, K. Z., & Lawenda, M. (2008). Elektrowiz
– system of measurement data management. Przeglad Elektrotechniczny. SIGMA-NOT.
chicago: Zubielik, Piotr, Jerzy Nadaczny, Krzysztof Z Pietrzak, and Marcin Lawenda.
“Elektrowiz – System of Measurement Data Management.” Przeglad Elektrotechniczny.
SIGMA-NOT, 2008.
ieee: P. Zubielik, J. Nadaczny, K. Z. Pietrzak, and M. Lawenda, “Elektrowiz – system
of measurement data management,” Przeglad Elektrotechniczny, vol. 84, no.
10. SIGMA-NOT, pp. 239–242, 2008.
ista: Zubielik P, Nadaczny J, Pietrzak KZ, Lawenda M. 2008. Elektrowiz – system
of measurement data management. Przeglad Elektrotechniczny. 84(10), 239–242.
mla: Zubielik, Piotr, et al. “Elektrowiz – System of Measurement Data Management.”
Przeglad Elektrotechniczny, vol. 84, no. 10, SIGMA-NOT, 2008, pp. 239–42.
short: P. Zubielik, J. Nadaczny, K.Z. Pietrzak, M. Lawenda, Przeglad Elektrotechniczny
84 (2008) 239–242.
date_created: 2018-12-11T12:02:08Z
date_published: 2008-10-01T00:00:00Z
date_updated: 2021-01-12T07:41:56Z
day: '01'
extern: 1
intvolume: ' 84'
issue: '10'
main_file_link:
- open_access: '0'
url: http://pe.org.pl/abstract_pl.php?nid=1917
month: '10'
page: 239 - 242
publication: Przeglad Elektrotechniczny
publication_status: published
publisher: SIGMA-NOT
publist_id: '3452'
quality_controlled: 0
status: public
title: Elektrowiz – system of measurement data management
type: journal_article
volume: 84
year: '2008'
...
---
_id: '3228'
abstract:
- lang: eng
text: |2-
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of the components is collision resistant. In this paper we prove a lower bound on the output length of black-box combiners for CRHFs. The bound we prove is basically tight as it is achieved by a recent construction of Canetti et al [Crypto'07]. The best previously known lower bounds only ruled out a very restricted class of combiners having a very strong security reduction: the reduction was required to output collisions for both underlying candidate hash-functions given a single collision for the combiner (Canetti et al [Crypto'07] building on Boneh and Boyen [Crypto'06] and Pietrzak [Eurocrypt'07]). Our proof uses a lemma similar to the elegant "reconstruction lemma" of Gennaro and Trevisan [FOCS'00], which states that any function which is not one-way is compressible (and thus uniformly random function must be one-way). In a similar vein we show that a function which is not collision resistant is compressible. We also borrow ideas from recent work by Haitner et al. [FOCS'07], who show that one can prove the reconstruction lemma even relative to some very powerful oracles (in our case this will be an exponential time collision-finding oracle). © 2008 Springer-Verlag Berlin Heidelberg.
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. Compression from collisions or why CRHF combiners have a long
output. In: Vol 5157. Springer; 2008:413-432. doi:10.1007/978-3-540-85174-5_23'
apa: 'Pietrzak, K. Z. (2008). Compression from collisions or why CRHF combiners
have a long output (Vol. 5157, pp. 413–432). Presented at the CRYPTO: International
Cryptology Conference, Springer. https://doi.org/10.1007/978-3-540-85174-5_23'
chicago: Pietrzak, Krzysztof Z. “Compression from Collisions or Why CRHF Combiners
Have a Long Output,” 5157:413–32. Springer, 2008. https://doi.org/10.1007/978-3-540-85174-5_23.
ieee: 'K. Z. Pietrzak, “Compression from collisions or why CRHF combiners have a
long output,” presented at the CRYPTO: International Cryptology Conference, 2008,
vol. 5157, pp. 413–432.'
ista: 'Pietrzak KZ. 2008. Compression from collisions or why CRHF combiners have
a long output. CRYPTO: International Cryptology Conference, LNCS, vol. 5157, 413–432.'
mla: Pietrzak, Krzysztof Z. Compression from Collisions or Why CRHF Combiners
Have a Long Output. Vol. 5157, Springer, 2008, pp. 413–32, doi:10.1007/978-3-540-85174-5_23.
short: K.Z. Pietrzak, in:, Springer, 2008, pp. 413–432.
conference:
name: 'CRYPTO: International Cryptology Conference'
date_created: 2018-12-11T12:02:08Z
date_published: 2008-09-11T00:00:00Z
date_updated: 2021-01-12T07:41:57Z
day: '11'
doi: 10.1007/978-3-540-85174-5_23
extern: 1
intvolume: ' 5157'
month: '09'
page: 413 - 432
publication_status: published
publisher: Springer
publist_id: '3453'
quality_controlled: 0
status: public
title: Compression from collisions or why CRHF combiners have a long output
type: conference
volume: 5157
year: '2008'
...
---
_id: '3229'
abstract:
- lang: eng
text: 'We construct a stream-cipher S whose implementation is secure even if a bounded
amount of arbitrary (adversarially chosen) information on the internal state ofS
is leaked during computation. This captures all possible side-channel attacks
on S where the amount of information leaked in a given period is bounded, but
overall can be arbitrary large. The only other assumption we make on the implementation
of S is that only data that is accessed during computation leaks information.
The stream-cipher S generates its output in chunks K1, K2, . . . and arbitrary
but bounded information leakage is modeled by allowing the adversary to adaptively
chose a function fl : {0,1}* rarr {0, 1}lambda before Kl is computed, she then
gets fl(taul) where taul is the internal state ofS that is accessed during the
computation of Kg. One notion of security we prove for S is that Kg is indistinguishable
from random when given K1,..., K1-1,f1(tau1 ),..., fl-1(taul-1) and also the complete
internal state of S after Kg has been computed (i.e. S is forward-secure). The
construction is based on alternating extraction (used in the intrusion-resilient
secret-sharing scheme from FOCS''07). We move this concept to the computational
setting by proving a lemma that states that the output of any PRG has high HILLpseudoentropy
(i.e. is indistinguishable from some distribution with high min-entropy) even
if arbitrary information about the seed is leaked. The amount of leakage lambda
that we can tolerate in each step depends on the strength of the underlying PRG,
it is at least logarithmic, but can be as large as a constant fraction of the
internal state of S if the PRG is exponentially hard.'
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. Leakage resilient cryptography. In: IEEE; 2008:293-302.
doi:10.1109/FOCS.2008.56'
apa: 'Dziembowski, S., & Pietrzak, K. Z. (2008). Leakage resilient cryptography
(pp. 293–302). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FOCS.2008.56'
chicago: Dziembowski, Stefan, and Krzysztof Z Pietrzak. “Leakage Resilient Cryptography,”
293–302. IEEE, 2008. https://doi.org/10.1109/FOCS.2008.56.
ieee: 'S. Dziembowski and K. Z. Pietrzak, “Leakage resilient cryptography,” presented
at the FOCS: Foundations of Computer Science, 2008, pp. 293–302.'
ista: 'Dziembowski S, Pietrzak KZ. 2008. Leakage resilient cryptography. FOCS: Foundations
of Computer Science, 293–302.'
mla: Dziembowski, Stefan, and Krzysztof Z. Pietrzak. Leakage Resilient Cryptography.
IEEE, 2008, pp. 293–302, doi:10.1109/FOCS.2008.56.
short: S. Dziembowski, K.Z. Pietrzak, in:, IEEE, 2008, pp. 293–302.
conference:
name: 'FOCS: Foundations of Computer Science'
date_created: 2018-12-11T12:02:08Z
date_published: 2008-10-28T00:00:00Z
date_updated: 2021-01-12T07:41:57Z
day: '28'
doi: 10.1109/FOCS.2008.56
extern: 1
month: '10'
page: 293 - 302
publication_status: published
publisher: IEEE
publist_id: '3451'
quality_controlled: 0
status: public
title: Leakage resilient cryptography
type: conference
year: '2008'
...
---
_id: '3291'
abstract:
- lang: eng
text: 'The filamentous fungus Aspergillus fumigatus is responsible for a lethal
disease called Invasive Aspergillosis that affects immunocompromised patients.
This disease, like other human fungal diseases, is generally treated by compounds
targeting the primary fungal cell membrane sterol. Recently, glucan synthesis
inhibitors were added to the limited antifungal arsenal and encouraged the search
for novel targets in cell wall biosynthesis. Although galactomannan is a major
component of the A. fumigatus cell wall and extracellular matrix, the biosynthesis
and role of galactomannan are currently unknown. By a targeted gene deletion approach,
we demonstrate that UDP-galactopyranose mutase, a key enzyme of galactofuranose
metabolism, controls the biosynthesis of galactomannan and galactofuranose containing
glycoconjugates. The glfA deletion mutant generated in this study is devoid of
galactofuranose and displays attenuated virulence in a low-dose mouse model of
invasive aspergillosis that likely reflects the impaired growth of the mutant
at mammalian body temperature. Furthermore, the absence of galactofuranose results
in a thinner cell wall that correlates with an increased susceptibility to several
antifungal agents. The UDP-galactopyranose mutase thus appears to be an appealing
adjunct therapeutic target in combination with other drugs against A. fumigatus.
Its absence from mammalian cells indeed offers a considerable advantage to achieve
therapeutic selectivity. '
author:
- first_name: Philipp S
full_name: Philipp Schmalhorst
id: 309D50DA-F248-11E8-B48F-1D18A9856A87
last_name: Schmalhorst
orcid: 0000-0002-5795-0133
- first_name: Sven
full_name: Krappmann, Sven
last_name: Krappmann
- first_name: Wouter
full_name: Vervecken, Wouter
last_name: Vervecken
- first_name: Manfred
full_name: Rohde, Manfred
last_name: Rohde
- first_name: Meike
full_name: Müller, Meike
last_name: Müller
- first_name: Gerhard
full_name: Braus, Gerhard H.
last_name: Braus
- first_name: Roland
full_name: Contreras, Roland
last_name: Contreras
- first_name: Armin
full_name: Braun, Armin
last_name: Braun
- first_name: Hans
full_name: Bakker, Hans
last_name: Bakker
- first_name: Françoise
full_name: Routier, Françoise H
last_name: Routier
citation:
ama: Schmalhorst PS, Krappmann S, Vervecken W, et al. Contribution of galactofuranose
to the virulence of the opportunistic pathogen Aspergillus fumigatus. Eukaryotic
Cell. 2008;7(8):1268-1277. doi:10.1128/EC.00065-08
apa: Schmalhorst, P. S., Krappmann, S., Vervecken, W., Rohde, M., Müller, M., Braus,
G., … Routier, F. (2008). Contribution of galactofuranose to the virulence of
the opportunistic pathogen Aspergillus fumigatus. Eukaryotic Cell. American
Society for Microbiology. https://doi.org/10.1128/EC.00065-08
chicago: Schmalhorst, Philipp S, Sven Krappmann, Wouter Vervecken, Manfred Rohde,
Meike Müller, Gerhard Braus, Roland Contreras, Armin Braun, Hans Bakker, and Françoise
Routier. “Contribution of Galactofuranose to the Virulence of the Opportunistic
Pathogen Aspergillus Fumigatus.” Eukaryotic Cell. American Society for
Microbiology, 2008. https://doi.org/10.1128/EC.00065-08.
ieee: P. S. Schmalhorst et al., “Contribution of galactofuranose to the virulence
of the opportunistic pathogen Aspergillus fumigatus,” Eukaryotic Cell,
vol. 7, no. 8. American Society for Microbiology, pp. 1268–1277, 2008.
ista: Schmalhorst PS, Krappmann S, Vervecken W, Rohde M, Müller M, Braus G, Contreras
R, Braun A, Bakker H, Routier F. 2008. Contribution of galactofuranose to the
virulence of the opportunistic pathogen Aspergillus fumigatus. Eukaryotic Cell.
7(8), 1268–1277.
mla: Schmalhorst, Philipp S., et al. “Contribution of Galactofuranose to the Virulence
of the Opportunistic Pathogen Aspergillus Fumigatus.” Eukaryotic Cell,
vol. 7, no. 8, American Society for Microbiology, 2008, pp. 1268–77, doi:10.1128/EC.00065-08.
short: P.S. Schmalhorst, S. Krappmann, W. Vervecken, M. Rohde, M. Müller, G. Braus,
R. Contreras, A. Braun, H. Bakker, F. Routier, Eukaryotic Cell 7 (2008) 1268–1277.
date_created: 2018-12-11T12:02:29Z
date_published: 2008-06-13T00:00:00Z
date_updated: 2021-01-12T07:42:26Z
day: '13'
doi: 10.1128/EC.00065-08
extern: 1
intvolume: ' 7'
issue: '8'
month: '06'
page: 1268 - 1277
publication: Eukaryotic Cell
publication_status: published
publisher: American Society for Microbiology
publist_id: '3354'
quality_controlled: 0
status: public
title: Contribution of galactofuranose to the virulence of the opportunistic pathogen
Aspergillus fumigatus
type: journal_article
volume: 7
year: '2008'
...
---
_id: '3307'
abstract:
- lang: eng
text: A complete mitochondrial (mt) genome sequence was reconstructed from a 38,000
year-old Neandertal individual with 8341 mtDNA sequences identified among 4.8
Gb of DNA generated from ∼0.3 g of bone. Analysis of the assembled sequence unequivocally
establishes that the Neandertal mtDNA falls outside the variation of extant human
mtDNAs, and allows an estimate of the divergence date between the two mtDNA lineages
of 660,000 ± 140,000 years. Of the 13 proteins encoded in the mtDNA, subunit 2
of cytochrome c oxidase of the mitochondrial electron transport chain has experienced
the largest number of amino acid substitutions in human ancestors since the separation
from Neandertals. There is evidence that purifying selection in the Neandertal
mtDNA was reduced compared with other primate lineages, suggesting that the effective
population size of Neandertals was small.
author:
- first_name: Richard
full_name: Green, Richard E
last_name: Green
- first_name: Anna
full_name: 'Malaspinas, Anna-Sapfo '
last_name: Malaspinas
- first_name: Johannes
full_name: Krause, Johannes
last_name: Krause
- first_name: Adrian
full_name: Briggs, Adrian W
last_name: Briggs
- first_name: Philip
full_name: Johnson, Philip L
last_name: Johnson
- first_name: Caroline
full_name: Caroline Uhler
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Matthias
full_name: Meyer, Matthias
last_name: Meyer
- first_name: Jeffrey
full_name: Good, Jeffrey M
last_name: Good
- first_name: Tomislav
full_name: Maricic, Tomislav
last_name: Maricic
- first_name: Udo
full_name: Stenzel, Udo
last_name: Stenzel
- first_name: Kay
full_name: Prüfer, Kay
last_name: Prüfer
- first_name: Michael
full_name: Siebauer, Michael F
last_name: Siebauer
- first_name: Hernän
full_name: Burbano, Hernän A
last_name: Burbano
- first_name: Michael
full_name: Ronan, Michael T
last_name: Ronan
- first_name: Jonathan
full_name: Rothberg, Jonathan M
last_name: Rothberg
- first_name: Michael
full_name: Egholm, Michael
last_name: Egholm
- first_name: Pavao
full_name: Rudan, Pavao
last_name: Rudan
- first_name: Dejana
full_name: Brajković, Dejana
last_name: Brajković
- first_name: Željko
full_name: Kućan, Željko
last_name: Kućan
- first_name: Ivan
full_name: Gušić, Ivan
last_name: Gušić
- first_name: Mårten
full_name: Wikström, Mårten K
last_name: Wikström
- first_name: Liisa
full_name: Laakkonen, Liisa J
last_name: Laakkonen
- first_name: Janet
full_name: Kelso, Janet F
last_name: Kelso
- first_name: Montgomery
full_name: Slatkin, Montgomery
last_name: Slatkin
- first_name: Svante
full_name: Pääbo, Svante H
last_name: Pääbo
citation:
ama: Green R, Malaspinas A, Krause J, et al. A complete neandertal mitochondrial
genome sequence determined by highhhroughput sequencing. Cell. 2008;134:416-426.
doi:10.1016/j.cell.2008.06.021
apa: Green, R., Malaspinas, A., Krause, J., Briggs, A., Johnson, P., Uhler, C.,
… Pääbo, S. (2008). A complete neandertal mitochondrial genome sequence determined
by highhhroughput sequencing. Cell. Cell Press. https://doi.org/10.1016/j.cell.2008.06.021
chicago: Green, Richard, Anna Malaspinas, Johannes Krause, Adrian Briggs, Philip
Johnson, Caroline Uhler, Matthias Meyer, et al. “A Complete Neandertal Mitochondrial
Genome Sequence Determined by Highhhroughput Sequencing.” Cell. Cell Press,
2008. https://doi.org/10.1016/j.cell.2008.06.021.
ieee: R. Green et al., “A complete neandertal mitochondrial genome sequence
determined by highhhroughput sequencing,” Cell, vol. 134. Cell Press, pp.
416–426, 2008.
ista: Green R, Malaspinas A, Krause J, Briggs A, Johnson P, Uhler C, Meyer M, Good
J, Maricic T, Stenzel U, Prüfer K, Siebauer M, Burbano H, Ronan M, Rothberg J,
Egholm M, Rudan P, Brajković D, Kućan Ž, Gušić I, Wikström M, Laakkonen L, Kelso
J, Slatkin M, Pääbo S. 2008. A complete neandertal mitochondrial genome sequence
determined by highhhroughput sequencing. Cell. 134, 416–426.
mla: Green, Richard, et al. “A Complete Neandertal Mitochondrial Genome Sequence
Determined by Highhhroughput Sequencing.” Cell, vol. 134, Cell Press, 2008,
pp. 416–26, doi:10.1016/j.cell.2008.06.021.
short: R. Green, A. Malaspinas, J. Krause, A. Briggs, P. Johnson, C. Uhler, M. Meyer,
J. Good, T. Maricic, U. Stenzel, K. Prüfer, M. Siebauer, H. Burbano, M. Ronan,
J. Rothberg, M. Egholm, P. Rudan, D. Brajković, Ž. Kućan, I. Gušić, M. Wikström,
L. Laakkonen, J. Kelso, M. Slatkin, S. Pääbo, Cell 134 (2008) 416–426.
date_created: 2018-12-11T12:02:35Z
date_published: 2008-08-01T00:00:00Z
date_updated: 2021-01-12T07:42:32Z
day: '01'
doi: 10.1016/j.cell.2008.06.021
extern: 1
intvolume: ' 134'
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2602844/
month: '08'
oa: 1
page: 416 - 426
publication: Cell
publication_status: published
publisher: Cell Press
publist_id: '3333'
quality_controlled: 0
status: public
title: A complete neandertal mitochondrial genome sequence determined by highhhroughput
sequencing
type: journal_article
volume: 134
year: '2008'
...
---
_id: '11109'
abstract:
- lang: eng
text: The nuclear envelope (NE) provides a selective barrier between the nuclear
interior and the cytoplasm and constitutes a central component of intracellular
architecture. During mitosis in metazoa, the NE breaks down leading to the complete
mixing of the nuclear content with the cytosol. Interestingly, many NE components
actively participate in mitotic progression. After chromosome segregation, the
NE is reassembled around decondensing chromatin and the nuclear compartment is
reestablished in the daughter cells. Here, we summarize recent progress in deciphering
the molecular mechanisms underlying NE dynamics during cell division.
article_processing_charge: No
article_type: original
author:
- first_name: Ulrike
full_name: Kutay, Ulrike
last_name: Kutay
- 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: Kutay U, Hetzer M. Reorganization of the nuclear envelope during open mitosis.
Current Opinion in Cell Biology. 2008;20(6):669-677. doi:10.1016/j.ceb.2008.09.010
apa: Kutay, U., & Hetzer, M. (2008). Reorganization of the nuclear envelope
during open mitosis. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2008.09.010
chicago: Kutay, Ulrike, and Martin Hetzer. “Reorganization of the Nuclear Envelope
during Open Mitosis.” Current Opinion in Cell Biology. Elsevier, 2008.
https://doi.org/10.1016/j.ceb.2008.09.010.
ieee: U. Kutay and M. Hetzer, “Reorganization of the nuclear envelope during open
mitosis,” Current Opinion in Cell Biology, vol. 20, no. 6. Elsevier, pp.
669–677, 2008.
ista: Kutay U, Hetzer M. 2008. Reorganization of the nuclear envelope during open
mitosis. Current Opinion in Cell Biology. 20(6), 669–677.
mla: Kutay, Ulrike, and Martin Hetzer. “Reorganization of the Nuclear Envelope during
Open Mitosis.” Current Opinion in Cell Biology, vol. 20, no. 6, Elsevier,
2008, pp. 669–77, doi:10.1016/j.ceb.2008.09.010.
short: U. Kutay, M. Hetzer, Current Opinion in Cell Biology 20 (2008) 669–677.
date_created: 2022-04-07T07:55:00Z
date_published: 2008-12-01T00:00:00Z
date_updated: 2022-07-18T08:55:32Z
day: '01'
doi: 10.1016/j.ceb.2008.09.010
extern: '1'
external_id:
pmid:
- '18938243'
intvolume: ' 20'
issue: '6'
keyword:
- Cell Biology
language:
- iso: eng
month: '12'
oa_version: None
page: 669-677
pmid: 1
publication: Current Opinion in Cell Biology
publication_identifier:
issn:
- 0955-0674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reorganization of the nuclear envelope during open mitosis
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 20
year: '2008'
...
---
_id: '11110'
abstract:
- lang: eng
text: Nuclear pore complexes are large aqueous channels that penetrate the nuclear
envelope, thereby connecting the nuclear interior with the cytoplasm. Until recently,
these macromolecular complexes were viewed as static structures, the only function
of which was to control the molecular trafficking between the two compartments.
It has now become evident that this simplistic scenario is inaccurate and that
nuclear pore complexes are highly dynamic multiprotein assemblies involved in
diverse cellular processes ranging from the organization of the cytoskeleton to
gene expression. In this review, we discuss the most recent developments in the
nuclear-pore-complex field, focusing on the assembly, disassembly, maintenance
and function of this macromolecular structure.
article_processing_charge: No
article_type: review
author:
- first_name: Maximiliano A.
full_name: D’Angelo, Maximiliano A.
last_name: D’Angelo
- 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: D’Angelo MA, Hetzer M. Structure, dynamics and function of nuclear pore complexes.
Trends in Cell Biology. 2008;18(10):456-466. doi:10.1016/j.tcb.2008.07.009
apa: D’Angelo, M. A., & Hetzer, M. (2008). Structure, dynamics and function
of nuclear pore complexes. Trends in Cell Biology. Elsevier. https://doi.org/10.1016/j.tcb.2008.07.009
chicago: D’Angelo, Maximiliano A., and Martin Hetzer. “Structure, Dynamics and Function
of Nuclear Pore Complexes.” Trends in Cell Biology. Elsevier, 2008. https://doi.org/10.1016/j.tcb.2008.07.009.
ieee: M. A. D’Angelo and M. Hetzer, “Structure, dynamics and function of nuclear
pore complexes,” Trends in Cell Biology, vol. 18, no. 10. Elsevier, pp.
456–466, 2008.
ista: D’Angelo MA, Hetzer M. 2008. Structure, dynamics and function of nuclear pore
complexes. Trends in Cell Biology. 18(10), 456–466.
mla: D’Angelo, Maximiliano A., and Martin Hetzer. “Structure, Dynamics and Function
of Nuclear Pore Complexes.” Trends in Cell Biology, vol. 18, no. 10, Elsevier,
2008, pp. 456–66, doi:10.1016/j.tcb.2008.07.009.
short: M.A. D’Angelo, M. Hetzer, Trends in Cell Biology 18 (2008) 456–466.
date_created: 2022-04-07T07:55:10Z
date_published: 2008-10-01T00:00:00Z
date_updated: 2022-07-18T08:55:33Z
day: '01'
doi: 10.1016/j.tcb.2008.07.009
extern: '1'
external_id:
pmid:
- '18786826'
intvolume: ' 18'
issue: '10'
keyword:
- Cell Biology
language:
- iso: eng
month: '10'
oa_version: None
page: 456-466
pmid: 1
publication: Trends in Cell Biology
publication_identifier:
issn:
- 0962-8924
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structure, dynamics and function of nuclear pore complexes
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 18
year: '2008'
...
---
_id: '11111'
abstract:
- lang: eng
text: During mitosis in metazoans, segregated chromosomes become enclosed by the
nuclear envelope (NE), a double membrane that is continuous with the endoplasmic
reticulum (ER). Recent in vitro data suggest that NE formation occurs by chromatin-mediated
reorganization of the tubular ER; however, the basic principles of such a membrane-reshaping
process remain uncharacterized. Here, we present a quantitative analysis of nuclear
membrane assembly in mammalian cells using time-lapse microscopy. From the initial
recruitment of ER tubules to chromatin, the formation of a membrane-enclosed,
transport-competent nucleus occurs within ∼12 min. Overexpression of the ER tubule-forming
proteins reticulon 3, reticulon 4, and DP1 inhibits NE formation and nuclear expansion,
whereas their knockdown accelerates nuclear assembly. This suggests that the transition
from membrane tubules to sheets is rate-limiting for nuclear assembly. Our results
provide evidence that ER-shaping proteins are directly involved in the reconstruction
of the nuclear compartment and that morphological restructuring of the ER is the
principal mechanism of NE formation in vivo.
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. Reshaping of the endoplasmic reticulum limits the rate
for nuclear envelope formation. Journal of Cell Biology. 2008;182(5):911-924.
doi:10.1083/jcb.200805140
apa: Anderson, D. J., & Hetzer, M. (2008). Reshaping of the endoplasmic reticulum
limits the rate for nuclear envelope formation. Journal of Cell Biology.
Rockefeller University Press. https://doi.org/10.1083/jcb.200805140
chicago: Anderson, Daniel J., and Martin Hetzer. “Reshaping of the Endoplasmic Reticulum
Limits the Rate for Nuclear Envelope Formation.” Journal of Cell Biology.
Rockefeller University Press, 2008. https://doi.org/10.1083/jcb.200805140.
ieee: D. J. Anderson and M. Hetzer, “Reshaping of the endoplasmic reticulum limits
the rate for nuclear envelope formation,” Journal of Cell Biology, vol.
182, no. 5. Rockefeller University Press, pp. 911–924, 2008.
ista: Anderson DJ, Hetzer M. 2008. Reshaping of the endoplasmic reticulum limits
the rate for nuclear envelope formation. Journal of Cell Biology. 182(5), 911–924.
mla: Anderson, Daniel J., and Martin Hetzer. “Reshaping of the Endoplasmic Reticulum
Limits the Rate for Nuclear Envelope Formation.” Journal of Cell Biology,
vol. 182, no. 5, Rockefeller University Press, 2008, pp. 911–24, doi:10.1083/jcb.200805140.
short: D.J. Anderson, M. Hetzer, Journal of Cell Biology 182 (2008) 911–924.
date_created: 2022-04-07T07:55:23Z
date_published: 2008-09-08T00:00:00Z
date_updated: 2022-07-18T08:56:02Z
day: '08'
doi: 10.1083/jcb.200805140
extern: '1'
external_id:
pmid:
- '18779370'
intvolume: ' 182'
issue: '5'
keyword:
- Cell Biology
language:
- iso: eng
month: '09'
oa_version: None
page: 911-924
pmid: 1
publication: Journal of Cell Biology
publication_identifier:
eissn:
- 1540-8140
issn:
- 0021-9525
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reshaping of the endoplasmic reticulum limits the rate for nuclear envelope
formation
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 182
year: '2008'
...
---
_id: '11112'
abstract:
- lang: eng
text: The nuclear envelope is a double-layered membrane that encloses the nuclear
genome and transcriptional machinery. In dividing cells of metazoa, the nucleus
completely disassembles during mitosis, creating the need to re-establish the
nuclear compartment at the end of each cell division. Given the crucial role of
the nuclear envelope in gene regulation and cellular organization, it is not surprising
that its biogenesis and organization have become active research areas. We will
review recent insights into nuclear membrane dynamics during the cell cycle.
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. The life cycle of the metazoan nuclear envelope. Current
Opinion in Cell Biology. 2008;20(4):386-392. doi:10.1016/j.ceb.2008.03.016
apa: Anderson, D. J., & Hetzer, M. (2008). The life cycle of the metazoan nuclear
envelope. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2008.03.016
chicago: Anderson, Daniel J, and Martin Hetzer. “The Life Cycle of the Metazoan
Nuclear Envelope.” Current Opinion in Cell Biology. Elsevier, 2008. https://doi.org/10.1016/j.ceb.2008.03.016.
ieee: D. J. Anderson and M. Hetzer, “The life cycle of the metazoan nuclear envelope,”
Current Opinion in Cell Biology, vol. 20, no. 4. Elsevier, pp. 386–392,
2008.
ista: Anderson DJ, Hetzer M. 2008. The life cycle of the metazoan nuclear envelope.
Current Opinion in Cell Biology. 20(4), 386–392.
mla: Anderson, Daniel J., and Martin Hetzer. “The Life Cycle of the Metazoan Nuclear
Envelope.” Current Opinion in Cell Biology, vol. 20, no. 4, Elsevier, 2008,
pp. 386–92, doi:10.1016/j.ceb.2008.03.016.
short: D.J. Anderson, M. Hetzer, Current Opinion in Cell Biology 20 (2008) 386–392.
date_created: 2022-04-07T07:55:34Z
date_published: 2008-08-01T00:00:00Z
date_updated: 2022-07-18T08:56:07Z
day: '01'
doi: 10.1016/j.ceb.2008.03.016
extern: '1'
external_id:
pmid:
- '18495454'
intvolume: ' 20'
issue: '4'
keyword:
- Cell Biology
language:
- iso: eng
month: '08'
oa_version: None
page: 386-392
pmid: 1
publication: Current Opinion in Cell Biology
publication_identifier:
issn:
- 0955-0674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: The life cycle of the metazoan nuclear envelope
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 20
year: '2008'
...
---
_id: '11113'
abstract:
- lang: eng
text: The nuclear envelope (NE), a double membrane enclosing the nucleus of eukaryotic
cells, controls the flow of information between the nucleoplasm and the cytoplasm
and provides a scaffold for the organization of chromatin and the cytoskeleton.
In dividing metazoan cells, the NE breaks down at the onset of mitosis and then
reforms around segregated chromosomes to generate the daughter nuclei. Recent
data from intact cells and cell-free nuclear assembly systems suggest that the
endoplasmic reticulum (ER) is the source of membrane for NE assembly. At the end
of mitosis, ER membrane tubules are targeted to chromatin via tubule ends and
reorganized into flat nuclear membrane sheets by specific DNA-binding membrane
proteins. In contrast to previous models, which proposed vesicle fusion to be
the principal mechanism of NE formation, these new studies suggest that the nuclear
membrane forms by the chromatin-mediated reshaping of the ER.
article_processing_charge: No
article_type: letter_note
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. Shaping the endoplasmic reticulum into the nuclear envelope.
Journal of Cell Science. 2008;121(2):137-142. doi:10.1242/jcs.005777
apa: Anderson, D. J., & Hetzer, M. (2008). Shaping the endoplasmic reticulum
into the nuclear envelope. Journal of Cell Science. The Company of Biologists.
https://doi.org/10.1242/jcs.005777
chicago: Anderson, Daniel J., and Martin Hetzer. “Shaping the Endoplasmic Reticulum
into the Nuclear Envelope.” Journal of Cell Science. The Company of Biologists,
2008. https://doi.org/10.1242/jcs.005777.
ieee: D. J. Anderson and M. Hetzer, “Shaping the endoplasmic reticulum into the
nuclear envelope,” Journal of Cell Science, vol. 121, no. 2. The Company
of Biologists, pp. 137–142, 2008.
ista: Anderson DJ, Hetzer M. 2008. Shaping the endoplasmic reticulum into the nuclear
envelope. Journal of Cell Science. 121(2), 137–142.
mla: Anderson, Daniel J., and Martin Hetzer. “Shaping the Endoplasmic Reticulum
into the Nuclear Envelope.” Journal of Cell Science, vol. 121, no. 2, The
Company of Biologists, 2008, pp. 137–42, doi:10.1242/jcs.005777.
short: D.J. Anderson, M. Hetzer, Journal of Cell Science 121 (2008) 137–142.
date_created: 2022-04-07T07:55:46Z
date_published: 2008-01-15T00:00:00Z
date_updated: 2022-07-18T08:56:10Z
day: '15'
doi: 10.1242/jcs.005777
extern: '1'
external_id:
pmid:
- '18187447'
intvolume: ' 121'
issue: '2'
keyword:
- Cell Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1242/jcs.005777
month: '01'
oa: 1
oa_version: Published Version
page: 137-142
pmid: 1
publication: Journal of Cell Science
publication_identifier:
eissn:
- 1477-9137
issn:
- 0021-9533
publication_status: published
publisher: The Company of Biologists
quality_controlled: '1'
scopus_import: '1'
status: public
title: Shaping the endoplasmic reticulum into the nuclear envelope
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 121
year: '2008'
...
---
_id: '11114'
abstract:
- lang: eng
text: We present a miniaturized pull-down method for the detection of protein-protein
interactions using standard affinity chromatography reagents. Binding events between
different proteins, which are color-coded with quantum dots (QDs), are visualized
on single affinity chromatography beads by fluorescence microscopy. The use of
QDs for single molecule detection allows the simultaneous analysis of multiple
protein-protein binding events and reduces the amount of time and material needed
to perform a pull-down experiment.
article_number: e2061
article_processing_charge: No
article_type: original
author:
- first_name: Roberta
full_name: Schulte, Roberta
last_name: Schulte
- first_name: Jessica
full_name: Talamas, Jessica
last_name: Talamas
- first_name: Christine
full_name: Doucet, Christine
last_name: Doucet
- 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: Schulte R, Talamas J, Doucet C, Hetzer M. Single bead affinity detection (SINBAD)
for the analysis of protein-protein interactions. PLoS ONE. 2008;3(4).
doi:10.1371/journal.pone.0002061
apa: Schulte, R., Talamas, J., Doucet, C., & Hetzer, M. (2008). Single bead
affinity detection (SINBAD) for the analysis of protein-protein interactions.
PLoS ONE. Public Library of Science. https://doi.org/10.1371/journal.pone.0002061
chicago: Schulte, Roberta, Jessica Talamas, Christine Doucet, and Martin Hetzer.
“Single Bead Affinity Detection (SINBAD) for the Analysis of Protein-Protein Interactions.”
PLoS ONE. Public Library of Science, 2008. https://doi.org/10.1371/journal.pone.0002061.
ieee: R. Schulte, J. Talamas, C. Doucet, and M. Hetzer, “Single bead affinity detection
(SINBAD) for the analysis of protein-protein interactions,” PLoS ONE, vol.
3, no. 4. Public Library of Science, 2008.
ista: Schulte R, Talamas J, Doucet C, Hetzer M. 2008. Single bead affinity detection
(SINBAD) for the analysis of protein-protein interactions. PLoS ONE. 3(4), e2061.
mla: Schulte, Roberta, et al. “Single Bead Affinity Detection (SINBAD) for the Analysis
of Protein-Protein Interactions.” PLoS ONE, vol. 3, no. 4, e2061, Public
Library of Science, 2008, doi:10.1371/journal.pone.0002061.
short: R. Schulte, J. Talamas, C. Doucet, M. Hetzer, PLoS ONE 3 (2008).
date_created: 2022-04-07T07:55:57Z
date_published: 2008-04-30T00:00:00Z
date_updated: 2022-07-18T08:56:36Z
day: '30'
doi: 10.1371/journal.pone.0002061
extern: '1'
external_id:
pmid:
- '18446240'
intvolume: ' 3'
issue: '4'
keyword:
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.1371/journal.pone.0002061'
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLoS ONE
publication_identifier:
issn:
- 1932-6203
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Single bead affinity detection (SINBAD) for the analysis of protein-protein
interactions
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 3
year: '2008'
...