[{"citation":{"ama":"Barton NH, Charlesworth B. Genetic revolutions, founder effects, and speciation. <i>Annual Review of Ecology and Systematics</i>. 1984;15:133-164. doi:<a href=\"https://doi.org/10.1146/annurev.es.15.110184.001025\">10.1146/annurev.es.15.110184.001025</a>","ista":"Barton NH, Charlesworth B. 1984. Genetic revolutions, founder effects, and speciation. Annual Review of Ecology and Systematics. 15, 133–164.","mla":"Barton, Nicholas H., and Brian Charlesworth. “Genetic Revolutions, Founder Effects, and Speciation.” <i>Annual Review of Ecology and Systematics</i>, vol. 15, Annual Reviews, 1984, pp. 133–64, doi:<a href=\"https://doi.org/10.1146/annurev.es.15.110184.001025\">10.1146/annurev.es.15.110184.001025</a>.","short":"N.H. Barton, B. Charlesworth, Annual Review of Ecology and Systematics 15 (1984) 133–164.","chicago":"Barton, Nicholas H, and Brian Charlesworth. “Genetic Revolutions, Founder Effects, and Speciation.” <i>Annual Review of Ecology and Systematics</i>. Annual Reviews, 1984. <a href=\"https://doi.org/10.1146/annurev.es.15.110184.001025\">https://doi.org/10.1146/annurev.es.15.110184.001025</a>.","ieee":"N. H. Barton and B. Charlesworth, “Genetic revolutions, founder effects, and speciation,” <i>Annual Review of Ecology and Systematics</i>, vol. 15. Annual Reviews, pp. 133–164, 1984.","apa":"Barton, N. H., &#38; Charlesworth, B. (1984). Genetic revolutions, founder effects, and speciation. <i>Annual Review of Ecology and Systematics</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev.es.15.110184.001025\">https://doi.org/10.1146/annurev.es.15.110184.001025</a>"},"publication_identifier":{"eissn":["1545-2069"],"issn":["0066-4162"]},"acknowledgement":"We thank Professor B. C. Clarke, Dr. K. Janson, Dr. R. Rockwell, Dr. M. J. van den Berg, and Dr. R. D. Ward for making their work available before publication. Dr. S. J. Arnold and Dr. L. Partridge provided us with useful references, and Dr. D. Charlesworth, Dr. J. M. Szymura, and Dr. J. S. Jones critically reviewed the manuscript.","status":"public","article_type":"original","_id":"4327","year":"1984","page":"133 - 164","volume":15,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","oa_version":"None","date_created":"2018-12-11T12:08:16Z","publist_id":"1713","title":"Genetic revolutions, founder effects, and speciation","publication":"Annual Review of Ecology and Systematics","publisher":"Annual Reviews","language":[{"iso":"eng"}],"month":"11","day":"01","intvolume":"        15","main_file_link":[{"url":"https://www.annualreviews.org/doi/10.1146/annurev.es.15.110184.001025"}],"publication_status":"published","scopus_import":"1","quality_controlled":"1","author":[{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240"},{"last_name":"Charlesworth","first_name":"Brian","full_name":"Charlesworth, Brian"}],"date_published":"1984-11-01T00:00:00Z","date_updated":"2022-01-27T13:51:54Z","doi":"10.1146/annurev.es.15.110184.001025","article_processing_charge":"No"},{"volume":1,"page":"109 - 125","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"book_chapter","intvolume":"         1","_id":"3562","main_file_link":[{"url":"http://pub.ist.ac.at/~edels/Papers/1983-B-01-ExpectedSegmentTrees.pdf"}],"year":"1983","publication_status":"published","status":"public","day":"01","citation":{"mla":"Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment Trees.” <i>Computational Geometry: Theory and Applications</i>, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 109–25.","ista":"Bucher W, Edelsbrunner H. 1983.On expected- and worst-case segment trees. In: Computational Geometry: Theory and Applications. Advances in Computing Research , vol. 1, 109–125.","short":"W. Bucher, H. Edelsbrunner, in:, F. Preparata (Ed.), Computational Geometry: Theory and Applications, Elsevier, 1983, pp. 109–125.","ama":"Bucher W, Edelsbrunner H. On expected- and worst-case segment trees. In: Preparata F, ed. <i>Computational Geometry: Theory and Applications</i>. Vol 1. Elsevier; 1983:109-125.","apa":"Bucher, W., &#38; Edelsbrunner, H. (1983). On expected- and worst-case segment trees. In F. Preparata (Ed.), <i>Computational Geometry: Theory and Applications</i> (Vol. 1, pp. 109–125). Elsevier.","chicago":"Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment Trees.” In <i>Computational Geometry: Theory and Applications</i>, edited by Franco Preparata, 1:109–25. Elsevier, 1983.","ieee":"W. Bucher and H. Edelsbrunner, “On expected- and worst-case segment trees,” in <i>Computational Geometry: Theory and Applications</i>, vol. 1, F. Preparata, Ed. Elsevier, 1983, pp. 109–125."},"month":"01","language":[{"iso":"eng"}],"publication":"Computational Geometry: Theory and Applications","title":"On expected- and worst-case segment trees","publisher":"Elsevier","date_created":"2018-12-11T12:03:58Z","oa_version":"None","publist_id":"2823","date_published":"1983-01-01T00:00:00Z","author":[{"last_name":"Bucher","first_name":"W.","full_name":"Bucher, W."},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"}],"editor":[{"full_name":"Preparata, Franco","last_name":"Preparata","first_name":"Franco"}],"article_processing_charge":"No","date_updated":"2022-01-27T07:40:13Z","alternative_title":["Advances in Computing Research "],"abstract":[{"lang":"eng","text":"The segment tree is a data structure for storing and maintaining a set of intervals on the real line. It has been used for an efficient algorithmic approach in a variety of geometric problems including the problem of deter-mining intersections among axis-parallel rectangles, computing the measure of a set of axis-parallel rectangles, and locating a point in a planar subdivision. A segment tree for n intervals requires 0(n) space in the best case and 0(n log n) space in the worst case. It is shown that segment trees require 0(n log n) space even in the expected case. Additionally, the worst-case upper bound on the space requirement of segment trees is improved over the previously known bound. Surprisingly, the space requirements in the expected and in the worst case differ only little. \r\n"}],"quality_controlled":"1","extern":"1"},{"date_updated":"2022-01-25T15:49:17Z","alternative_title":[" Advances in Computing Research"],"article_processing_charge":"No","editor":[{"last_name":"Preparata","first_name":"Franco","full_name":"Preparata, Franco"}],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"full_name":"Overmars, Mark","last_name":"Overmars","first_name":"Mark"},{"full_name":"Wood, Derick","first_name":"Derick","last_name":"Wood"}],"date_published":"1983-01-01T00:00:00Z","quality_controlled":"1","extern":"1","abstract":[{"lang":"eng","text":"Usually in computer graphics, a two-dimensional view of a set of three-dimensional objects is considered. In this article we reduce the dimensionality by one in each case. In other words we study what, for obvious reasons, we call Flatland graphics. This forms the beginning of a mathematical investigation of computer graphics and, at the same time, provides uniform solutions for a number of computational geometry problems. In particular we study the maintenance of a view during insertion and deletion of objects and the \"frame-to-frame\" coherence while walking around a set of objects. Both parallel and perspective projections are considered. Our major concern is convex objects that are simple—in a sense, made precise in this article. However, we will close this article by discussing some possible extensions to nonconvex objects and/or to higher dimensions. The investigation also serves to demonstrate a number of tools that have been developed recently in the context of computational geometry. For example. dynamization and searching. \r\n\r\n"}],"publisher":"Elsevier","title":"Graphics in Flatland: a case study","publication":"Computational Geometry: Theory and Applications","publist_id":"2822","oa_version":"None","date_created":"2018-12-11T12:03:59Z","day":"01","status":"public","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0-89232-356-6"]},"month":"01","citation":{"chicago":"Edelsbrunner, Herbert, Mark Overmars, and Derick Wood. “Graphics in Flatland: A Case Study.” In <i>Computational Geometry: Theory and Applications</i>, edited by Franco Preparata, 1:35–59. Elsevier, 1983.","ieee":"H. Edelsbrunner, M. Overmars, and D. Wood, “Graphics in Flatland: a case study,” in <i>Computational Geometry: Theory and Applications</i>, vol. 1, F. Preparata, Ed. Elsevier, 1983, pp. 35–59.","apa":"Edelsbrunner, H., Overmars, M., &#38; Wood, D. (1983). Graphics in Flatland: a case study. In F. Preparata (Ed.), <i>Computational Geometry: Theory and Applications</i> (Vol. 1, pp. 35–59). Elsevier.","ama":"Edelsbrunner H, Overmars M, Wood D. Graphics in Flatland: a case study. In: Preparata F, ed. <i>Computational Geometry: Theory and Applications</i>. Vol 1. Elsevier; 1983:35-59.","short":"H. Edelsbrunner, M. Overmars, D. Wood, in:, F. Preparata (Ed.), Computational Geometry: Theory and Applications, Elsevier, 1983, pp. 35–59.","ista":"Edelsbrunner H, Overmars M, Wood D. 1983.Graphics in Flatland: a case study. In: Computational Geometry: Theory and Applications.  Advances in Computing Research, vol. 1, 35–59.","mla":"Edelsbrunner, Herbert, et al. “Graphics in Flatland: A Case Study.” <i>Computational Geometry: Theory and Applications</i>, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 35–59."},"type":"book_chapter","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"35 - 59","volume":1,"publication_status":"published","year":"1983","_id":"3563","intvolume":"         1"},{"title":"Neue Entwicklungen im Bereich Datenstrukturen","publication":"Überblicke Informationsverarbeitung ","publisher":"BI Wissenschaftsverlag","oa_version":"None","date_created":"2018-12-11T12:03:59Z","publist_id":"2821","editor":[{"full_name":"Maurer, Hermann","first_name":"Hermann","last_name":"Maurer"}],"date_published":"1983-01-01T00:00:00Z","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"}],"date_updated":"2022-01-25T15:28:05Z","article_processing_charge":"No","quality_controlled":"1","extern":"1","page":"55 - 109","type":"book_chapter","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3564","publication_status":"published","year":"1983","status":"public","day":"01","citation":{"chicago":"Edelsbrunner, Herbert. “Neue Entwicklungen im Bereich Datenstrukturen.” In <i>Überblicke Informationsverarbeitung </i>, edited by Hermann Maurer, 55–109. BI Wissenschaftsverlag, 1983.","ieee":"H. Edelsbrunner, “Neue Entwicklungen im Bereich Datenstrukturen,” in <i>Überblicke Informationsverarbeitung </i>, H. Maurer, Ed. BI Wissenschaftsverlag, 1983, pp. 55–109.","apa":"Edelsbrunner, H. (1983). Neue Entwicklungen im Bereich Datenstrukturen. In H. Maurer (Ed.), <i>Überblicke Informationsverarbeitung </i> (pp. 55–109). BI Wissenschaftsverlag.","ama":"Edelsbrunner H. Neue Entwicklungen im Bereich Datenstrukturen. In: Maurer H, ed. <i>Überblicke Informationsverarbeitung </i>. BI Wissenschaftsverlag; 1983:55-109.","mla":"Edelsbrunner, Herbert. “Neue Entwicklungen im Bereich Datenstrukturen.” <i>Überblicke Informationsverarbeitung </i>, edited by Hermann Maurer, BI Wissenschaftsverlag, 1983, pp. 55–109.","ista":"Edelsbrunner H. 1983.Neue Entwicklungen im Bereich Datenstrukturen. In: Überblicke Informationsverarbeitung . , 55–109.","short":"H. Edelsbrunner, in:, H. Maurer (Ed.), Überblicke Informationsverarbeitung , BI Wissenschaftsverlag, 1983, pp. 55–109."},"publication_identifier":{"isbn":["9783411016587"]},"language":[{"iso":"ger"}],"month":"01"},{"doi":"10.1038/306317a0","date_updated":"2022-01-25T15:17:15Z","article_processing_charge":"No","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"},{"last_name":"Jones","first_name":"Steve","full_name":"Jones, Steve"}],"date_published":"1983-11-24T00:00:00Z","quality_controlled":"1","scopus_import":"1","day":"24","pmid":1,"language":[{"iso":"eng"}],"month":"11","publication_status":"published","intvolume":"       306","main_file_link":[{"url":"https://www.nature.com/articles/306317a0"}],"extern":"1","publisher":"Springer Nature","title":"Mitochondrial DNA: new clues about evolution","publication":"Nature","publist_id":"2785","oa_version":"None","date_created":"2018-12-11T12:04:10Z","external_id":{"pmid":["6646215"]},"article_type":"original","status":"public","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"citation":{"ama":"Barton NH, Jones S. Mitochondrial DNA: new clues about evolution. <i>Nature</i>. 1983;306:317-318. doi:<a href=\"https://doi.org/10.1038/306317a0\">10.1038/306317a0</a>","short":"N.H. Barton, S. Jones, Nature 306 (1983) 317–318.","ista":"Barton NH, Jones S. 1983. Mitochondrial DNA: new clues about evolution. Nature. 306, 317–318.","mla":"Barton, Nicholas H., and Steve Jones. “Mitochondrial DNA: New Clues about Evolution.” <i>Nature</i>, vol. 306, Springer Nature, 1983, pp. 317–18, doi:<a href=\"https://doi.org/10.1038/306317a0\">10.1038/306317a0</a>.","chicago":"Barton, Nicholas H, and Steve Jones. “Mitochondrial DNA: New Clues about Evolution.” <i>Nature</i>. Springer Nature, 1983. <a href=\"https://doi.org/10.1038/306317a0\">https://doi.org/10.1038/306317a0</a>.","ieee":"N. H. Barton and S. Jones, “Mitochondrial DNA: new clues about evolution,” <i>Nature</i>, vol. 306. Springer Nature, pp. 317–318, 1983.","apa":"Barton, N. H., &#38; Jones, S. (1983). Mitochondrial DNA: new clues about evolution. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/306317a0\">https://doi.org/10.1038/306317a0</a>"},"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"317 - 318","volume":306,"year":"1983","_id":"3598"},{"day":"01","month":"02","language":[{"iso":"eng"}],"publication_status":"published","main_file_link":[{"url":"https://academic.oup.com/biolinnean/article-abstract/19/1/51/2666256?redirectedFrom=fulltext"}],"intvolume":"        19","article_processing_charge":"No","date_updated":"2022-01-25T14:52:15Z","doi":"10.1111/j.1095-8312.1983.tb00776.x","date_published":"1983-02-01T00:00:00Z","author":[{"full_name":"Halliday, Bruce","first_name":"Bruce","last_name":"Halliday"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"full_name":"Hewitt, Godfrey","last_name":"Hewitt","first_name":"Godfrey"}],"quality_controlled":"1","keyword":["Hybrid zone","Electrophoresis","Podisma pedestris","Polymorphism"],"scopus_import":"1","issue":"1","article_type":"original","status":"public","publication_identifier":{"issn":["0024-4066"],"eissn":["1095-8312"]},"citation":{"ama":"Halliday B, Barton NH, Hewitt G. Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma pedestris. <i>Biological Journal of the Linnean Society</i>. 1983;19(1):51-62. doi:<a href=\"https://doi.org/10.1111/j.1095-8312.1983.tb00776.x\">10.1111/j.1095-8312.1983.tb00776.x</a>","mla":"Halliday, Bruce, et al. “Electrophoretic Analysis of a Chromosomal Hybrid Zone in the Grasshopper Podisma Pedestris.” <i>Biological Journal of the Linnean Society</i>, vol. 19, no. 1, Oxford University Press, 1983, pp. 51–62, doi:<a href=\"https://doi.org/10.1111/j.1095-8312.1983.tb00776.x\">10.1111/j.1095-8312.1983.tb00776.x</a>.","ista":"Halliday B, Barton NH, Hewitt G. 1983. Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma pedestris. Biological Journal of the Linnean Society. 19(1), 51–62.","short":"B. Halliday, N.H. Barton, G. Hewitt, Biological Journal of the Linnean Society 19 (1983) 51–62.","ieee":"B. Halliday, N. H. Barton, and G. Hewitt, “Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma pedestris,” <i>Biological Journal of the Linnean Society</i>, vol. 19, no. 1. Oxford University Press, pp. 51–62, 1983.","chicago":"Halliday, Bruce, Nicholas H Barton, and Godfrey Hewitt. “Electrophoretic Analysis of a Chromosomal Hybrid Zone in the Grasshopper Podisma Pedestris.” <i>Biological Journal of the Linnean Society</i>. Oxford University Press, 1983. <a href=\"https://doi.org/10.1111/j.1095-8312.1983.tb00776.x\">https://doi.org/10.1111/j.1095-8312.1983.tb00776.x</a>.","apa":"Halliday, B., Barton, N. H., &#38; Hewitt, G. (1983). Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma pedestris. <i>Biological Journal of the Linnean Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1111/j.1095-8312.1983.tb00776.x\">https://doi.org/10.1111/j.1095-8312.1983.tb00776.x</a>"},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":19,"page":"51 - 62","year":"1983","_id":"3666","extern":"1","abstract":[{"text":"We have made an extensive allozyme survey of 21 enzyme and protein loci in populations of the alpine grasshopper Podisma pedestris. This species occurs in two races, differing by a chromosomal fusion which separates the ancestral XO/XX race from a derived neo-XY race. These races also differ in DNA content, and hybrids between them have reduced viability. Electrophoresis reveals that the amount of genetic differentiation between these races is no greater than the variation among populations within each race. Both larger-scale surveys and a detailed survey of an area where the races hybridize, show that the chromosomal change is not correlated with gene frequency changes at any of the 21 loci studied. These findings are consistent with recently developed theory concerning the strength of the barrier to gene flow posed by a hybrid zone with characteristics such as those measured experimentally in Podisma. It is argued that hybrid zones in other species which involve allozymic differences do so because of stronger selection against hybrids rather than through mating isolation.","lang":"eng"}],"publisher":"Oxford University Press","publication":"Biological Journal of the Linnean Society","title":"Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma pedestris","publist_id":"2717","date_created":"2018-12-11T12:04:31Z","oa_version":"None"},{"title":"Rare electrophoretic variants in a hybrid zone","publication":"Heredity","publisher":"Nature Publishing Group","oa_version":"Published Version","date_created":"2018-12-11T12:04:31Z","publist_id":"2716","abstract":[{"lang":"eng","text":"Populations of the grasshopper Podisma pedestris were collected from two ends of a zone of hybridization between two chromosome races, at Seyne and Tende in southern France. 21 enzyme and protein loci were detected by gel electrophoresis. Six of these loci showed widespread polymorphism, and a further eleven had very little or no variation. Two loci (Idh, 6Pgd) had rare alleles in different frequencies in the two areas surveyed. The remaining two loci (Mdh-1, Mdh-2) showed a marked increase in the frequency of rare variants, from 1 per cent outside the hybrid zone, up to 5 per cent at its centre. This region of increased electrophoretic variation coincided with the chromosomal cline between the two races, and with a region of decreased viability. It was spread over about the same width as the chromosomal cline. Possible explanations for this extra variation include intragenic recombination and elevated mutation rates."}],"extern":"1","page":"139 - 146","volume":50,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3667","year":"1983","status":"public","acknowledgement":"We would like to thank Manse East, Lynda Flegg, and Sim Webb for their excellent technical assistance, and Prof. J. M. Thoday for helpful comments. Financial support was provided by a NERC Studentship to NHB, and a SRC grant to GMH.","oa":1,"article_type":"original","issue":"2","citation":{"short":"N.H. Barton, B. Halliday, G. Hewitt, Heredity 50 (1983) 139–146.","ista":"Barton NH, Halliday B, Hewitt G. 1983. Rare electrophoretic variants in a hybrid zone. Heredity. 50(2), 139–146.","mla":"Barton, Nicholas H., et al. “Rare Electrophoretic Variants in a Hybrid Zone.” <i>Heredity</i>, vol. 50, no. 2, Nature Publishing Group, 1983, pp. 139–46, doi:<a href=\"https://doi.org/10.1038/hdy.1983.15\">10.1038/hdy.1983.15</a>.","ama":"Barton NH, Halliday B, Hewitt G. Rare electrophoretic variants in a hybrid zone. <i>Heredity</i>. 1983;50(2):139-146. doi:<a href=\"https://doi.org/10.1038/hdy.1983.15\">10.1038/hdy.1983.15</a>","apa":"Barton, N. H., Halliday, B., &#38; Hewitt, G. (1983). Rare electrophoretic variants in a hybrid zone. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.1983.15\">https://doi.org/10.1038/hdy.1983.15</a>","chicago":"Barton, Nicholas H, Bruce Halliday, and Godfrey Hewitt. “Rare Electrophoretic Variants in a Hybrid Zone.” <i>Heredity</i>. Nature Publishing Group, 1983. <a href=\"https://doi.org/10.1038/hdy.1983.15\">https://doi.org/10.1038/hdy.1983.15</a>.","ieee":"N. H. Barton, B. Halliday, and G. Hewitt, “Rare electrophoretic variants in a hybrid zone,” <i>Heredity</i>, vol. 50, no. 2. Nature Publishing Group, pp. 139–146, 1983."},"publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"author":[{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton"},{"full_name":"Halliday, Bruce","first_name":"Bruce","last_name":"Halliday"},{"full_name":"Hewitt, Godfrey","last_name":"Hewitt","first_name":"Godfrey"}],"date_published":"1983-04-01T00:00:00Z","doi":"10.1038/hdy.1983.15","date_updated":"2022-01-25T14:07:12Z","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","main_file_link":[{"url":"https://www.nature.com/articles/hdy198315","open_access":"1"}],"intvolume":"        50","publication_status":"published","day":"01","language":[{"iso":"eng"}],"month":"04"},{"date_created":"2018-12-11T12:04:31Z","oa_version":"None","publist_id":"2715","publication":"Evolution; International Journal of Organic Evolution","title":"Multilocus clines","publisher":"Society for the Study of Evolution","abstract":[{"lang":"eng","text":"When two populations which differ at many loci meet, the degree of introgression of alleles across the boundary will depend on the selection acting on each locus (s), the rate of recombination between adjacent loci (r), and the number of loci involved (n). Simple scaling arguments suggest that the behavior of the system should depend on the ratio of selection to recombination (θ = s/r), and on n. This is borne out by mathematical analysis of two demes which exchange individuals at a low rate; when selection is stronger than recombination (θ > 1), the effective selection on each locus is comparable to the total selection over the whole genome (s* ∼ ns). When selection is weaker than recombination (θ < 1), the effective selection is much weaker, but is still stronger than the selection on each locus alone (s* \\sim sn20 for small θ). When n is very large, these two regimes are separated by a sharp threshold at θ = 1. The results are extended to two taxa which meet in a continuous habitat; the effective selection pressure, which determines the width of the hybrid zone, behaves in the same way as for the simpler case above. Even when selection is weak compared to recombination, multilocus clines have a sharp step at their center, flanked by tails of introgression in which the alleles behave independently of each other. The set of clines acts as a barrier to gene flow, and it is shown that the barrier is strongest when selection is spread over many loci. The implications of the results for divergence and speciation are discussed."}],"extern":"1","_id":"3668","year":"1983","volume":37,"page":"454 - 471","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"journal_article","citation":{"ama":"Barton NH. Multilocus clines. <i>Evolution; International Journal of Organic Evolution</i>. 1983;37(3):454-471. doi:<a href=\"https://doi.org/10.2307/2408260\">10.2307/2408260</a>","short":"N.H. Barton, Evolution; International Journal of Organic Evolution 37 (1983) 454–471.","ista":"Barton NH. 1983. Multilocus clines. Evolution; International Journal of Organic Evolution. 37(3), 454–471.","mla":"Barton, Nicholas H. “Multilocus Clines.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 37, no. 3, Society for the Study of Evolution, 1983, pp. 454–71, doi:<a href=\"https://doi.org/10.2307/2408260\">10.2307/2408260</a>.","ieee":"N. H. Barton, “Multilocus clines,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 37, no. 3. Society for the Study of Evolution, pp. 454–471, 1983.","chicago":"Barton, Nicholas H. “Multilocus Clines.” <i>Evolution; International Journal of Organic Evolution</i>. Society for the Study of Evolution, 1983. <a href=\"https://doi.org/10.2307/2408260\">https://doi.org/10.2307/2408260</a>.","apa":"Barton, N. H. (1983). Multilocus clines. <i>Evolution; International Journal of Organic Evolution</i>. Society for the Study of Evolution. <a href=\"https://doi.org/10.2307/2408260\">https://doi.org/10.2307/2408260</a>"},"publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"status":"public","acknowledgement":"I would like to thank G. Hewitt, J. Raper, M. Shaw, P. Oliver, M. Slatkin, J. Felsenstein, and D. J. Futuyma for their\r\n helpful comments. This work was partly supported by an SRC Post-Doctoral Fellowship.","issue":"3","external_id":{"pmid":["28563316 "]},"article_type":"original","quality_controlled":"1","date_published":"1983-05-01T00:00:00Z","author":[{"first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","date_updated":"2022-08-19T07:08:29Z","doi":"10.2307/2408260","main_file_link":[{"url":"http://www.jstor.org/stable/2408260"}],"intvolume":"        37","publication_status":"published","month":"05","language":[{"iso":"eng"}],"pmid":1,"day":"01"},{"conference":{"end_date":"1983-07-22","name":"ICALP: Automata, Languages and Programming","start_date":"1983-07-18","location":"Barcelona, Spain"},"quality_controlled":"1","scopus_import":"1","keyword":["Voronoi diagram","Asymptotic bound","Straightforward counting","Affine trans","Neighbor Voronoi diagram"],"alternative_title":["LNCS"],"date_updated":"2022-01-25T13:42:40Z","doi":"10.1007/BFb0036908","article_processing_charge":"No","date_published":"1983-01-01T00:00:00Z","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"last_name":"Welzl","first_name":"Emo","full_name":"Welzl, Emo"}],"publication_status":"published","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007%2FBFb0036908"}],"intvolume":"       154","language":[{"iso":"eng"}],"month":"01","day":"01","publist_id":"1996","oa_version":"None","date_created":"2018-12-11T12:07:04Z","publisher":"Springer","title":"On the number of equal-sized semispaces of a set of points in the plane","publication":"International Colloquium on Automata, Languages, and Programming","extern":"1","series_title":"LNCS","year":"1983","_id":"4124","type":"conference","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"182 - 187","volume":154,"citation":{"apa":"Edelsbrunner, H., &#38; Welzl, E. (1983). On the number of equal-sized semispaces of a set of points in the plane. In <i>International Colloquium on Automata, Languages, and Programming</i> (Vol. 154, pp. 182–187). Barcelona, Spain: Springer. <a href=\"https://doi.org/10.1007/BFb0036908\">https://doi.org/10.1007/BFb0036908</a>","chicago":"Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Equal-Sized Semispaces of a Set of Points in the Plane.” In <i>International Colloquium on Automata, Languages, and Programming</i>, 154:182–87. LNCS. Springer, 1983. <a href=\"https://doi.org/10.1007/BFb0036908\">https://doi.org/10.1007/BFb0036908</a>.","ieee":"H. Edelsbrunner and E. Welzl, “On the number of equal-sized semispaces of a set of points in the plane,” in <i>International Colloquium on Automata, Languages, and Programming</i>, Barcelona, Spain, 1983, vol. 154, pp. 182–187.","short":"H. Edelsbrunner, E. Welzl, in:, International Colloquium on Automata, Languages, and Programming, Springer, 1983, pp. 182–187.","ista":"Edelsbrunner H, Welzl E. 1983. On the number of equal-sized semispaces of a set of points in the plane. International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and ProgrammingLNCS, LNCS, vol. 154, 182–187.","mla":"Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Equal-Sized Semispaces of a Set of Points in the Plane.” <i>International Colloquium on Automata, Languages, and Programming</i>, vol. 154, Springer, 1983, pp. 182–87, doi:<a href=\"https://doi.org/10.1007/BFb0036908\">10.1007/BFb0036908</a>.","ama":"Edelsbrunner H, Welzl E. On the number of equal-sized semispaces of a set of points in the plane. In: <i>International Colloquium on Automata, Languages, and Programming</i>. Vol 154. LNCS. Springer; 1983:182-187. doi:<a href=\"https://doi.org/10.1007/BFb0036908\">10.1007/BFb0036908</a>"},"status":"public"},{"page":"251 - 257","volume":17,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4125","year":"1983","status":"public","acknowledgement":"The second author gratefully acknowledges discussions on the presented topic with David Kirkpatrick and Raimund Seidel.","article_type":"original","issue":"2","citation":{"chicago":"Aurenhammer, Franz, and Herbert Edelsbrunner. “An Optimal Algorithm for Constructing the Weighted Voronoi Diagram in the Plane.” <i>Pattern Recognition</i>. Elsevier, 1983. <a href=\"https://doi.org/10.1016/0031-3203(84)90064-5\">https://doi.org/10.1016/0031-3203(84)90064-5</a>.","ieee":"F. Aurenhammer and H. Edelsbrunner, “An optimal algorithm for constructing the weighted Voronoi diagram in the plane,” <i>Pattern Recognition</i>, vol. 17, no. 2. Elsevier, pp. 251–257, 1983.","apa":"Aurenhammer, F., &#38; Edelsbrunner, H. (1983). An optimal algorithm for constructing the weighted Voronoi diagram in the plane. <i>Pattern Recognition</i>. Elsevier. <a href=\"https://doi.org/10.1016/0031-3203(84)90064-5\">https://doi.org/10.1016/0031-3203(84)90064-5</a>","ama":"Aurenhammer F, Edelsbrunner H. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. <i>Pattern Recognition</i>. 1983;17(2):251-257. doi:<a href=\"https://doi.org/10.1016/0031-3203(84)90064-5\">10.1016/0031-3203(84)90064-5</a>","mla":"Aurenhammer, Franz, and Herbert Edelsbrunner. “An Optimal Algorithm for Constructing the Weighted Voronoi Diagram in the Plane.” <i>Pattern Recognition</i>, vol. 17, no. 2, Elsevier, 1983, pp. 251–57, doi:<a href=\"https://doi.org/10.1016/0031-3203(84)90064-5\">10.1016/0031-3203(84)90064-5</a>.","short":"F. Aurenhammer, H. Edelsbrunner, Pattern Recognition 17 (1983) 251–257.","ista":"Aurenhammer F, Edelsbrunner H. 1983. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition. 17(2), 251–257."},"publication_identifier":{"eissn":["1873-5142"],"issn":["0031-3203"]},"title":"An optimal algorithm for constructing the weighted Voronoi diagram in the plane","publication":"Pattern Recognition","publisher":"Elsevier","oa_version":"None","date_created":"2018-12-11T12:07:05Z","publist_id":"1997","abstract":[{"text":"Let S denote a set of n points in the plane such that each point p has assigned a positive weight w(p) which expresses its capability to influence its neighbourhood. In this sense, the weighted distance of an arbitrary point x from p is given by de(x,p)/w(p) where de denotes the Euclidean distance function. The weighted Voronoi diagram for S is a subdivision of the plane such that each point p in S is associated with a region consisting of all points x in the plane for which p is a weighted nearest point of S.\r\n\r\nAn algorithm which constructs the weighted Voronoi diagram for S in O(n2) time is outlined in this paper. The method is optimal as the diagram can consist of Θ(n2) faces, edges and vertices.\r\n","lang":"eng"}],"extern":"1","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0031320384900645?via%3Dihub"}],"intvolume":"        17","publication_status":"published","day":"01","language":[{"iso":"eng"}],"month":"07","author":[{"first_name":"Franz","last_name":"Aurenhammer","full_name":"Aurenhammer, Franz"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"}],"date_published":"1983-07-01T00:00:00Z","doi":"10.1016/0031-3203(84)90064-5","date_updated":"2022-01-27T14:06:27Z","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1"},{"day":"01","month":"09","language":[{"iso":"eng"}],"publication_status":"published","intvolume":"        13","article_processing_charge":"No","date_updated":"2022-01-25T12:21:18Z","doi":"10.1080/00207168308803364","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"date_published":"1983-09-01T00:00:00Z","quality_controlled":"1","scopus_import":"1","issue":"3-4","article_type":"original","status":"public","publication_identifier":{"eissn":["1029-0265"],"issn":["0020-7160"]},"citation":{"ista":"Edelsbrunner H. 1983. A new approach to rectangle intersections part 1. International Journal of Computer Mathematics. 13(3–4), 209–219.","mla":"Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 1.” <i>International Journal of Computer Mathematics</i>, vol. 13, no. 3–4, Taylor &#38; Francis, 1983, pp. 209–19, doi:<a href=\"https://doi.org/10.1080/00207168308803364\">10.1080/00207168308803364</a>.","short":"H. Edelsbrunner, International Journal of Computer Mathematics 13 (1983) 209–219.","ama":"Edelsbrunner H. A new approach to rectangle intersections part 1. <i>International Journal of Computer Mathematics</i>. 1983;13(3-4):209-219. doi:<a href=\"https://doi.org/10.1080/00207168308803364\">10.1080/00207168308803364</a>","apa":"Edelsbrunner, H. (1983). A new approach to rectangle intersections part 1. <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00207168308803364\">https://doi.org/10.1080/00207168308803364</a>","chicago":"Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 1.” <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis, 1983. <a href=\"https://doi.org/10.1080/00207168308803364\">https://doi.org/10.1080/00207168308803364</a>.","ieee":"H. Edelsbrunner, “A new approach to rectangle intersections part 1,” <i>International Journal of Computer Mathematics</i>, vol. 13, no. 3–4. Taylor &#38; Francis, pp. 209–219, 1983."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":13,"page":"209 - 219","year":"1983","_id":"4126","extern":"1","abstract":[{"text":"Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data structure is developed which is efficient in time and space and allows us to report all d-dimensional rectangles stored which intersect a d-dimensional query rectangle. Second, in Part II, a slightly modified version of this new data structure is applied to report all intersecting pairs of rectangles of a given set. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions.","lang":"eng"}],"publisher":"Taylor & Francis","publication":"International Journal of Computer Mathematics","title":"A new approach to rectangle intersections part 1","publist_id":"1993","date_created":"2018-12-11T12:07:05Z","oa_version":"None"},{"intvolume":"        13","publication_status":"published","day":"01","month":"09","language":[{"iso":"eng"}],"author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"date_published":"1983-09-01T00:00:00Z","article_processing_charge":"No","date_updated":"2022-01-25T12:33:10Z","doi":"10.1080/00207168308803365","scopus_import":"1","quality_controlled":"1","volume":13,"page":"221 - 229","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","_id":"4127","year":"1983","status":"public","issue":"3-4","article_type":"original","citation":{"ista":"Edelsbrunner H. 1983. A new approach to rectangle intersections part 2. International Journal of Computer Mathematics. 13(3–4), 221–229.","mla":"Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 2.” <i>International Journal of Computer Mathematics</i>, vol. 13, no. 3–4, Taylor &#38; Francis, 1983, pp. 221–29, doi:<a href=\"https://doi.org/10.1080/00207168308803365\">10.1080/00207168308803365</a>.","short":"H. Edelsbrunner, International Journal of Computer Mathematics 13 (1983) 221–229.","ama":"Edelsbrunner H. A new approach to rectangle intersections part 2. <i>International Journal of Computer Mathematics</i>. 1983;13(3-4):221-229. doi:<a href=\"https://doi.org/10.1080/00207168308803365\">10.1080/00207168308803365</a>","apa":"Edelsbrunner, H. (1983). A new approach to rectangle intersections part 2. <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00207168308803365\">https://doi.org/10.1080/00207168308803365</a>","chicago":"Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 2.” <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis, 1983. <a href=\"https://doi.org/10.1080/00207168308803365\">https://doi.org/10.1080/00207168308803365</a>.","ieee":"H. Edelsbrunner, “A new approach to rectangle intersections part 2,” <i>International Journal of Computer Mathematics</i>, vol. 13, no. 3–4. Taylor &#38; Francis, pp. 221–229, 1983."},"publication_identifier":{"issn":["0020-7160"],"eissn":["1029-0265"]},"publication":"International Journal of Computer Mathematics","title":"A new approach to rectangle intersections part 2","publisher":"Taylor & Francis","date_created":"2018-12-11T12:07:06Z","oa_version":"None","publist_id":"1994","abstract":[{"lang":"eng","text":"The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions."}],"extern":"1"},{"quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","doi":"10.1109/TIT.1983.1056714 ","date_updated":"2022-01-25T12:55:07Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"last_name":"Kirkpatrick","first_name":"David","full_name":"Kirkpatrick, David"},{"full_name":"Seidel, Raimund","last_name":"Seidel","first_name":"Raimund"}],"date_published":"1983-06-01T00:00:00Z","month":"06","language":[{"iso":"eng"}],"day":"01","publication_status":"published","intvolume":"        29","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/1056714"}],"extern":"1","abstract":[{"lang":"eng","text":"A generalization of the convex hull of a finite set of points in the plane is introduced and analyzed. This generalization leads to a family of straight-line graphs, \" \\alpha -shapes,\" which seem to capture the intuitive notions of \"fine shape\" and \"crude shape\" of point sets. It is shown that a-shapes are subgraphs of the closest point or furthest point Delaunay triangulation. Relying on this result an optimal O(n \\log n) algorithm that constructs \\alpha -shapes is developed."}],"publist_id":"1995","date_created":"2018-12-11T12:07:06Z","oa_version":"None","publisher":"IEEE","publication":"IEEE Transactions on Information Theory","title":"On the shape of a set of points in the plane","publication_identifier":{"eissn":["1558-0814"],"issn":["0018-9162"]},"citation":{"chicago":"Edelsbrunner, Herbert, David Kirkpatrick, and Raimund Seidel. “On the Shape of a Set of Points in the Plane.” <i>IEEE Transactions on Information Theory</i>. IEEE, 1983. <a href=\"https://doi.org/10.1109/TIT.1983.1056714 \">https://doi.org/10.1109/TIT.1983.1056714 </a>.","ieee":"H. Edelsbrunner, D. Kirkpatrick, and R. Seidel, “On the shape of a set of points in the plane,” <i>IEEE Transactions on Information Theory</i>, vol. 29, no. 4. IEEE, pp. 551–559, 1983.","apa":"Edelsbrunner, H., Kirkpatrick, D., &#38; Seidel, R. (1983). On the shape of a set of points in the plane. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/TIT.1983.1056714 \">https://doi.org/10.1109/TIT.1983.1056714 </a>","ama":"Edelsbrunner H, Kirkpatrick D, Seidel R. On the shape of a set of points in the plane. <i>IEEE Transactions on Information Theory</i>. 1983;29(4):551-559. doi:<a href=\"https://doi.org/10.1109/TIT.1983.1056714 \">10.1109/TIT.1983.1056714 </a>","mla":"Edelsbrunner, Herbert, et al. “On the Shape of a Set of Points in the Plane.” <i>IEEE Transactions on Information Theory</i>, vol. 29, no. 4, IEEE, 1983, pp. 551–59, doi:<a href=\"https://doi.org/10.1109/TIT.1983.1056714 \">10.1109/TIT.1983.1056714 </a>.","short":"H. Edelsbrunner, D. Kirkpatrick, R. Seidel, IEEE Transactions on Information Theory 29 (1983) 551–559.","ista":"Edelsbrunner H, Kirkpatrick D, Seidel R. 1983. On the shape of a set of points in the plane. IEEE Transactions on Information Theory. 29(4), 551–559."},"issue":"4","article_type":"original","acknowledgement":"The authors express their appreciation for numerous constructive suggestions, which led to improvements on\r\nvarious phases of the manuscript, to Dr. Marvin Simon of JPL and to Professor George L. Turin of University of\r\nCalifornia, Berkeley. The junior author also gratefully acknowledges the role of the latter as her M.S. research\r\nadvisor on the project which formed the nucleus of this work. \r\n","status":"public","year":"1983","_id":"4128","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":29,"page":"551 - 559"},{"conference":{"location":"University of York, United Kingdom","start_date":"1982-07-13","name":"SystAss: Systematics Association","end_date":"1982-07-15"},"keyword":["chemotaxonomy"],"quality_controlled":"1","date_published":"1983-01-01T00:00:00Z","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"},{"first_name":"Godfrey","last_name":"Hewitt","full_name":"Hewitt, Godfrey"}],"editor":[{"last_name":"Oxford","first_name":"Geoffrey","full_name":"Oxford, Geoffrey"},{"last_name":"Rollinson","first_name":"David","full_name":"Rollinson, David"}],"article_processing_charge":"No","alternative_title":["Systematics Association Special Volume"],"date_updated":"2022-01-24T11:05:31Z","intvolume":"        24","publication_status":"published","month":"01","language":[{"iso":"eng"}],"day":"01","date_created":"2018-12-11T12:08:17Z","oa_version":"None","publist_id":"1710","publication":"Protein polymorphism: Adaptive and taxonomic significance","title":"Hybrid zones as barriers to gene flow","publisher":"Academic Press","abstract":[{"lang":"eng","text":"The hybrid zone which forms when two partially incompatible populations meet acts as a barrier to gene flow. We discuss electrophoretic and theoretical evidence on the strength of such barriers. Hybrid zones generally involve considerable electrophoretic divergence. The enzyme clines are consistent in position and width; in some cases, they show consistently asymmetric patterns of introgression. This consistency suggests that the clines are maintained primarily by the indirect effects of selection at linked loci, rather than by the effect of each individual locus on fitness. A cline at a single locus will present some barrier, regardless of the selective mechanism which maintains it. However, unless the locus induces virtually complete assortment or hybrid unfitness, the barrier will be weak. Spreading the same selection over more clines gives a stronger barrier. If the clines are staggered, this barrier is still unlikely to be significant; if they coincide, and if selection is stronger than recombination, then the barrier will be very strong; its strength and asymmetry will be consistent over different loci. Thus, the taxonomic status of divergent populations cannot be inferred just from the total amount of pre- or post-mating isolation; the number of genetic differences, and the interactions between them are equally important in determining rates of gene flow."}],"extern":"1","_id":"4328","year":"1983","volume":24,"page":"341 - 359","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"book_chapter","citation":{"ieee":"N. H. Barton and G. Hewitt, “Hybrid zones as barriers to gene flow,” in <i>Protein polymorphism: Adaptive and taxonomic significance</i>, vol. 24, G. Oxford and D. Rollinson, Eds. Academic Press, 1983, pp. 341–359.","chicago":"Barton, Nicholas H, and Godfrey Hewitt. “Hybrid Zones as Barriers to Gene Flow.” In <i>Protein Polymorphism: Adaptive and Taxonomic Significance</i>, edited by Geoffrey Oxford and David Rollinson, 24:341–59. Academic Press, 1983.","apa":"Barton, N. H., &#38; Hewitt, G. (1983). Hybrid zones as barriers to gene flow. In G. Oxford &#38; D. Rollinson (Eds.), <i>Protein polymorphism: Adaptive and taxonomic significance</i> (Vol. 24, pp. 341–359). University of York, United Kingdom: Academic Press.","ama":"Barton NH, Hewitt G. Hybrid zones as barriers to gene flow. In: Oxford G, Rollinson D, eds. <i>Protein Polymorphism: Adaptive and Taxonomic Significance</i>. Vol 24. Academic Press; 1983:341-359.","mla":"Barton, Nicholas H., and Godfrey Hewitt. “Hybrid Zones as Barriers to Gene Flow.” <i>Protein Polymorphism: Adaptive and Taxonomic Significance</i>, edited by Geoffrey Oxford and David Rollinson, vol. 24, Academic Press, 1983, pp. 341–59.","ista":"Barton NH, Hewitt G. 1983.Hybrid zones as barriers to gene flow. In: Protein polymorphism: Adaptive and taxonomic significance. Systematics Association Special Volume, vol. 24, 341–359.","short":"N.H. Barton, G. Hewitt, in:, G. Oxford, D. Rollinson (Eds.), Protein Polymorphism: Adaptive and Taxonomic Significance, Academic Press, 1983, pp. 341–359."},"publication_identifier":{"issn":["0309-2593"],"isbn":["978-0-1253-1780-1"]},"status":"public"},{"publication_status":"published","year":"1983","_id":"4329","intvolume":"        31","type":"review","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"626 - 627","volume":31,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1095-8282"],"issn":["0003-3472"]},"month":"05","citation":{"ieee":"N. H. Barton, “The extended phenotype: the gene as the unit of selection (review of Dawkins R 1982),” <i>Animal Behaviour</i>, vol. 31, no. 2. Elsevier, pp. 626–627, 1983.","chicago":"Barton, Nicholas H. “The Extended Phenotype: The Gene as the Unit of Selection (Review of Dawkins R 1982).” <i>Animal Behaviour</i>. Elsevier, 1983. <a href=\"https://doi.org/10.1016/S0003-3472(83)80100-6\">https://doi.org/10.1016/S0003-3472(83)80100-6</a>.","apa":"Barton, N. H. (1983). The extended phenotype: the gene as the unit of selection (review of Dawkins R 1982). <i>Animal Behaviour</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0003-3472(83)80100-6\">https://doi.org/10.1016/S0003-3472(83)80100-6</a>","ama":"Barton NH. The extended phenotype: the gene as the unit of selection (review of Dawkins R 1982). <i>Animal Behaviour</i>. 1983;31(2):626-627. doi:<a href=\"https://doi.org/10.1016/S0003-3472(83)80100-6\">10.1016/S0003-3472(83)80100-6</a>","ista":"Barton NH. 1983. The extended phenotype: the gene as the unit of selection (review of Dawkins R 1982). Animal Behaviour. 31(2), 626–627.","mla":"Barton, Nicholas H. “The Extended Phenotype: The Gene as the Unit of Selection (Review of Dawkins R 1982).” <i>Animal Behaviour</i>, vol. 31, no. 2, Elsevier, 1983, pp. 626–27, doi:<a href=\"https://doi.org/10.1016/S0003-3472(83)80100-6\">10.1016/S0003-3472(83)80100-6</a>.","short":"N.H. Barton, Animal Behaviour 31 (1983) 626–627."},"day":"01","issue":"2","status":"public","publist_id":"1708","oa_version":"None","date_created":"2018-12-11T12:08:17Z","publisher":"Elsevier","title":"The extended phenotype: the gene as the unit of selection (review of Dawkins R 1982)","publication":"Animal Behaviour","extern":"1","quality_controlled":"1","doi":"10.1016/S0003-3472(83)80100-6","date_updated":"2022-01-21T12:47:05Z","article_processing_charge":"No","date_published":"1983-05-01T00:00:00Z","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"}]},{"publication_status":"published","year":"1983","intvolume":"        50","_id":"4330","main_file_link":[{"url":"https://www.nature.com/articles/hdy198324","open_access":"1"}],"place":"University College of London","type":"review","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"213 - 213","volume":50,"publication_identifier":{"eissn":["1365-2540"],"issn":["0018-067X"]},"language":[{"iso":"eng"}],"month":"04","citation":{"ieee":"N. H. Barton, “Gene flow and speciation (abstract),” <i>Heredity</i>, vol. 50. Springer Nature, University College of London, pp. 213–213, 1983.","chicago":"Barton, Nicholas H. “Gene Flow and Speciation (Abstract).” <i>Heredity</i>. University College of London: Springer Nature, 1983. <a href=\"https://doi.org/10.1038/hdy.1983.24\">https://doi.org/10.1038/hdy.1983.24</a>.","apa":"Barton, N. H. (1983). Gene flow and speciation (abstract). <i>Heredity</i>. University College of London: Springer Nature. <a href=\"https://doi.org/10.1038/hdy.1983.24\">https://doi.org/10.1038/hdy.1983.24</a>","ama":"Barton NH. Gene flow and speciation (abstract). <i>Heredity</i>. 1983;50:213-213. doi:<a href=\"https://doi.org/10.1038/hdy.1983.24\">10.1038/hdy.1983.24</a>","short":"N.H. Barton, Heredity 50 (1983) 213–213.","ista":"Barton NH. 1983. Gene flow and speciation (abstract). Heredity. 50, 213–213.","mla":"Barton, Nicholas H. “Gene Flow and Speciation (Abstract).” <i>Heredity</i>, vol. 50, Springer Nature, 1983, pp. 213–213, doi:<a href=\"https://doi.org/10.1038/hdy.1983.24\">10.1038/hdy.1983.24</a>."},"day":"01","oa":1,"status":"public","publist_id":"1704","oa_version":"Published Version","date_created":"2018-12-11T12:08:17Z","publisher":"Springer Nature","title":"Gene flow and speciation (abstract)","publication":"Heredity","extern":"1","quality_controlled":"1","doi":"10.1038/hdy.1983.24","date_updated":"2022-01-21T12:38:10Z","article_processing_charge":"No","date_published":"1983-04-01T00:00:00Z","author":[{"first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}]},{"abstract":[{"lang":"eng","text":"The dispersal rate of the grasshopper Podisma pedestris has been measured, with the aim of interpreting the width of a chromosomal cline. 171 adults were marked individually, and released within the cline. 169 movements were seen over three subsequent scorings; the distribution of distances, after correction for the loss of long distance dispersants, was close to a normal curve, but there was an initial shift of ten metres, perhaps towards a better habitat. The linear variance increased at about 214 m2 day- 1, which corresponds to a standard deviation of 207 m gen- 1/2 over a 20 day life span. Statistical uncertainty in this estimate can be expressed using a distribution-free maximum likelihood method, which gives support limits of 186- 270 m gen- 1/2. However, the main errors come from extrapolating from this experiment to the cline as a whole."}],"extern":"1","date_created":"2018-12-11T12:04:32Z","oa_version":"Published Version","publist_id":"2714","publication":"Heredity","title":"A measurement of dispersal in the grasshopper Podisma pedestris (Orthoptera: Acrididae)","publisher":"Springer Nature","citation":{"ista":"Barton NH, Hewitt G. 1982. A measurement of dispersal in the grasshopper Podisma pedestris (Orthoptera: Acrididae). Heredity. 48(2), 237–249.","mla":"Barton, Nicholas H., and Godfrey Hewitt. “A Measurement of Dispersal in the Grasshopper Podisma Pedestris (Orthoptera: Acrididae).” <i>Heredity</i>, vol. 48, no. 2, Springer Nature, 1982, pp. 237–49, doi:<a href=\"https://doi.org/10.1038/hdy.1982.29\">10.1038/hdy.1982.29</a>.","short":"N.H. Barton, G. Hewitt, Heredity 48 (1982) 237–249.","ama":"Barton NH, Hewitt G. A measurement of dispersal in the grasshopper Podisma pedestris (Orthoptera: Acrididae). <i>Heredity</i>. 1982;48(2):237-249. doi:<a href=\"https://doi.org/10.1038/hdy.1982.29\">10.1038/hdy.1982.29</a>","apa":"Barton, N. H., &#38; Hewitt, G. (1982). A measurement of dispersal in the grasshopper Podisma pedestris (Orthoptera: Acrididae). <i>Heredity</i>. Springer Nature. <a href=\"https://doi.org/10.1038/hdy.1982.29\">https://doi.org/10.1038/hdy.1982.29</a>","ieee":"N. H. Barton and G. Hewitt, “A measurement of dispersal in the grasshopper Podisma pedestris (Orthoptera: Acrididae),” <i>Heredity</i>, vol. 48, no. 2. Springer Nature, pp. 237–249, 1982.","chicago":"Barton, Nicholas H, and Godfrey Hewitt. “A Measurement of Dispersal in the Grasshopper Podisma Pedestris (Orthoptera: Acrididae).” <i>Heredity</i>. Springer Nature, 1982. <a href=\"https://doi.org/10.1038/hdy.1982.29\">https://doi.org/10.1038/hdy.1982.29</a>."},"publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"acknowledgement":"We are grateful for the help in the field of Bruce and Helen Halliday, James, Matthew, Daniel and Elizabeth Hewitt, and for the hospitality of M et Mme Aviotti. This work was supported by an N.E.R.C. Studentship to the first author, and an S.R.C. research grant to the second.\r\n","status":"public","oa":1,"issue":"2","article_type":"original","_id":"3669","year":"1982","volume":48,"page":"237 - 249","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","quality_controlled":"1","date_published":"1982-04-01T00:00:00Z","author":[{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton"},{"full_name":"Hewitt, Godfrey","first_name":"Godfrey","last_name":"Hewitt"}],"article_processing_charge":"No","doi":"10.1038/hdy.1982.29","date_updated":"2022-01-21T12:31:06Z","month":"04","language":[{"iso":"eng"}],"day":"01","main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy198229"}],"intvolume":"        48","publication_status":"published"},{"abstract":[{"text":"An algorithm for the geometric problem of determining a line (called a stabbing line) which intersects each ofn given line segments in the plane is presented. As a matter of fact, the algorithm computes a description of all stabbing lines. A purely geometric fact is proved which infers that this description requiresO(n) space to be specified. Our algorithm computes it inO(n logn) time which is optimal in the worst case.\r\nUsing the description of the stabbing lines, we are able to decide inO(logn) time whether or not a specified line is a stabbing line. Finally, the problem of maintaining the description of all stabbing lines while inserting and deleting line segments is addressed.","lang":"eng"}],"extern":"1","quality_controlled":"1","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"full_name":"Maurer, Hermann","last_name":"Maurer","first_name":"Hermann"},{"full_name":"Preparata, Franco","last_name":"Preparata","first_name":"Franco"},{"first_name":"Arnold","last_name":"Rosenberg","full_name":"Rosenberg, Arnold"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"},{"first_name":"Derick","last_name":"Wood","full_name":"Wood, Derick"}],"date_published":"1982-09-01T00:00:00Z","article_processing_charge":"No","doi":"10.1007/BF01934440","date_updated":"2022-01-21T11:01:45Z","date_created":"2018-12-11T12:07:06Z","oa_version":"None","publist_id":"1990","publication":"BIT Numerical Mathematics","title":"Stabbing line segments","publisher":"Springer Nature","citation":{"apa":"Edelsbrunner, H., Maurer, H., Preparata, F., Rosenberg, A., Welzl, E., &#38; Wood, D. (1982). Stabbing line segments. <i>BIT Numerical Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/BF01934440\">https://doi.org/10.1007/BF01934440</a>","ieee":"H. Edelsbrunner, H. Maurer, F. Preparata, A. Rosenberg, E. Welzl, and D. Wood, “Stabbing line segments,” <i>BIT Numerical Mathematics</i>, vol. 22, no. 3. Springer Nature, pp. 274–281, 1982.","chicago":"Edelsbrunner, Herbert, Hermann Maurer, Franco Preparata, Arnold Rosenberg, Emo Welzl, and Derick Wood. “Stabbing Line Segments.” <i>BIT Numerical Mathematics</i>. Springer Nature, 1982. <a href=\"https://doi.org/10.1007/BF01934440\">https://doi.org/10.1007/BF01934440</a>.","mla":"Edelsbrunner, Herbert, et al. “Stabbing Line Segments.” <i>BIT Numerical Mathematics</i>, vol. 22, no. 3, Springer Nature, 1982, pp. 274–81, doi:<a href=\"https://doi.org/10.1007/BF01934440\">10.1007/BF01934440</a>.","ista":"Edelsbrunner H, Maurer H, Preparata F, Rosenberg A, Welzl E, Wood D. 1982. Stabbing line segments. BIT Numerical Mathematics. 22(3), 274–281.","short":"H. Edelsbrunner, H. Maurer, F. Preparata, A. Rosenberg, E. Welzl, D. Wood, BIT Numerical Mathematics 22 (1982) 274–281.","ama":"Edelsbrunner H, Maurer H, Preparata F, Rosenberg A, Welzl E, Wood D. Stabbing line segments. <i>BIT Numerical Mathematics</i>. 1982;22(3):274-281. doi:<a href=\"https://doi.org/10.1007/BF01934440\">10.1007/BF01934440</a>"},"month":"09","publication_identifier":{"eissn":["1572-9125"],"issn":["0006-3835"]},"language":[{"iso":"eng"}],"status":"public","issue":"3","day":"01","article_type":"original","intvolume":"        22","_id":"4129","year":"1982","publication_status":"published","volume":22,"page":"274 - 281","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article"},{"article_type":"original","day":"20","issue":"2","status":"public","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1872-6119"],"issn":["0020-0190"]},"month":"04","citation":{"ama":"Edelsbrunner H, Maurer H, Kirkpatrick D. Polygonal intersection searching. <i>Information Processing Letters</i>. 1982;14(2):74-79. doi:<a href=\"https://doi.org/10.1016/0020-0190(82)90090-4\">10.1016/0020-0190(82)90090-4</a>","ista":"Edelsbrunner H, Maurer H, Kirkpatrick D. 1982. Polygonal intersection searching. Information Processing Letters. 14(2), 74–79.","short":"H. Edelsbrunner, H. Maurer, D. Kirkpatrick, Information Processing Letters 14 (1982) 74–79.","mla":"Edelsbrunner, Herbert, et al. “Polygonal Intersection Searching.” <i>Information Processing Letters</i>, vol. 14, no. 2, Elsevier, 1982, pp. 74–79, doi:<a href=\"https://doi.org/10.1016/0020-0190(82)90090-4\">10.1016/0020-0190(82)90090-4</a>.","chicago":"Edelsbrunner, Herbert, Hermann Maurer, and David Kirkpatrick. “Polygonal Intersection Searching.” <i>Information Processing Letters</i>. Elsevier, 1982. <a href=\"https://doi.org/10.1016/0020-0190(82)90090-4\">https://doi.org/10.1016/0020-0190(82)90090-4</a>.","ieee":"H. Edelsbrunner, H. Maurer, and D. Kirkpatrick, “Polygonal intersection searching,” <i>Information Processing Letters</i>, vol. 14, no. 2. Elsevier, pp. 74–79, 1982.","apa":"Edelsbrunner, H., Maurer, H., &#38; Kirkpatrick, D. (1982). Polygonal intersection searching. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(82)90090-4\">https://doi.org/10.1016/0020-0190(82)90090-4</a>"},"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"74 - 79","volume":14,"publication_status":"published","year":"1982","intvolume":"        14","_id":"4130","doi":"10.1016/0020-0190(82)90090-4","date_updated":"2022-01-21T11:11:25Z","article_processing_charge":"No","date_published":"1982-04-20T00:00:00Z","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Maurer, Hermann","first_name":"Hermann","last_name":"Maurer"},{"full_name":"Kirkpatrick, David","first_name":"David","last_name":"Kirkpatrick"}],"extern":"1","quality_controlled":"1","publisher":"Elsevier","title":"Polygonal intersection searching","publication":"Information Processing Letters","publist_id":"1991","oa_version":"None","date_created":"2018-12-11T12:07:07Z"},{"publisher":"Elsevier","publication":"Information Processing Letters","title":"On the equivalence of some rectangle problems","publist_id":"1992","date_created":"2018-12-11T12:07:07Z","oa_version":"None","article_processing_charge":"No","date_updated":"2022-01-21T12:22:39Z","doi":"10.1016/0020-0190(82)90068-0","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"first_name":"Mark","last_name":"Overmars","full_name":"Overmars, Mark"}],"date_published":"1982-05-16T00:00:00Z","quality_controlled":"1","extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":14,"page":"124 - 127","year":"1982","publication_status":"published","_id":"4131","intvolume":"        14","issue":"3","day":"16","article_type":"original","status":"public","month":"05","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1872-6119"],"unknown":["0020-0190"]},"citation":{"chicago":"Edelsbrunner, Herbert, and Mark Overmars. “On the Equivalence of Some Rectangle Problems.” <i>Information Processing Letters</i>. Elsevier, 1982. <a href=\"https://doi.org/10.1016/0020-0190(82)90068-0\">https://doi.org/10.1016/0020-0190(82)90068-0</a>.","ieee":"H. Edelsbrunner and M. Overmars, “On the equivalence of some rectangle problems,” <i>Information Processing Letters</i>, vol. 14, no. 3. Elsevier, pp. 124–127, 1982.","apa":"Edelsbrunner, H., &#38; Overmars, M. (1982). On the equivalence of some rectangle problems. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(82)90068-0\">https://doi.org/10.1016/0020-0190(82)90068-0</a>","ama":"Edelsbrunner H, Overmars M. On the equivalence of some rectangle problems. <i>Information Processing Letters</i>. 1982;14(3):124-127. doi:<a href=\"https://doi.org/10.1016/0020-0190(82)90068-0\">10.1016/0020-0190(82)90068-0</a>","short":"H. Edelsbrunner, M. Overmars, Information Processing Letters 14 (1982) 124–127.","ista":"Edelsbrunner H, Overmars M. 1982. On the equivalence of some rectangle problems. Information Processing Letters. 14(3), 124–127.","mla":"Edelsbrunner, Herbert, and Mark Overmars. “On the Equivalence of Some Rectangle Problems.” <i>Information Processing Letters</i>, vol. 14, no. 3, Elsevier, 1982, pp. 124–27, doi:<a href=\"https://doi.org/10.1016/0020-0190(82)90068-0\">10.1016/0020-0190(82)90068-0</a>."}}]