---
OA_type: closed access
_id: '3614'
abstract:
- lang: eng
text: 'We analyze the changes in the mean and variance components of a quantitative
trait caused by changes in allele frequencies, concentrating on the effects of
genetic drift. We use a general representation of epistasis and dominance that
allows an arbitrary relation between genotype and phenotype for any number of
diallelic loci. We assume initial and final Hardy-Weinberg and linkage equilibrium
in our analyses of drift-induced changes. Random drift generates transient linkage
disequilibria that cause correlations between allele frequency fluctuations at
different loci. However, we show that these have negligible effects, at least
for interactions among small numbers of loci. Our analyses are based on diffusion
approximations that summarize the effects of drift in terms of F, the inbreeding
coefficient, interpreted as the expected proportional decrease in heterozygosity
at each locus. For haploids, the variance of the trait mean after a population
bottleneck is var(Δz̄) =inline imagewhere n is the number of loci contributing
to the trait variance, VA(1)=VA is the additive genetic variance, and VA(k) is
the kth-order additive epistatic variance. The expected additive genetic variance
after the bottleneck, denoted (V*A), is closely related to var(Δz̄);
(V*A) (1 –F)inline imageThus, epistasis inflates the expected additive variance
above VA(1 –F), the expectation under additivity. For haploids (and diploids without
dominance), the expected value of every variance component is inflated by the
existence of higher order interactions (e.g., third-order epistasis inflates (V*AA)).
This is not true in general with diploidy, because dominance alone can reduce
(V*A) below VA(1 –F) (e.g., when dominant alleles are rare). Without dominance,
diploidy produces simple expressions: var(Δz̄)=inline image=1 (2F)
kVA(k) and (V*A) = (1 –F)inline imagek(2F)k-1VA(k) With dominance (and even without
epistasis), var(Δz̄)and (V*A) no longer depend solely on the variance
components in the base population. For small F, the expected additive variance
simplifies to (V*A)(1 –F) VA+ 4FVAA+2FVD+2FCAD, where CAD is a sum of two terms
describing covariances between additive effects and dominance and additive × dominance
interactions. Whether population bottlenecks lead to expected increases in additive
variance depends primarily on the ratio of nonadditive to additive genetic variance
in the base population, but dominance precludes simple predictions based solely
on variance components. We illustrate these results using a model in which genotypic
values are drawn at random, allowing extreme and erratic epistatic interactions.
Although our analyses clarify the conditions under which drift is expected to
increase VA, we question the evolutionary importance of such increases.'
article_processing_charge: No
article_type: original
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Michael
full_name: Turelli, Michael
last_name: Turelli
citation:
ama: Barton NH, Turelli M. Effects of allele frequency changes on variance components
under a general model of epistasis. Evolution; International Journal of Organic
Evolution. 2004;58(10):2111-2132. doi:10.1111/j.0014-3820.2004.tb01591.x
apa: Barton, N. H., & Turelli, M. (2004). Effects of allele frequency changes
on variance components under a general model of epistasis. Evolution; International
Journal of Organic Evolution. Wiley-Blackwell. https://doi.org/10.1111/j.0014-3820.2004.tb01591.x
chicago: Barton, Nicholas H, and Michael Turelli. “Effects of Allele Frequency Changes
on Variance Components under a General Model of Epistasis.” Evolution; International
Journal of Organic Evolution. Wiley-Blackwell, 2004. https://doi.org/10.1111/j.0014-3820.2004.tb01591.x.
ieee: N. H. Barton and M. Turelli, “Effects of allele frequency changes on variance
components under a general model of epistasis,” Evolution; International Journal
of Organic Evolution, vol. 58, no. 10. Wiley-Blackwell, pp. 2111–2132, 2004.
ista: Barton NH, Turelli M. 2004. Effects of allele frequency changes on variance
components under a general model of epistasis. Evolution; International Journal
of Organic Evolution. 58(10), 2111–2132.
mla: Barton, Nicholas H., and Michael Turelli. “Effects of Allele Frequency Changes
on Variance Components under a General Model of Epistasis.” Evolution; International
Journal of Organic Evolution, vol. 58, no. 10, Wiley-Blackwell, 2004, pp.
2111–32, doi:10.1111/j.0014-3820.2004.tb01591.x.
short: N.H. Barton, M. Turelli, Evolution; International Journal of Organic Evolution
58 (2004) 2111–2132.
date_created: 2018-12-11T12:04:15Z
date_published: 2004-10-01T00:00:00Z
date_updated: 2026-09-11T11:20:44Z
day: '01'
doi: 10.1111/j.0014-3820.2004.tb01591.x
extern: '1'
external_id:
pmid:
- '15562679'
fulldoi: https://doi.org/10.1111/j.0014-3820.2004.tb01591.x
intvolume: ' 58'
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
page: 2111 - 2132
pmid: 1
publication: Evolution; International Journal of Organic Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2769'
status: public
title: Effects of allele frequency changes on variance components under a general
model of epistasis
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 58
year: '2004'
...
---
OA_type: closed access
_id: '3615'
abstract:
- lang: eng
text: 'We investigate three alternative selection-based scenarios proposed to maintain
polygenic variation: pleiotropic balancing selection, G x E interactions (with
spatial or temporal variation in allelic effects), and sex-dependent allelic effects.
Each analysis assumes an additive polygenic trait with n diallelic loci under
stabilizing selection. We allow loci to have different effects and consider equilibria
at which the population mean departs from the stabilizing-selection optimum. Under
weak selection, each model produces essentially identical, approximate allele-frequency
dynamics. Variation is maintained under pleiotropic balancing selection only at
loci for which the strength of balancing selection exceeds the effective strength
of stabilizing selection. In addition, for all models, polymorphism requires that
the population mean be close enough to the optimum that directional selection
does not overwhelm balancing selection. This balance allows many simultaneously
stable equilibria, and we explore their properties numerically. Both spatial and
temporal G x E can maintain variation at loci for which the coefficient of variation
(across environments) of the effect of a substitution exceeds a critical value
greater than one. The critical value depends on the correlation between substitution
effects at different loci. For large positive correlations (e.g., ρ2ij > 3/4),
even extreme fluctuations in allelic effects cannot maintain variation. Surprisingly,
this constraint on correlations implies that sex-dependent allelic effects cannot
maintain polygenic variation. We present numerical results that support our analytical
approximations and discuss our results in connection to relevant data and alternative
variance-maintaining mechanisms.'
article_processing_charge: No
article_type: original
author:
- first_name: Michael
full_name: Turelli, Michael
last_name: Turelli
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Turelli M, Barton NH. Polygenic variation maintained by balancing selection:
pleiotropy, sex-dependent allelic effects and GxE interactions. Genetics.
2004;166(2):1053-1079. doi:10.1534/genetics.166.2.1053'
apa: 'Turelli, M., & Barton, N. H. (2004). Polygenic variation maintained by
balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions.
Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.166.2.1053'
chicago: 'Turelli, Michael, and Nicholas H Barton. “Polygenic Variation Maintained
by Balancing Selection: Pleiotropy, Sex-Dependent Allelic Effects and GxE Interactions.”
Genetics. Genetics Society of America, 2004. https://doi.org/10.1534/genetics.166.2.1053.'
ieee: 'M. Turelli and N. H. Barton, “Polygenic variation maintained by balancing
selection: pleiotropy, sex-dependent allelic effects and GxE interactions,” Genetics,
vol. 166, no. 2. Genetics Society of America, pp. 1053–1079, 2004.'
ista: 'Turelli M, Barton NH. 2004. Polygenic variation maintained by balancing selection:
pleiotropy, sex-dependent allelic effects and GxE interactions. Genetics. 166(2),
1053–1079.'
mla: 'Turelli, Michael, and Nicholas H. Barton. “Polygenic Variation Maintained
by Balancing Selection: Pleiotropy, Sex-Dependent Allelic Effects and GxE Interactions.”
Genetics, vol. 166, no. 2, Genetics Society of America, 2004, pp. 1053–79,
doi:10.1534/genetics.166.2.1053.'
short: M. Turelli, N.H. Barton, Genetics 166 (2004) 1053–1079.
date_created: 2018-12-11T12:04:15Z
date_published: 2004-02-01T00:00:00Z
date_updated: 2026-09-11T11:13:08Z
day: '01'
doi: 10.1534/genetics.166.2.1053
extern: '1'
external_id:
pmid:
- '15020487'
fulldoi: https://doi.org/10.1534/genetics.166.2.1053
intvolume: ' 166'
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 1053 - 1079
pmid: 1
publication: Genetics
publication_identifier:
eissn:
- 1943-2631
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
publist_id: '2768'
status: public
title: 'Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent
allelic effects and GxE interactions'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 166
year: '2004'
...
---
OA_type: closed access
_id: '3617'
abstract:
- lang: eng
text: 'The coalescent process can describe the effects of selection at linked loci
only if selection is so strong that genotype frequencies evolve deterministically.
Here, we develop methods proposed by Kaplan, Darden, and Hudson to find the effects
of weak selection. We show that the overall effect is given by an extension to
Price''s equation: the change in properties such as moments of coalescence times
is equal to the covariance between those properties and the fitness of the sample
of genes. The distribution of coalescence times differs substantially between
allelic classes, even in the absence of selection. However, the average coalescence
time between randomly chosen genes is insensitive to the current allele frequency
and is affected significantly by purifying selection only if deleterious mutations
are common and selection is strong (i.e., the product of population size and selection
coefficient, Ns > 3). Balancing selection increases mean coalescence times,
but the effect becomes large only when mutation rates between allelic classes
are low and when selection is extremely strong. Our analysis supports previous
simulations that show that selection has surprisingly little effect on genealogies.
Moreover, small fluctuations in allele frequency due to random drift can greatly
reduce any such effects. This will make it difficult to detect the action of selection
from neutral variation alone.'
article_processing_charge: No
article_type: original
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Alison
full_name: Etheridge, Alison
last_name: Etheridge
citation:
ama: Barton NH, Etheridge A. The effect of selection on genealogies. Genetics.
2004;166(2):1115-1131. doi:10.1534/genetics.166.2.1115
apa: Barton, N. H., & Etheridge, A. (2004). The effect of selection on genealogies.
Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.166.2.1115
chicago: Barton, Nicholas H, and Alison Etheridge. “The Effect of Selection on Genealogies.”
Genetics. Genetics Society of America, 2004. https://doi.org/10.1534/genetics.166.2.1115.
ieee: N. H. Barton and A. Etheridge, “The effect of selection on genealogies,” Genetics,
vol. 166, no. 2. Genetics Society of America, pp. 1115–1131, 2004.
ista: Barton NH, Etheridge A. 2004. The effect of selection on genealogies. Genetics.
166(2), 1115–1131.
mla: Barton, Nicholas H., and Alison Etheridge. “The Effect of Selection on Genealogies.”
Genetics, vol. 166, no. 2, Genetics Society of America, 2004, pp. 1115–31,
doi:10.1534/genetics.166.2.1115.
short: N.H. Barton, A. Etheridge, Genetics 166 (2004) 1115–1131.
date_created: 2018-12-11T12:04:16Z
date_published: 2004-02-01T00:00:00Z
date_updated: 2026-09-11T10:54:39Z
day: '01'
doi: 10.1534/genetics.166.2.1115
extern: '1'
external_id:
pmid:
- '15020491'
fulldoi: https://doi.org/10.1534/genetics.166.2.1115
intvolume: ' 166'
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 1115 - 1131
pmid: 1
publication: Genetics
publication_identifier:
eissn:
- 1943-2631
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
publist_id: '2766'
status: public
title: The effect of selection on genealogies
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 166
year: '2004'
...
---
OA_type: closed access
_id: '3805'
abstract:
- lang: eng
text: The operation of neuronal networks crucially depends on a fast time course
of signaling in inhibitory interneurons. Synapses that excite interneurons generate
fast currents, owing to the expression of glutamate receptors of specific subunit
composition. Interneurons generate brief action potentials in response to transient
synaptic activation and discharge repetitively at very high frequencies during
sustained stimulation. The ability to generate short-duration action potentials
at high frequencies depends on the expression of specific voltage-gated K+ channels.
Factors facilitating fast action potential initiation following synaptic excitation
include depolarized interneuron resting potential, subthreshold conductances and
active dendrites. Finally, GABA release at interneuron output synapses is rapid
and highly synchronized, leading to a faster inhibition in postsynaptic interneurons
than in principal cells. Thus, the expression of distinct transmitter receptors
and voltage-gated ion channels ensures that interneurons operate with high speed
and temporal precision.
article_processing_charge: No
article_type: original
author:
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Josef
full_name: Bischofberger, Josef
last_name: Bischofberger
- first_name: Desdemona
full_name: Fricker, Desdemona
last_name: Fricker
- first_name: Richard
full_name: Miles, Richard
last_name: Miles
citation:
ama: 'Jonas PM, Bischofberger J, Fricker D, Miles R. Interneuron Diversity series:
Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons.
Trends in Neurosciences. 2004;27(1):30-40. doi:doi:10.1016/j.tins.2003.10.010'
apa: 'Jonas, P. M., Bischofberger, J., Fricker, D., & Miles, R. (2004). Interneuron
Diversity series: Fast in, fast out--temporal and spatial signal processing in
hippocampal interneurons. Trends in Neurosciences. Elsevier. https://doi.org/doi:10.1016/j.tins.2003.10.010'
chicago: 'Jonas, Peter M, Josef Bischofberger, Desdemona Fricker, and Richard Miles.
“Interneuron Diversity Series: Fast in, Fast out--Temporal and Spatial Signal
Processing in Hippocampal Interneurons.” Trends in Neurosciences. Elsevier,
2004. https://doi.org/doi:10.1016/j.tins.2003.10.010.'
ieee: 'P. M. Jonas, J. Bischofberger, D. Fricker, and R. Miles, “Interneuron Diversity
series: Fast in, fast out--temporal and spatial signal processing in hippocampal
interneurons,” Trends in Neurosciences, vol. 27, no. 1. Elsevier, pp. 30–40,
2004.'
ista: 'Jonas PM, Bischofberger J, Fricker D, Miles R. 2004. Interneuron Diversity
series: Fast in, fast out--temporal and spatial signal processing in hippocampal
interneurons. Trends in Neurosciences. 27(1), 30–40.'
mla: 'Jonas, Peter M., et al. “Interneuron Diversity Series: Fast in, Fast out--Temporal
and Spatial Signal Processing in Hippocampal Interneurons.” Trends in Neurosciences,
vol. 27, no. 1, Elsevier, 2004, pp. 30–40, doi:doi:10.1016/j.tins.2003.10.010.'
short: P.M. Jonas, J. Bischofberger, D. Fricker, R. Miles, Trends in Neurosciences
27 (2004) 30–40.
date_created: 2018-12-11T12:05:16Z
date_published: 2004-01-01T00:00:00Z
date_updated: 2026-09-11T10:25:02Z
day: '01'
doi: doi:10.1016/j.tins.2003.10.010
extern: '1'
external_id:
pmid:
- '14698608'
fulldoi: https://doi.org/doi:10.1016/j.tins.2003.10.010
intvolume: ' 27'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 30 - 40
pmid: 1
publication: Trends in Neurosciences
publication_identifier:
eissn:
- 1878-108X
issn:
- 0166-2236
publication_status: published
publisher: Elsevier
publist_id: '2404'
status: public
title: 'Interneuron Diversity series: Fast in, fast out--temporal and spatial signal
processing in hippocampal interneurons'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 27
year: '2004'
...
---
OA_type: closed access
_id: '3688'
abstract:
- lang: eng
text: Capturing images of documents using handheld digital cameras has a variety
of applications in academia, research, knowledge management, retail, and office
settings. The ultimate goal of such systems is to achieve image quality comparable
to that currently achieved with flatbed scanners even for curved, warped, or curled
pages. This can be achieved by high-accuracy 3D modeling of the page surface,
followed by a "flattening" of the surface. A number of previous systems
have either assumed only perspective distortions, or used techniques like structured
lighting, shading, or side-imaging for obtaining 3D shape. This paper describes
a system for handheld camera-based document capture using general purpose stereo
vision methods followed by a new document dewarping technique. Examples of shape
modeling and dewarping of book images is shown.
article_processing_charge: No
author:
- first_name: Adrian
full_name: Ulges, Adrian
last_name: Ulges
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Thomas
full_name: Breuel, Thomas
last_name: Breuel
citation:
ama: 'Ulges A, Lampert C, Breuel T. Document capture using stereo vision. In: Proceedings
of the 2004 ACM Symposium on Document Engineering. ACM; 2004:198-200. doi:10.1145/1030397.1030434'
apa: 'Ulges, A., Lampert, C., & Breuel, T. (2004). Document capture using stereo
vision. In Proceedings of the 2004 ACM symposium on Document engineering
(pp. 198–200). Milwaukee, WI, United States: ACM. https://doi.org/10.1145/1030397.1030434'
chicago: Ulges, Adrian, Christoph Lampert, and Thomas Breuel. “Document Capture
Using Stereo Vision.” In Proceedings of the 2004 ACM Symposium on Document
Engineering, 198–200. ACM, 2004. https://doi.org/10.1145/1030397.1030434.
ieee: A. Ulges, C. Lampert, and T. Breuel, “Document capture using stereo vision,”
in Proceedings of the 2004 ACM symposium on Document engineering, Milwaukee,
WI, United States, 2004, pp. 198–200.
ista: 'Ulges A, Lampert C, Breuel T. 2004. Document capture using stereo vision.
Proceedings of the 2004 ACM symposium on Document engineering. DocEng: ACM Symposium
on Document Engineering, 198–200.'
mla: Ulges, Adrian, et al. “Document Capture Using Stereo Vision.” Proceedings
of the 2004 ACM Symposium on Document Engineering, ACM, 2004, pp. 198–200,
doi:10.1145/1030397.1030434.
short: A. Ulges, C. Lampert, T. Breuel, in:, Proceedings of the 2004 ACM Symposium
on Document Engineering, ACM, 2004, pp. 198–200.
conference:
end_date: 2004-10-30
location: Milwaukee, WI, United States
name: 'DocEng: ACM Symposium on Document Engineering'
start_date: 2004-10-28
date_created: 2018-12-11T12:04:38Z
date_published: 2004-01-01T00:00:00Z
date_updated: 2026-09-11T10:45:46Z
day: '01'
doi: 10.1145/1030397.1030434
extern: '1'
fulldoi: https://doi.org/10.1145/1030397.1030434
language:
- iso: eng
main_file_link:
- url: http://pub.ist.ac.at/~chl/papers/ulges-doceng2004.pdf
month: '01'
oa_version: None
page: 198 - 200
publication: Proceedings of the 2004 ACM symposium on Document engineering
publication_identifier:
isbn:
- '9781581139389'
publication_status: published
publisher: ACM
publist_id: '2679'
status: public
title: Document capture using stereo vision
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2004'
...
---
OA_type: closed access
_id: '3575'
abstract:
- lang: eng
text: The Jacobi set of two Morse functions defined on a common - manifold is the
set of critical points of the restrictions of one func- tion to the level sets
of the other function. Equivalently, it is the set of points where the gradients
of the functions are parallel. For a generic pair of Morse functions, the Jacobi
set is a smoothly embed- ded 1-manifold. We give a polynomial-time algorithm that
com- putes the piecewise linear analog of the Jacobi set for functions specified
at the vertices of a triangulation, and we generalize all results to more than
two but at most Morse functions.
alternative_title:
- London Mathematical Society Lecture Note
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: John
full_name: Harer, John
last_name: Harer
citation:
ama: 'Edelsbrunner H, Harer J. Jacobi sets of multiple Morse functions. In: Foundations
of Computational Mathematics. Vol 312. Springer; 2004:37-57. doi:10.1017/CBO9781139106962.003'
apa: Edelsbrunner, H., & Harer, J. (2004). Jacobi sets of multiple Morse functions.
In Foundations of Computational Mathematics (Vol. 312, pp. 37–57). Springer.
https://doi.org/10.1017/CBO9781139106962.003
chicago: Edelsbrunner, Herbert, and John Harer. “Jacobi Sets of Multiple Morse Functions.”
In Foundations of Computational Mathematics, 312:37–57. Springer, 2004.
https://doi.org/10.1017/CBO9781139106962.003.
ieee: H. Edelsbrunner and J. Harer, “Jacobi sets of multiple Morse functions,” in
Foundations of Computational Mathematics, vol. 312, Springer, 2004, pp.
37–57.
ista: 'Edelsbrunner H, Harer J. 2004.Jacobi sets of multiple Morse functions. In:
Foundations of Computational Mathematics. London Mathematical Society Lecture
Note, vol. 312, 37–57.'
mla: Edelsbrunner, Herbert, and John Harer. “Jacobi Sets of Multiple Morse Functions.”
Foundations of Computational Mathematics, vol. 312, Springer, 2004, pp.
37–57, doi:10.1017/CBO9781139106962.003.
short: H. Edelsbrunner, J. Harer, in:, Foundations of Computational Mathematics,
Springer, 2004, pp. 37–57.
date_created: 2018-12-11T12:04:02Z
date_published: 2004-01-01T00:00:00Z
date_updated: 2026-09-11T11:58:23Z
day: '01'
doi: 10.1017/CBO9781139106962.003
extern: '1'
fulldoi: https://doi.org/10.1017/CBO9781139106962.003
intvolume: ' 312'
language:
- iso: eng
month: '01'
oa_version: None
page: 37 - 57
publication: Foundations of Computational Mathematics
publication_status: published
publisher: Springer
publist_id: '2810'
status: public
title: Jacobi sets of multiple Morse functions
type: book_chapter
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 312
year: '2004'
...
---
OA_type: closed access
_id: '3587'
alternative_title:
- Molecular Aspects of Fish and Marine Biology
article_processing_charge: No
author:
- first_name: Florian
full_name: Ulrich, Florian
last_name: Ulrich
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: 'Ulrich F, Heisenberg C-PJ. Gastrulation in zebrafish. In: Korzh V, Gong Z,
eds. Fish Development and Genetics : The Zebrafish and Medaka Models. Vol
2. World Scientific Publishing; 2004:39-86.'
apa: 'Ulrich, F., & Heisenberg, C.-P. J. (2004). Gastrulation in zebrafish.
In V. Korzh & Z. Gong (Eds.), Fish development and genetics : the zebrafish
and medaka models (Vol. 2, pp. 39–86). World Scientific Publishing.'
chicago: 'Ulrich, Florian, and Carl-Philipp J Heisenberg. “Gastrulation in Zebrafish.”
In Fish Development and Genetics : The Zebrafish and Medaka Models, edited
by Vladimir Korzh and Zhiyuan Gong, 2:39–86. World Scientific Publishing, 2004.'
ieee: 'F. Ulrich and C.-P. J. Heisenberg, “Gastrulation in zebrafish,” in Fish
development and genetics : the zebrafish and medaka models, vol. 2, V. Korzh
and Z. Gong, Eds. World Scientific Publishing, 2004, pp. 39–86.'
ista: 'Ulrich F, Heisenberg C-PJ. 2004.Gastrulation in zebrafish. In: Fish development
and genetics : the zebrafish and medaka models. Molecular Aspects of Fish and
Marine Biology, vol. 2, 39–86.'
mla: 'Ulrich, Florian, and Carl-Philipp J. Heisenberg. “Gastrulation in Zebrafish.”
Fish Development and Genetics : The Zebrafish and Medaka Models, edited
by Vladimir Korzh and Zhiyuan Gong, vol. 2, World Scientific Publishing, 2004,
pp. 39–86.'
short: 'F. Ulrich, C.-P.J. Heisenberg, in:, V. Korzh, Z. Gong (Eds.), Fish Development
and Genetics : The Zebrafish and Medaka Models, World Scientific Publishing, 2004,
pp. 39–86.'
date_created: 2018-12-11T12:04:06Z
date_published: 2004-11-01T00:00:00Z
date_updated: 2026-09-11T11:54:02Z
day: '01'
editor:
- first_name: Vladimir
full_name: Korzh, Vladimir
last_name: Korzh
- first_name: Zhiyuan
full_name: Gong, Zhiyuan
last_name: Gong
extern: '1'
intvolume: ' 2'
language:
- iso: eng
month: '11'
oa_version: None
page: 39 - 86
publication: 'Fish development and genetics : the zebrafish and medaka models'
publication_identifier:
isbn:
- '9812388214'
publication_status: published
publisher: World Scientific Publishing
publist_id: '2796'
status: public
title: Gastrulation in zebrafish
type: book_chapter
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2
year: '2004'
...
---
OA_type: closed access
_id: '3595'
article_processing_charge: No
author:
- first_name: Brian
full_name: Charlesworth, Brian
last_name: Charlesworth
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Charlesworth B, Barton NH. Genome size: Does bigger mean worse? Current
Biology. 2004;14(6):R233-R235. doi:10.1016/j.cub.2004.02.054'
apa: 'Charlesworth, B., & Barton, N. H. (2004). Genome size: Does bigger mean
worse? Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2004.02.054'
chicago: 'Charlesworth, Brian, and Nicholas H Barton. “Genome Size: Does Bigger
Mean Worse?” Current Biology. Cell Press, 2004. https://doi.org/10.1016/j.cub.2004.02.054.'
ieee: 'B. Charlesworth and N. H. Barton, “Genome size: Does bigger mean worse?,”
Current Biology, vol. 14, no. 6. Cell Press, pp. R233–R235, 2004.'
ista: 'Charlesworth B, Barton NH. 2004. Genome size: Does bigger mean worse? Current
Biology. 14(6), R233–R235.'
mla: 'Charlesworth, Brian, and Nicholas H. Barton. “Genome Size: Does Bigger Mean
Worse?” Current Biology, vol. 14, no. 6, Cell Press, 2004, pp. R233–35,
doi:10.1016/j.cub.2004.02.054.'
short: B. Charlesworth, N.H. Barton, Current Biology 14 (2004) R233–R235.
date_created: 2018-12-11T12:04:09Z
date_published: 2004-03-01T00:00:00Z
date_updated: 2026-09-11T11:22:22Z
day: '01'
doi: 10.1016/j.cub.2004.02.054
extern: '1'
external_id:
pmid:
- '15043833'
fulldoi: https://doi.org/10.1016/j.cub.2004.02.054
intvolume: ' 14'
issue: '6'
language:
- iso: eng
month: '03'
oa_version: None
page: R233 - R235
pmid: 1
publication: Current Biology
publication_identifier:
eissn:
- 1879-0445
issn:
- 0960-9822
publication_status: published
publisher: Cell Press
publist_id: '2788'
status: public
title: 'Genome size: Does bigger mean worse?'
type: review
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14
year: '2004'
...
---
_id: '3616'
article_processing_charge: No
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Barton NH. Speciation: Why, how, where and when? Current Biology. 2004;14(15):R603-R604.
doi:10.1016/j.cub.2004.07.037'
apa: 'Barton, N. H. (2004). Speciation: Why, how, where and when? Current Biology.
Cell Press. https://doi.org/10.1016/j.cub.2004.07.037'
chicago: 'Barton, Nicholas H. “Speciation: Why, How, Where and When?” Current
Biology. Cell Press, 2004. https://doi.org/10.1016/j.cub.2004.07.037.'
ieee: 'N. H. Barton, “Speciation: Why, how, where and when?,” Current Biology,
vol. 14, no. 15. Cell Press, pp. R603–R604, 2004.'
ista: 'Barton NH. 2004. Speciation: Why, how, where and when? Current Biology. 14(15),
R603–R604.'
mla: 'Barton, Nicholas H. “Speciation: Why, How, Where and When?” Current Biology,
vol. 14, no. 15, Cell Press, 2004, pp. R603–04, doi:10.1016/j.cub.2004.07.037.'
short: N.H. Barton, Current Biology 14 (2004) R603–R604.
date_created: 2018-12-11T12:04:16Z
date_published: 2004-08-10T00:00:00Z
date_updated: 2026-09-11T10:57:09Z
day: '10'
doi: 10.1016/j.cub.2004.07.037
extern: '1'
fulldoi: https://doi.org/10.1016/j.cub.2004.07.037
intvolume: ' 14'
issue: '15'
language:
- iso: eng
month: '08'
oa_version: None
page: R603 - R604
publication: Current Biology
publication_identifier:
eissn:
- 1879-0445
issn:
- 0960-9822
publication_status: published
publisher: Cell Press
publist_id: '2767'
status: public
title: 'Speciation: Why, how, where and when?'
type: review
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14
year: '2004'
...
---
OA_type: closed access
_id: '3208'
abstract:
- lang: eng
text: "A new technique for proving the adaptive indistinguishability of two systems,
each composed of some component systems, is presented, using only the fact that
corresponding component systems are non-adaptively indistinguishable. The main
tool is the definition of a special monotone condition for a random system F,
relative to another random system G, whose probability of occurring for a given
distinguisher D is closely related to the distinguishing advantage ε of D for
F and G, namely it is lower and upper bounded by ε and (1+ln1), respectively.\r\nA
concrete instantiation of this result shows that the cascade of two random permutations
(with the second one inverted) is indistinguishable from a uniform random permutation
by adaptive distinguishers which may query the system from both sides, assuming
the components’ security only against non-adaptive one-sided distinguishers.\r\nAs
applications we provide some results in various fields as almost k-wise independent
probability spaces, decorrelation theory and computational indistinguishability
(i.e., pseudo-randomness)."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ueli
full_name: Maurer, Ueli
last_name: Maurer
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Maurer U, Pietrzak KZ. Composition of random systems: When two weak make one
strong. In: First Theory of Cryptography Conference, 2004. Vol 2951. Springer
Nature; 2004:410-427. doi:10.1007/978-3-540-24638-1_23'
apa: 'Maurer, U., & Pietrzak, K. Z. (2004). Composition of random systems: When
two weak make one strong. In First Theory of Cryptography Conference, 2004
(Vol. 2951, pp. 410–427). Cambridge, MA, United: Springer Nature. https://doi.org/10.1007/978-3-540-24638-1_23'
chicago: 'Maurer, Ueli, and Krzysztof Z Pietrzak. “Composition of Random Systems:
When Two Weak Make One Strong.” In First Theory of Cryptography Conference,
2004, 2951:410–27. Springer Nature, 2004. https://doi.org/10.1007/978-3-540-24638-1_23.'
ieee: 'U. Maurer and K. Z. Pietrzak, “Composition of random systems: When two weak
make one strong,” in First Theory of Cryptography Conference, 2004, Cambridge,
MA, United, 2004, vol. 2951, pp. 410–427.'
ista: 'Maurer U, Pietrzak KZ. 2004. Composition of random systems: When two weak
make one strong. First Theory of Cryptography Conference, 2004. TCC: Theory of
Cryptography Conference, LNCS, vol. 2951, 410–427.'
mla: 'Maurer, Ueli, and Krzysztof Z. Pietrzak. “Composition of Random Systems: When
Two Weak Make One Strong.” First Theory of Cryptography Conference, 2004,
vol. 2951, Springer Nature, 2004, pp. 410–27, doi:10.1007/978-3-540-24638-1_23.'
short: U. Maurer, K.Z. Pietrzak, in:, First Theory of Cryptography Conference, 2004,
Springer Nature, 2004, pp. 410–427.
conference:
end_date: 2004-02-21
location: Cambridge, MA, United
name: 'TCC: Theory of Cryptography Conference'
start_date: 2004-02-19
date_created: 2018-12-11T12:02:01Z
date_published: 2004-03-19T00:00:00Z
date_updated: 2026-09-11T12:11:09Z
day: '19'
doi: 10.1007/978-3-540-24638-1_23
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-24638-1_23
intvolume: ' 2951'
language:
- iso: eng
month: '03'
oa_version: None
page: 410 - 427
publication: First Theory of Cryptography Conference, 2004
publication_identifier:
eisbn:
- '9783540246381'
isbn:
- '9783540210009'
publication_status: published
publisher: Springer Nature
publist_id: '3471'
status: public
title: 'Composition of random systems: When two weak make one strong'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2951
year: '2004'
...
---
OA_type: closed access
_id: '3177'
abstract:
- lang: eng
text: Feature space clustering is a popular approach to image segmentation, in which
a feature vector of local properties (such as intensity, texture or motion) is
computed at each pixel. The feature space is then clustered, and each pixel is
labeled with the cluster that contains its feature vector. A major limitation
of this approach is that feature space clusters generally lack spatial coherence
(i.e., they do not correspond to a compact grouping of pixels). In this paper,
we propose a segmentation algorithm that operates simultaneously in feature space
and in image space. We define an energy function over both a set of clusters and
a labeling of pixels with clusters. In our framework, a pixel is labeled with
a single cluster (rather than, for example, a distribution over clusters). Our
energy function penalizes clusters that are a poor fit to the data in feature
space, and also penalizes clusters whose pixels lack spatial coherence. The energy
function can be efficiently minimized using graph cuts. Our algorithm can incorporate
both parametric and non-parametric clustering methods. It can be applied to many
optimization-based clustering methods, including k-means and k-medians, and can
handle models which are very close in feature space. Preliminary results are presented
on segmenting real and synthetic images, using both parametric and non-parametric
clustering.
article_processing_charge: No
author:
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Zabih R, Kolmogorov V. Spatially coherent clustering using graph cuts. In:
Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision
and Pattern Recognition, 2004. Vol 2. IEEE; 2004:437-444. doi:10.1109/CVPR.2004.1315196'
apa: 'Zabih, R., & Kolmogorov, V. (2004). Spatially coherent clustering using
graph cuts. In Proceedings of the 2004 IEEE Computer Society Conference on
Computer Vision and Pattern Recognition, 2004 (Vol. 2, pp. 437–444). Washington,
DC, United States: IEEE. https://doi.org/10.1109/CVPR.2004.1315196'
chicago: Zabih, Ramin, and Vladimir Kolmogorov. “Spatially Coherent Clustering Using
Graph Cuts.” In Proceedings of the 2004 IEEE Computer Society Conference on
Computer Vision and Pattern Recognition, 2004, 2:437–44. IEEE, 2004. https://doi.org/10.1109/CVPR.2004.1315196.
ieee: R. Zabih and V. Kolmogorov, “Spatially coherent clustering using graph cuts,”
in Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision
and Pattern Recognition, 2004, Washington, DC, United States, 2004, vol. 2,
pp. 437–444.
ista: 'Zabih R, Kolmogorov V. 2004. Spatially coherent clustering using graph cuts.
Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and
Pattern Recognition, 2004. CVPR: Computer Vision and Pattern Recognition vol.
2, 437–444.'
mla: Zabih, Ramin, and Vladimir Kolmogorov. “Spatially Coherent Clustering Using
Graph Cuts.” Proceedings of the 2004 IEEE Computer Society Conference on Computer
Vision and Pattern Recognition, 2004, vol. 2, IEEE, 2004, pp. 437–44, doi:10.1109/CVPR.2004.1315196.
short: R. Zabih, V. Kolmogorov, in:, Proceedings of the 2004 IEEE Computer Society
Conference on Computer Vision and Pattern Recognition, 2004, IEEE, 2004, pp. 437–444.
conference:
end_date: 2004-07-02
location: Washington, DC, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2004-06-27
date_created: 2018-12-11T12:01:50Z
date_published: 2004-06-01T00:00:00Z
date_updated: 2026-09-11T12:20:17Z
day: '01'
doi: 10.1109/CVPR.2004.1315196
extern: '1'
fulldoi: https://doi.org/10.1109/CVPR.2004.1315196
intvolume: ' 2'
language:
- iso: eng
month: '06'
oa_version: None
page: 437 - 444
publication: Proceedings of the 2004 IEEE Computer Society Conference on Computer
Vision and Pattern Recognition, 2004
publication_identifier:
isbn:
- '0769521584'
issn:
- 1063-6919
publication_status: published
publisher: IEEE
publist_id: '3506'
status: public
title: Spatially coherent clustering using graph cuts
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2
year: '2004'
...
---
OA_type: closed access
_id: '3420'
abstract:
- lang: eng
text: Single-molecule force-spectroscopy was employed to unfold and refold single
sodium-proton antiporters (NhaA) of Escherichia coli from membrane patches. Although
transmembrane α-helices and extracellular polypeptide loops exhibited sufficient
stability to individually establish potential barriers against unfolding, two
helices predominantly unfolded pairwise, thereby acting as one structural unit.
Many of the potential barriers were detected unfolding NhaA either from the C-terminal
or the N-terminal end. It was found that some molecular interactions stabilizing
secondary structural elements were directional, while others were not. Additionally,
some interactions appeared to occur between the secondary structural elements.
After unfolding ten of the 12 helices, the extracted polypeptide was allowed to
refold back into the membrane. After five seconds, the refolded polypeptide established
all secondary structure elements of the native protein. One helical pair showed
a characteristic spring like “snap in” into its folded conformation, while the
refolding process of other helices was not detected in particular. Additionally,
individual helices required characteristic periods of time to fold. Correlating
these results with the primary structure of NhaA allowed us to obtain the first
insights into how potential barriers establish and determine the folding kinetics
of the secondary structure elements.
article_processing_charge: No
article_type: original
author:
- first_name: Alexej
full_name: Kedrov, Alexej
last_name: Kedrov
- first_name: Christine
full_name: Ziegler, Christine
last_name: Ziegler
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Werner
full_name: Kühlbrandt, Werner
last_name: Kühlbrandt
- first_name: Daniel
full_name: Mueller, Daniel
last_name: Mueller
citation:
ama: Kedrov A, Ziegler C, Janovjak HL, Kühlbrandt W, Mueller D. Controlled unfolding
and refolding of a single sodium/proton antiporter using atomic force microscopy.
Journal of Molecular Biology. 2004;340(5):1143-1152. doi:10.1016/j.jmb.2004.05.026
apa: Kedrov, A., Ziegler, C., Janovjak, H. L., Kühlbrandt, W., & Mueller, D.
(2004). Controlled unfolding and refolding of a single sodium/proton antiporter
using atomic force microscopy. Journal of Molecular Biology. Elsevier.
https://doi.org/10.1016/j.jmb.2004.05.026
chicago: Kedrov, Alexej, Christine Ziegler, Harald L Janovjak, Werner Kühlbrandt,
and Daniel Mueller. “Controlled Unfolding and Refolding of a Single Sodium/Proton
Antiporter Using Atomic Force Microscopy.” Journal of Molecular Biology.
Elsevier, 2004. https://doi.org/10.1016/j.jmb.2004.05.026.
ieee: A. Kedrov, C. Ziegler, H. L. Janovjak, W. Kühlbrandt, and D. Mueller, “Controlled
unfolding and refolding of a single sodium/proton antiporter using atomic force
microscopy,” Journal of Molecular Biology, vol. 340, no. 5. Elsevier, pp.
1143–1152, 2004.
ista: Kedrov A, Ziegler C, Janovjak HL, Kühlbrandt W, Mueller D. 2004. Controlled
unfolding and refolding of a single sodium/proton antiporter using atomic force
microscopy. Journal of Molecular Biology. 340(5), 1143–1152.
mla: Kedrov, Alexej, et al. “Controlled Unfolding and Refolding of a Single Sodium/Proton
Antiporter Using Atomic Force Microscopy.” Journal of Molecular Biology,
vol. 340, no. 5, Elsevier, 2004, pp. 1143–52, doi:10.1016/j.jmb.2004.05.026.
short: A. Kedrov, C. Ziegler, H.L. Janovjak, W. Kühlbrandt, D. Mueller, Journal
of Molecular Biology 340 (2004) 1143–1152.
date_created: 2018-12-11T12:03:14Z
date_published: 2004-07-23T00:00:00Z
date_updated: 2026-09-11T12:02:45Z
day: '23'
doi: 10.1016/j.jmb.2004.05.026
extern: '1'
external_id:
pmid:
- '15236973'
fulldoi: https://doi.org/10.1016/j.jmb.2004.05.026
intvolume: ' 340'
issue: '5'
language:
- iso: eng
month: '07'
oa_version: None
page: 1143 - 1152
pmid: 1
publication: Journal of Molecular Biology
publication_identifier:
issn:
- 0022-2836
publication_status: published
publisher: Elsevier
publist_id: '2981'
status: public
title: Controlled unfolding and refolding of a single sodium/proton antiporter using
atomic force microscopy
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 340
year: '2004'
...
---
OA_type: free access
_id: '3419'
abstract:
- lang: eng
text: The folding and stability of transmembrane proteins is a fundamental and unsolved
biological problem. Here, single bacteriorhodopsin molecules were mechanically
unfolded from native purple membranes using atomic force microscopy and force
spectroscopy. The energy landscape of individual transmembrane α helices and polypeptide
loops was mapped by monitoring the pulling speed dependence of the unfolding forces
and applying Monte Carlo simulations. Single helices formed independently stable
units stabilized by a single potential barrier. Mechanical unfolding of the helices
was triggered by 3.9–7.7 Å extension, while natural unfolding rates were of the
order of 10−3 s−1. Besides acting as individually stable units, helices associated
pairwise, establishing a collective potential barrier. The unfolding pathways
of individual proteins reflect distinct pulling speed-dependent unfolding routes
in their energy landscapes. These observations support the two-stage model of
membrane protein folding in which α helices insert into the membrane as stable
units and then assemble into the functional protein.
article_processing_charge: No
article_type: original
author:
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Jens
full_name: Struckmeier, Jens
last_name: Struckmeier
- first_name: Maurice
full_name: Hubain, Maurice
last_name: Hubain
- first_name: Max
full_name: Kessler, Max
last_name: Kessler
- first_name: Alexej
full_name: Kedrov, Alexej
last_name: Kedrov
- first_name: Daniel
full_name: Mueller, Daniel
last_name: Mueller
citation:
ama: Janovjak HL, Struckmeier J, Hubain M, Kessler M, Kedrov A, Mueller D. Probing
the energy landscape of the membrane protein bacteriorhodopsin. Structure.
2004;12(5):871-879. doi:10.1016/j.str.2004.03.016
apa: Janovjak, H. L., Struckmeier, J., Hubain, M., Kessler, M., Kedrov, A., &
Mueller, D. (2004). Probing the energy landscape of the membrane protein bacteriorhodopsin.
Structure. Cell Press. https://doi.org/10.1016/j.str.2004.03.016
chicago: Janovjak, Harald L, Jens Struckmeier, Maurice Hubain, Max Kessler, Alexej
Kedrov, and Daniel Mueller. “Probing the Energy Landscape of the Membrane Protein
Bacteriorhodopsin.” Structure. Cell Press, 2004. https://doi.org/10.1016/j.str.2004.03.016.
ieee: H. L. Janovjak, J. Struckmeier, M. Hubain, M. Kessler, A. Kedrov, and D. Mueller,
“Probing the energy landscape of the membrane protein bacteriorhodopsin,” Structure,
vol. 12, no. 5. Cell Press, pp. 871–879, 2004.
ista: Janovjak HL, Struckmeier J, Hubain M, Kessler M, Kedrov A, Mueller D. 2004.
Probing the energy landscape of the membrane protein bacteriorhodopsin. Structure.
12(5), 871–879.
mla: Janovjak, Harald L., et al. “Probing the Energy Landscape of the Membrane Protein
Bacteriorhodopsin.” Structure, vol. 12, no. 5, Cell Press, 2004, pp. 871–79,
doi:10.1016/j.str.2004.03.016.
short: H.L. Janovjak, J. Struckmeier, M. Hubain, M. Kessler, A. Kedrov, D. Mueller,
Structure 12 (2004) 871–879.
date_created: 2018-12-11T12:03:14Z
date_published: 2004-05-01T00:00:00Z
date_updated: 2026-09-11T12:05:19Z
day: '01'
doi: 10.1016/j.str.2004.03.016
extern: '1'
external_id:
pmid:
- '15130479'
fulldoi: https://doi.org/10.1016/j.str.2004.03.016
intvolume: ' 12'
issue: '5'
language:
- iso: eng
month: '05'
oa_version: None
page: 871 - 879
pmid: 1
publication: Structure
publication_identifier:
eissn:
- 1878-4186
issn:
- 0969-2126
publication_status: published
publisher: Cell Press
publist_id: '2982'
status: public
title: Probing the energy landscape of the membrane protein bacteriorhodopsin
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 12
year: '2004'
...
---
OA_place: publisher
OA_type: gold
_id: '3179'
abstract:
- lang: eng
text: The problem of efficient, interactive foreground/background segmentation in
still images is of great practical importance in image editing. Classical image
segmentation tools use either texture (colour) information, e.g. Magic Wand, or
edge (contrast) information, e.g. Intelligent Scissors. Recently, an approach
based on optimization by graph-cut has been developed which successfully combines
both types of information. In this paper we extend the graph-cut approach in three
respects. First, we have developed a more powerful, iterative version of the optimisation.
Secondly, the power of the iterative algorithm is used to simplify substantially
the user interaction needed for a given quality of result. Thirdly, a robust algorithm
for "border matting" has been developed to estimate simultaneously the
alpha-matte around an object boundary and the colours of foreground pixels. We
show that for moderately difficult examples the proposed method outperforms competitive
tools.
article_processing_charge: No
author:
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
citation:
ama: 'Rother C, Kolmogorov V, Blake A. "GrabCut" - Interactive
foreground extraction using iterated graph cuts . In: Vol 23. ACM; 2004:309-314.
doi:10.1145/1015706.1015720'
apa: 'Rother, C., Kolmogorov, V., & Blake, A. (2004). "GrabCut"
- Interactive foreground extraction using iterated graph cuts (Vol. 23, pp. 309–314).
Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive
Techniques, ACM. https://doi.org/10.1145/1015706.1015720'
chicago: Rother, Carsten, Vladimir Kolmogorov, and Andrew Blake. “"GrabCut"
- Interactive Foreground Extraction Using Iterated Graph Cuts ,” 23:309–14. ACM,
2004. https://doi.org/10.1145/1015706.1015720.
ieee: 'C. Rother, V. Kolmogorov, and A. Blake, “"GrabCut" - Interactive
foreground extraction using iterated graph cuts ,” presented at the SIGGRAPH:
Special Interest Group on Computer Graphics and Interactive Techniques, 2004,
vol. 23, no. 3, pp. 309–314.'
ista: 'Rother C, Kolmogorov V, Blake A. 2004. "GrabCut" - Interactive
foreground extraction using iterated graph cuts . SIGGRAPH: Special Interest Group
on Computer Graphics and Interactive Techniques vol. 23, 309–314.'
mla: Rother, Carsten, et al. "GrabCut" - Interactive Foreground
Extraction Using Iterated Graph Cuts . Vol. 23, no. 3, ACM, 2004, pp. 309–14,
doi:10.1145/1015706.1015720.
short: C. Rother, V. Kolmogorov, A. Blake, in:, ACM, 2004, pp. 309–314.
conference:
name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
date_created: 2018-12-11T12:01:51Z
date_published: 2004-08-01T00:00:00Z
date_updated: 2026-09-11T12:16:13Z
day: '01'
doi: 10.1145/1015706.1015720
extern: '1'
fulldoi: https://doi.org/10.1145/1015706.1015720
intvolume: ' 23'
issue: '3'
language:
- iso: eng
main_file_link:
- url: http://research.microsoft.com/pubs/67890/siggraph04-grabcut.pdf
month: '08'
oa_version: None
page: 309 - 314
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: ACM
publist_id: '3505'
status: public
title: '"GrabCut" - Interactive foreground extraction using iterated graph
cuts '
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 23
year: '2004'
...
---
OA_type: closed access
_id: '3574'
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Edelsbrunner H. Biological applications of computational topology. In: Handbook
of Discrete and Computational Geometry. CRC Press; 2004:1395-1412.'
apa: Edelsbrunner, H. (2004). Biological applications of computational topology.
In Handbook of Discrete and Computational Geometry (pp. 1395–1412). CRC
Press.
chicago: Edelsbrunner, Herbert. “Biological Applications of Computational Topology.”
In Handbook of Discrete and Computational Geometry, 1395–1412. CRC Press,
2004.
ieee: H. Edelsbrunner, “Biological applications of computational topology,” in Handbook
of Discrete and Computational Geometry, CRC Press, 2004, pp. 1395–1412.
ista: 'Edelsbrunner H. 2004.Biological applications of computational topology. In:
Handbook of Discrete and Computational Geometry. , 1395–1412.'
mla: Edelsbrunner, Herbert. “Biological Applications of Computational Topology.”
Handbook of Discrete and Computational Geometry, CRC Press, 2004, pp. 1395–412.
short: H. Edelsbrunner, in:, Handbook of Discrete and Computational Geometry, CRC
Press, 2004, pp. 1395–1412.
date_created: 2018-12-11T12:04:02Z
date_published: 2004-04-15T00:00:00Z
date_updated: 2026-09-11T11:59:01Z
day: '15'
extern: '1'
language:
- iso: eng
main_file_link:
- url: http://www.cs.duke.edu/~edels/Papers/2004-B-01-BiologicalApplicationsTopology.pdf
month: '04'
oa_version: None
page: 1395 - 1412
publication: Handbook of Discrete and Computational Geometry
publication_status: published
publisher: CRC Press
publist_id: '2811'
status: public
title: Biological applications of computational topology
type: book_chapter
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2004'
...
---
OA_type: closed access
_id: '3178'
abstract:
- lang: eng
text: Minimum cut/maximum flow algorithms on graphs have emerged as an increasingly
useful tool for exactor approximate energy minimization in low-level vision. The
combinatorial optimization literature provides many min-cut/max-flow algorithms
with different polynomial time complexity. Their practical efficiency, however,
has to date been studied mainly outside the scope of computer vision. The goal
of this paper is to provide an experimental comparison of the efficiency of min-cut/max
flow algorithms for applications in vision. We compare the running times of several
standard algorithms, as well as a new algorithm that we have recently developed.
The algorithms we study include both Goldberg-Tarjan style "push -relabel"
methods and algorithms based on Ford-Fulkerson style "augmenting paths."
We benchmark these algorithms on a number of typical graphs in the contexts of
image restoration, stereo, and segmentation. In many cases, our new algorithm
works several times faster than any of the other methods, making near real-time
performance possible. An implementation of our max-flow/min-cut algorithm is available
upon request for research purposes.
article_processing_charge: No
article_type: original
author:
- first_name: Yuri
full_name: Boykov, Yuri
last_name: Boykov
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms
for energy minimization in vision. IEEE Transactions on Pattern Analysis and
Machine Intelligence. 2004;26(9):1124-1137. doi:10.1109/TPAMI.2004.60
apa: Boykov, Y., & Kolmogorov, V. (2004). An experimental comparison of min-cut/max-flow
algorithms for energy minimization in vision. IEEE Transactions on Pattern
Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2004.60
chicago: Boykov, Yuri, and Vladimir Kolmogorov. “An Experimental Comparison of Min-Cut/Max-Flow
Algorithms for Energy Minimization in Vision.” IEEE Transactions on Pattern
Analysis and Machine Intelligence. IEEE, 2004. https://doi.org/10.1109/TPAMI.2004.60.
ieee: Y. Boykov and V. Kolmogorov, “An experimental comparison of min-cut/max-flow
algorithms for energy minimization in vision,” IEEE Transactions on Pattern
Analysis and Machine Intelligence, vol. 26, no. 9. IEEE, pp. 1124–1137, 2004.
ista: Boykov Y, Kolmogorov V. 2004. An experimental comparison of min-cut/max-flow
algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 26(9), 1124–1137.
mla: Boykov, Yuri, and Vladimir Kolmogorov. “An Experimental Comparison of Min-Cut/Max-Flow
Algorithms for Energy Minimization in Vision.” IEEE Transactions on Pattern
Analysis and Machine Intelligence, vol. 26, no. 9, IEEE, 2004, pp. 1124–37,
doi:10.1109/TPAMI.2004.60.
short: Y. Boykov, V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine
Intelligence 26 (2004) 1124–1137.
date_created: 2018-12-11T12:01:51Z
date_published: 2004-09-01T00:00:00Z
date_updated: 2026-09-16T12:51:04Z
day: '01'
doi: 10.1109/TPAMI.2004.60
extern: '1'
external_id:
pmid:
- '15742889'
fulldoi: https://doi.org/10.1109/TPAMI.2004.60
intvolume: ' 26'
issue: '9'
language:
- iso: eng
month: '09'
oa_version: None
page: 1124 - 1137
pmid: 1
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
eissn:
- 1939-3539
issn:
- 0162-8828
publication_status: published
publisher: IEEE
publist_id: '3507'
status: public
title: An experimental comparison of min-cut/max-flow algorithms for energy minimization
in vision
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 26
year: '2004'
...
---
OA_type: closed access
_id: '3172'
abstract:
- lang: eng
text: The simultaneous multiple volume (SMV) approach in navigator-gated MRI allows
the use of the whole motion range or the entire scan time for the reconstruction
of final images by simultaneously acquiring different image volumes at different
motion states. The motion tolerance range for each volume is kept small, thus
SMV substantially increases the scan efficiency of navigator methods while maintaining
the effectiveness of motion suppression. This article reports a general implementation
of the SMV approach using a multiprocessor scheduling algorithm. Each motion state
is regarded as a processor and each volume is regarded as a job. An efficient
scheduling that completes all jobs in minimal time is maintained even when the
motion pattern changes. Initial experiments demonstrated that SMV significantly
increased the scan efficiency of navigatorgated MRI.
article_processing_charge: No
article_type: original
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Thành
full_name: Nguyen, Thành
last_name: Nguyen
- first_name: Anthony
full_name: Nuval, Anthony
last_name: Nuval
- first_name: Pascal
full_name: Spincemaille, Pascal
last_name: Spincemaille
- first_name: Martin
full_name: Prince, Martin
last_name: Prince
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
- first_name: Yusu
full_name: Wang, Yusu
last_name: Wang
citation:
ama: Kolmogorov V, Nguyen T, Nuval A, et al. Multiprocessor scheduling implementation
of the simultaneous multiple volume SMV navigator method. Magnetic Resonance
in Medicine. 2004;52(2):362-367. doi:10.1002/mrm.20162
apa: Kolmogorov, V., Nguyen, T., Nuval, A., Spincemaille, P., Prince, M., Zabih,
R., & Wang, Y. (2004). Multiprocessor scheduling implementation of the simultaneous
multiple volume SMV navigator method. Magnetic Resonance in Medicine. Wiley-Blackwell.
https://doi.org/10.1002/mrm.20162
chicago: Kolmogorov, Vladimir, Thành Nguyen, Anthony Nuval, Pascal Spincemaille,
Martin Prince, Ramin Zabih, and Yusu Wang. “Multiprocessor Scheduling Implementation
of the Simultaneous Multiple Volume SMV Navigator Method.” Magnetic Resonance
in Medicine. Wiley-Blackwell, 2004. https://doi.org/10.1002/mrm.20162.
ieee: V. Kolmogorov et al., “Multiprocessor scheduling implementation of
the simultaneous multiple volume SMV navigator method,” Magnetic Resonance
in Medicine, vol. 52, no. 2. Wiley-Blackwell, pp. 362–367, 2004.
ista: Kolmogorov V, Nguyen T, Nuval A, Spincemaille P, Prince M, Zabih R, Wang Y.
2004. Multiprocessor scheduling implementation of the simultaneous multiple volume
SMV navigator method. Magnetic Resonance in Medicine. 52(2), 362–367.
mla: Kolmogorov, Vladimir, et al. “Multiprocessor Scheduling Implementation of the
Simultaneous Multiple Volume SMV Navigator Method.” Magnetic Resonance in Medicine,
vol. 52, no. 2, Wiley-Blackwell, 2004, pp. 362–67, doi:10.1002/mrm.20162.
short: V. Kolmogorov, T. Nguyen, A. Nuval, P. Spincemaille, M. Prince, R. Zabih,
Y. Wang, Magnetic Resonance in Medicine 52 (2004) 362–367.
date_created: 2018-12-11T12:01:48Z
date_published: 2004-08-01T00:00:00Z
date_updated: 2026-09-16T12:55:19Z
day: '01'
doi: 10.1002/mrm.20162
extern: '1'
external_id:
pmid:
- '15282819'
fulldoi: https://doi.org/10.1002/mrm.20162
intvolume: ' 52'
issue: '2'
language:
- iso: eng
month: '08'
oa_version: None
page: 362 - 367
pmid: 1
publication: Magnetic Resonance in Medicine
publication_identifier:
eissn:
- 1522-2594
issn:
- 0740-3194
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3508'
status: public
title: Multiprocessor scheduling implementation of the simultaneous multiple volume
SMV navigator method
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 52
year: '2004'
...
---
OA_type: closed access
_id: '3173'
abstract:
- lang: eng
text: In the last few years, several new algorithms based on graph cuts have been
developed to solve energy minimization problems in computer vision. Each of these
techniques constructs a graph such that the minimum cut on the graph also minimizes
the energy. Yet, because these graph constructions are complex and highly specific
to a particular energy function, graph cuts have seen limited application to date.
In this paper, we give a characterization of the energy functions that can be
minimized by graph cuts. Our results are restricted to functions of binary variables.
However, our work generalizes many previous constructions and is easily applicable
to vision problems that involve large numbers of labels, such as stereo, motion,
image restoration, and scene reconstruction. We give a precise characterization
of what energy functions can be minimized using graph cuts, among the energy functions
that can be written as a sum of terms containing three or fewer binary variables.
We also provide a general-purpose construction to minimize such an energy function.
Finally, we give a necessary condition for any energy function of binary variables
to be minimized by graph cuts. Researchers who are considering the use of graph
cuts to optimize a particular energy function can use our results to determine
if this is possible and then follow our construction to create the appropriate
graph. A software implementation is freely available.
article_processing_charge: No
article_type: original
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
citation:
ama: Kolmogorov V, Zabih R. What energy functions can be minimized via graph cuts?
. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2004;26(2):147-159.
doi:10.1109/TPAMI.2004.1262177
apa: Kolmogorov, V., & Zabih, R. (2004). What energy functions can be minimized
via graph cuts? . IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE. https://doi.org/10.1109/TPAMI.2004.1262177
chicago: Kolmogorov, Vladimir, and Ramin Zabih. “What Energy Functions Can Be Minimized
via Graph Cuts? .” IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE, 2004. https://doi.org/10.1109/TPAMI.2004.1262177.
ieee: V. Kolmogorov and R. Zabih, “What energy functions can be minimized via graph
cuts? ,” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 26, no. 2. IEEE, pp. 147–159, 2004.
ista: Kolmogorov V, Zabih R. 2004. What energy functions can be minimized via graph
cuts? . IEEE Transactions on Pattern Analysis and Machine Intelligence. 26(2),
147–159.
mla: Kolmogorov, Vladimir, and Ramin Zabih. “What Energy Functions Can Be Minimized
via Graph Cuts? .” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 26, no. 2, IEEE, 2004, pp. 147–59, doi:10.1109/TPAMI.2004.1262177.
short: V. Kolmogorov, R. Zabih, IEEE Transactions on Pattern Analysis and Machine
Intelligence 26 (2004) 147–159.
date_created: 2018-12-11T12:01:49Z
date_published: 2004-02-01T00:00:00Z
date_updated: 2026-09-17T12:40:36Z
day: '01'
doi: 10.1109/TPAMI.2004.1262177
extern: '1'
external_id:
pmid:
- '15376891'
fulldoi: https://doi.org/10.1109/TPAMI.2004.1262177
intvolume: ' 26'
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 147 - 159
pmid: 1
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
eissn:
- 1939-3539
issn:
- 0162-8828
publication_status: published
publisher: IEEE
publist_id: '3509'
status: public
title: 'What energy functions can be minimized via graph cuts? '
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 26
year: '2004'
...
---
OA_type: free access
_id: '2998'
abstract:
- lang: eng
text: The packaging of the genomic DNA into chromatin in the cell nucleus requires
machineries that facilitate DNA-dependent processes such as transcription in the
presence of repressive chromatin structures. Using co-immunoprecipitation we have
identified in Arabidopsis thaliana cells the FAcilitates Chromatin Transcription
(FACT) complex, consisting of the 120-kDa Spt16 and the 71-kDa SSRP1 proteins.
Indirect immunofluorecence analyses revealed that both FACT subunits co-localize
to nuclei of the majority of cell types in embryos, shoots and roots, whereas
FACT is not present in terminally differentiated cells such as mature trichoblasts
or cells of the root cap. In the nucleus, Spt16 and SSRP1 are found in the cytologically
defined euchromatin of interphase cells independent of the status of DNA replication,
but the proteins are not associated with heterochromatic chromocentres and condensed
mitotic chromosomes. FACT can be detected by chromatin immunoprecipitation over
the entire transcribed region (5′-UTR, coding sequence, 3′-UTR) of actively transcribed
genes, whereas it does not occur at transcriptionally inactive heterochromatic
regions and intergenic regions. FACT localizes to inducible genes only after induction
of transcription, and the association of the complex with the genes correlates
with the level of transcription. Collectively, these results indicate that FACT
assists transcription elongation through plant chromatin.
article_processing_charge: No
article_type: original
author:
- first_name: Meg
full_name: Duroux, Meg
last_name: Duroux
- first_name: Andreas
full_name: Houben, Andreas
last_name: Houben
- first_name: Kamil
full_name: Růžička, Kamil
last_name: Růžička
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Klaus
full_name: Grasser, Klaus
last_name: Grasser
citation:
ama: Duroux M, Houben A, Růžička K, Friml J, Grasser K. The chromatin remodelling
complex FACT associates with actively transcribed regions of the Arabidopsis genome.
Plant Journal. 2004;40(5):660-671. doi:10.1111/j.1365-313X.2004.02242.x
apa: Duroux, M., Houben, A., Růžička, K., Friml, J., & Grasser, K. (2004). The
chromatin remodelling complex FACT associates with actively transcribed regions
of the Arabidopsis genome. Plant Journal. Wiley-Blackwell. https://doi.org/10.1111/j.1365-313X.2004.02242.x
chicago: Duroux, Meg, Andreas Houben, Kamil Růžička, Jiří Friml, and Klaus Grasser.
“The Chromatin Remodelling Complex FACT Associates with Actively Transcribed Regions
of the Arabidopsis Genome.” Plant Journal. Wiley-Blackwell, 2004. https://doi.org/10.1111/j.1365-313X.2004.02242.x.
ieee: M. Duroux, A. Houben, K. Růžička, J. Friml, and K. Grasser, “The chromatin
remodelling complex FACT associates with actively transcribed regions of the Arabidopsis
genome,” Plant Journal, vol. 40, no. 5. Wiley-Blackwell, pp. 660–671, 2004.
ista: Duroux M, Houben A, Růžička K, Friml J, Grasser K. 2004. The chromatin remodelling
complex FACT associates with actively transcribed regions of the Arabidopsis genome.
Plant Journal. 40(5), 660–671.
mla: Duroux, Meg, et al. “The Chromatin Remodelling Complex FACT Associates with
Actively Transcribed Regions of the Arabidopsis Genome.” Plant Journal,
vol. 40, no. 5, Wiley-Blackwell, 2004, pp. 660–71, doi:10.1111/j.1365-313X.2004.02242.x.
short: M. Duroux, A. Houben, K. Růžička, J. Friml, K. Grasser, Plant Journal 40
(2004) 660–671.
date_created: 2018-12-11T12:00:47Z
date_published: 2004-12-01T00:00:00Z
date_updated: 2026-09-17T12:52:29Z
day: '01'
doi: 10.1111/j.1365-313X.2004.02242.x
extern: '1'
external_id:
pmid:
- '15546350'
fulldoi: https://doi.org/10.1111/j.1365-313X.2004.02242.x
intvolume: ' 40'
issue: '5'
language:
- iso: eng
month: '12'
oa_version: None
page: 660 - 671
pmid: 1
publication: Plant Journal
publication_identifier:
eissn:
- 1365-313X
issn:
- 0960-7412
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3703'
status: public
title: The chromatin remodelling complex FACT associates with actively transcribed
regions of the Arabidopsis genome
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 40
year: '2004'
...
---
OA_type: closed access
_id: '2997'
abstract:
- lang: eng
text: Polar transport-dependent local accumulation of auxin provides positional
cues for multiple plant patterning processes. This directional auxin flow depends
on the polar subcellular localization of the PIN auxin efflux regulators. Overexpression
of the PINOID protein kinase induces a basal-to-apical shift in PIN localization,
resulting in the loss of auxin gradients and strong defects in embryo and seedling
roots. Conversely, pid loss of function induces an apical-to-basal shift in PIN1
polar targeting at the inflorescence apex, accompanied by defective organogenesis.
Our results show that a PINOID-dependent binary switch controls PIN polarity and
mediates changes in auxin flow to create local gradients for patterning processes.
article_processing_charge: No
article_type: original
author:
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Xiong
full_name: Yang, Xiong
last_name: Yang
- first_name: Marta
full_name: Michniewicz, Marta
last_name: Michniewicz
- first_name: Dolf
full_name: Weijers, Dolf
last_name: Weijers
- first_name: Ab
full_name: Quint, Ab
last_name: Quint
- first_name: Olaf
full_name: Tietz, Olaf
last_name: Tietz
- first_name: René
full_name: Benjamins, René
last_name: Benjamins
- first_name: Pieter
full_name: Ouwerkerk, Pieter
last_name: Ouwerkerk
- first_name: Karin
full_name: Ljung, Karin
last_name: Ljung
- first_name: Göran
full_name: Sandberg, Göran
last_name: Sandberg
- first_name: Paul
full_name: Hooykaas, Paul
last_name: Hooykaas
- first_name: Klaus
full_name: Palme, Klaus
last_name: Palme
- first_name: Remko
full_name: Offringa, Remko
last_name: Offringa
citation:
ama: Friml J, Yang X, Michniewicz M, et al. A PINOID-dependent binary switch in
apical-basal PIN polar targeting directs auxin efflux. Science. 2004;306(5697):862-865.
doi:10.1126/science.1100618
apa: Friml, J., Yang, X., Michniewicz, M., Weijers, D., Quint, A., Tietz, O., …
Offringa, R. (2004). A PINOID-dependent binary switch in apical-basal PIN polar
targeting directs auxin efflux. Science. American Association for the Advancement
of Science. https://doi.org/10.1126/science.1100618
chicago: Friml, Jiří, Xiong Yang, Marta Michniewicz, Dolf Weijers, Ab Quint, Olaf
Tietz, René Benjamins, et al. “A PINOID-Dependent Binary Switch in Apical-Basal
PIN Polar Targeting Directs Auxin Efflux.” Science. American Association
for the Advancement of Science, 2004. https://doi.org/10.1126/science.1100618.
ieee: J. Friml et al., “A PINOID-dependent binary switch in apical-basal
PIN polar targeting directs auxin efflux,” Science, vol. 306, no. 5697.
American Association for the Advancement of Science, pp. 862–865, 2004.
ista: Friml J, Yang X, Michniewicz M, Weijers D, Quint A, Tietz O, Benjamins R,
Ouwerkerk P, Ljung K, Sandberg G, Hooykaas P, Palme K, Offringa R. 2004. A PINOID-dependent
binary switch in apical-basal PIN polar targeting directs auxin efflux. Science.
306(5697), 862–865.
mla: Friml, Jiří, et al. “A PINOID-Dependent Binary Switch in Apical-Basal PIN Polar
Targeting Directs Auxin Efflux.” Science, vol. 306, no. 5697, American
Association for the Advancement of Science, 2004, pp. 862–65, doi:10.1126/science.1100618.
short: J. Friml, X. Yang, M. Michniewicz, D. Weijers, A. Quint, O. Tietz, R. Benjamins,
P. Ouwerkerk, K. Ljung, G. Sandberg, P. Hooykaas, K. Palme, R. Offringa, Science
306 (2004) 862–865.
date_created: 2018-12-11T12:00:46Z
date_published: 2004-10-29T00:00:00Z
date_updated: 2026-09-17T13:05:22Z
day: '29'
doi: 10.1126/science.1100618
extern: '1'
external_id:
pmid:
- '15514156'
fulldoi: https://doi.org/10.1126/science.1100618
intvolume: ' 306'
issue: '5697'
language:
- iso: eng
month: '10'
oa_version: None
page: 862 - 865
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '3705'
status: public
title: A PINOID-dependent binary switch in apical-basal PIN polar targeting directs
auxin efflux
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 306
year: '2004'
...