[{"year":"1986","doi":"10.1007/BF00580727","title":"Toxin γ of the scorpion Tityus serrulatus modifies both activation and inactivation of sodium permeability of nerve membrane","external_id":{"pmid":["2426654 "]},"article_processing_charge":"No","publist_id":"2923","volume":407,"date_updated":"2022-02-03T09:46:42Z","publication_identifier":{"eissn":["1432-2013"],"issn":["0031-6768"]},"extern":"1","pmid":1,"_id":"3464","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"mla":"Jonas, Peter M., et al. “Toxin γ of the Scorpion Tityus Serrulatus Modifies Both Activation and Inactivation of Sodium Permeability of Nerve Membrane.” <i>Pflugers Archiv : European Journal of Physiology</i>, vol. 407, no. 1, Springer, 1986, pp. 92–99, doi:<a href=\"https://doi.org/10.1007/BF00580727\">10.1007/BF00580727</a>.","ama":"Jonas PM, Vogel W, Arantes E, Giglio J. Toxin γ of the scorpion Tityus serrulatus modifies both activation and inactivation of sodium permeability of nerve membrane. <i>Pflugers Archiv : European Journal of Physiology</i>. 1986;407(1):92-99. doi:<a href=\"https://doi.org/10.1007/BF00580727\">10.1007/BF00580727</a>","short":"P.M. Jonas, W. Vogel, E. Arantes, J. Giglio, Pflugers Archiv : European Journal of Physiology 407 (1986) 92–99.","ista":"Jonas PM, Vogel W, Arantes E, Giglio J. 1986. Toxin γ of the scorpion Tityus serrulatus modifies both activation and inactivation of sodium permeability of nerve membrane. Pflugers Archiv : European Journal of Physiology. 407(1), 92–99.","ieee":"P. M. Jonas, W. Vogel, E. Arantes, and J. Giglio, “Toxin γ of the scorpion Tityus serrulatus modifies both activation and inactivation of sodium permeability of nerve membrane,” <i>Pflugers Archiv : European Journal of Physiology</i>, vol. 407, no. 1. Springer, pp. 92–99, 1986.","apa":"Jonas, P. M., Vogel, W., Arantes, E., &#38; Giglio, J. (1986). Toxin γ of the scorpion Tityus serrulatus modifies both activation and inactivation of sodium permeability of nerve membrane. <i>Pflugers Archiv : European Journal of Physiology</i>. Springer. <a href=\"https://doi.org/10.1007/BF00580727\">https://doi.org/10.1007/BF00580727</a>","chicago":"Jonas, Peter M, Werner Vogel, Eliane Arantes, and Jose Giglio. “Toxin γ of the Scorpion Tityus Serrulatus Modifies Both Activation and Inactivation of Sodium Permeability of Nerve Membrane.” <i>Pflugers Archiv : European Journal of Physiology</i>. Springer, 1986. <a href=\"https://doi.org/10.1007/BF00580727\">https://doi.org/10.1007/BF00580727</a>."},"publication_status":"published","abstract":[{"lang":"eng","text":"The effects of the major neurotoxic fraction isolated from scorpion venom of Tityus serrulatus, TiTx gamma, on peripheral nerve membrane of Xenopus laevis were studied under current- and voltage-clamp conditions. 700 nmol/l TiTx gamma depolarized the membrane and induced spontaneous activity (150 s-1, maximum value), which ceased within a few minutes. It reduced the amplitude of the action potentials from 109 mV to 52 mV and increased their duration from 1.25 ms to 4.5 ms. 440 nmol/l TiTx gamma induced inward Na current flow at resting potential. The descending branch of the Na current-voltage curve was flattened and shifted approximately 10 mV to more negative potentials. Maximum Na permeability was reduced to about 20%. Both development of and recovery from inactivation of Na permeability were slowed. The steepness of the steady-state inactivation curve was decreased, but the mid-potential changed only insignificantly. No prepulse was necessary to elicit either a shift of activation or an inward current at resting potential. Expressing the toxin effect either in terms of the decrease of Na peak current or of the slowing of inactivation, half-maximum effects were found with 0.3 +/- 0.1 and 3.7 +/- 0.7 mumol/l TiTx gamma, respectively."}],"author":[{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","last_name":"Jonas","full_name":"Jonas, Peter M","first_name":"Peter M"},{"full_name":"Vogel, Werner","last_name":"Vogel","first_name":"Werner"},{"full_name":"Arantes, Eliane","last_name":"Arantes","first_name":"Eliane"},{"full_name":"Giglio, Jose","last_name":"Giglio","first_name":"Jose"}],"date_created":"2018-12-11T12:03:28Z","month":"07","article_type":"original","date_published":"1986-07-01T00:00:00Z","publisher":"Springer","language":[{"iso":"eng"}],"publication":"Pflugers Archiv : European Journal of Physiology","issue":"1","page":"92 - 99","day":"01","type":"journal_article","intvolume":"       407","status":"public"},{"publication":"Congressus Numerantium","date_updated":"2022-02-02T15:58:04Z","publist_id":"2806","volume":53,"article_processing_charge":"No","page":"193 - 200","_id":"3579","publication_identifier":{"issn":["0384-9864"]},"extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","publication_status":"published","citation":{"apa":"Edelsbrunner, H., &#38; Jaromczyk, J. (1986). How often can you see yourself in a convex configuration of mirrors? <i>Congressus Numerantium</i>. Utilitas Mathemtica Publ. Inc.","ieee":"H. Edelsbrunner and J. Jaromczyk, “How often can you see yourself in a convex configuration of mirrors?,” <i>Congressus Numerantium</i>, vol. 53. Utilitas Mathemtica Publ. Inc., pp. 193–200, 1986.","chicago":"Edelsbrunner, Herbert, and Jerzy Jaromczyk. “How Often Can You See Yourself in a Convex Configuration of Mirrors?” <i>Congressus Numerantium</i>. Utilitas Mathemtica Publ. Inc., 1986.","ama":"Edelsbrunner H, Jaromczyk J. How often can you see yourself in a convex configuration of mirrors? <i>Congressus Numerantium</i>. 1986;53:193-200.","mla":"Edelsbrunner, Herbert, and Jerzy Jaromczyk. “How Often Can You See Yourself in a Convex Configuration of Mirrors?” <i>Congressus Numerantium</i>, vol. 53, Utilitas Mathemtica Publ. Inc., 1986, pp. 193–200.","ista":"Edelsbrunner H, Jaromczyk J. 1986. How often can you see yourself in a convex configuration of mirrors? Congressus Numerantium. 53, 193–200.","short":"H. Edelsbrunner, J. Jaromczyk, Congressus Numerantium 53 (1986) 193–200."},"day":"01","type":"journal_article","intvolume":"        53","status":"public","author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jaromczyk","full_name":"Jaromczyk, Jerzy","first_name":"Jerzy"}],"date_created":"2018-12-11T12:04:04Z","month":"01","year":"1986","article_type":"original","date_published":"1986-01-01T00:00:00Z","publisher":"Utilitas Mathemtica Publ. Inc.","title":"How often can you see yourself in a convex configuration of mirrors?","language":[{"iso":"eng"}]},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","_id":"3580","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"extern":"1","date_updated":"2022-02-02T09:36:32Z","volume":1,"publist_id":"2805","article_processing_charge":"No","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"An edge-skeleton in an arrangementA(H) of a finite set of planes inE 3 is a connected collection of edges inA(H). We give a method that constructs a skeleton inO(√n logn) time per edge. This method implies new and more efficient algorithms for a number of structures in computational geometry including order-k power diagrams inE 2 and space cutting trees inE 3.\r\nWe also give a novel method for handling special cases which has the potential to substantially decrease the amount of effort needed to implement geometric algorithms.","lang":"eng"}],"publication_status":"published","citation":{"apa":"Edelsbrunner, H. (1986). Edge-skeletons in arrangements with applications. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/BF01840438\">https://doi.org/10.1007/BF01840438</a>","ieee":"H. Edelsbrunner, “Edge-skeletons in arrangements with applications,” <i>Algorithmica</i>, vol. 1, no. 1–4. Springer, pp. 93–109, 1986.","chicago":"Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” <i>Algorithmica</i>. Springer, 1986. <a href=\"https://doi.org/10.1007/BF01840438\">https://doi.org/10.1007/BF01840438</a>.","mla":"Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” <i>Algorithmica</i>, vol. 1, no. 1–4, Springer, 1986, pp. 93–109, doi:<a href=\"https://doi.org/10.1007/BF01840438\">10.1007/BF01840438</a>.","ama":"Edelsbrunner H. Edge-skeletons in arrangements with applications. <i>Algorithmica</i>. 1986;1(1-4):93-109. doi:<a href=\"https://doi.org/10.1007/BF01840438\">10.1007/BF01840438</a>","short":"H. Edelsbrunner, Algorithmica 1 (1986) 93–109.","ista":"Edelsbrunner H. 1986. Edge-skeletons in arrangements with applications. Algorithmica. 1(1–4), 93–109."},"title":"Edge-skeletons in arrangements with applications","year":"1986","doi":"10.1007/BF01840438","page":"93 - 109","issue":"1-4","publication":"Algorithmica","status":"public","intvolume":"         1","type":"journal_article","day":"01","date_created":"2018-12-11T12:04:04Z","language":[{"iso":"eng"}],"publisher":"Springer","scopus_import":"1","article_type":"original","date_published":"1986-11-01T00:00:00Z","month":"11"},{"date_created":"2018-12-11T12:04:30Z","publisher":"Academic Press","scopus_import":"1","language":[{"iso":"eng"}],"month":"06","article_type":"original","date_published":"1986-06-01T00:00:00Z","issue":"3","publication":"Theoretical Population Biology","page":"407 - 437","intvolume":"        29","status":"public","day":"01","type":"journal_article","title":"Intrachromosomal gene conversion, linkage, and the evolution of multigene families","year":"1986","doi":"10.1016/0040-5809(86)90017-1","_id":"3662","extern":"1","publication_identifier":{"issn":["0040-5809"],"eissn":["1096-0325"]},"acknowledgement":"Supported by National Science Foundation Grant DEB81-03530","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","publist_id":"2721","date_updated":"2022-02-01T15:50:10Z","volume":29,"article_processing_charge":"No","abstract":[{"lang":"eng","text":"The evolution of the probabilities of genetic identity within and between tandemly repeated loci of a multigene family is investigated analytically and numerically. Unbiased intrachromosomal gene conversion, equal crossing over, random genetic drift, and mutation to new alleles are incorporated. Generations are discrete and nonoverlapping; the diploid, monoecious population mates at random. Under the restriction that there is at most one crossover in the multigene family per individual per generation, the dependence on location of the probabilities of identity is treated exactly. In the “homogeneous” approximation to this “exact” model, end effects are disregarded; in the “exchangeable” approximation, to which all previous work was confined, all position dependence is neglected. Numerical results indicate that (i) the exchangeable and homogeneous models are both qualitatively correct, (ii) the exchangeable model is sometimes too inaccurate for quantitative conclusions, and (iii) the homogeneous model is always more accurate than the exchangeable one and is always sufficiently accurate for quantitative conclusions."}],"author":[{"first_name":"Thomas","full_name":"Nagylaki, Thomas","last_name":"Nagylaki"},{"first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","citation":{"apa":"Nagylaki, T., &#38; Barton, N. H. (1986). Intrachromosomal gene conversion, linkage, and the evolution of multigene families. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/0040-5809(86)90017-1\">https://doi.org/10.1016/0040-5809(86)90017-1</a>","ieee":"T. Nagylaki and N. H. Barton, “Intrachromosomal gene conversion, linkage, and the evolution of multigene families,” <i>Theoretical Population Biology</i>, vol. 29, no. 3. Academic Press, pp. 407–437, 1986.","chicago":"Nagylaki, Thomas, and Nicholas H Barton. “Intrachromosomal Gene Conversion, Linkage, and the Evolution of Multigene Families.” <i>Theoretical Population Biology</i>. Academic Press, 1986. <a href=\"https://doi.org/10.1016/0040-5809(86)90017-1\">https://doi.org/10.1016/0040-5809(86)90017-1</a>.","ama":"Nagylaki T, Barton NH. Intrachromosomal gene conversion, linkage, and the evolution of multigene families. <i>Theoretical Population Biology</i>. 1986;29(3):407-437. doi:<a href=\"https://doi.org/10.1016/0040-5809(86)90017-1\">10.1016/0040-5809(86)90017-1</a>","mla":"Nagylaki, Thomas, and Nicholas H. Barton. “Intrachromosomal Gene Conversion, Linkage, and the Evolution of Multigene Families.” <i>Theoretical Population Biology</i>, vol. 29, no. 3, Academic Press, 1986, pp. 407–37, doi:<a href=\"https://doi.org/10.1016/0040-5809(86)90017-1\">10.1016/0040-5809(86)90017-1</a>.","ista":"Nagylaki T, Barton NH. 1986. Intrachromosomal gene conversion, linkage, and the evolution of multigene families. Theoretical Population Biology. 29(3), 407–437.","short":"T. Nagylaki, N.H. Barton, Theoretical Population Biology 29 (1986) 407–437."}},{"status":"public","intvolume":"        56","type":"journal_article","day":"01","page":"409 - 416","issue":"3","publication":"Heredity","language":[{"iso":"eng"}],"publisher":"Nature Publishing Group","scopus_import":"1","article_type":"original","date_published":"1986-06-01T00:00:00Z","month":"06","date_created":"2018-12-11T12:04:30Z","author":[{"first_name":"Nicholas H","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Montgomery","last_name":"Slatkin","full_name":"Slatkin, Montgomery"}],"abstract":[{"lang":"eng","text":"The conditional average frequency of rare alleles has been shown in simulations to provide a simple and robust estimator of the number of individuals exchanged between local populations in an island model (Nm). This statistic is defined as the average frequency of an allele in those samples in which the allele is present. Here, we show that the conditional average frequency can be calculated from the distribution of allele frequencies. It is a measure of the spread of this distribution, and so is analogous to the standardised variance, FST. Analytic predictions for the island model of migration agree well with the corresponding simulation results. These predictions are based on the assumption that the rare alleles found in samples have reached a &quot;quasi-equilibrium&quot; distribution. As well as relating the conditional average frequency to the underlying allele frequency distribution, our results provide a more accurate method of estimating Nm from the conditional average frequency of private alleles in samples of different sizes."}],"publication_status":"published","citation":{"ieee":"N. H. Barton and M. Slatkin, “A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population,” <i>Heredity</i>, vol. 56, no. 3. Nature Publishing Group, pp. 409–416, 1986.","apa":"Barton, N. H., &#38; Slatkin, M. (1986). A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.1986.63\">https://doi.org/10.1038/hdy.1986.63</a>","chicago":"Barton, Nicholas H, and Montgomery Slatkin. “A Quasi-Equilibrium Theory of the Distribution of Rare Alleles in a Subdivided Population.” <i>Heredity</i>. Nature Publishing Group, 1986. <a href=\"https://doi.org/10.1038/hdy.1986.63\">https://doi.org/10.1038/hdy.1986.63</a>.","mla":"Barton, Nicholas H., and Montgomery Slatkin. “A Quasi-Equilibrium Theory of the Distribution of Rare Alleles in a Subdivided Population.” <i>Heredity</i>, vol. 56, no. 3, Nature Publishing Group, 1986, pp. 409–16, doi:<a href=\"https://doi.org/10.1038/hdy.1986.63\">10.1038/hdy.1986.63</a>.","ama":"Barton NH, Slatkin M. A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population. <i>Heredity</i>. 1986;56(3):409-416. doi:<a href=\"https://doi.org/10.1038/hdy.1986.63\">10.1038/hdy.1986.63</a>","ista":"Barton NH, Slatkin M. 1986. A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population. Heredity. 56(3), 409–416.","short":"N.H. Barton, M. Slatkin, Heredity 56 (1986) 409–416."},"acknowledgement":"This research has been supported in part by grants from the Royal Society of London, S.E.R.C., and the National Science Foundation. We thank J. Felsenstein for helpful discussions of this problem.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","_id":"3663","pmid":1,"extern":"1","publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"date_updated":"2022-02-01T15:04:01Z","volume":56,"oa":1,"publist_id":"2720","article_processing_charge":"No","title":"A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population","external_id":{"pmid":["3733460 "]},"doi":"10.1038/hdy.1986.63","year":"1986","main_file_link":[{"url":"https://www.nature.com/articles/hdy198663","open_access":"1"}]},{"language":[{"iso":"eng"}],"publisher":"Nature Publishing Group","scopus_import":"1","article_type":"original","date_published":"1986-01-01T00:00:00Z","month":"01","date_created":"2018-12-11T12:04:30Z","status":"public","intvolume":"        57","type":"journal_article","day":"01","page":"357 - 376","publication":"Heredity","title":"The barrier to genetic exchange between hybridising populations","year":"1986","main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy1986135"}],"author":[{"last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Bengt","last_name":"Bengtsson","full_name":"Bengtsson, Bengt"}],"abstract":[{"lang":"eng","text":"Suppose that selection acts at one or more loci to maintain genetic differences between hybridising populations. Then, the flow of alleles at a neutral marker locus which is linked to these selected loci will be impeded. We define and calculate measures of the barrier to gene flow between two distinct demes, and across a continuous habitat. In both cases, we find that in order for gene flow to be significantly reduced over much of the genome, hybrids must be substantially less fit, and the number of genes involved in building the barrier must be so large that the majority of other genes become closely linked to some locus which is under selection. This conclusion is not greatly affected by the pattern of epistasis, or the position of the marker locus along the chromosome."}],"publication_status":"published","citation":{"ieee":"N. H. Barton and B. Bengtsson, “The barrier to genetic exchange between hybridising populations,” <i>Heredity</i>, vol. 57. Nature Publishing Group, pp. 357–376, 1986.","apa":"Barton, N. H., &#38; Bengtsson, B. (1986). The barrier to genetic exchange between hybridising populations. <i>Heredity</i>. Nature Publishing Group.","chicago":"Barton, Nicholas H, and Bengt Bengtsson. “The Barrier to Genetic Exchange between Hybridising Populations.” <i>Heredity</i>. Nature Publishing Group, 1986.","ama":"Barton NH, Bengtsson B. The barrier to genetic exchange between hybridising populations. <i>Heredity</i>. 1986;57:357-376.","mla":"Barton, Nicholas H., and Bengt Bengtsson. “The Barrier to Genetic Exchange between Hybridising Populations.” <i>Heredity</i>, vol. 57, Nature Publishing Group, 1986, pp. 357–76.","short":"N.H. Barton, B. Bengtsson, Heredity 57 (1986) 357–376.","ista":"Barton NH, Bengtsson B. 1986. The barrier to genetic exchange between hybridising populations. Heredity. 57, 357–376."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"Published Version","quality_controlled":"1","_id":"3664","extern":"1","publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"date_updated":"2022-02-01T14:49:02Z","publist_id":"2719","volume":57,"oa":1,"article_processing_charge":"No"},{"scopus_import":"1","publisher":"Nature Publishing Group","language":[{"iso":"eng"}],"month":"01","date_published":"1986-01-01T00:00:00Z","article_type":"original","date_created":"2018-12-11T12:04:30Z","intvolume":"        57","status":"public","day":"01","type":"journal_article","publication":"Heredity","page":"415 - 426","title":"The effects of linkage and density-dependent regulation on gene flow","year":"1986","main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy1986142"}],"abstract":[{"text":"The rate of gene flow across a hybrid zone may be reduced by the presence of a physical barrier, by a reduction of population density caused by reduced fitness of hybrids (the “hybrid sink” effect), and by linkage. If the reduction in hybrid fitness is not extreme, the strength of the barrier to gene flow caused by these effects is. Here, w is the width of the cline; ρ* is the carrying capacity; W̄* is the mean fitness of the population, excluding effects of density; R is the strength of density-dependent regulation; and r̄ is the harmonic mean recombination rate between the locus whose flow is being calculated, and loci under selection. +, 0 denote populations outside the hybrid zone, and at its centre, respectively. This relation is illustrated using data from hybrid ones in Bombina and Podisma, and its implications for interpretation of data from nature are discussed.","lang":"eng"}],"author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"}],"citation":{"ama":"Barton NH. The effects of linkage and density-dependent regulation on gene flow. <i>Heredity</i>. 1986;57:415-426.","mla":"Barton, Nicholas H. “The Effects of Linkage and Density-Dependent Regulation on Gene Flow.” <i>Heredity</i>, vol. 57, Nature Publishing Group, 1986, pp. 415–26.","ista":"Barton NH. 1986. The effects of linkage and density-dependent regulation on gene flow. Heredity. 57, 415–426.","short":"N.H. Barton, Heredity 57 (1986) 415–426.","apa":"Barton, N. H. (1986). The effects of linkage and density-dependent regulation on gene flow. <i>Heredity</i>. Nature Publishing Group.","ieee":"N. H. Barton, “The effects of linkage and density-dependent regulation on gene flow,” <i>Heredity</i>, vol. 57. Nature Publishing Group, pp. 415–426, 1986.","chicago":"Barton, Nicholas H. “The Effects of Linkage and Density-Dependent Regulation on Gene Flow.” <i>Heredity</i>. Nature Publishing Group, 1986."},"publication_status":"published","publication_identifier":{"eissn":["1365-2540"],"issn":["0018-067X"]},"extern":"1","_id":"3665","oa_version":"Published Version","quality_controlled":"1","acknowledgement":"I would like to thank Shahin Rouhani and Richard Nichols for their helpful comments on the manuscript, and the latter for providing the data used in fig. 3. This work was supported by a grant from the Science and Engineering Research Council (GR/C/91529).","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","publist_id":"2718","volume":57,"oa":1,"date_updated":"2022-02-01T14:31:29Z"},{"publication_status":"published","citation":{"chicago":"Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/0097-3165(86)90075-0\">https://doi.org/10.1016/0097-3165(86)90075-0</a>.","ieee":"H. Edelsbrunner and G. Stöckl, “The number of extreme pairs of finite point-sets in Euclidean spaces,” <i>Journal of Combinatorial Theory Series A</i>, vol. 43, no. 2. Elsevier, pp. 344–349, 1986.","apa":"Edelsbrunner, H., &#38; Stöckl, G. (1986). The number of extreme pairs of finite point-sets in Euclidean spaces. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/0097-3165(86)90075-0\">https://doi.org/10.1016/0097-3165(86)90075-0</a>","ista":"Edelsbrunner H, Stöckl G. 1986. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 43(2), 344–349.","short":"H. Edelsbrunner, G. Stöckl, Journal of Combinatorial Theory Series A 43 (1986) 344–349.","ama":"Edelsbrunner H, Stöckl G. The number of extreme pairs of finite point-sets in Euclidean spaces. <i>Journal of Combinatorial Theory Series A</i>. 1986;43(2):344-349. doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90075-0\">10.1016/0097-3165(86)90075-0</a>","mla":"Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” <i>Journal of Combinatorial Theory Series A</i>, vol. 43, no. 2, Elsevier, 1986, pp. 344–49, doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90075-0\">10.1016/0097-3165(86)90075-0</a>."},"abstract":[{"text":"To points p and q of a finite set S in d-dimensional Euclidean space Ed are extreme if {p, q} = S ∩ h, for some open halfspace h. Let e2(d)(n) be the maximum number of extreme pairs realized by any n points in Ed. We give geometric proofs of , if n⩾4, and e2(3)(n) = 3n−6, if n⩾6. These results settle the question since all other cases are trivial.","lang":"eng"}],"author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Stöckl, Gerd","last_name":"Stöckl","first_name":"Gerd"}],"volume":43,"oa":1,"date_updated":"2022-02-01T14:02:41Z","publist_id":"2020","article_processing_charge":"No","_id":"4098","extern":"1","publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","quality_controlled":"1","year":"1986","doi":"10.1016/0097-3165(86)90075-0","title":"The number of extreme pairs of finite point-sets in Euclidean spaces","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/0097316586900750?via%3Dihub"}],"day":"01","type":"journal_article","intvolume":"        43","status":"public","issue":"2","publication":"Journal of Combinatorial Theory Series A","page":"344 - 349","month":"11","date_published":"1986-11-01T00:00:00Z","article_type":"original","publisher":"Elsevier","scopus_import":"1","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:06:56Z"},{"language":[{"iso":"eng"}],"publisher":"Elsevier","date_published":"1986-11-24T00:00:00Z","article_type":"original","month":"11","date_created":"2018-12-11T12:06:56Z","status":"public","intvolume":"        23","type":"journal_article","day":"24","page":"289 - 293","publication":"Information Processing Letters","issue":"5","title":"Halfplanar range search in linear space and O(n0.695) query time","year":"1986","doi":"10.1016/0020-0190(86)90088-8","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Emo","full_name":"Welzl, Emo","last_name":"Welzl"}],"abstract":[{"lang":"eng","text":"Let S denote a set of n points in the Euclidean plane. A halfplanar range query specifies a halfplane h and requires the determination of the number of points in S which are contained in h. A new data structure is described which stores S in O(n) space and allows us to answer a halfplanar range query in O(nlog2(1+√5)−1) time in the worst case, thus improving the best result known before. The structure can be built in O(n log n) time."}],"citation":{"ista":"Edelsbrunner H, Welzl E. 1986. Halfplanar range search in linear space and O(n0.695) query time. Information Processing Letters. 23(5), 289–293.","short":"H. Edelsbrunner, E. Welzl, Information Processing Letters 23 (1986) 289–293.","mla":"Edelsbrunner, Herbert, and Emo Welzl. “Halfplanar Range Search in Linear Space and O(N0.695) Query Time.” <i>Information Processing Letters</i>, vol. 23, no. 5, Elsevier, 1986, pp. 289–93, doi:<a href=\"https://doi.org/10.1016/0020-0190(86)90088-8\">10.1016/0020-0190(86)90088-8</a>.","ama":"Edelsbrunner H, Welzl E. Halfplanar range search in linear space and O(n0.695) query time. <i>Information Processing Letters</i>. 1986;23(5):289-293. doi:<a href=\"https://doi.org/10.1016/0020-0190(86)90088-8\">10.1016/0020-0190(86)90088-8</a>","chicago":"Edelsbrunner, Herbert, and Emo Welzl. “Halfplanar Range Search in Linear Space and O(N0.695) Query Time.” <i>Information Processing Letters</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/0020-0190(86)90088-8\">https://doi.org/10.1016/0020-0190(86)90088-8</a>.","ieee":"H. Edelsbrunner and E. Welzl, “Halfplanar range search in linear space and O(n0.695) query time,” <i>Information Processing Letters</i>, vol. 23, no. 5. Elsevier, pp. 289–293, 1986.","apa":"Edelsbrunner, H., &#38; Welzl, E. (1986). Halfplanar range search in linear space and O(n0.695) query time. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(86)90088-8\">https://doi.org/10.1016/0020-0190(86)90088-8</a>"},"publication_status":"published","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"We thank W. Bucher for help in the analysis of the time complexity of the query algorithm. ","publication_identifier":{"issn":["0020-0190"],"eissn":["1872-6119"]},"extern":"1","_id":"4099","article_processing_charge":"No","publist_id":"2021","date_updated":"2022-02-01T14:17:10Z","volume":23},{"article_processing_charge":"No","volume":41,"publist_id":"2015","oa":1,"date_updated":"2022-02-01T09:46:55Z","extern":"1","publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"_id":"4103","oa_version":"Published Version","quality_controlled":"1","acknowledgement":"The second author thanks Gan Gusfield for useful discussion.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"short":"H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 41 (1986) 159–166.","ista":"Edelsbrunner H, Welzl E. 1986. On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. 41(2), 159–166.","mla":"Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” <i>Journal of Combinatorial Theory Series A</i>, vol. 41, no. 2, Elsevier, 1986, pp. 159–66, doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">10.1016/0097-3165(86)90078-6</a>.","ama":"Edelsbrunner H, Welzl E. On the maximal number of edges of many faces in an arrangement. <i>Journal of Combinatorial Theory Series A</i>. 1986;41(2):159-166. doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">10.1016/0097-3165(86)90078-6</a>","chicago":"Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">https://doi.org/10.1016/0097-3165(86)90078-6</a>.","ieee":"H. Edelsbrunner and E. Welzl, “On the maximal number of edges of many faces in an arrangement,” <i>Journal of Combinatorial Theory Series A</i>, vol. 41, no. 2. Elsevier, pp. 159–166, 1986.","apa":"Edelsbrunner, H., &#38; Welzl, E. (1986). On the maximal number of edges of many faces in an arrangement. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">https://doi.org/10.1016/0097-3165(86)90078-6</a>"},"publication_status":"published","abstract":[{"lang":"eng","text":"Let A be an arrangement of n lines in the plane. Suppose F1,…, Fk are faces in the dissection induced by A and that Fi is a t(Fi)-gon. We give asymptotic bounds on the maximal sum ∑i=1kt(Fi) which can be realized by k different faces in an arrangement of n lines. The results improve known bounds for k of higher order than n(1/2)."}],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"first_name":"Emo","full_name":"Welzl, Emo","last_name":"Welzl"}],"main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/0097316586900786?via%3Dihub"}],"doi":"10.1016/0097-3165(86)90078-6","year":"1986","title":"On the maximal number of edges of many faces in an arrangement","publication":"Journal of Combinatorial Theory Series A","issue":"2","page":"159 - 166","day":"01","type":"journal_article","intvolume":"        41","status":"public","date_created":"2018-12-11T12:06:57Z","month":"11","date_published":"1986-11-01T00:00:00Z","scopus_import":"1","publisher":"Elsevier","language":[{"iso":"eng"}]},{"title":"Optimal point location in a monotone subdivision","doi":"10.1137/0215023","year":"1986","extern":"1","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"_id":"4104","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"We would like to thank Andrei Broder, Dan Greene, Mary Claire van Leunen, Greg Nelson, Lyle Ramshaw, and F. Frances Yao, whose comments and suggestions have greatly improved the readability of this paper.","article_processing_charge":"No","volume":15,"publist_id":"2016","date_updated":"2022-02-01T10:05:55Z","abstract":[{"lang":"eng","text":"Point location, often known in graphics as “hit detection,” is one of the fundamental problems of computational geometry. In a point location query we want to identify which of a given collection of geometric objects contains a particular point. Let $\\mathcal{S}$ denote a subdivision of the Euclidean plane into monotone regions by a straight-line graph of $m$ edges. In this paper we exhibit a substantial refinement of the technique of Lee and Preparata [SIAM J. Comput., 6 (1977), pp. 594–606] for locating a point in $\\mathcal{S}$ based on separating chains. The new data structure, called a layered dag, can be built in $O(m)$ time, uses $O(m)$ storage, and makes possible point location in $O(\\log m)$ time. Unlike previous structures that attain these optimal bounds, the layered dag can be implemented in a simple and practical way, and is extensible to subdivisions with edges more general than straight-line segments.\r\n© 1986 Society for Industrial and Applied Mathematics"}],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"first_name":"Leonidas","last_name":"Guibas","full_name":"Guibas, Leonidas"},{"first_name":"Jorge","last_name":"Stolfi","full_name":"Stolfi, Jorge"}],"citation":{"ista":"Edelsbrunner H, Guibas L, Stolfi J. 1986. Optimal point location in a monotone subdivision. SIAM Journal on Computing. 15(2), 317–340.","short":"H. Edelsbrunner, L. Guibas, J. Stolfi, SIAM Journal on Computing 15 (1986) 317–340.","ama":"Edelsbrunner H, Guibas L, Stolfi J. Optimal point location in a monotone subdivision. <i>SIAM Journal on Computing</i>. 1986;15(2):317-340. doi:<a href=\"https://doi.org/10.1137/0215023\">10.1137/0215023</a>","mla":"Edelsbrunner, Herbert, et al. “Optimal Point Location in a Monotone Subdivision.” <i>SIAM Journal on Computing</i>, vol. 15, no. 2, SIAM, 1986, pp. 317–40, doi:<a href=\"https://doi.org/10.1137/0215023\">10.1137/0215023</a>.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, and Jorge Stolfi. “Optimal Point Location in a Monotone Subdivision.” <i>SIAM Journal on Computing</i>. SIAM, 1986. <a href=\"https://doi.org/10.1137/0215023\">https://doi.org/10.1137/0215023</a>.","ieee":"H. Edelsbrunner, L. Guibas, and J. Stolfi, “Optimal point location in a monotone subdivision,” <i>SIAM Journal on Computing</i>, vol. 15, no. 2. SIAM, pp. 317–340, 1986.","apa":"Edelsbrunner, H., Guibas, L., &#38; Stolfi, J. (1986). Optimal point location in a monotone subdivision. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0215023\">https://doi.org/10.1137/0215023</a>"},"publication_status":"published","date_created":"2018-12-11T12:06:58Z","scopus_import":"1","publisher":"SIAM","language":[{"iso":"eng"}],"month":"01","article_type":"original","date_published":"1986-01-01T00:00:00Z","publication":"SIAM Journal on Computing","issue":"2","page":"317 - 340","intvolume":"        15","status":"public","day":"01","type":"journal_article"},{"month":"01","date_published":"1986-01-01T00:00:00Z","article_type":"original","scopus_import":"1","publisher":"SIAM","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:06:58Z","day":"01","type":"journal_article","intvolume":"        15","status":"public","publication":"SIAM Journal on Computing","issue":"2","page":"341 - 363","doi":"10.1137/0215024","year":"1986","title":"Constructing arrangements of lines and hyperplanes with applications","citation":{"mla":"Edelsbrunner, Herbert, et al. “Constructing Arrangements of Lines and Hyperplanes with Applications.” <i>SIAM Journal on Computing</i>, vol. 15, no. 2, SIAM, 1986, pp. 341–63, doi:<a href=\"https://doi.org/10.1137/0215024\">10.1137/0215024</a>.","ama":"Edelsbrunner H, O’Rourke J, Seidel R. Constructing arrangements of lines and hyperplanes with applications. <i>SIAM Journal on Computing</i>. 1986;15(2):341-363. doi:<a href=\"https://doi.org/10.1137/0215024\">10.1137/0215024</a>","short":"H. Edelsbrunner, J. O’Rourke, R. Seidel, SIAM Journal on Computing 15 (1986) 341–363.","ista":"Edelsbrunner H, O’Rourke J, Seidel R. 1986. Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing. 15(2), 341–363.","ieee":"H. Edelsbrunner, J. O’Rourke, and R. Seidel, “Constructing arrangements of lines and hyperplanes with applications,” <i>SIAM Journal on Computing</i>, vol. 15, no. 2. SIAM, pp. 341–363, 1986.","apa":"Edelsbrunner, H., O’Rourke, J., &#38; Seidel, R. (1986). Constructing arrangements of lines and hyperplanes with applications. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0215024\">https://doi.org/10.1137/0215024</a>","chicago":"Edelsbrunner, Herbert, Joseph O’Rourke, and Raimund Seidel. “Constructing Arrangements of Lines and Hyperplanes with Applications.” <i>SIAM Journal on Computing</i>. SIAM, 1986. <a href=\"https://doi.org/10.1137/0215024\">https://doi.org/10.1137/0215024</a>."},"publication_status":"published","abstract":[{"lang":"eng","text":"A finite set of lines partitions the Euclidean plane into a cell complex. Similarly, a finite set of $(d - 1)$-dimensional hyperplanes partitions $d$-dimensional Euclidean space. An algorithm is presented that constructs a representation for the cell complex defined by $n$ hyperplanes in optimal $O(n^d )$ time in $d$ dimensions. It relies on a combinatorial result that is of interest in its own right. The algorithm is shown to lead to new methods for computing $\\lambda $-matrices, constructing all higher-order Voronoi diagrams, halfspatial range estimation, degeneracy testing, and finding minimum measure simplices. In all five applications, the new algorithms are asymptotically faster than previous results, and in several cases are the only known methods that generalize to arbitrary dimensions. The algorithm also implies an upper bound of $2^{cn^d } $, $c$ a positive constant, for the number of combinatorially distinct arrangements of $n$ hyperplanes in $E^d $.\r\n© 1986 Society for Industrial and Applied Mathematics"}],"author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"O'Rourke, Joseph","last_name":"O'Rourke","first_name":"Joseph"},{"first_name":"Raimund","full_name":"Seidel, Raimund","last_name":"Seidel"}],"article_processing_charge":"No","date_updated":"2022-02-01T11:03:07Z","volume":15,"publist_id":"2017","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"extern":"1","_id":"4105","quality_controlled":"1","oa_version":"None","acknowledgement":"We thank Emmerich Welzl for discussions on Theorem 2.7. We also thank Friedrich Huber for implementing the \r\nconstruction of arrangements in arbitrary dimensions, and Gerd Stoeckl for implementing the algorithms presented in §§\r\n4.1 and 4.3. The third author wishes to thank Jack Edmonds for the many enlightening discussions.\r\n","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"title":"Computing a ham-sandwich cut in two dimensions","doi":"10.1016/S0747-7171(86)80020-7","year":"1986","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert"},{"first_name":"Roman","full_name":"Waupotitsch, Roman","last_name":"Waupotitsch"}],"abstract":[{"lang":"eng","text":"Let B be a set of nb black points and W a set of nw, white points in the Euclidean plane. A line h is said to bisect B (or W) if, at most, half of the points of B (or W) lie on any one side of h. A line that bisects both B and W is called a ham-sandwich cut of B and W. We give an algorithm that computes a ham-sandwich cut of B and W in 0((nh+nw) log (min {nb, nw}+ 1)) time. The algorithm is considerably simpler than the previous most efficient one which takes 0((nb + nw) log (nb + nw)) time."}],"publication_status":"published","citation":{"ista":"Edelsbrunner H, Waupotitsch R. 1986. Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation. 2(2), 171–178.","short":"H. Edelsbrunner, R. Waupotitsch, Journal of Symbolic Computation 2 (1986) 171–178.","ama":"Edelsbrunner H, Waupotitsch R. Computing a ham-sandwich cut in two dimensions. <i>Journal of Symbolic Computation</i>. 1986;2(2):171-178. doi:<a href=\"https://doi.org/10.1016/S0747-7171(86)80020-7\">10.1016/S0747-7171(86)80020-7</a>","mla":"Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.” <i>Journal of Symbolic Computation</i>, vol. 2, no. 2, Elsevier, 1986, pp. 171–78, doi:<a href=\"https://doi.org/10.1016/S0747-7171(86)80020-7\">10.1016/S0747-7171(86)80020-7</a>.","chicago":"Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.” <i>Journal of Symbolic Computation</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/S0747-7171(86)80020-7\">https://doi.org/10.1016/S0747-7171(86)80020-7</a>.","ieee":"H. Edelsbrunner and R. Waupotitsch, “Computing a ham-sandwich cut in two dimensions,” <i>Journal of Symbolic Computation</i>, vol. 2, no. 2. Elsevier, pp. 171–178, 1986.","apa":"Edelsbrunner, H., &#38; Waupotitsch, R. (1986). Computing a ham-sandwich cut in two dimensions. <i>Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0747-7171(86)80020-7\">https://doi.org/10.1016/S0747-7171(86)80020-7</a>"},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","_id":"4106","publication_identifier":{"eissn":["1095-855X"],"issn":["0747-7171"]},"extern":"1","publist_id":"2018","volume":2,"date_updated":"2022-02-01T11:22:59Z","article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"Elsevier","scopus_import":"1","date_published":"1986-01-01T00:00:00Z","article_type":"original","month":"01","date_created":"2018-12-11T12:06:58Z","status":"public","intvolume":"         2","type":"journal_article","day":"01","page":"171 - 178","issue":"2","publication":"Journal of Symbolic Computation"},{"abstract":[{"lang":"eng","text":"A set of m planes dissects E3 into cells, facets, edges and vertices. Letting deg(c) be the number of facets that bound a cellc, we give exact and asymptotic bounds on the maximum of ∈cinCdeg(c), if C is a family of cells of the arrangement with fixed cardinality."}],"author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"David","full_name":"Haussler, David","last_name":"Haussler"}],"publication_status":"published","citation":{"chicago":"Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.” <i>Discrete Mathematics</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/0012-365X(86)90008-7\">https://doi.org/10.1016/0012-365X(86)90008-7</a>.","ieee":"H. Edelsbrunner and D. Haussler, “The complexity of cells in 3-dimensional arrangements,” <i>Discrete Mathematics</i>, vol. 60, no. C. Elsevier, pp. 139–146, 1986.","apa":"Edelsbrunner, H., &#38; Haussler, D. (1986). The complexity of cells in 3-dimensional arrangements. <i>Discrete Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/0012-365X(86)90008-7\">https://doi.org/10.1016/0012-365X(86)90008-7</a>","ista":"Edelsbrunner H, Haussler D. 1986. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 60(C), 139–146.","short":"H. Edelsbrunner, D. Haussler, Discrete Mathematics 60 (1986) 139–146.","mla":"Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.” <i>Discrete Mathematics</i>, vol. 60, no. C, Elsevier, 1986, pp. 139–46, doi:<a href=\"https://doi.org/10.1016/0012-365X(86)90008-7\">10.1016/0012-365X(86)90008-7</a>.","ama":"Edelsbrunner H, Haussler D. The complexity of cells in 3-dimensional arrangements. <i>Discrete Mathematics</i>. 1986;60(C):139-146. doi:<a href=\"https://doi.org/10.1016/0012-365X(86)90008-7\">10.1016/0012-365X(86)90008-7</a>"},"_id":"4107","publication_identifier":{"issn":["0012-365X"],"eissn":["1872-681X"]},"extern":"1","acknowledgement":"Research reported in the paper was conducted while the second author was visiting the Technical University of Graz. Support provided by the Technical University for this visit is gratefully acknowledged. ","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","volume":60,"date_updated":"2022-02-01T12:44:50Z","publist_id":"2019","article_processing_charge":"No","title":"The complexity of cells in 3-dimensional arrangements","doi":"10.1016/0012-365X(86)90008-7","year":"1986","intvolume":"        60","status":"public","day":"01","type":"journal_article","issue":"C","publication":"Discrete Mathematics","page":"139 - 146","publisher":"Elsevier","language":[{"iso":"eng"}],"month":"06","date_published":"1986-06-01T00:00:00Z","article_type":"original","date_created":"2018-12-11T12:06:59Z"},{"language":[{"iso":"eng"}],"publisher":"Springer","date_published":"1986-01-01T00:00:00Z","article_type":"original","month":"01","date_created":"2018-12-11T12:06:59Z","status":"public","intvolume":"         1","type":"journal_article","day":"01","page":"25 - 44","issue":"1","publication":"Discrete & Computational Geometry","title":"Voronoi diagrams and arrangements","doi":"10.1007/BF02187681","year":"1986","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Raimund","last_name":"Seidel","full_name":"Seidel, Raimund"}],"abstract":[{"lang":"eng","text":"We propose a uniform and general framework for defining and dealing with Voronoi diagrams. In this framework a Voronoi diagram is a partition of a domainD induced by a finite number of real valued functions onD. Valuable insight can be gained when one considers how these real valued functions partitionD ×R. With this view it turns out that the standard Euclidean Voronoi diagram of point sets inR d along with its order-k generalizations are intimately related to certain arrangements of hyperplanes. This fact can be used to obtain new Voronoi diagram algorithms. We also discuss how the formalism of arrangements can be used to solve certain intersection and union problems."}],"publication_status":"published","citation":{"apa":"Edelsbrunner, H., &#38; Seidel, R. (1986). Voronoi diagrams and arrangements. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187681\">https://doi.org/10.1007/BF02187681</a>","ieee":"H. Edelsbrunner and R. Seidel, “Voronoi diagrams and arrangements,” <i>Discrete &#38; Computational Geometry</i>, vol. 1, no. 1. Springer, pp. 25–44, 1986.","chicago":"Edelsbrunner, Herbert, and Raimund Seidel. “Voronoi Diagrams and Arrangements.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1986. <a href=\"https://doi.org/10.1007/BF02187681\">https://doi.org/10.1007/BF02187681</a>.","mla":"Edelsbrunner, Herbert, and Raimund Seidel. “Voronoi Diagrams and Arrangements.” <i>Discrete &#38; Computational Geometry</i>, vol. 1, no. 1, Springer, 1986, pp. 25–44, doi:<a href=\"https://doi.org/10.1007/BF02187681\">10.1007/BF02187681</a>.","ama":"Edelsbrunner H, Seidel R. Voronoi diagrams and arrangements. <i>Discrete &#38; Computational Geometry</i>. 1986;1(1):25-44. doi:<a href=\"https://doi.org/10.1007/BF02187681\">10.1007/BF02187681</a>","short":"H. Edelsbrunner, R. Seidel, Discrete &#38; Computational Geometry 1 (1986) 25–44.","ista":"Edelsbrunner H, Seidel R. 1986. Voronoi diagrams and arrangements. Discrete &#38; Computational Geometry. 1(1), 25–44."},"acknowledgement":"We would like to thank John Gilbert for his careful reading of the manuscript and his many suggestions for improvement. We also want to thank Bennett Battaile, Gianfranco Bilardi, Joseph O'Rourke, and Chee Yap for their comments. ","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","quality_controlled":"1","_id":"4108","extern":"1","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"publist_id":"2012","date_updated":"2022-02-01T08:53:39Z","volume":1,"article_processing_charge":"No"},{"publication_identifier":{"eissn":["1460-2067"],"issn":["0010-4620"]},"extern":"1","_id":"4109","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"Computer Journal","issue":"1","article_processing_charge":"No","page":"76 - 82","publist_id":"2013","volume":29,"date_updated":"2022-02-01T09:17:51Z","abstract":[{"text":"Rectangle location search in d dimensions is finding the d-dimensional axis-parallel box of a non-overlapping collection C that contains a query point. A new data structure is proposed that requires optimal space and 0(logd|C|) time for a search. The significance of this data structure in practical applications is substantiated by empirical examinations of its behaviour.","lang":"eng"}],"intvolume":"        29","status":"public","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"last_name":"Haring","full_name":"Haring, Günter","first_name":"Günter"},{"first_name":"D","full_name":"Hilbert, D","last_name":"Hilbert"}],"citation":{"chicago":"Edelsbrunner, Herbert, Günter Haring, and D Hilbert. “Rectangular Point Location in D-Dimensions with Applications.” <i>Computer Journal</i>. Oxford University Press, 1986. <a href=\"https://doi.org/10.1093/comjnl/29.1.76\">https://doi.org/10.1093/comjnl/29.1.76</a>.","apa":"Edelsbrunner, H., Haring, G., &#38; Hilbert, D. (1986). Rectangular point location in d-dimensions with applications. <i>Computer Journal</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/comjnl/29.1.76\">https://doi.org/10.1093/comjnl/29.1.76</a>","ieee":"H. Edelsbrunner, G. Haring, and D. Hilbert, “Rectangular point location in d-dimensions with applications,” <i>Computer Journal</i>, vol. 29, no. 1. Oxford University Press, pp. 76–82, 1986.","ista":"Edelsbrunner H, Haring G, Hilbert D. 1986. Rectangular point location in d-dimensions with applications. Computer Journal. 29(1), 76–82.","short":"H. Edelsbrunner, G. Haring, D. Hilbert, Computer Journal 29 (1986) 76–82.","mla":"Edelsbrunner, Herbert, et al. “Rectangular Point Location in D-Dimensions with Applications.” <i>Computer Journal</i>, vol. 29, no. 1, Oxford University Press, 1986, pp. 76–82, doi:<a href=\"https://doi.org/10.1093/comjnl/29.1.76\">10.1093/comjnl/29.1.76</a>.","ama":"Edelsbrunner H, Haring G, Hilbert D. Rectangular point location in d-dimensions with applications. <i>Computer Journal</i>. 1986;29(1):76-82. doi:<a href=\"https://doi.org/10.1093/comjnl/29.1.76\">10.1093/comjnl/29.1.76</a>"},"day":"01","publication_status":"published","type":"journal_article","date_created":"2018-12-11T12:06:59Z","title":"Rectangular point location in d-dimensions with applications","publisher":"Oxford University Press","language":[{"iso":"eng"}],"month":"01","year":"1986","doi":"10.1093/comjnl/29.1.76","article_type":"original","date_published":"1986-01-01T00:00:00Z"},{"day":"01","type":"journal_article","intvolume":"        15","status":"public","issue":"1","publication":"SIAM Journal on Computing","page":"271 - 284","month":"01","date_published":"1986-01-01T00:00:00Z","article_type":"original","publisher":"SIAM","scopus_import":"1","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:07:00Z","publication_status":"published","citation":{"apa":"Edelsbrunner, H., &#38; Welzl, E. (1986). Constructing belts in two-dimensional arrangements with applications. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0215019\">https://doi.org/10.1137/0215019</a>","ieee":"H. Edelsbrunner and E. Welzl, “Constructing belts in two-dimensional arrangements with applications,” <i>SIAM Journal on Computing</i>, vol. 15, no. 1. SIAM, pp. 271–284, 1986.","chicago":"Edelsbrunner, Herbert, and Emo Welzl. “Constructing Belts in Two-Dimensional Arrangements with Applications.” <i>SIAM Journal on Computing</i>. SIAM, 1986. <a href=\"https://doi.org/10.1137/0215019\">https://doi.org/10.1137/0215019</a>.","mla":"Edelsbrunner, Herbert, and Emo Welzl. “Constructing Belts in Two-Dimensional Arrangements with Applications.” <i>SIAM Journal on Computing</i>, vol. 15, no. 1, SIAM, 1986, pp. 271–84, doi:<a href=\"https://doi.org/10.1137/0215019\">10.1137/0215019</a>.","ama":"Edelsbrunner H, Welzl E. Constructing belts in two-dimensional arrangements with applications. <i>SIAM Journal on Computing</i>. 1986;15(1):271-284. doi:<a href=\"https://doi.org/10.1137/0215019\">10.1137/0215019</a>","short":"H. Edelsbrunner, E. Welzl, SIAM Journal on Computing 15 (1986) 271–284.","ista":"Edelsbrunner H, Welzl E. 1986. Constructing belts in two-dimensional arrangements with applications. SIAM Journal on Computing. 15(1), 271–284."},"abstract":[{"lang":"eng","text":"For H a set of lines in the Euclidean plane, $A(H)$ denotes the induced dissection, called the arrangement of H. We define the notion of a belt in $A(H)$, which is bounded by a subset of the edges in $A(H)$, and describe two algorithms for constructing belts. All this is motivated by applications to a host of seemingly unrelated problems including a type of range search and finding the minimum area triangle with the vertices taken from some finite set of points."}],"author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Emo","full_name":"Welzl, Emo","last_name":"Welzl"}],"volume":15,"date_updated":"2022-02-01T09:34:20Z","publist_id":"2014","article_processing_charge":"No","_id":"4110","extern":"1","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","doi":"10.1137/0215019","year":"1986","title":"Constructing belts in two-dimensional arrangements with applications"},{"page":"1141 - 1159","article_processing_charge":"No","date_updated":"2022-01-31T15:31:37Z","volume":40,"publist_id":"1724","publication":"Evolution; International Journal of Organic Evolution","quality_controlled":"1","oa_version":"None","acknowledgement":"We are grateful to J. Mitton and W. P. Hall for their suggestions and help with earlier versions of the statistical analysis. The manuscript was much improved by the helpful comments of Dorothy Currie, Gunther Gollmann, Godfrey Hewitt, Julian MacLean, and Jim Mallet. Thanks are also due to Tina Tsang for her careful typing. This work was supported by  the Exchange Agreement between the Polish Academy of Sciences and the Royal Society, and by grants from the Polish Academy of Sciences (project MR-II/6), the Royal Society, the Nuffield Foundation, and the  Science and Engineering Research Council. ","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"_id":"4321","type":"journal_article","citation":{"short":"J. Szymura, N.H. Barton, Evolution; International Journal of Organic Evolution 40 (1986) 1141–1159.","ista":"Szymura J, Barton NH. 1986. Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland. Evolution; International Journal of Organic Evolution. 40, 1141–1159.","mla":"Szymura, Jacek, and Nicholas H. Barton. “Genetic Analysis of a Hybrid Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata, near Cracow in Southern Poland.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 40, Society for the Study of Evolution, 1986, pp. 1141–59, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1986.tb05740.x\">10.1111/j.1558-5646.1986.tb05740.x</a>.","ama":"Szymura J, Barton NH. Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland. <i>Evolution; International Journal of Organic Evolution</i>. 1986;40:1141-1159. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1986.tb05740.x\">10.1111/j.1558-5646.1986.tb05740.x</a>","chicago":"Szymura, Jacek, and Nicholas H Barton. “Genetic Analysis of a Hybrid Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata, near Cracow in Southern Poland.” <i>Evolution; International Journal of Organic Evolution</i>. Society for the Study of Evolution, 1986. <a href=\"https://doi.org/10.1111/j.1558-5646.1986.tb05740.x\">https://doi.org/10.1111/j.1558-5646.1986.tb05740.x</a>.","apa":"Szymura, J., &#38; Barton, N. H. (1986). Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland. <i>Evolution; International Journal of Organic Evolution</i>. Society for the Study of Evolution. <a href=\"https://doi.org/10.1111/j.1558-5646.1986.tb05740.x\">https://doi.org/10.1111/j.1558-5646.1986.tb05740.x</a>","ieee":"J. Szymura and N. H. Barton, “Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 40. Society for the Study of Evolution, pp. 1141–1159, 1986."},"day":"01","publication_status":"published","status":"public","author":[{"first_name":"Jacek","full_name":"Szymura, Jacek","last_name":"Szymura"},{"full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"The fire-bellied toads Bombina bombina and B. variegata differ extensively in biochemistry, morphology, and behavior. We use a survey of five diagnostic enzyme loci across the hybrid zone near Cracow in Southern Poland to estimate the dispersal rate, selection pressures, and numbers of loci which maintain this zone. The enzyme clines coincide closely with each other and with morphological and mitochondrial DNA clines. Although the zone lies on a broad transition between environments suitable for bombina and variegata, the close concordance of diverse characters, together with increased aberrations and mortality in hybrids, suggest that the zone is maintained largely by selection against hybrids. There are strong “linkage disequilibria” between each pair of (unlinked) enzyme loci (R̄ = 0.129 [2-unit support limits: 0.119–0.139]). These are probably caused by gene flow into the zone, and they give an estimate of dispersal (σ = 890 [790–940] m gen−½). The clines are sharply stepped, with most of the change occurring within 6.15 (5.45–6.45) km, but with long tails of introgression on either side. This implies that the effective selection pressure on each enzyme marker (due largely to disequilibrium with other loci) is s* = 0.17 (0.159–0.181) at the center but that the selection acting directly on the enzyme loci is weak or zero (se < 0.0038). The stepped pattern implies a barrier to gene flow of 220 (48–415) km. This would substantially delay neutral introgression but would have little effect on advantageous alleles; the two taxa need not evolve independently. Strong selection is needed to maintain such a barrier: hybrid populations must have their mean fitness reduced by a factor of 0.65 (0.60–0.77). This selection must be spread over a large number of loci to account for the concordant patterns and the observed cline widths (N = 300 [80–2,000]).","lang":"eng"}],"intvolume":"        40","date_created":"2018-12-11T12:08:14Z","article_type":"original","date_published":"1986-01-01T00:00:00Z","year":"1986","month":"01","doi":"10.1111/j.1558-5646.1986.tb05740.x","language":[{"iso":"eng"}],"title":"Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland","publisher":"Society for the Study of Evolution"},{"language":[{"iso":"eng"}],"publisher":"Elsevier","article_type":"original","date_published":"1986-06-21T00:00:00Z","month":"06","date_created":"2018-12-11T12:08:15Z","status":"public","intvolume":"       120","type":"journal_article","day":"21","page":"381 - 387","publication":"Journal of Theoretical Biology","issue":"4","title":"Sibling competition and the advantage of mixed families","doi":"10.1016/S0022-5193(86)80033-9","year":"1986","author":[{"first_name":"Nicholas H","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"first_name":"R.J.","full_name":"Post, R.J.","last_name":"Post"}],"abstract":[{"lang":"eng","text":"It is noted that the sibling competition model for the evolution of sex and recombination, as it has been developed so far, involves truncation selection. After briefly reviewing aspects of the development and behaviour of such models an analytical treatment is presented which involves additive selection. Additive selection, as compared with truncation selection, decreases the advantage of sex to such an extent that it is unlikely that sibling competition could overcome its intrinsic two-fold cost, although it could still be important in promoting family variability produced by other mechanisms, such as polyandry."}],"citation":{"short":"N.H. Barton, R.J. Post, Journal of Theoretical Biology 120 (1986) 381–387.","ista":"Barton NH, Post RJ. 1986. Sibling competition and the advantage of mixed families. Journal of Theoretical Biology. 120(4), 381–387.","mla":"Barton, Nicholas H., and R. J. Post. “Sibling Competition and the Advantage of Mixed Families.” <i>Journal of Theoretical Biology</i>, vol. 120, no. 4, Elsevier, 1986, pp. 381–87, doi:<a href=\"https://doi.org/10.1016/S0022-5193(86)80033-9\">10.1016/S0022-5193(86)80033-9</a>.","ama":"Barton NH, Post RJ. Sibling competition and the advantage of mixed families. <i>Journal of Theoretical Biology</i>. 1986;120(4):381-387. doi:<a href=\"https://doi.org/10.1016/S0022-5193(86)80033-9\">10.1016/S0022-5193(86)80033-9</a>","chicago":"Barton, Nicholas H, and R.J. Post. “Sibling Competition and the Advantage of Mixed Families.” <i>Journal of Theoretical Biology</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/S0022-5193(86)80033-9\">https://doi.org/10.1016/S0022-5193(86)80033-9</a>.","ieee":"N. H. Barton and R. J. Post, “Sibling competition and the advantage of mixed families,” <i>Journal of Theoretical Biology</i>, vol. 120, no. 4. Elsevier, pp. 381–387, 1986.","apa":"Barton, N. H., &#38; Post, R. J. (1986). Sibling competition and the advantage of mixed families. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0022-5193(86)80033-9\">https://doi.org/10.1016/S0022-5193(86)80033-9</a>"},"publication_status":"published","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"We would like to thank M. Bulmer for his helpful comments. R. J. Post was supported during this work by an MRC Postdoctoral Fellowship, and N. Barton by an SRC Postdoctoral Fellowship. \r\n","extern":"1","publication_identifier":{"eissn":["1095-8541"],"issn":["0022-5193"]},"_id":"4323","article_processing_charge":"No","publist_id":"1720","date_updated":"2022-01-31T14:44:50Z","volume":120},{"publication_status":"published","citation":{"ista":"Barton NH. 1986. The maintenance of polygenic variation through a balance between mutation and stabilising selection. Genetical Research. 47(3), 209–216.","short":"N.H. Barton, Genetical Research 47 (1986) 209–216.","ama":"Barton NH. The maintenance of polygenic variation through a balance between mutation and stabilising selection. <i>Genetical Research</i>. 1986;47(3):209-216. doi:<a href=\"https://doi.org/10.1017/S0016672300023156\">10.1017/S0016672300023156</a>","mla":"Barton, Nicholas H. “The Maintenance of Polygenic Variation through a Balance between Mutation and Stabilising Selection.” <i>Genetical Research</i>, vol. 47, no. 3, Cambridge University Press, 1986, pp. 209–16, doi:<a href=\"https://doi.org/10.1017/S0016672300023156\">10.1017/S0016672300023156</a>.","chicago":"Barton, Nicholas H. “The Maintenance of Polygenic Variation through a Balance between Mutation and Stabilising Selection.” <i>Genetical Research</i>. Cambridge University Press, 1986. <a href=\"https://doi.org/10.1017/S0016672300023156\">https://doi.org/10.1017/S0016672300023156</a>.","ieee":"N. H. Barton, “The maintenance of polygenic variation through a balance between mutation and stabilising selection,” <i>Genetical Research</i>, vol. 47, no. 3. Cambridge University Press, pp. 209–216, 1986.","apa":"Barton, N. H. (1986). The maintenance of polygenic variation through a balance between mutation and stabilising selection. <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300023156\">https://doi.org/10.1017/S0016672300023156</a>"},"abstract":[{"text":"The maintenance of polygenic variation through a balance between mutation and stabilizing selection can be approximated in two ways. In the ‘Gaussian’ approximation, a normal distribution of allelic effects is assumed at each locus. In the ‘House of Cards’ approximation, the effect of new mutations is assumed to be large compared with the spread of the existing distribution. These approximations were developed to describe models where alleles may have a continuous range of effects. However, previous analyses of models with only two alleles have predicted an equilibrium variance equal to that given by the ‘House of Cards’ approximation. These analyses of biallelic models have assumed that, at equilibrium, the population mean is at the optimum. Here, it is shown that many stable equilibria may coexist, each giving a slight deviation from the optimum. Though the variance is given by the ‘House of Cards’ approximation when the mean is at the optimum, it increases towards a value of the same order as that given by the ‘Gaussian’ approximation when the mean deviates from the optimum. Thus, the equilibrium variance cannot be predicted by any simple model, but depends on the previous history of the population.","lang":"eng"}],"author":[{"first_name":"Nicholas H","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2022-01-31T14:31:48Z","publist_id":"1718","volume":47,"article_processing_charge":"No","_id":"4324","pmid":1,"publication_identifier":{"eissn":["1469-5073"],"issn":["0016-6723"]},"extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"Thanks are due to J. Felsenstein, J. Gillespie, S. Rouhani, M. Slatkin, and M. Turelli for stimulating discussions, and for their comments on the manuscript. This work was sup- ported by a travel grant from the Royal Society, and by a research grant from the SERC","oa_version":"None","quality_controlled":"1","doi":"10.1017/S0016672300023156","year":"1986","title":"The maintenance of polygenic variation through a balance between mutation and stabilising selection","external_id":{"pmid":["3744046"]},"day":"01","type":"journal_article","intvolume":"        47","status":"public","issue":"3","publication":"Genetical Research","page":"209 - 216","month":"06","date_published":"1986-06-01T00:00:00Z","article_type":"original","publisher":"Cambridge University Press","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:08:15Z"}]