[{"scopus_import":"1","quality_controlled":"1","citation":{"ama":"Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements of lines or segments. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):433-466. doi:<a href=\"https://doi.org/10.1007/BF02187742\">10.1007/BF02187742</a>","mla":"Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:<a href=\"https://doi.org/10.1007/BF02187742\">10.1007/BF02187742</a>.","ieee":"H. Edelsbrunner <i>et al.</i>, “Implicitly representing arrangements of lines or segments,” <i>Discrete &#38; Computational Geometry</i>, 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 &#38; Computational Geometry. 4(1), 433–466.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements of Lines or Segments.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187742\">https://doi.org/10.1007/BF02187742</a>.","apa":"Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., &#38; Welzl, E. (1989). Implicitly representing arrangements of lines or segments. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187742\">https://doi.org/10.1007/BF02187742</a>","short":"H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete &#38; Computational Geometry 4 (1989) 433–466."},"_id":"4088","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","last_name":"Guibas","first_name":"Leonidas"},{"first_name":"John","last_name":"Hershberger","full_name":"Hershberger, John"},{"first_name":"Raimund","last_name":"Seidel","full_name":"Seidel, Raimund"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"},{"full_name":"Snoeyink, Jack","last_name":"Snoeyink","first_name":"Jack"},{"full_name":"Welzl, Emo","first_name":"Emo","last_name":"Welzl"}],"intvolume":"         4","publisher":"Springer","type":"journal_article","publist_id":"2036","page":"433 - 466","volume":4,"article_type":"original","title":"Implicitly representing arrangements of lines or segments","publication":"Discrete & Computational Geometry","year":"1989","article_processing_charge":"No","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.","date_created":"2018-12-11T12:06:52Z","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"oa_version":"Published Version","date_updated":"2022-02-10T15:03:48Z","issue":"1","oa":1,"language":[{"iso":"eng"}],"day":"01","extern":"1","abstract":[{"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.","lang":"eng"}],"publication_status":"published","date_published":"1989-12-01T00:00:00Z","status":"public","month":"12","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187742","open_access":"1"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1007/BF02187742"},{"status":"public","date_published":"1989-12-01T00:00:00Z","publication_status":"published","abstract":[{"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.","lang":"eng"}],"extern":"1","doi":"10.1007/BF02187745","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187745","open_access":"1"}],"month":"12","oa":1,"language":[{"iso":"eng"}],"issue":"1","date_updated":"2022-02-10T15:40:04Z","oa_version":"Published Version","day":"01","year":"1989","publication":"Discrete & Computational Geometry","article_type":"original","title":"On arrangements of Jordan arcs with three intersections per pair","volume":4,"page":"523 - 539","publist_id":"2037","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"date_created":"2018-12-11T12:06:52Z","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","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"full_name":"Hershberger, John","last_name":"Hershberger","first_name":"John"},{"first_name":"János","last_name":"Pach","full_name":"Pach, János"},{"full_name":"Pollack, Richard","last_name":"Pollack","first_name":"Richard"},{"last_name":"Seidel","first_name":"Raimund","full_name":"Seidel, Raimund"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"},{"full_name":"Snoeyink, Jack","first_name":"Jack","last_name":"Snoeyink"}],"_id":"4089","citation":{"ama":"Edelsbrunner H, Guibas L, Hershberger J, et al. On arrangements of Jordan arcs with three intersections per pair. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):523-539. doi:<a href=\"https://doi.org/10.1007/BF02187745\">10.1007/BF02187745</a>","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 &#38; Computational Geometry. 4(1), 523–539.","ieee":"H. Edelsbrunner <i>et al.</i>, “On arrangements of Jordan arcs with three intersections per pair,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 523–539, 1989.","mla":"Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections per Pair.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 523–39, doi:<a href=\"https://doi.org/10.1007/BF02187745\">10.1007/BF02187745</a>.","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.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187745\">https://doi.org/10.1007/BF02187745</a>.","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. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187745\">https://doi.org/10.1007/BF02187745</a>","short":"H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, Discrete &#38; Computational Geometry 4 (1989) 523–539."},"quality_controlled":"1","scopus_import":"1","type":"journal_article","publisher":"Springer","intvolume":"         4"},{"date_updated":"2022-02-10T10:06:23Z","oa_version":"None","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"day":"24","publication_status":"published","extern":"1","date_published":"1989-07-24T00:00:00Z","status":"public","month":"07","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/BFb0035760"}],"doi":"10.1007/BFb0035760","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","scopus_import":"1","citation":{"short":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, in:, 16th International Colloquium on Automata, Languages, and Programming, Springer, 1989, pp. 179–193.","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1989). A singly exponential stratification scheme for real semi-algebraic varieties and its applications. In <i>16th International Colloquium on Automata, Languages, and Programming</i> (Vol. 372, pp. 179–193). Stresa, Italy: Springer. <a href=\"https://doi.org/10.1007/BFb0035760\">https://doi.org/10.1007/BFb0035760</a>","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” In <i>16th International Colloquium on Automata, Languages, and Programming</i>, 372:179–93. Springer, 1989. <a href=\"https://doi.org/10.1007/BFb0035760\">https://doi.org/10.1007/BFb0035760</a>.","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.” <i>16th International Colloquium on Automata, Languages, and Programming</i>, vol. 372, Springer, 1989, pp. 179–93, doi:<a href=\"https://doi.org/10.1007/BFb0035760\">10.1007/BFb0035760</a>.","ieee":"B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “A singly exponential stratification scheme for real semi-algebraic varieties and its applications,” in <i>16th International Colloquium on Automata, Languages, and Programming</i>, Stresa, Italy, 1989, vol. 372, pp. 179–193.","ama":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. In: <i>16th International Colloquium on Automata, Languages, and Programming</i>. Vol 372. Springer; 1989:179-193. doi:<a href=\"https://doi.org/10.1007/BFb0035760\">10.1007/BFb0035760</a>"},"author":[{"first_name":"Bernard","last_name":"Chazelle","full_name":"Chazelle, Bernard"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","last_name":"Guibas","first_name":"Leonidas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"_id":"4092","intvolume":"       372","publisher":"Springer","type":"conference","page":"179 - 193","publist_id":"2031","title":"A singly exponential stratification scheme for real semi-algebraic varieties and its applications","volume":372,"year":"1989","publication":"16th International Colloquium on Automata, Languages, and Programming","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. ","date_created":"2018-12-11T12:06:53Z","article_processing_charge":"No","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Stresa, Italy","end_date":"1989-07-15","start_date":"1989-07-11"}},{"date_updated":"2022-02-10T10:25:57Z","oa_version":"None","issue":"1","language":[{"iso":"eng"}],"day":"01","extern":"1","publication_status":"published","abstract":[{"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.","lang":"eng"}],"date_published":"1989-03-01T00:00:00Z","status":"public","month":"03","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187720"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1007/BF02187720","quality_controlled":"1","citation":{"ista":"Chazelle B, Edelsbrunner H, Guibas L. 1989. The complexity of cutting complexes. Discrete &#38; Computational Geometry. 4(1), 139–181.","mla":"Chazelle, Bernard, et al. “The Complexity of Cutting Complexes.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 139–81, doi:<a href=\"https://doi.org/10.1007/BF02187720\">10.1007/BF02187720</a>.","ieee":"B. Chazelle, H. Edelsbrunner, and L. Guibas, “The complexity of cutting complexes,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 139–181, 1989.","ama":"Chazelle B, Edelsbrunner H, Guibas L. The complexity of cutting complexes. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):139-181. doi:<a href=\"https://doi.org/10.1007/BF02187720\">10.1007/BF02187720</a>","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, Discrete &#38; Computational Geometry 4 (1989) 139–181.","apa":"Chazelle, B., Edelsbrunner, H., &#38; Guibas, L. (1989). The complexity of cutting complexes. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187720\">https://doi.org/10.1007/BF02187720</a>","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, and Leonidas Guibas. “The Complexity of Cutting Complexes.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187720\">https://doi.org/10.1007/BF02187720</a>."},"_id":"4093","author":[{"first_name":"Bernard","last_name":"Chazelle","full_name":"Chazelle, Bernard"},{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"}],"intvolume":"         4","publisher":"Springer","type":"journal_article","publist_id":"2032","page":"139 - 181","volume":4,"title":"The complexity of cutting complexes","publication":"Discrete & Computational Geometry","year":"1989","article_processing_charge":"No","date_created":"2018-12-11T12:06:54Z","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.","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]}},{"author":[{"full_name":"Slatkin, Montgomery","first_name":"Montgomery","last_name":"Slatkin"},{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"}],"_id":"4309","citation":{"ama":"Slatkin M, Barton NH. A comparison of three methods for estimating average levels of gene flow. <i>Evolution; International Journal of Organic Evolution</i>. 1989;43(7):1349-1368. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1989.tb02587.x \">10.1111/j.1558-5646.1989.tb02587.x </a>","mla":"Slatkin, Montgomery, and Nicholas H. Barton. “A Comparison of Three Methods for Estimating Average Levels of Gene Flow.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 43, no. 7, Wiley-Blackwell, 1989, pp. 1349–68, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1989.tb02587.x \">10.1111/j.1558-5646.1989.tb02587.x </a>.","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.","ieee":"M. Slatkin and N. H. Barton, “A comparison of three methods for estimating average levels of gene flow,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 43, no. 7. Wiley-Blackwell, pp. 1349–1368, 1989.","chicago":"Slatkin, Montgomery, and Nicholas H Barton. “A Comparison of Three Methods for Estimating Average Levels of Gene Flow.” <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell, 1989. <a href=\"https://doi.org/10.1111/j.1558-5646.1989.tb02587.x \">https://doi.org/10.1111/j.1558-5646.1989.tb02587.x </a>.","short":"M. Slatkin, N.H. Barton, Evolution; International Journal of Organic Evolution 43 (1989) 1349–1368.","apa":"Slatkin, M., &#38; Barton, N. H. (1989). A comparison of three methods for estimating average levels of gene flow. <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.1989.tb02587.x \">https://doi.org/10.1111/j.1558-5646.1989.tb02587.x </a>"},"quality_controlled":"1","type":"journal_article","publisher":"Wiley-Blackwell","intvolume":"        43","year":"1989","publication":"Evolution; International Journal of Organic Evolution","title":"A comparison of three methods for estimating average levels of gene flow","article_type":"original","external_id":{"pmid":["28564250 "]},"volume":43,"page":"1349 - 1368","publist_id":"1751","publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"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.","date_created":"2018-12-11T12:08:10Z","article_processing_charge":"No","language":[{"iso":"eng"}],"issue":"7","date_updated":"2022-02-10T09:44:53Z","oa_version":"None","day":"01","status":"public","date_published":"1989-11-01T00:00:00Z","publication_status":"published","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."}],"extern":"1","doi":"10.1111/j.1558-5646.1989.tb02587.x ","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"http://www.jstor.org/stable/2409452"}],"month":"11"},{"intvolume":"        23","day":"01","publisher":"Annual Reviews","type":"journal_article","quality_controlled":"1","oa_version":"None","date_updated":"2022-02-09T16:01:46Z","citation":{"mla":"Barton, Nicholas H., and Michael Turelli. “Evolutionary Quantitative Genetics: How Little Do We Know?” <i>Annual Review of Genetics</i>, vol. 23, Annual Reviews, 1989, pp. 337–70, doi:<a href=\"https://doi.org/10.1146/annurev.ge.23.120189.002005\">10.1146/annurev.ge.23.120189.002005</a>.","ieee":"N. H. Barton and M. Turelli, “Evolutionary quantitative genetics: how little do we know?,” <i>Annual Review of Genetics</i>, 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.","ama":"Barton NH, Turelli M. Evolutionary quantitative genetics: how little do we know? <i>Annual Review of Genetics</i>. 1989;23:337-370. doi:<a href=\"https://doi.org/10.1146/annurev.ge.23.120189.002005\">10.1146/annurev.ge.23.120189.002005</a>","apa":"Barton, N. H., &#38; Turelli, M. (1989). Evolutionary quantitative genetics: how little do we know? <i>Annual Review of Genetics</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev.ge.23.120189.002005\">https://doi.org/10.1146/annurev.ge.23.120189.002005</a>","short":"N.H. Barton, M. Turelli, Annual Review of Genetics 23 (1989) 337–370.","chicago":"Barton, Nicholas H, and Michael Turelli. “Evolutionary Quantitative Genetics: How Little Do We Know?” <i>Annual Review of Genetics</i>. Annual Reviews, 1989. <a href=\"https://doi.org/10.1146/annurev.ge.23.120189.002005\">https://doi.org/10.1146/annurev.ge.23.120189.002005</a>."},"_id":"4312","language":[{"iso":"eng"}],"author":[{"first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","full_name":"Barton, Nicholas H"},{"first_name":"Michael","last_name":"Turelli","full_name":"Turelli, Michael"}],"article_processing_charge":"No","month":"01","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.","date_created":"2018-12-11T12:08:11Z","main_file_link":[{"url":"https://www.annualreviews.org/doi/10.1146/annurev.ge.23.120189.002005"}],"publication_identifier":{"eissn":["1545-2948"],"issn":["0066-4197"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1146/annurev.ge.23.120189.002005","publist_id":"1744","extern":"1","publication_status":"published","page":"337 - 370","date_published":"1989-01-01T00:00:00Z","volume":23,"article_type":"original","title":"Evolutionary quantitative genetics: how little do we know?","publication":"Annual Review of Genetics","year":"1989","status":"public"},{"publication_status":"published","extern":"1","publist_id":"1742","status":"public","year":"1989","publication":"Speciation and its consequences","title":"Founder effect speciation","date_published":"1989-01-01T00:00:00Z","main_file_link":[{"url":"https://www.researchgate.net/publication/237005503_Speciation_and_Its_Consequences"}],"publication_identifier":{"isbn":["‎ 978-0878936571"]},"date_created":"2018-12-11T12:08:12Z","article_processing_charge":"No","month":"01","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"chicago":"Barton, Nicholas H. “Founder Effect Speciation.” In <i>Speciation and Its Consequences</i>, 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.","apa":"Barton, N. H. (1989). Founder effect speciation. In D. Otte &#38; J. Endler (Eds.), <i>Speciation and its consequences</i>. Sinauer Press.","ama":"Barton NH. Founder effect speciation. In: Otte D, Endler J, eds. <i>Speciation and Its Consequences</i>. Sinauer Press; 1989.","ieee":"N. H. Barton, “Founder effect speciation,” in <i>Speciation and its consequences</i>, 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.” <i>Speciation and Its Consequences</i>, edited by Daniel Otte and John Endler, Sinauer Press, 1989."},"date_updated":"2022-02-09T15:03:06Z","oa_version":"None","author":[{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"_id":"4313","publisher":"Sinauer Press","day":"01","editor":[{"first_name":"Daniel","last_name":"Otte","full_name":"Otte, Daniel"},{"first_name":"John","last_name":"Endler","full_name":"Endler, John"}],"type":"book_chapter"},{"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","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","pmid":1,"doi":"10.1017/S0016672300028378","extern":"1","publication_status":"published","abstract":[{"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.","lang":"eng"}],"status":"public","date_published":"1989-08-01T00:00:00Z","day":"01","oa_version":"None","date_updated":"2022-02-09T14:18:28Z","issue":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0016-6723"],"eissn":["1469-5073"]},"article_processing_charge":"No","date_created":"2018-12-11T12:08:12Z","publist_id":"1741","page":"59 - 78","publication":"Genetical Research","year":"1989","volume":54,"article_type":"original","title":"The divergence of a polygenic system under stabilising selection, mutation and drift","external_id":{"pmid":["2806907"]},"publisher":"Cambridge University Press","intvolume":"        54","type":"journal_article","citation":{"short":"N.H. Barton, Genetical Research 54 (1989) 59–78.","apa":"Barton, N. H. (1989). The divergence of a polygenic system under stabilising selection, mutation and drift. <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300028378\">https://doi.org/10.1017/S0016672300028378</a>","chicago":"Barton, Nicholas H. “The Divergence of a Polygenic System under Stabilising Selection, Mutation and Drift.” <i>Genetical Research</i>. Cambridge University Press, 1989. <a href=\"https://doi.org/10.1017/S0016672300028378\">https://doi.org/10.1017/S0016672300028378</a>.","ieee":"N. H. Barton, “The divergence of a polygenic system under stabilising selection, mutation and drift,” <i>Genetical Research</i>, 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.” <i>Genetical Research</i>, vol. 54, no. 1, Cambridge University Press, 1989, pp. 59–78, doi:<a href=\"https://doi.org/10.1017/S0016672300028378\">10.1017/S0016672300028378</a>.","ama":"Barton NH. The divergence of a polygenic system under stabilising selection, mutation and drift. <i>Genetical Research</i>. 1989;54(1):59-78. doi:<a href=\"https://doi.org/10.1017/S0016672300028378\">10.1017/S0016672300028378</a>"},"scopus_import":"1","quality_controlled":"1","_id":"4314","author":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H"}]}]