[{"intvolume":"        59","status":"public","day":"01","type":"journal_article","publication":"Heredity","issue":"3","page":"457 - 466","scopus_import":"1","publisher":"Nature Publishing Group","language":[{"iso":"eng"}],"month":"12","article_type":"original","date_published":"1987-12-01T00:00:00Z","date_created":"2018-12-11T12:04:28Z","abstract":[{"lang":"eng","text":"Females of the grasshopper Podisima pedestris were collected from the middle of a hybrid zone between two chromosomal races in the Alpes Maritimes. They had already mated in the field, and could therefore lay fertilised eggs in the laboratory. The embryos were karyotyped, and found to contain an excess of chromosomal homozygotes. No evidence of assortative mating was found from copulating pairs taken in the field. The excess appears to have been caused by a combination of multiple insemination and assortative fertilisation. The genetics of the assortment, and the implications for the evolution of reproductive isolation are discussed."}],"author":[{"first_name":"Godfrey","last_name":"Hewitt","full_name":"Hewitt, Godfrey"},{"first_name":"R.","last_name":"Nichols","full_name":"Nichols, R."},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240"}],"citation":{"ama":"Hewitt G, Nichols R, Barton NH. Homogamy in a hybrid zone in the alpine grasshopper Podisma pedestris. <i>Heredity</i>. 1987;59(3):457-466. doi:<a href=\"https://doi.org/10.1038/hdy.1987.156\">10.1038/hdy.1987.156</a>","mla":"Hewitt, Godfrey, et al. “Homogamy in a Hybrid Zone in the Alpine Grasshopper Podisma Pedestris.” <i>Heredity</i>, vol. 59, no. 3, Nature Publishing Group, 1987, pp. 457–66, doi:<a href=\"https://doi.org/10.1038/hdy.1987.156\">10.1038/hdy.1987.156</a>.","ista":"Hewitt G, Nichols R, Barton NH. 1987. Homogamy in a hybrid zone in the alpine grasshopper Podisma pedestris. Heredity. 59(3), 457–466.","short":"G. Hewitt, R. Nichols, N.H. Barton, Heredity 59 (1987) 457–466.","apa":"Hewitt, G., Nichols, R., &#38; Barton, N. H. (1987). Homogamy in a hybrid zone in the alpine grasshopper Podisma pedestris. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.1987.156\">https://doi.org/10.1038/hdy.1987.156</a>","ieee":"G. Hewitt, R. Nichols, and N. H. Barton, “Homogamy in a hybrid zone in the alpine grasshopper Podisma pedestris,” <i>Heredity</i>, vol. 59, no. 3. Nature Publishing Group, pp. 457–466, 1987.","chicago":"Hewitt, Godfrey, R. Nichols, and Nicholas H Barton. “Homogamy in a Hybrid Zone in the Alpine Grasshopper Podisma Pedestris.” <i>Heredity</i>. Nature Publishing Group, 1987. <a href=\"https://doi.org/10.1038/hdy.1987.156\">https://doi.org/10.1038/hdy.1987.156</a>."},"publication_status":"published","publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"extern":"1","_id":"3658","oa_version":"Published Version","quality_controlled":"1","acknowledgement":"We are most grateful to Manse East for excellent technical assistance, to Dr Michael Shaw and Martin Dransfield for statistical advice and to Dr Roger Butlin for critical reading of the manuscript. It is a pleasure to thank M. and Mme. Aviotti and family at Casterino for their help and hospitality over several years of field work. The authorities of Le Parc National de Mercantour kindly gave permission for the collections. This work was financed by grants from the N.E.R.C. and S.E.R.C.\r\n","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","publist_id":"2725","volume":59,"date_updated":"2022-02-04T12:20:46Z","oa":1,"title":"Homogamy in a hybrid zone in the alpine grasshopper Podisma pedestris","doi":"10.1038/hdy.1987.156","year":"1987","main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy1987156"}]},{"main_file_link":[{"url":" http://www.jstor.org/stable/2461884"}],"title":"The relative rates of evolution of sex chromosomes and autosomes","year":"1987","doi":"10.1086/284701","_id":"3659","publication_identifier":{"eissn":["1537-5323"],"issn":["0003-0147"]},"extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","quality_controlled":"1","volume":130,"date_updated":"2022-02-04T12:11:20Z","publist_id":"2724","article_processing_charge":"No","abstract":[{"text":"We develop models of the rates of evolution at sex-linked and autosomal loci and of the rates of fixation of chromosomal rearrangements involving sex chromosomes and autosomes. We show that the substitution of selectively favorable mutations often proceeds more rapidly for X- or Y-linked loci than for the autosomes, provided that mutations are recessive or partially recessive on the average. Selection acting on a quantitative character is expected to result in similar long-term rates of gene substitution for X-linked and autosomal loci, unless there is strong directional dominance. Short-term responses to such selection often preferentially fix alleles at autosomal loci. The fixation of slightly deleterious alleles by random drift and the stochastic turnover of alleles at loci controlling quantitative characters under stabilizing selection usually proceed somewhat more slowly at sex-linked loci. In contrast, the fixation of underdominant chromosomal rearrangements by random genetic drift is faster with sex linkage. Sex-specific selection may also differentially favor the fixation of sex-linked rearrangements. These results are discussed in relation to genetic and cytological data on species differences. We show that the frequently disproportionate effects of the sex chromosomes on interspecific inviability or sterility are consistent with the hypothesis that the gene differences concerned involve recessive or partially recessive alleles fixed by selection. Haldane's rule is readily interpreted in this light. There is little evidence for strong effects of the sex chromosomes on quantitative characters in interspecific crosses, in accordance with our theoretical results. Thus, the evolution of reproductive isolation may not be the byproduct of selective change in additively inherited, polygenic traits. Rather, it may be due mainly to the fixation of favorable mutations whose effects on fitness reflect locus-specific effects on the phenotype. These mutations behave as major genes in the sense of contributing the bulk of the genetic variance in the characters that they control during the course of the mutations' substitution. The data on the genetics of short-term responses to selection in Drosophila are hard to interpret, but, in accordance with theory, these responses do not usually seem to involve the X chromosome disproportionately. In some groups, there is evidence for a disproportionate role of the sex chromosomes in chromosomal changes, but others show no clear pattern. Factors that may distort the expectations of the simple models of chromosomal evolution are discussed.","lang":"eng"}],"author":[{"last_name":"Charlesworth","full_name":"Charlesworth, Brian","first_name":"Brian"},{"first_name":"Jerry","last_name":"Coyne","full_name":"Coyne, Jerry"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"publication_status":"published","citation":{"chicago":"Charlesworth, Brian, Jerry Coyne, and Nicholas H Barton. “The Relative Rates of Evolution of Sex Chromosomes and Autosomes.” <i>American Naturalist</i>. University of Chicago Press, 1987. <a href=\"https://doi.org/10.1086/284701\">https://doi.org/10.1086/284701</a>.","ieee":"B. Charlesworth, J. Coyne, and N. H. Barton, “The relative rates of evolution of sex chromosomes and autosomes,” <i>American Naturalist</i>, vol. 130, no. 1. University of Chicago Press, pp. 113–146, 1987.","apa":"Charlesworth, B., Coyne, J., &#38; Barton, N. H. (1987). The relative rates of evolution of sex chromosomes and autosomes. <i>American Naturalist</i>. University of Chicago Press. <a href=\"https://doi.org/10.1086/284701\">https://doi.org/10.1086/284701</a>","ista":"Charlesworth B, Coyne J, Barton NH. 1987. The relative rates of evolution of sex chromosomes and autosomes. American Naturalist. 130(1), 113–146.","short":"B. Charlesworth, J. Coyne, N.H. Barton, American Naturalist 130 (1987) 113–146.","ama":"Charlesworth B, Coyne J, Barton NH. The relative rates of evolution of sex chromosomes and autosomes. <i>American Naturalist</i>. 1987;130(1):113-146. doi:<a href=\"https://doi.org/10.1086/284701\">10.1086/284701</a>","mla":"Charlesworth, Brian, et al. “The Relative Rates of Evolution of Sex Chromosomes and Autosomes.” <i>American Naturalist</i>, vol. 130, no. 1, University of Chicago Press, 1987, pp. 113–46, doi:<a href=\"https://doi.org/10.1086/284701\">10.1086/284701</a>."},"date_created":"2018-12-11T12:04:29Z","publisher":"University of Chicago Press","language":[{"iso":"eng"}],"month":"01","article_type":"original","date_published":"1987-01-01T00:00:00Z","issue":"1","publication":"American Naturalist","page":"113 - 146","intvolume":"       130","status":"public","day":"01","type":"journal_article"},{"type":"journal_article","day":"01","status":"public","intvolume":"        49","page":"157 - 174","issue":"2","publication":"Genetical Research","date_published":"1987-04-01T00:00:00Z","article_type":"original","month":"04","language":[{"iso":"eng"}],"publisher":"Cambridge University Press","scopus_import":"1","date_created":"2018-12-11T12:04:29Z","publication_status":"published","citation":{"apa":"Barton, N. H., &#38; Turelli, M. (1987). Adaptive landscapes, genetic distance, and the evolution of quantitative characters. <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300026951\">https://doi.org/10.1017/S0016672300026951</a>","ieee":"N. H. Barton and M. Turelli, “Adaptive landscapes, genetic distance, and the evolution of quantitative characters,” <i>Genetical Research</i>, vol. 49, no. 2. Cambridge University Press, pp. 157–174, 1987.","chicago":"Barton, Nicholas H, and Michael Turelli. “Adaptive Landscapes, Genetic Distance, and the Evolution of Quantitative Characters.” <i>Genetical Research</i>. Cambridge University Press, 1987. <a href=\"https://doi.org/10.1017/S0016672300026951\">https://doi.org/10.1017/S0016672300026951</a>.","mla":"Barton, Nicholas H., and Michael Turelli. “Adaptive Landscapes, Genetic Distance, and the Evolution of Quantitative Characters.” <i>Genetical Research</i>, vol. 49, no. 2, Cambridge University Press, 1987, pp. 157–74, doi:<a href=\"https://doi.org/10.1017/S0016672300026951\">10.1017/S0016672300026951</a>.","ama":"Barton NH, Turelli M. Adaptive landscapes, genetic distance, and the evolution of quantitative characters. <i>Genetical Research</i>. 1987;49(2):157-174. doi:<a href=\"https://doi.org/10.1017/S0016672300026951\">10.1017/S0016672300026951</a>","short":"N.H. Barton, M. Turelli, Genetical Research 49 (1987) 157–174.","ista":"Barton NH, Turelli M. 1987. Adaptive landscapes, genetic distance, and the evolution of quantitative characters. Genetical Research. 49(2), 157–174."},"author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton"},{"first_name":"Michael","last_name":"Turelli","full_name":"Turelli, Michael"}],"abstract":[{"text":"The maintenance of polygenic variability by a balance between mutation and stabilizing selection has been analysed using two approximations: the ‘Gaussian’ and the ‘house of cards’. These lead to qualitatively different relationships between the equilibrium genetic variance and the parameters describing selection and mutation. Here we generalize these approximations to describe the dynamics of genetic means and variances under arbitrary patterns of selection and mutation. We incorporate genetic drift into the same mathematical framework.\r\nThe effects of frequency-independent selection and genetic drift can be determined from the gradient of log mean fitness and a covariance matrix that depends on genotype frequencies. These equations describe an ‘adaptive landscape’, with a natural metric of genetic distance set by the covariance matrix. From this representation we can change coordinates to derive equations describing the dynamics of an additive polygenic character in terms of the moments (means, variances, …) of allelic effects at individual loci. Only under certain simplifying conditions, such as those derived from the Gaussian and house-of-cards approximations, do these general recursions lead to tractable equations for the first few phenotypic moments. The alternative approximations differ in the constraints they impose on the distributions of allelic effects at individual loci. The Gaussian-based prediction that evolution of the phenotypic mean does not change the genetic variance is shown to be a consequence of the assumption that the allelic distributions are never skewed. We present both analytical and numerical results delimiting the parameter values consistent with our approximations.","lang":"eng"}],"volume":49,"publist_id":"2723","date_updated":"2022-02-04T10:54:31Z","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","quality_controlled":"1","_id":"3660","extern":"1","publication_identifier":{"eissn":["1469-5073"],"issn":["0016-6723"]},"doi":"10.1017/S0016672300026951","year":"1987","title":"Adaptive landscapes, genetic distance, and the evolution of quantitative characters","main_file_link":[{"url":"https://www.cambridge.org/core/journals/genetics-research/article/adaptive-landscapes-genetic-distance-and-the-evolution-of-quantitative-characters/25C2D277AC7554F805D67F6C32579549"}]},{"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0022519387802102?via%3Dihub"}],"date_created":"2018-12-11T12:04:29Z","month":"04","year":"1987","doi":"10.1016/S0022-5193(87)80210-2","article_type":"original","date_published":"1987-04-21T00:00:00Z","publisher":"Elsevier","title":"The frequency of shifts between alternative equilibria","language":[{"iso":"eng"}],"issue":"4","publication":"Journal of Theoretical Biology","publist_id":"2722","date_updated":"2022-02-04T10:39:15Z","volume":125,"article_processing_charge":"No","page":"397 - 418","_id":"3661","extern":"1","publication_identifier":{"issn":["0022-5193"],"eissn":["1095-8541"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","publication_status":"published","citation":{"ama":"Barton NH, Rouhani S. The frequency of shifts between alternative equilibria. <i>Journal of Theoretical Biology</i>. 1987;125(4):397-418. doi:<a href=\"https://doi.org/10.1016/S0022-5193(87)80210-2\">10.1016/S0022-5193(87)80210-2</a>","mla":"Barton, Nicholas H., and Shahin Rouhani. “The Frequency of Shifts between Alternative Equilibria.” <i>Journal of Theoretical Biology</i>, vol. 125, no. 4, Elsevier, 1987, pp. 397–418, doi:<a href=\"https://doi.org/10.1016/S0022-5193(87)80210-2\">10.1016/S0022-5193(87)80210-2</a>.","ista":"Barton NH, Rouhani S. 1987. The frequency of shifts between alternative equilibria. Journal of Theoretical Biology. 125(4), 397–418.","short":"N.H. Barton, S. Rouhani, Journal of Theoretical Biology 125 (1987) 397–418.","ieee":"N. H. Barton and S. Rouhani, “The frequency of shifts between alternative equilibria,” <i>Journal of Theoretical Biology</i>, vol. 125, no. 4. Elsevier, pp. 397–418, 1987.","apa":"Barton, N. H., &#38; Rouhani, S. (1987). The frequency of shifts between alternative equilibria. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0022-5193(87)80210-2\">https://doi.org/10.1016/S0022-5193(87)80210-2</a>","chicago":"Barton, Nicholas H, and Shahin Rouhani. “The Frequency of Shifts between Alternative Equilibria.” <i>Journal of Theoretical Biology</i>. Elsevier, 1987. <a href=\"https://doi.org/10.1016/S0022-5193(87)80210-2\">https://doi.org/10.1016/S0022-5193(87)80210-2</a>."},"day":"21","type":"journal_article","abstract":[{"lang":"eng","text":"We derive a formula giving thefrequency with which random drift shifts a population betweenalternativeequilibria. This formula is valid when such shifts are rare (Ns &gt;&gt; 1), and applies over a wide range of mutation rates. When the number of mutations entering the population is low (4Nμ &lt;&lt; 1), the rate of stochastic shifts reduces to the product ofthe mutation rate and the probability of fixation of a single mutation. However, when many mutations enter the population in each generation (4Nμ &gt;&gt; 1), the rate is higher than would be expected if mutations were established independently, and converges to that given by a gaussian approximation. We apply recent results on bistable systems to extend this formula to the general multidimensional case. This gives an explicit expression for thefrequencyof stochastic shifts, which depends only on theequilibrium probability distribution near the saddle point separating thealternative stable states. The plausibility of theories of speciation through random drift are discussed in the light of these results."}],"intvolume":"       125","status":"public","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"},{"full_name":"Rouhani, Shahin","last_name":"Rouhani","first_name":"Shahin"}]},{"title":"Algorithms in Combinatorial Geometry","publisher":"Springer","language":[{"iso":"eng"}],"year":"1987","place":"Berlin ; Heidelberg","doi":"10.1007/978-3-642-61568-9","month":"01","date_published":"1987-01-01T00:00:00Z","related_material":{"link":[{"description":"available via catalog IST BookList","relation":"other","url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=4096"}]},"date_created":"2018-12-11T12:05:47Z","alternative_title":["EATCS monographs on theoretical computer science"],"intvolume":"        10","abstract":[{"text":"Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa­ tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con­ structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com­ binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.","lang":"eng"}],"author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"status":"public","day":"01","citation":{"chicago":"Edelsbrunner, Herbert. <i>Algorithms in Combinatorial Geometry</i>. Vol. 10. Berlin ; Heidelberg: Springer, 1987. <a href=\"https://doi.org/10.1007/978-3-642-61568-9\">https://doi.org/10.1007/978-3-642-61568-9</a>.","apa":"Edelsbrunner, H. (1987). <i>Algorithms in Combinatorial Geometry</i> (Vol. 10). Berlin ; Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-61568-9\">https://doi.org/10.1007/978-3-642-61568-9</a>","ieee":"H. Edelsbrunner, <i>Algorithms in Combinatorial Geometry</i>, vol. 10. Berlin ; Heidelberg: Springer, 1987.","ista":"Edelsbrunner H. 1987. Algorithms in Combinatorial Geometry, Berlin ; Heidelberg: Springer, XV, 423p.","short":"H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin ; Heidelberg, 1987.","mla":"Edelsbrunner, Herbert. <i>Algorithms in Combinatorial Geometry</i>. Vol. 10, Springer, 1987, doi:<a href=\"https://doi.org/10.1007/978-3-642-61568-9\">10.1007/978-3-642-61568-9</a>.","ama":"Edelsbrunner H. <i>Algorithms in Combinatorial Geometry</i>. Vol 10. Berlin ; Heidelberg: Springer; 1987. doi:<a href=\"https://doi.org/10.1007/978-3-642-61568-9\">10.1007/978-3-642-61568-9</a>"},"publication_status":"published","type":"book","extern":"1","publication_identifier":{"issn":["1431-2654"],"eisbn":["978-3-642-61568-9"],"isbn":["978-3-540-13722-1"]},"_id":"3900","quality_controlled":"1","oa_version":"None","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","page":"XV, 423","article_processing_charge":"No","volume":10,"date_updated":"2021-12-22T12:59:57Z","publist_id":"2257"},{"status":"public","intvolume":"        26","type":"journal_article","day":"19","page":"61 - 64","publication":"Information Processing Letters","issue":"2","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Elsevier","date_published":"1987-10-19T00:00:00Z","article_type":"original","month":"10","date_created":"2018-12-11T12:06:54Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Shen","full_name":"Shen, Xiaojun","first_name":"Xiaojun"}],"abstract":[{"text":"The visibility graph of a finite set of line segments in the plane connects two endpoints u and v if and only if the straight line connection between u and v does not cross any line segment of the set. This article proves that 5n - 4 is a lower bound on the number of edges in the visibility graph of n nonintersecting line segments in the plane. This bound is tight.","lang":"eng"}],"citation":{"chicago":"Edelsbrunner, Herbert, and Xiaojun Shen. “A Tight Lower Bound on the Size of Visibility Graphs.” <i>Information Processing Letters</i>. Elsevier, 1987. <a href=\"https://doi.org/10.1016/0020-0190(87)90038-X\">https://doi.org/10.1016/0020-0190(87)90038-X</a>.","apa":"Edelsbrunner, H., &#38; Shen, X. (1987). A tight lower bound on the size of visibility graphs. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(87)90038-X\">https://doi.org/10.1016/0020-0190(87)90038-X</a>","ieee":"H. Edelsbrunner and X. Shen, “A tight lower bound on the size of visibility graphs,” <i>Information Processing Letters</i>, vol. 26, no. 2. Elsevier, pp. 61–64, 1987.","ista":"Edelsbrunner H, Shen X. 1987. A tight lower bound on the size of visibility graphs. Information Processing Letters. 26(2), 61–64.","short":"H. Edelsbrunner, X. Shen, Information Processing Letters 26 (1987) 61–64.","ama":"Edelsbrunner H, Shen X. A tight lower bound on the size of visibility graphs. <i>Information Processing Letters</i>. 1987;26(2):61-64. doi:<a href=\"https://doi.org/10.1016/0020-0190(87)90038-X\">10.1016/0020-0190(87)90038-X</a>","mla":"Edelsbrunner, Herbert, and Xiaojun Shen. “A Tight Lower Bound on the Size of Visibility Graphs.” <i>Information Processing Letters</i>, vol. 26, no. 2, Elsevier, 1987, pp. 61–64, doi:<a href=\"https://doi.org/10.1016/0020-0190(87)90038-X\">10.1016/0020-0190(87)90038-X</a>."},"publication_status":"published","quality_controlled":"1","oa_version":"None","acknowledgement":"Research of this author ‘was supported by the Amoco Foundation for Facilitation of Development of Computer\r\nScience under Grant No. l-6-44862.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"issn":["0020-0190"],"eissn":["1872-6119"]},"_id":"4094","article_processing_charge":"No","publist_id":"2025","date_updated":"2022-02-03T14:05:19Z","volume":26,"title":"A tight lower bound on the size of visibility graphs","year":"1987","doi":"10.1016/0020-0190(87)90038-X","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/002001908790038X?via%3Dihub"}]},{"date_created":"2018-12-11T12:06:54Z","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"IEEE","date_published":"1987-11-01T00:00:00Z","article_type":"original","month":"11","page":"1349 - 1354","publication":"IEEE Transactions on Computers","issue":"11","status":"public","intvolume":"        36","type":"journal_article","day":"01","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/5009474"}],"title":"An improved algorithm for constructing kth-order Voronoi diagrams","doi":"10.1109/TC.1987.5009474","year":"1987","quality_controlled":"1","oa_version":"None","acknowledgement":"We would like to thank two anonymous referees for their constructive criticism. ","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"eissn":["1557-9956"],"issn":["0018-9340"]},"extern":"1","_id":"4095","article_processing_charge":"No","volume":36,"publist_id":"2026","date_updated":"2022-02-04T10:32:27Z","author":[{"last_name":"Chazelle","full_name":"Chazelle, Bernard","first_name":"Bernard"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"}],"abstract":[{"text":"he kth-order Voronoi diagram of a finite set of sites in the Euclidean plane E2 subdivides E2 into maximal regions such that all points within a given region have the same k nearest sites. Two versions of an algorithm are developed for constructing the kth-order Voronoi diagram of a set of n sites in O(n2 log n + k(n - k) log2 n) time, O(k(n - k)) storage, and in O(n2 + k(n - k) log2 n) time, O(n2) storage, respectively.","lang":"eng"}],"citation":{"ista":"Chazelle B, Edelsbrunner H. 1987. An improved algorithm for constructing kth-order Voronoi diagrams. IEEE Transactions on Computers. 36(11), 1349–1354.","short":"B. Chazelle, H. Edelsbrunner, IEEE Transactions on Computers 36 (1987) 1349–1354.","mla":"Chazelle, Bernard, and Herbert Edelsbrunner. “An Improved Algorithm for Constructing Kth-Order Voronoi Diagrams.” <i>IEEE Transactions on Computers</i>, vol. 36, no. 11, IEEE, 1987, pp. 1349–54, doi:<a href=\"https://doi.org/10.1109/TC.1987.5009474\">10.1109/TC.1987.5009474</a>.","ama":"Chazelle B, Edelsbrunner H. An improved algorithm for constructing kth-order Voronoi diagrams. <i>IEEE Transactions on Computers</i>. 1987;36(11):1349-1354. doi:<a href=\"https://doi.org/10.1109/TC.1987.5009474\">10.1109/TC.1987.5009474</a>","chicago":"Chazelle, Bernard, and Herbert Edelsbrunner. “An Improved Algorithm for Constructing Kth-Order Voronoi Diagrams.” <i>IEEE Transactions on Computers</i>. IEEE, 1987. <a href=\"https://doi.org/10.1109/TC.1987.5009474\">https://doi.org/10.1109/TC.1987.5009474</a>.","apa":"Chazelle, B., &#38; Edelsbrunner, H. (1987). An improved algorithm for constructing kth-order Voronoi diagrams. <i>IEEE Transactions on Computers</i>. IEEE. <a href=\"https://doi.org/10.1109/TC.1987.5009474\">https://doi.org/10.1109/TC.1987.5009474</a>","ieee":"B. Chazelle and H. Edelsbrunner, “An improved algorithm for constructing kth-order Voronoi diagrams,” <i>IEEE Transactions on Computers</i>, vol. 36, no. 11. IEEE, pp. 1349–1354, 1987."},"publication_status":"published"},{"publisher":"Springer","scopus_import":"1","language":[{"iso":"eng"}],"month":"01","article_type":"original","date_published":"1987-01-01T00:00:00Z","date_created":"2018-12-11T12:06:56Z","intvolume":"         2","status":"public","day":"01","type":"journal_article","issue":"1","publication":"Discrete & Computational Geometry","page":"113 - 126","title":"Linear space data structures for two types of range search","year":"1987","doi":"10.1007/BF02187875","abstract":[{"text":"This paper investigates the existence of linear space data structures for range searching. We examine thehomothetic range search problem, where a setS ofn points in the plane is to be preprocessed so that for any triangleT with sides parallel to three fixed directions the points ofS that lie inT can be computed efficiently. We also look atdomination searching in three dimensions. In this problem,S is a set ofn points inE 3 and the question is to retrieve all points ofS that are dominated by some query point. We describe linear space data structures for both problems. The query time is optimal in the first case and nearly optimal in the second.\r\n","lang":"eng"}],"author":[{"last_name":"Chazelle","full_name":"Chazelle, Bernard","first_name":"Bernard"},{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","citation":{"chicago":"Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1987. <a href=\"https://doi.org/10.1007/BF02187875\">https://doi.org/10.1007/BF02187875</a>.","ieee":"B. Chazelle and H. Edelsbrunner, “Linear space data structures for two types of range search,” <i>Discrete &#38; Computational Geometry</i>, vol. 2, no. 1. Springer, pp. 113–126, 1987.","apa":"Chazelle, B., &#38; Edelsbrunner, H. (1987). Linear space data structures for two types of range search. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187875\">https://doi.org/10.1007/BF02187875</a>","short":"B. Chazelle, H. Edelsbrunner, Discrete &#38; Computational Geometry 2 (1987) 113–126.","ista":"Chazelle B, Edelsbrunner H. 1987. Linear space data structures for two types of range search. Discrete &#38; Computational Geometry. 2(1), 113–126.","mla":"Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.” <i>Discrete &#38; Computational Geometry</i>, vol. 2, no. 1, Springer, 1987, pp. 113–26, doi:<a href=\"https://doi.org/10.1007/BF02187875\">10.1007/BF02187875</a>.","ama":"Chazelle B, Edelsbrunner H. Linear space data structures for two types of range search. <i>Discrete &#38; Computational Geometry</i>. 1987;2(1):113-126. doi:<a href=\"https://doi.org/10.1007/BF02187875\">10.1007/BF02187875</a>"},"_id":"4100","extern":"1","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"This research was conducted while the first author was with Brown University and the second author was with the Technical University of Graz, Austria. The first author was supported in part by NSF Grant MCS 83-03925.","oa_version":"None","quality_controlled":"1","publist_id":"2022","date_updated":"2022-02-03T11:07:26Z","volume":2,"article_processing_charge":"No"},{"author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Overmars, Mark","last_name":"Overmars","first_name":"Mark"}],"abstract":[{"lang":"eng","text":"In a number of recent papers, techniques from computational geometry (the field of algorithm design that deals with objects in multi-dimensional space) have been applied to some problems in the area of computer graphics. In this way, efficient solutions were obtained for the windowing problem that asks for those line segments in a planar set that lie in given window (range) and the moving problem that asks for the first line segment that comes into the window when moving the window in some direction. In this paper we show that also the zooming problem, which asks for the first line segment that comes into the window when we enlarge it, can be solved efficiently. This is done by repeatedly performing range queries with ranges of varying sizes. The obtained structure is dynamic and yields a query time of O(log2n) and an insertion and deletion time of O(log2n), where n is the number of line segments in the set. The amount of storage required is O(n log n). It is also shown that the technique of repeated range search can be used to solve several other problems efficiently."}],"publication_status":"published","citation":{"apa":"Edelsbrunner, H., &#38; Overmars, M. (1987). Zooming by repeated range detection. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(87)90120-7\">https://doi.org/10.1016/0020-0190(87)90120-7</a>","ieee":"H. Edelsbrunner and M. Overmars, “Zooming by repeated range detection,” <i>Information Processing Letters</i>, vol. 24, no. 6. Elsevier, pp. 413–417, 1987.","chicago":"Edelsbrunner, Herbert, and Mark Overmars. “Zooming by Repeated Range Detection.” <i>Information Processing Letters</i>. Elsevier, 1987. <a href=\"https://doi.org/10.1016/0020-0190(87)90120-7\">https://doi.org/10.1016/0020-0190(87)90120-7</a>.","ama":"Edelsbrunner H, Overmars M. Zooming by repeated range detection. <i>Information Processing Letters</i>. 1987;24(6):413-417. doi:<a href=\"https://doi.org/10.1016/0020-0190(87)90120-7\">10.1016/0020-0190(87)90120-7</a>","mla":"Edelsbrunner, Herbert, and Mark Overmars. “Zooming by Repeated Range Detection.” <i>Information Processing Letters</i>, vol. 24, no. 6, Elsevier, 1987, pp. 413–17, doi:<a href=\"https://doi.org/10.1016/0020-0190(87)90120-7\">10.1016/0020-0190(87)90120-7</a>.","ista":"Edelsbrunner H, Overmars M. 1987. Zooming by repeated range detection. Information Processing Letters. 24(6), 413–417.","short":"H. Edelsbrunner, M. Overmars, Information Processing Letters 24 (1987) 413–417."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","_id":"4101","publication_identifier":{"eissn":["1872-6119"],"issn":["0020-0190"]},"extern":"1","volume":24,"date_updated":"2022-02-03T13:29:17Z","publist_id":"2023","article_processing_charge":"No","title":"Zooming by repeated range detection","doi":"10.1016/0020-0190(87)90120-7","year":"1987","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0020019087901207?via%3Dihub"}],"status":"public","intvolume":"        24","type":"journal_article","day":"06","page":"413 - 417","issue":"6","publication":"Information Processing Letters","language":[{"iso":"eng"}],"publisher":"Elsevier","scopus_import":"1","article_type":"original","date_published":"1987-04-06T00:00:00Z","month":"04","date_created":"2018-12-11T12:06:57Z"},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","quality_controlled":"1","_id":"4102","extern":"1","publication_identifier":{"eissn":["1090-2678"],"issn":["0196-6774"]},"volume":8,"date_updated":"2022-02-03T13:47:53Z","publist_id":"2024","article_processing_charge":"No","author":[{"first_name":"David","last_name":"Dobkin","full_name":"Dobkin, David"},{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"Determining or counting geometric objects that intersect another geometric query object is at the core of algorithmic problems in a number of applied areas of computer science. This article presents a family of space-efficient data structures that realize sublinear query time for points, line segments, lines and polygons in the plane, and points, line segments, planes, and polyhedra in three dimensions."}],"publication_status":"published","citation":{"short":"D. Dobkin, H. Edelsbrunner, Journal of Algorithms 8 (1987) 348–361.","ista":"Dobkin D, Edelsbrunner H. 1987. Space searching for intersecting objects. Journal of Algorithms. 8(3), 348–361.","mla":"Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.” <i>Journal of Algorithms</i>, vol. 8, no. 3, Academic Press, 1987, pp. 348–61, doi:<a href=\"https://doi.org/10.1016/0196-6774(87)90015-0\">10.1016/0196-6774(87)90015-0</a>.","ama":"Dobkin D, Edelsbrunner H. Space searching for intersecting objects. <i>Journal of Algorithms</i>. 1987;8(3):348-361. doi:<a href=\"https://doi.org/10.1016/0196-6774(87)90015-0\">10.1016/0196-6774(87)90015-0</a>","chicago":"Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.” <i>Journal of Algorithms</i>. Academic Press, 1987. <a href=\"https://doi.org/10.1016/0196-6774(87)90015-0\">https://doi.org/10.1016/0196-6774(87)90015-0</a>.","ieee":"D. Dobkin and H. Edelsbrunner, “Space searching for intersecting objects,” <i>Journal of Algorithms</i>, vol. 8, no. 3. Academic Press, pp. 348–361, 1987.","apa":"Dobkin, D., &#38; Edelsbrunner, H. (1987). Space searching for intersecting objects. <i>Journal of Algorithms</i>. Academic Press. <a href=\"https://doi.org/10.1016/0196-6774(87)90015-0\">https://doi.org/10.1016/0196-6774(87)90015-0</a>"},"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0196677487900150?via%3Dihub"}],"title":"Space searching for intersecting objects","year":"1987","doi":"10.1016/0196-6774(87)90015-0","page":"348 - 361","issue":"3","publication":"Journal of Algorithms","status":"public","intvolume":"         8","type":"journal_article","day":"01","date_created":"2018-12-11T12:06:57Z","language":[{"iso":"eng"}],"publisher":"Academic Press","scopus_import":"1","date_published":"1987-09-01T00:00:00Z","article_type":"original","month":"09"},{"main_file_link":[{"url":"https://www.nature.com/articles/hdy198736","open_access":"1"}],"title":"Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris","doi":"10.1038/hdy.1987.36","year":"1987","quality_controlled":"1","oa_version":"Published Version","acknowledgement":"s We would like to thank Manse East for technical assistance and M. et Mme Aviotti for their hospitality in France. We are grateful to Dr Michael Rennet, Dr Donald Fox, Professor Hubert Rees, and an anonymous referee for their helpful comments on earlier manuscripts. This work was supported by an S.E.R.C. grant to G.M.H., and by an S.E.R.C. postdoctoral fellowship to N.H.B. MW. worked at UEA under an Outside Studies Program.\r\n","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"eissn":["1365-2540"],"issn":["0018-067X"]},"_id":"4319","article_processing_charge":"No","date_updated":"2022-02-03T10:48:40Z","volume":58,"publist_id":"1733","oa":1,"author":[{"first_name":"Michael","full_name":"Westerman, Michael","last_name":"Westerman"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H"},{"first_name":"Godfrey","last_name":"Hewitt","full_name":"Hewitt, Godfrey"}],"abstract":[{"lang":"eng","text":"The grasshopper Podisma pedestris contains two chromosomal races, which differ by a Robertsonian fusion between the sex chromosome and an autosome, and which meet in a narrow hybrid zone in the Alpes Maritimes. DNA content variation across this hybrid zone was investigated by optical densitometry of Feulgen stained spermatids. Spermatids from males with the unfused sex chromosome stain more strongly than those from males with the fused chromosome. The difference between the karyotypes is greater in the centre of the hybrid zone, suggesting that it is not a pleiotropic effect of the fusion itself, but is due instead to differences at closely linked loci."}],"citation":{"chicago":"Westerman, Michael, Nicholas H Barton, and Godfrey Hewitt. “Differences in DNA Content between Two Chromosomal Races of the Grasshopper Podisma Pedestris.” <i>Heredity</i>. Nature Publishing Group, 1987. <a href=\"https://doi.org/10.1038/hdy.1987.36\">https://doi.org/10.1038/hdy.1987.36</a>.","apa":"Westerman, M., Barton, N. H., &#38; Hewitt, G. (1987). Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.1987.36\">https://doi.org/10.1038/hdy.1987.36</a>","ieee":"M. Westerman, N. H. Barton, and G. Hewitt, “Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris,” <i>Heredity</i>, vol. 58. Nature Publishing Group, pp. 221–228, 1987.","ista":"Westerman M, Barton NH, Hewitt G. 1987. Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris. Heredity. 58, 221–228.","short":"M. Westerman, N.H. Barton, G. Hewitt, Heredity 58 (1987) 221–228.","ama":"Westerman M, Barton NH, Hewitt G. Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris. <i>Heredity</i>. 1987;58:221-228. doi:<a href=\"https://doi.org/10.1038/hdy.1987.36\">10.1038/hdy.1987.36</a>","mla":"Westerman, Michael, et al. “Differences in DNA Content between Two Chromosomal Races of the Grasshopper Podisma Pedestris.” <i>Heredity</i>, vol. 58, Nature Publishing Group, 1987, pp. 221–28, doi:<a href=\"https://doi.org/10.1038/hdy.1987.36\">10.1038/hdy.1987.36</a>."},"publication_status":"published","date_created":"2018-12-11T12:08:14Z","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Nature Publishing Group","article_type":"original","date_published":"1987-01-01T00:00:00Z","month":"01","page":"221 - 228","publication":"Heredity","status":"public","intvolume":"        58","type":"journal_article","day":"01"},{"author":[{"first_name":"Shahin","full_name":"Rouhani, Shahin","last_name":"Rouhani"},{"first_name":"Nicholas H","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"Bosonic field theories may be formulated in terms of stochastic differential equations. The characteristic long term behaviour of these systems is a decay into the global minimum of their Hamiltonian. If local minima exist, the rate of this decay is determined by instanton effects. We calculate the decay rate and perform computer simulations on a 1 + 1 dimensional model to test the instanton approximation. We find the instanton approximations to be in very good agreement with the simulation results.","lang":"eng"}],"citation":{"mla":"Rouhani, Shahin, and Nicholas H. Barton. “Instantons in Stochastic Quantization.” <i>Physica A: Statistical Mechanics and Its Applications</i>, vol. 143, no. 1–2, Elsevier, 1987, pp. 220–26, doi:<a href=\"https://doi.org/10.1016/0378-4371(87)90064-1\">10.1016/0378-4371(87)90064-1</a>.","ama":"Rouhani S, Barton NH. Instantons in stochastic quantization. <i>Physica A: Statistical Mechanics and its Applications</i>. 1987;143(1-2):220-226. doi:<a href=\"https://doi.org/10.1016/0378-4371(87)90064-1\">10.1016/0378-4371(87)90064-1</a>","ista":"Rouhani S, Barton NH. 1987. Instantons in stochastic quantization. Physica A: Statistical Mechanics and its Applications. 143(1–2), 220–226.","short":"S. Rouhani, N.H. Barton, Physica A: Statistical Mechanics and Its Applications 143 (1987) 220–226.","ieee":"S. Rouhani and N. H. Barton, “Instantons in stochastic quantization,” <i>Physica A: Statistical Mechanics and its Applications</i>, vol. 143, no. 1–2. Elsevier, pp. 220–226, 1987.","apa":"Rouhani, S., &#38; Barton, N. H. (1987). Instantons in stochastic quantization. <i>Physica A: Statistical Mechanics and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/0378-4371(87)90064-1\">https://doi.org/10.1016/0378-4371(87)90064-1</a>","chicago":"Rouhani, Shahin, and Nicholas H Barton. “Instantons in Stochastic Quantization.” <i>Physica A: Statistical Mechanics and Its Applications</i>. Elsevier, 1987. <a href=\"https://doi.org/10.1016/0378-4371(87)90064-1\">https://doi.org/10.1016/0378-4371(87)90064-1</a>."},"publication_status":"published","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"issn":["0378-4371"],"eissn":["1873-2119"]},"extern":"1","_id":"4320","article_processing_charge":"No","publist_id":"1730","volume":143,"date_updated":"2022-02-03T10:33:03Z","title":"Instantons in stochastic quantization","year":"1987","doi":"10.1016/0378-4371(87)90064-1","status":"public","intvolume":"       143","type":"journal_article","day":"01","page":"220 - 226","publication":"Physica A: Statistical Mechanics and its Applications","issue":"1-2","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Elsevier","article_type":"original","date_published":"1987-01-01T00:00:00Z","month":"01","date_created":"2018-12-11T12:08:14Z"},{"date_created":"2018-12-11T12:08:15Z","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Cambridge University Press","article_type":"original","date_published":"1987-01-01T00:00:00Z","month":"01","page":"35 - 40","publication":"Genetical Research","issue":"1","status":"public","intvolume":"        50","type":"journal_article","day":"01","external_id":{"pmid":["3653687 "]},"title":"The probability of establishment of an advantageous mutation in a subdivided population","year":"1987","doi":"10.1017/S0016672300023314","quality_controlled":"1","oa_version":"None","acknowledgement":"This work was supported by a grant from the Science and Engineering Research Council (GR/D/91529). Shahin\r\nRouhani supplied the proof that no positive solution to (6) exists when all eigenvalues are negative (Appendix);\r\nM. Slatkin, M. Turelli, T. Nagylaki and he also gave helpful comments on the manuscript.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"issn":["0016-6723"],"eissn":["1469-5073"]},"_id":"4322","pmid":1,"article_processing_charge":"No","date_updated":"2022-02-03T10:16:16Z","volume":50,"publist_id":"1725","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"}],"abstract":[{"lang":"eng","text":"A method is developed for calculating the probability of establishment of an allele which is favoured in some places, but not others, in a large subdivided population. This method is quite general, and could be used to calculate the chance that any system which is linear near an absorbing boundary will move away from that boundary. The results are applied to a population distributed along one dimension. Only mutants which arise within a distance  σ/ √2s of the region in which they are favoured stand an appreciable chance of establishment. The net chance of establishment of mutations distributed randomly across the habitat will be decreased by gene flow if selection against them is sufficiently strong. However, if the mutations are only weakly deleterious outside some limited region, gene flow may increase the net chance of establishment."}],"citation":{"chicago":"Barton, Nicholas H. “The Probability of Establishment of an Advantageous Mutation in a Subdivided Population.” <i>Genetical Research</i>. Cambridge University Press, 1987. <a href=\"https://doi.org/10.1017/S0016672300023314\">https://doi.org/10.1017/S0016672300023314</a>.","apa":"Barton, N. H. (1987). The probability of establishment of an advantageous mutation in a subdivided population. <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300023314\">https://doi.org/10.1017/S0016672300023314</a>","ieee":"N. H. Barton, “The probability of establishment of an advantageous mutation in a subdivided population,” <i>Genetical Research</i>, vol. 50, no. 1. Cambridge University Press, pp. 35–40, 1987.","short":"N.H. Barton, Genetical Research 50 (1987) 35–40.","ista":"Barton NH. 1987. The probability of establishment of an advantageous mutation in a subdivided population. Genetical Research. 50(1), 35–40.","ama":"Barton NH. The probability of establishment of an advantageous mutation in a subdivided population. <i>Genetical Research</i>. 1987;50(1):35-40. doi:<a href=\"https://doi.org/10.1017/S0016672300023314\">10.1017/S0016672300023314</a>","mla":"Barton, Nicholas H. “The Probability of Establishment of an Advantageous Mutation in a Subdivided Population.” <i>Genetical Research</i>, vol. 50, no. 1, Cambridge University Press, 1987, pp. 35–40, doi:<a href=\"https://doi.org/10.1017/S0016672300023314\">10.1017/S0016672300023314</a>."},"publication_status":"published"},{"month":"07","article_type":"original","date_published":"1986-07-01T00:00:00Z","publisher":"Springer","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:03:28Z","day":"01","type":"journal_article","intvolume":"       407","status":"public","publication":"Pflugers Archiv : European Journal of Physiology","issue":"1","page":"92 - 99","year":"1986","doi":"10.1007/BF00580727","external_id":{"pmid":["2426654 "]},"title":"Toxin γ of the scorpion Tityus serrulatus modifies both activation and inactivation of sodium permeability of nerve membrane","citation":{"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>.","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>","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.","short":"P.M. Jonas, W. Vogel, E. Arantes, J. Giglio, Pflugers Archiv : European Journal of Physiology 407 (1986) 92–99.","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>","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>."},"publication_status":"published","abstract":[{"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.","lang":"eng"}],"author":[{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","last_name":"Jonas","full_name":"Jonas, Peter M","first_name":"Peter M"},{"first_name":"Werner","last_name":"Vogel","full_name":"Vogel, Werner"},{"first_name":"Eliane","full_name":"Arantes, Eliane","last_name":"Arantes"},{"last_name":"Giglio","full_name":"Giglio, Jose","first_name":"Jose"}],"article_processing_charge":"No","publist_id":"2923","volume":407,"date_updated":"2022-02-03T09:46:42Z","publication_identifier":{"issn":["0031-6768"],"eissn":["1432-2013"]},"extern":"1","pmid":1,"_id":"3464","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"issn":["0384-9864"]},"_id":"3579","page":"193 - 200","article_processing_charge":"No","volume":53,"publist_id":"2806","date_updated":"2022-02-02T15:58:04Z","publication":"Congressus Numerantium","status":"public","author":[{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jaromczyk","full_name":"Jaromczyk, Jerzy","first_name":"Jerzy"}],"intvolume":"        53","type":"journal_article","day":"01","citation":{"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.","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.","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.","short":"H. Edelsbrunner, J. Jaromczyk, Congressus Numerantium 53 (1986) 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.","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."},"publication_status":"published","date_created":"2018-12-11T12:04:04Z","language":[{"iso":"eng"}],"title":"How often can you see yourself in a convex configuration of mirrors?","publisher":"Utilitas Mathemtica Publ. Inc.","article_type":"original","date_published":"1986-01-01T00:00:00Z","year":"1986","month":"01"},{"article_processing_charge":"No","date_updated":"2022-02-02T09:36:32Z","volume":1,"publist_id":"2805","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"eissn":["1432-0541"],"issn":["0178-4617"]},"_id":"3580","citation":{"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>.","ieee":"H. Edelsbrunner, “Edge-skeletons in arrangements with applications,” <i>Algorithmica</i>, vol. 1, no. 1–4. Springer, pp. 93–109, 1986.","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>","ista":"Edelsbrunner H. 1986. Edge-skeletons in arrangements with applications. Algorithmica. 1(1–4), 93–109.","short":"H. Edelsbrunner, Algorithmica 1 (1986) 93–109.","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>"},"publication_status":"published","author":[{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","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"}],"year":"1986","doi":"10.1007/BF01840438","title":"Edge-skeletons in arrangements with applications","page":"93 - 109","publication":"Algorithmica","issue":"1-4","type":"journal_article","day":"01","status":"public","intvolume":"         1","date_created":"2018-12-11T12:04:04Z","article_type":"original","date_published":"1986-11-01T00:00:00Z","month":"11","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Springer"},{"language":[{"iso":"eng"}],"publisher":"Academic Press","scopus_import":"1","date_published":"1986-06-01T00:00:00Z","article_type":"original","month":"06","date_created":"2018-12-11T12:04:30Z","status":"public","intvolume":"        29","type":"journal_article","day":"01","page":"407 - 437","issue":"3","publication":"Theoretical Population Biology","title":"Intrachromosomal gene conversion, linkage, and the evolution of multigene families","doi":"10.1016/0040-5809(86)90017-1","year":"1986","author":[{"first_name":"Thomas","full_name":"Nagylaki, Thomas","last_name":"Nagylaki"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"}],"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."}],"publication_status":"published","citation":{"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.","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>","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."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"Supported by National Science Foundation Grant DEB81-03530","oa_version":"None","quality_controlled":"1","_id":"3662","publication_identifier":{"issn":["0040-5809"],"eissn":["1096-0325"]},"extern":"1","date_updated":"2022-02-01T15:50:10Z","volume":29,"publist_id":"2721","article_processing_charge":"No"},{"month":"06","date_published":"1986-06-01T00:00:00Z","article_type":"original","scopus_import":"1","publisher":"Nature Publishing Group","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:04:30Z","day":"01","type":"journal_article","intvolume":"        56","status":"public","publication":"Heredity","issue":"3","page":"409 - 416","doi":"10.1038/hdy.1986.63","year":"1986","external_id":{"pmid":["3733460 "]},"title":"A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population","main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy198663"}],"citation":{"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>","short":"N.H. Barton, M. Slatkin, Heredity 56 (1986) 409–416.","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.","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>."},"publication_status":"published","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."}],"author":[{"full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Montgomery","full_name":"Slatkin, Montgomery","last_name":"Slatkin"}],"article_processing_charge":"No","publist_id":"2720","date_updated":"2022-02-01T15:04:01Z","oa":1,"volume":56,"publication_identifier":{"eissn":["1365-2540"],"issn":["0018-067X"]},"extern":"1","pmid":1,"_id":"3663","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","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."},{"main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy1986135"}],"year":"1986","title":"The barrier to genetic exchange between hybridising populations","article_processing_charge":"No","publist_id":"2719","date_updated":"2022-02-01T14:49:02Z","volume":57,"oa":1,"quality_controlled":"1","oa_version":"Published Version","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"extern":"1","_id":"3664","citation":{"chicago":"Barton, Nicholas H, and Bengt Bengtsson. “The Barrier to Genetic Exchange between Hybridising Populations.” <i>Heredity</i>. Nature Publishing Group, 1986.","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.","ista":"Barton NH, Bengtsson B. 1986. The barrier to genetic exchange between hybridising populations. Heredity. 57, 357–376.","short":"N.H. Barton, B. Bengtsson, Heredity 57 (1986) 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.","ama":"Barton NH, Bengtsson B. The barrier to genetic exchange between hybridising populations. <i>Heredity</i>. 1986;57:357-376."},"publication_status":"published","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H"},{"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."}],"date_created":"2018-12-11T12:04:30Z","date_published":"1986-01-01T00:00:00Z","article_type":"original","month":"01","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Nature Publishing Group","page":"357 - 376","publication":"Heredity","type":"journal_article","day":"01","status":"public","intvolume":"        57"},{"intvolume":"        57","status":"public","day":"01","type":"journal_article","publication":"Heredity","page":"415 - 426","publisher":"Nature Publishing Group","scopus_import":"1","language":[{"iso":"eng"}],"month":"01","date_published":"1986-01-01T00:00:00Z","article_type":"original","date_created":"2018-12-11T12:04:30Z","abstract":[{"lang":"eng","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."}],"author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"}],"publication_status":"published","citation":{"short":"N.H. Barton, Heredity 57 (1986) 415–426.","ista":"Barton NH. 1986. The effects of linkage and density-dependent regulation on gene flow. Heredity. 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.","ama":"Barton NH. The effects of linkage and density-dependent regulation on gene flow. <i>Heredity</i>. 1986;57:415-426.","chicago":"Barton, Nicholas H. “The Effects of Linkage and Density-Dependent Regulation on Gene Flow.” <i>Heredity</i>. Nature Publishing Group, 1986.","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."},"_id":"3665","publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"extern":"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","oa_version":"Published Version","quality_controlled":"1","volume":57,"oa":1,"publist_id":"2718","date_updated":"2022-02-01T14:31:29Z","article_processing_charge":"No","title":"The effects of linkage and density-dependent regulation on gene flow","year":"1986","main_file_link":[{"url":"https://www.nature.com/articles/hdy1986142","open_access":"1"}]}]