---
_id: '4088'
abstract:
- lang: eng
text: 'Anarrangement ofn lines (or line segments) in the plane is the partition
of the plane defined by these objects. Such an arrangement consists ofO(n 2) regions,
calledfaces. In this paper we study the problem of calculating and storing arrangementsimplicitly,
using subquadratic space and preprocessing, so that, given any query pointp, we
can calculate efficiently the face containingp. First, we consider the case of
lines and show that with (n) space1 and (n 3/2) preprocessing time, we can answer
face queries in (n)+O(K) time, whereK is the output size. (The query time is achieved
with high probability.) In the process, we solve three interesting subproblems:
(1) given a set ofn points, find a straight-edge spanning tree of these points
such that any line intersects only a few edges of the tree, (2) given a simple
polygonal path , form a data structure from which we can find the convex hull
of any subpath of quickly, and (3) given a set of points, organize them so that
the convex hull of their subset lying above a query line can be found quickly.
Second, using random sampling, we give a tradeoff between increasing space and
decreasing query time. Third, we extend our structure to report faces in an arrangement
of line segments in (n 1/3)+O(K) time, given(n 4/3) space and (n 5/3) preprocessing
time. Lastly, we note that our techniques allow us to computem faces in an arrangement
ofn lines in time (m 2/3 n 2/3+n), which is nearly optimal.'
acknowledgement: The first author is pleased to acknowledge the support of Amoco Fnd.
Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565.
Work on this paper by the fifth author has been supported by Office of Naval Research
Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, by
grants from the Digital Equipment Corporation, and the IBM Corporation, and by a
research grant from the NCRD—the Israeli National Council for Research and Development.
The sixth author was supported in part by a National Science Foundation Graduate
Fellowship. This work was begun while the non-DEC authors were visiting at the DEC
Systems Research Center.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: John
full_name: Hershberger, John
last_name: Hershberger
- first_name: Raimund
full_name: Seidel, Raimund
last_name: Seidel
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
- first_name: Jack
full_name: Snoeyink, Jack
last_name: Snoeyink
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements
of lines or segments. Discrete & Computational Geometry. 1989;4(1):433-466.
doi:10.1007/BF02187742
apa: Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink,
J., & Welzl, E. (1989). Implicitly representing arrangements of lines or segments.
Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187742
chicago: Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel,
Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements
of Lines or Segments.” Discrete & Computational Geometry. Springer,
1989. https://doi.org/10.1007/BF02187742.
ieee: H. Edelsbrunner et al., “Implicitly representing arrangements of lines
or segments,” Discrete & Computational Geometry, vol. 4, no. 1. Springer,
pp. 433–466, 1989.
ista: Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M, Snoeyink J, Welzl
E. 1989. Implicitly representing arrangements of lines or segments. Discrete &
Computational Geometry. 4(1), 433–466.
mla: Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines
or Segments.” Discrete & Computational Geometry, vol. 4, no. 1, Springer,
1989, pp. 433–66, doi:10.1007/BF02187742.
short: H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink,
E. Welzl, Discrete & Computational Geometry 4 (1989) 433–466.
date_created: 2018-12-11T12:06:52Z
date_published: 1989-12-01T00:00:00Z
date_updated: 2022-02-10T15:03:48Z
day: '01'
doi: 10.1007/BF02187742
extern: '1'
intvolume: ' 4'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/article/10.1007/BF02187742
month: '12'
oa: 1
oa_version: Published Version
page: 433 - 466
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2036'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Implicitly representing arrangements of lines or segments
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 4
year: '1989'
...
---
_id: '4089'
abstract:
- lang: eng
text: Motivated by a number of motion-planning questions, we investigate in this
paper some general topological and combinatorial properties of the boundary of
the union ofn regions bounded by Jordan curves in the plane. We show that, under
some fairly weak conditions, a simply connected surface can be constructed that
exactly covers this union and whose boundary has combinatorial complexity that
is nearly linear, even though the covered region can have quadratic complexity.
In the case where our regions are delimited by Jordan acrs in the upper halfplane
starting and ending on thex-axis such that any pair of arcs intersect in at most
three points, we prove that the total number of subarcs that appear on the boundary
of the union is only (n(n)), where(n) is the extremely slowly growing functional
inverse of Ackermann's function.
acknowledgement: The first author is pleased to acknowledge the support of Amoco Fnd.
Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565.
Work on this paper by the fourth and seventh authors has been supported by Office
of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085,
and by grants from the Digital Equipment Corporation and the IBM Corporation. The
seventh author in addition wishes to acknowledge support by a research grant from
the NCRD—the Israeli National Council for Research and Development. The fifth author
would like to acknowledge support in part by NSF grant DMS-8501947. Finally, the
eighth author was supported in part by a National Science Foundation Graduate Fellowship.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: John
full_name: Hershberger, John
last_name: Hershberger
- first_name: János
full_name: Pach, János
last_name: Pach
- first_name: Richard
full_name: Pollack, Richard
last_name: Pollack
- first_name: Raimund
full_name: Seidel, Raimund
last_name: Seidel
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
- first_name: Jack
full_name: Snoeyink, Jack
last_name: Snoeyink
citation:
ama: Edelsbrunner H, Guibas L, Hershberger J, et al. On arrangements of Jordan arcs
with three intersections per pair. Discrete & Computational Geometry.
1989;4(1):523-539. doi:10.1007/BF02187745
apa: Edelsbrunner, H., Guibas, L., Hershberger, J., Pach, J., Pollack, R., Seidel,
R., … Snoeyink, J. (1989). On arrangements of Jordan arcs with three intersections
per pair. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187745
chicago: Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, János Pach, Richard
Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “On Arrangements of
Jordan Arcs with Three Intersections per Pair.” Discrete & Computational
Geometry. Springer, 1989. https://doi.org/10.1007/BF02187745.
ieee: H. Edelsbrunner et al., “On arrangements of Jordan arcs with three
intersections per pair,” Discrete & Computational Geometry, vol. 4,
no. 1. Springer, pp. 523–539, 1989.
ista: Edelsbrunner H, Guibas L, Hershberger J, Pach J, Pollack R, Seidel R, Sharir
M, Snoeyink J. 1989. On arrangements of Jordan arcs with three intersections per
pair. Discrete & Computational Geometry. 4(1), 523–539.
mla: Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections
per Pair.” Discrete & Computational Geometry, vol. 4, no. 1, Springer,
1989, pp. 523–39, doi:10.1007/BF02187745.
short: H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel,
M. Sharir, J. Snoeyink, Discrete & Computational Geometry 4 (1989) 523–539.
date_created: 2018-12-11T12:06:52Z
date_published: 1989-12-01T00:00:00Z
date_updated: 2022-02-10T15:40:04Z
day: '01'
doi: 10.1007/BF02187745
extern: '1'
intvolume: ' 4'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/article/10.1007/BF02187745
month: '12'
oa: 1
oa_version: Published Version
page: 523 - 539
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2037'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On arrangements of Jordan arcs with three intersections per pair
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 4
year: '1989'
...
---
_id: '4092'
acknowledgement: 'The support of the Digital Systems Research center and the Digital
Paris Research laboratory, where much of this research was carried out, are gratefully
acknowledged. Work on this paper by Bernard Chazelle has been supported by NSF Grant
CCI~-87-00917. Work on this paper by Herbert Edelsbrunner has been supported by
NSF Grant CCR-87-14565. Work on this paper by Micha Sharir has been supported by
ONR Grant N00014-87-K-0129, by NSF Grant DCP~-83-20085, and by grants from the U.S.-Israeli
Binational Science Foundation, the NCRD - the Israeli National Council for Research
and Development, and the EMET Fund of the Israeli Academy of Sciences. '
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Bernard
full_name: Chazelle, Bernard
last_name: Chazelle
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
citation:
ama: 'Chazelle B, Edelsbrunner H, Guibas L, Sharir M. A singly exponential stratification
scheme for real semi-algebraic varieties and its applications. In: 16th International
Colloquium on Automata, Languages, and Programming. Vol 372. Springer; 1989:179-193.
doi:10.1007/BFb0035760'
apa: 'Chazelle, B., Edelsbrunner, H., Guibas, L., & Sharir, M. (1989). A singly
exponential stratification scheme for real semi-algebraic varieties and its applications.
In 16th International Colloquium on Automata, Languages, and Programming
(Vol. 372, pp. 179–193). Stresa, Italy: Springer. https://doi.org/10.1007/BFb0035760'
chicago: Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir.
“A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties
and Its Applications.” In 16th International Colloquium on Automata, Languages,
and Programming, 372:179–93. Springer, 1989. https://doi.org/10.1007/BFb0035760.
ieee: B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “A singly exponential
stratification scheme for real semi-algebraic varieties and its applications,”
in 16th International Colloquium on Automata, Languages, and Programming,
Stresa, Italy, 1989, vol. 372, pp. 179–193.
ista: 'Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1989. A singly exponential
stratification scheme for real semi-algebraic varieties and its applications.
16th International Colloquium on Automata, Languages, and Programming. ICALP:
International Colloquium on Automata, Languages, and Programming, LNCS, vol. 372,
179–193.'
mla: Chazelle, Bernard, et al. “A Singly Exponential Stratification Scheme for Real
Semi-Algebraic Varieties and Its Applications.” 16th International Colloquium
on Automata, Languages, and Programming, vol. 372, Springer, 1989, pp. 179–93,
doi:10.1007/BFb0035760.
short: B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, in:, 16th International
Colloquium on Automata, Languages, and Programming, Springer, 1989, pp. 179–193.
conference:
end_date: 1989-07-15
location: Stresa, Italy
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 1989-07-11
date_created: 2018-12-11T12:06:53Z
date_published: 1989-07-24T00:00:00Z
date_updated: 2022-02-10T10:06:23Z
day: '24'
doi: 10.1007/BFb0035760
extern: '1'
intvolume: ' 372'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/BFb0035760
month: '07'
oa_version: None
page: 179 - 193
publication: 16th International Colloquium on Automata, Languages, and Programming
publication_status: published
publisher: Springer
publist_id: '2031'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A singly exponential stratification scheme for real semi-algebraic varieties
and its applications
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 372
year: '1989'
...
---
_id: '4093'
abstract:
- lang: eng
text: This paper investigates the combinatorial and computational aspects of certain
extremal geometric problems in two and three dimensions. Specifically, we examine
the problem of intersecting a convex subdivision with a line in order to maximize
the number of intersections. A similar problem is to maximize the number of intersected
facets in a cross-section of a three-dimensional convex polytope. Related problems
concern maximum chains in certain families of posets defined over the regions
of a convex subdivision. In most cases we are able to prove sharp bounds on the
asymptotic behavior of the corresponding extremal functions. We also describe
polynomial algorithms for all the problems discussed.
acknowledgement: "Bernard Chazelle wishes to acknowledge the National Science Foundation
for supporting this research in part under Grant No. MCS83-03925. Herbert Edelsbrunner
is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862.
We wish to thank J. Pach and E. Szemeredi for valuable discussions on several\r\nof
the problems studied in this paper."
article_processing_charge: No
author:
- first_name: Bernard
full_name: Chazelle, Bernard
last_name: Chazelle
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
citation:
ama: Chazelle B, Edelsbrunner H, Guibas L. The complexity of cutting complexes.
Discrete & Computational Geometry. 1989;4(1):139-181. doi:10.1007/BF02187720
apa: Chazelle, B., Edelsbrunner, H., & Guibas, L. (1989). The complexity of
cutting complexes. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02187720
chicago: Chazelle, Bernard, Herbert Edelsbrunner, and Leonidas Guibas. “The Complexity
of Cutting Complexes.” Discrete & Computational Geometry. Springer,
1989. https://doi.org/10.1007/BF02187720.
ieee: B. Chazelle, H. Edelsbrunner, and L. Guibas, “The complexity of cutting complexes,”
Discrete & Computational Geometry, vol. 4, no. 1. Springer, pp. 139–181,
1989.
ista: Chazelle B, Edelsbrunner H, Guibas L. 1989. The complexity of cutting complexes.
Discrete & Computational Geometry. 4(1), 139–181.
mla: Chazelle, Bernard, et al. “The Complexity of Cutting Complexes.” Discrete
& Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 139–81, doi:10.1007/BF02187720.
short: B. Chazelle, H. Edelsbrunner, L. Guibas, Discrete & Computational Geometry
4 (1989) 139–181.
date_created: 2018-12-11T12:06:54Z
date_published: 1989-03-01T00:00:00Z
date_updated: 2022-02-10T10:25:57Z
day: '01'
doi: 10.1007/BF02187720
extern: '1'
intvolume: ' 4'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02187720
month: '03'
oa_version: None
page: 139 - 181
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2032'
quality_controlled: '1'
status: public
title: The complexity of cutting complexes
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 4
year: '1989'
...
---
_id: '4309'
abstract:
- lang: eng
text: Three methods for estimating the average level of gene flow in natural population
are discussed and compared. The three methods are FST, rare alleles, and maximum
likelihood. All three methods yield estimates of the combination of parameters
(the number of migrants [Nm] in a demic model or the neighborhood size [4πDσ2]
in a continuum model) that determines the relative importance of gene flow and
genetic drift. We review the theory underlying these methods and derive new analytic
results for the expectation of FST in stepping-stone and continuum models when
small sets of samples are taken. We also compare the effectiveness of the different
methods using a variety of simulated data. We found that the FST and rare-alleles
methods yield comparable estimates under a wide variety of conditions when the
population being sampled is demographically stable. They are roughly equally sensitive
to selection and to variation in population structure, and they approach their
equilibrium values at approximately the same rate. We found that two different
maximum-likelihood methods tend to yield biased estimates when relatively small
numbers of locations are sampled but more accurate estimates when larger numbers
are sampled. Our conclusion is that, although FST and rare-alleles methods are
expected to be equally effective in analyzing ideal data, practical problems in
estimating the frequencies of rare alleles in electrophoretic studies suggest
that FST is likely to be more useful under realistic conditions.
acknowledgement: This research has been supported in partv by grant 85-00258 from
the National Science Foundation and by grants GR/C/9 1529 and GR/E/08507 from the
Science and Engineering Research Council. We thank C. C. Cockerham and B. S. Weir
for helpful discussions of this topic, C. Wehrhahn for bringing his method to our
attention and for providing us with a copy of his program for estimating Nm, and
J. Coyne, M. Nei, B. S. Weir, and an anonymous referee for comments on an earlier
draft of this paper.
article_processing_charge: No
article_type: original
author:
- first_name: Montgomery
full_name: Slatkin, Montgomery
last_name: Slatkin
- 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: Slatkin M, Barton NH. A comparison of three methods for estimating average
levels of gene flow. Evolution; International Journal of Organic Evolution.
1989;43(7):1349-1368. doi:10.1111/j.1558-5646.1989.tb02587.x
apa: Slatkin, M., & Barton, N. H. (1989). A comparison of three methods for
estimating average levels of gene flow. Evolution; International Journal of
Organic Evolution. Wiley-Blackwell. https://doi.org/10.1111/j.1558-5646.1989.tb02587.x
chicago: Slatkin, Montgomery, and Nicholas H Barton. “A Comparison of Three Methods
for Estimating Average Levels of Gene Flow.” Evolution; International Journal
of Organic Evolution. Wiley-Blackwell, 1989. https://doi.org/10.1111/j.1558-5646.1989.tb02587.x .
ieee: M. Slatkin and N. H. Barton, “A comparison of three methods for estimating
average levels of gene flow,” Evolution; International Journal of Organic Evolution,
vol. 43, no. 7. Wiley-Blackwell, pp. 1349–1368, 1989.
ista: Slatkin M, Barton NH. 1989. A comparison of three methods for estimating average
levels of gene flow. Evolution; International Journal of Organic Evolution. 43(7),
1349–1368.
mla: Slatkin, Montgomery, and Nicholas H. Barton. “A Comparison of Three Methods
for Estimating Average Levels of Gene Flow.” Evolution; International Journal
of Organic Evolution, vol. 43, no. 7, Wiley-Blackwell, 1989, pp. 1349–68,
doi:10.1111/j.1558-5646.1989.tb02587.x
.
short: M. Slatkin, N.H. Barton, Evolution; International Journal of Organic Evolution
43 (1989) 1349–1368.
date_created: 2018-12-11T12:08:10Z
date_published: 1989-11-01T00:00:00Z
date_updated: 2022-02-10T09:44:53Z
day: '01'
doi: '10.1111/j.1558-5646.1989.tb02587.x '
extern: '1'
external_id:
pmid:
- '28564250 '
intvolume: ' 43'
issue: '7'
language:
- iso: eng
main_file_link:
- url: http://www.jstor.org/stable/2409452
month: '11'
oa_version: None
page: 1349 - 1368
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: '1751'
quality_controlled: '1'
status: public
title: A comparison of three methods for estimating average levels of gene flow
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 43
year: '1989'
...
---
_id: '4312'
acknowledgement: "We thank G. E. Bradford, B. Charlesworth, J. A. Coyne, D. Currie,
H. Dingle, J. H. Gillespie, A. Gimelfarb, W. G. Hill, A. A. Hoffmann, K. S. Jackson,
J. S. Jones, A. Liebowiz, T. Mitchell-aids , T. A. Mousseau, J. Peck, T. Prout,
B. Riska, D. A. Roff, H. B. Shaffer, and M. Slatkin for helpful discussions and
comments on earlier drafts. Our research is supported\r\nin part by grants from
the Science and Engineering Research Council, the National Science Foundation (BSR-8866548),
and the Institute of Theoretical Dynamics at University of California, Davis."
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. Evolutionary quantitative genetics: how little do we
know? Annual Review of Genetics. 1989;23:337-370. doi:10.1146/annurev.ge.23.120189.002005'
apa: 'Barton, N. H., & Turelli, M. (1989). Evolutionary quantitative genetics:
how little do we know? Annual Review of Genetics. Annual Reviews. https://doi.org/10.1146/annurev.ge.23.120189.002005'
chicago: 'Barton, Nicholas H, and Michael Turelli. “Evolutionary Quantitative Genetics:
How Little Do We Know?” Annual Review of Genetics. Annual Reviews, 1989.
https://doi.org/10.1146/annurev.ge.23.120189.002005.'
ieee: 'N. H. Barton and M. Turelli, “Evolutionary quantitative genetics: how little
do we know?,” Annual Review of Genetics, vol. 23. Annual Reviews, pp. 337–370,
1989.'
ista: 'Barton NH, Turelli M. 1989. Evolutionary quantitative genetics: how little
do we know? Annual Review of Genetics. 23, 337–370.'
mla: 'Barton, Nicholas H., and Michael Turelli. “Evolutionary Quantitative Genetics:
How Little Do We Know?” Annual Review of Genetics, vol. 23, Annual Reviews,
1989, pp. 337–70, doi:10.1146/annurev.ge.23.120189.002005.'
short: N.H. Barton, M. Turelli, Annual Review of Genetics 23 (1989) 337–370.
date_created: 2018-12-11T12:08:11Z
date_published: 1989-01-01T00:00:00Z
date_updated: 2022-02-09T16:01:46Z
day: '01'
doi: 10.1146/annurev.ge.23.120189.002005
extern: '1'
intvolume: ' 23'
language:
- iso: eng
main_file_link:
- url: https://www.annualreviews.org/doi/10.1146/annurev.ge.23.120189.002005
month: '01'
oa_version: None
page: 337 - 370
publication: Annual Review of Genetics
publication_identifier:
eissn:
- 1545-2948
issn:
- 0066-4197
publication_status: published
publisher: Annual Reviews
publist_id: '1744'
quality_controlled: '1'
status: public
title: 'Evolutionary quantitative genetics: how little do we know?'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 23
year: '1989'
...
---
_id: '4313'
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. Founder effect speciation. In: Otte D, Endler J, eds. Speciation
and Its Consequences. Sinauer Press; 1989.'
apa: Barton, N. H. (1989). Founder effect speciation. In D. Otte & J. Endler
(Eds.), Speciation and its consequences. Sinauer Press.
chicago: Barton, Nicholas H. “Founder Effect Speciation.” In Speciation and Its
Consequences, edited by Daniel Otte and John Endler. Sinauer Press, 1989.
ieee: N. H. Barton, “Founder effect speciation,” in Speciation and its consequences,
D. Otte and J. Endler, Eds. Sinauer Press, 1989.
ista: 'Barton NH. 1989.Founder effect speciation. In: Speciation and its consequences.
.'
mla: Barton, Nicholas H. “Founder Effect Speciation.” Speciation and Its Consequences,
edited by Daniel Otte and John Endler, Sinauer Press, 1989.
short: N.H. Barton, in:, D. Otte, J. Endler (Eds.), Speciation and Its Consequences,
Sinauer Press, 1989.
date_created: 2018-12-11T12:08:12Z
date_published: 1989-01-01T00:00:00Z
date_updated: 2022-02-09T15:03:06Z
day: '01'
editor:
- first_name: Daniel
full_name: Otte, Daniel
last_name: Otte
- first_name: John
full_name: Endler, John
last_name: Endler
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://www.researchgate.net/publication/237005503_Speciation_and_Its_Consequences
month: '01'
oa_version: None
publication: Speciation and its consequences
publication_identifier:
isbn:
- 978-0878936571
publication_status: published
publisher: Sinauer Press
publist_id: '1742'
status: public
title: Founder effect speciation
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1989'
...
---
_id: '4314'
abstract:
- lang: eng
text: 'Polygenic variation can be maintained by a balance between mutation and stabilizing
selection. When the alleles responsible for variation are rare, many classes of
equilibria may be stable. The rate at which drift causes shifts between equilibria
is investigated by integrating the gene frequency distribution W2N II (pq)4N mu-1.
This integral can be found exactly, by numerical integration, or can be approximated
by assuming that the full distribution of allele frequencies is approximately
Gaussian. These methods are checked against simulations. Over a wide range of
population sizes, drift will keep the population near an equilibrium which minimizes
the genetic variance and the deviation from the selective optimum. Shifts between
equilibria in this class occur at an appreciable rate if the product of population
size and selection on each locus is small (Ns alpha 2 less than 10). The Gaussian
approximation is accurate even when the underlying distribution is strongly skewed.
Reproductive isolation evolves as populations shift to new combinations of alleles:
however, this process is slow, approaching the neutral rate (approximately mu)
in small populations.'
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
citation:
ama: Barton NH. The divergence of a polygenic system under stabilising selection,
mutation and drift. Genetical Research. 1989;54(1):59-78. doi:10.1017/S0016672300028378
apa: Barton, N. H. (1989). The divergence of a polygenic system under stabilising
selection, mutation and drift. Genetical Research. Cambridge University
Press. https://doi.org/10.1017/S0016672300028378
chicago: Barton, Nicholas H. “The Divergence of a Polygenic System under Stabilising
Selection, Mutation and Drift.” Genetical Research. Cambridge University
Press, 1989. https://doi.org/10.1017/S0016672300028378.
ieee: N. H. Barton, “The divergence of a polygenic system under stabilising selection,
mutation and drift,” Genetical Research, vol. 54, no. 1. Cambridge University
Press, pp. 59–78, 1989.
ista: Barton NH. 1989. The divergence of a polygenic system under stabilising selection,
mutation and drift. Genetical Research. 54(1), 59–78.
mla: Barton, Nicholas H. “The Divergence of a Polygenic System under Stabilising
Selection, Mutation and Drift.” Genetical Research, vol. 54, no. 1, Cambridge
University Press, 1989, pp. 59–78, doi:10.1017/S0016672300028378.
short: N.H. Barton, Genetical Research 54 (1989) 59–78.
date_created: 2018-12-11T12:08:12Z
date_published: 1989-08-01T00:00:00Z
date_updated: 2022-02-09T14:18:28Z
day: '01'
doi: 10.1017/S0016672300028378
extern: '1'
external_id:
pmid:
- '2806907'
intvolume: ' 54'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://www.cambridge.org/core/journals/genetics-research/article/divergence-of-a-polygenic-system-subject-to-stabilizing-selection-mutation-and-drift/95DF5B589A5C32376F1AAEE99F3200D8
month: '08'
oa_version: None
page: 59 - 78
pmid: 1
publication: Genetical Research
publication_identifier:
eissn:
- 1469-5073
issn:
- 0016-6723
publication_status: published
publisher: Cambridge University Press
publist_id: '1741'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The divergence of a polygenic system under stabilising selection, mutation
and drift
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 54
year: '1989'
...