[{"publisher":"Liss","title":"Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy","language":[{"iso":"eng"}],"month":"01","year":"1985","date_published":"1985-01-01T00:00:00Z","date_created":"2018-12-11T12:07:48Z","alternative_title":["Progress in leukocyte biology "],"intvolume":"         3","status":"public","author":[{"full_name":"Curtis, C.","last_name":"Curtis","first_name":"C."},{"first_name":"J.","last_name":"Curtis","full_name":"Curtis, J."},{"orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","citation":{"chicago":"Curtis, C., J. Curtis, and Nicholas H Barton. “Methodology for Testing the Hypothesis of Single Locus Control of Host Resistance to Infection and Malignancy.” In <i>Genetic Control of Host Resistance to Infection and Malignancy</i>, edited by Emil Skamene, Vol. 3. Progress in Leukocyte Biology. Liss, 1985.","ieee":"C. Curtis, J. Curtis, and N. H. Barton, “Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy,” in <i>Genetic Control of Host Resistance to Infection and Malignancy</i>, vol. 3, E. Skamene, Ed. Liss, 1985.","apa":"Curtis, C., Curtis, J., &#38; Barton, N. H. (1985). Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy. In E. Skamene (Ed.), <i>Genetic Control of Host Resistance to Infection and Malignancy</i> (Vol. 3). Liss.","ista":"Curtis C, Curtis J, Barton NH. 1985.Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy. In: Genetic Control of Host Resistance to Infection and Malignancy. Progress in leukocyte biology , vol. 3.","short":"C. Curtis, J. Curtis, N.H. Barton, in:, E. Skamene (Ed.), Genetic Control of Host Resistance to Infection and Malignancy, Liss, 1985.","mla":"Curtis, C., et al. “Methodology for Testing the Hypothesis of Single Locus Control of Host Resistance to Infection and Malignancy.” <i>Genetic Control of Host Resistance to Infection and Malignancy</i>, edited by Emil Skamene, vol. 3, Liss, 1985.","ama":"Curtis C, Curtis J, Barton NH. Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy. In: Skamene E, ed. <i>Genetic Control of Host Resistance to Infection and Malignancy</i>. Vol 3. Progress in leukocyte biology. Liss; 1985."},"day":"01","type":"book_chapter","series_title":"Progress in leukocyte biology","_id":"4241","extern":"1","publication_identifier":{"isbn":["9780845141021"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","editor":[{"last_name":"Skamene","full_name":"Skamene, Emil","first_name":"Emil"}],"publication":"Genetic Control of Host Resistance to Infection and Malignancy","volume":3,"date_updated":"2022-02-02T09:23:20Z","publist_id":"1872","article_processing_charge":"No"},{"language":[{"iso":"eng"}],"scopus_import":"1","title":"Haldane's Rule OK","external_id":{"pmid":["3990801"]},"publisher":"Nature Publishing Group","article_type":"original","date_published":"1985-04-25T00:00:00Z","doi":"10.1038/314668a0","year":"1985","month":"04","date_created":"2018-12-11T12:08:16Z","author":[{"first_name":"Steve","last_name":"Jones","full_name":"Jones, Steve"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"status":"public","intvolume":"       314","type":"journal_article","day":"25","citation":{"chicago":"Jones, Steve, and Nicholas H Barton. “Haldane’s Rule OK.” <i>Nature</i>. Nature Publishing Group, 1985. <a href=\"https://doi.org/10.1038/314668a0\">https://doi.org/10.1038/314668a0</a>.","apa":"Jones, S., &#38; Barton, N. H. (1985). Haldane’s Rule OK. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/314668a0\">https://doi.org/10.1038/314668a0</a>","ieee":"S. Jones and N. H. Barton, “Haldane’s Rule OK,” <i>Nature</i>, vol. 314. Nature Publishing Group, pp. 668–668, 1985.","short":"S. Jones, N.H. Barton, Nature 314 (1985) 668–668.","ista":"Jones S, Barton NH. 1985. Haldane’s Rule OK. Nature. 314, 668–668.","ama":"Jones S, Barton NH. Haldane’s Rule OK. <i>Nature</i>. 1985;314:668-668. doi:<a href=\"https://doi.org/10.1038/314668a0\">10.1038/314668a0</a>","mla":"Jones, Steve, and Nicholas H. Barton. “Haldane’s Rule OK.” <i>Nature</i>, vol. 314, Nature Publishing Group, 1985, pp. 668–668, doi:<a href=\"https://doi.org/10.1038/314668a0\">10.1038/314668a0</a>."},"publication_status":"published","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","pmid":1,"_id":"4325","page":"668 - 668","article_processing_charge":"No","volume":314,"publist_id":"1716","date_updated":"2022-01-28T12:42:09Z","publication":"Nature"},{"article_type":"original","date_published":"1985-11-01T00:00:00Z","year":"1985","month":"11","doi":"10.1146/annurev.es.16.110185.000553","language":[{"iso":"eng"}],"title":"Analysis of hybrid zones","publisher":"Annual Reviews","date_created":"2018-12-11T12:08:16Z","type":"journal_article","day":"01","citation":{"chicago":"Barton, Nicholas H, and Godfrey Hewitt. “Analysis of Hybrid Zones.” <i>Annual Review of Ecology and Systematics</i>. Annual Reviews, 1985. <a href=\"https://doi.org/10.1146/annurev.es.16.110185.000553\">https://doi.org/10.1146/annurev.es.16.110185.000553</a>.","ieee":"N. H. Barton and G. Hewitt, “Analysis of hybrid zones,” <i>Annual Review of Ecology and Systematics</i>, vol. 16. Annual Reviews, pp. 113–148, 1985.","apa":"Barton, N. H., &#38; Hewitt, G. (1985). Analysis of hybrid zones. <i>Annual Review of Ecology and Systematics</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev.es.16.110185.000553\">https://doi.org/10.1146/annurev.es.16.110185.000553</a>","ista":"Barton NH, Hewitt G. 1985. Analysis of hybrid zones. Annual Review of Ecology and Systematics. 16, 113–148.","short":"N.H. Barton, G. Hewitt, Annual Review of Ecology and Systematics 16 (1985) 113–148.","ama":"Barton NH, Hewitt G. Analysis of hybrid zones. <i>Annual Review of Ecology and Systematics</i>. 1985;16:113-148. doi:<a href=\"https://doi.org/10.1146/annurev.es.16.110185.000553\">10.1146/annurev.es.16.110185.000553</a>","mla":"Barton, Nicholas H., and Godfrey Hewitt. “Analysis of Hybrid Zones.” <i>Annual Review of Ecology and Systematics</i>, vol. 16, Annual Reviews, 1985, pp. 113–48, doi:<a href=\"https://doi.org/10.1146/annurev.es.16.110185.000553\">10.1146/annurev.es.16.110185.000553</a>."},"publication_status":"published","status":"public","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H"},{"last_name":"Hewitt","full_name":"Hewitt, Godfrey","first_name":"Godfrey"}],"intvolume":"        16","article_processing_charge":"No","page":"113 - 148","publist_id":"1714","date_updated":"2022-01-28T12:32:23Z","volume":16,"publication":"Annual Review of Ecology and Systematics","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"We thank R. Butlin, D. Currie, R. A. Nichols , and S. Rouhani for their thoughtful comments on the manuscript, and their help in preparing the Figures and Tables; all those (too numerous to name) who gave us details of their unpublished work; and T. Tsang and S. Ward for their patient typing. This work was supported by grants from the NERC and SERC to G. M. Hewitt, and from the SERC and the Nuffield Foundation to N. H. Barton.","extern":"1","publication_identifier":{"issn":["0066-4162"],"eissn":["1545-2069"]},"_id":"4326"},{"main_file_link":[{"url":"http://pub.ist.ac.at/~edels/Papers/1984-P-06-HamSandwichTheorems.pdf"}],"date_created":"2018-12-11T12:03:43Z","conference":{"location":"Haus Ohrbeck, Germany","name":"WG: International Workshop on Graph Theoretic Concepts in Computer Science"},"date_published":"1984-01-01T00:00:00Z","month":"01","year":"1984","language":[{"iso":"eng"}],"title":"Ham-sandwich theorems applied to intersection problems","publisher":"Teubner","article_processing_charge":"No","page":"88 - 99","publist_id":"2872","date_updated":"2022-01-28T12:10:55Z","publication":"9th International Workshop on Graph Theoretic Concepts in Computer Science","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"isbn":["3-853-20311-6"]},"extern":"1","_id":"3513","series_title":"WG","type":"conference","citation":{"apa":"Dobkin, D., &#38; Edelsbrunner, H. (1984). Ham-sandwich theorems applied to intersection problems. In <i>9th International Workshop on Graph Theoretic Concepts in Computer Science</i> (pp. 88–99). Haus Ohrbeck, Germany: Teubner.","ieee":"D. Dobkin and H. Edelsbrunner, “Ham-sandwich theorems applied to intersection problems,” in <i>9th International Workshop on Graph Theoretic Concepts in Computer Science</i>, Haus Ohrbeck, Germany, 1984, pp. 88–99.","chicago":"Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied to Intersection Problems.” In <i>9th International Workshop on Graph Theoretic Concepts in Computer Science</i>, 88–99. WG. Teubner, 1984.","mla":"Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied to Intersection Problems.” <i>9th International Workshop on Graph Theoretic Concepts in Computer Science</i>, Teubner, 1984, pp. 88–99.","ama":"Dobkin D, Edelsbrunner H. Ham-sandwich theorems applied to intersection problems. In: <i>9th International Workshop on Graph Theoretic Concepts in Computer Science</i>. WG. Teubner; 1984:88-99.","ista":"Dobkin D, Edelsbrunner H. 1984. Ham-sandwich theorems applied to intersection problems. 9th International Workshop on Graph Theoretic Concepts in Computer Science. WG: International Workshop on Graph Theoretic Concepts in Computer ScienceWG, 88–99.","short":"D. Dobkin, H. Edelsbrunner, in:, 9th International Workshop on Graph Theoretic Concepts in Computer Science, Teubner, 1984, pp. 88–99."},"day":"01","publication_status":"published","author":[{"last_name":"Dobkin","full_name":"Dobkin, David","first_name":"David"},{"first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"status":"public"},{"status":"public","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert"},{"last_name":"Van Leeuwen","full_name":"Van Leeuwen, Jan","first_name":"Jan"},{"full_name":"Ottmann, Thomas","last_name":"Ottmann","first_name":"Thomas"},{"full_name":"Wood, Derick","last_name":"Wood","first_name":"Derick"}],"intvolume":"        18","abstract":[{"lang":"eng","text":"Two or more geometrical objects (solids) are said to be connected whenever their union is a connected point set in the usual sense. Sets of geometrical objects are naturally divided into connected components, which are maximal connected subsets. We show that the connected components of a given collection of n horizontal and vertical line segments in the plane can be computed in O (n log n) time and O (n) space and prove that this is essentially optimal. The result is generalized to compute the connected components of a set of n rectilinearly-oriented rectangles\r\nin the plane with the same time and space bounds. Several extensions of the results to higher dimensions and to dynamic sets of objects are discussed."}],"type":"journal_article","publication_status":"published","day":"01","citation":{"short":"H. Edelsbrunner, J. Van Leeuwen, T. Ottmann, D. Wood, Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications 18 (1984) 171–183.","ista":"Edelsbrunner H, Van Leeuwen J, Ottmann T, Wood D. 1984. Computing the connected components of simple rectilinear geometrical objects in D-Space. Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications. 18(2), 171–183.","ama":"Edelsbrunner H, Van Leeuwen J, Ottmann T, Wood D. Computing the connected components of simple rectilinear geometrical objects in D-Space. <i>Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications</i>. 1984;18(2):171-183. doi:<a href=\"https://doi.org/10.1051/ita/1984180201711\">10.1051/ita/1984180201711</a>","mla":"Edelsbrunner, Herbert, et al. “Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.” <i>Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications</i>, vol. 18, no. 2, EDP Sciences, 1984, pp. 171–83, doi:<a href=\"https://doi.org/10.1051/ita/1984180201711\">10.1051/ita/1984180201711</a>.","chicago":"Edelsbrunner, Herbert, Jan Van Leeuwen, Thomas Ottmann, and Derick Wood. “Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.” <i>Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications</i>. EDP Sciences, 1984. <a href=\"https://doi.org/10.1051/ita/1984180201711\">https://doi.org/10.1051/ita/1984180201711</a>.","apa":"Edelsbrunner, H., Van Leeuwen, J., Ottmann, T., &#38; Wood, D. (1984). Computing the connected components of simple rectilinear geometrical objects in D-Space. <i>Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/ita/1984180201711\">https://doi.org/10.1051/ita/1984180201711</a>","ieee":"H. Edelsbrunner, J. Van Leeuwen, T. Ottmann, and D. Wood, “Computing the connected components of simple rectilinear geometrical objects in D-Space,” <i>Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications</i>, vol. 18, no. 2. EDP Sciences, pp. 171–183, 1984."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","quality_controlled":"1","_id":"4117","extern":"1","publication_identifier":{"issn":["0397-9326"],"eissn":["1290-385X"]},"volume":18,"date_updated":"2022-01-27T15:22:30Z","publist_id":"2001","article_processing_charge":"No","page":"171 - 183","issue":"2","publication":"Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications","language":[{"iso":"eng"}],"publisher":"EDP Sciences","title":"Computing the connected components of simple rectilinear geometrical objects in D-Space","article_type":"original","date_published":"1984-01-01T00:00:00Z","month":"01","year":"1984","doi":"10.1051/ita/1984180201711","date_created":"2018-12-11T12:07:02Z"},{"year":"1984","doi":"10.1016/S0734-189X(84)80041-9","title":"Stationing guards in rectilinear art galleries","publication_status":"published","citation":{"chicago":"Edelsbrunner, Herbert, Joseph O’Rourke, and Emo Welzl. “Stationing Guards in Rectilinear Art Galleries.” <i>Computer Vision, Graphics, and Image Processing</i>. Elsevier, 1984. <a href=\"https://doi.org/10.1016/S0734-189X(84)80041-9\">https://doi.org/10.1016/S0734-189X(84)80041-9</a>.","ieee":"H. Edelsbrunner, J. O’Rourke, and E. Welzl, “Stationing guards in rectilinear art galleries,” <i>Computer Vision, Graphics, and Image Processing</i>, vol. 27, no. 2. Elsevier, pp. 167–176, 1984.","apa":"Edelsbrunner, H., O’Rourke, J., &#38; Welzl, E. (1984). Stationing guards in rectilinear art galleries. <i>Computer Vision, Graphics, and Image Processing</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0734-189X(84)80041-9\">https://doi.org/10.1016/S0734-189X(84)80041-9</a>","short":"H. Edelsbrunner, J. O’Rourke, E. Welzl, Computer Vision, Graphics, and Image Processing 27 (1984) 167–176.","ista":"Edelsbrunner H, O’Rourke J, Welzl E. 1984. Stationing guards in rectilinear art galleries. Computer Vision, Graphics, and Image Processing. 27(2), 167–176.","ama":"Edelsbrunner H, O’Rourke J, Welzl E. Stationing guards in rectilinear art galleries. <i>Computer Vision, Graphics, and Image Processing</i>. 1984;27(2):167-176. doi:<a href=\"https://doi.org/10.1016/S0734-189X(84)80041-9\">10.1016/S0734-189X(84)80041-9</a>","mla":"Edelsbrunner, Herbert, et al. “Stationing Guards in Rectilinear Art Galleries.” <i>Computer Vision, Graphics, and Image Processing</i>, vol. 27, no. 2, Elsevier, 1984, pp. 167–76, doi:<a href=\"https://doi.org/10.1016/S0734-189X(84)80041-9\">10.1016/S0734-189X(84)80041-9</a>."},"abstract":[{"lang":"eng","text":"A rectilinear polygon can be viewed as an art gallery room whose walls meet at right angles. An algorithm is presented that stations guards in such a room so that every interior point is visible to some guard. The algorithm partitions the polygon into L-shaped pieces, a subclass of star-shaped pieces, and locates one guard within each kernel. The algorithm runs in O(n log n) time in the worst case for a polygon of n vertices."}],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"last_name":"O'Rourke","full_name":"O'Rourke, Joseph","first_name":"Joseph"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"publist_id":"2002","date_updated":"2022-01-28T08:03:51Z","volume":27,"article_processing_charge":"No","_id":"4118","publication_identifier":{"issn":["1557-895X"],"eissn":["0734-189X"]},"extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","quality_controlled":"1","month":"08","article_type":"original","date_published":"1984-08-01T00:00:00Z","publisher":"Elsevier","scopus_import":"1","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:07:02Z","day":"01","type":"journal_article","intvolume":"        27","status":"public","issue":"2","publication":"Computer Vision, Graphics, and Image Processing","page":"167 - 176"},{"status":"public","intvolume":"       176","series_title":"MFCS","type":"conference","day":"01","page":"265 - 272","publication":"11th International Symposium on Mathematical Foundations of Computer Science","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Springer","date_published":"1984-01-01T00:00:00Z","month":"01","date_created":"2018-12-11T12:07:03Z","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","end_date":"1984-09-07","location":"Praha, Czechoslovakia","start_date":"1984-09-03"},"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"last_name":"Welzl","full_name":"Welzl, Emo","first_name":"Emo"}],"citation":{"ama":"Edelsbrunner H, Welzl E. Monotone edge sequences in line arrangements and applications. In: <i>11th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 176. MFCS. Springer; 1984:265-272. doi:<a href=\"https://doi.org/10.1007/BFb0030307\">10.1007/BFb0030307</a>","mla":"Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements and Applications.” <i>11th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 176, Springer, 1984, pp. 265–72, doi:<a href=\"https://doi.org/10.1007/BFb0030307\">10.1007/BFb0030307</a>.","short":"H. Edelsbrunner, E. Welzl, in:, 11th International Symposium on Mathematical Foundations of Computer Science, Springer, 1984, pp. 265–272.","ista":"Edelsbrunner H, Welzl E. 1984. Monotone edge sequences in line arrangements and applications. 11th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer ScienceMFCS, LNCS, vol. 176, 265–272.","apa":"Edelsbrunner, H., &#38; Welzl, E. (1984). Monotone edge sequences in line arrangements and applications. In <i>11th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 176, pp. 265–272). Praha, Czechoslovakia: Springer. <a href=\"https://doi.org/10.1007/BFb0030307\">https://doi.org/10.1007/BFb0030307</a>","ieee":"H. Edelsbrunner and E. Welzl, “Monotone edge sequences in line arrangements and applications,” in <i>11th International Symposium on Mathematical Foundations of Computer Science</i>, Praha, Czechoslovakia, 1984, vol. 176, pp. 265–272.","chicago":"Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements and Applications.” In <i>11th International Symposium on Mathematical Foundations of Computer Science</i>, 176:265–72. MFCS. Springer, 1984. <a href=\"https://doi.org/10.1007/BFb0030307\">https://doi.org/10.1007/BFb0030307</a>."},"publication_status":"published","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"isbn":["3-540-13372-0"]},"_id":"4119","article_processing_charge":"No","volume":176,"date_updated":"2022-01-28T08:52:23Z","publist_id":"2003","title":"Monotone edge sequences in line arrangements and applications","doi":"10.1007/BFb0030307","year":"1984","alternative_title":["LNCS"]},{"_id":"4121","publication_identifier":{"eissn":["1432-1343"],"issn":["0176-4268"]},"extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","publication":"Journal of Classification","volume":1,"publist_id":"1998","date_updated":"2022-01-27T14:16:27Z","article_processing_charge":"No","page":"7 - 24","intvolume":"         1","abstract":[{"text":"Whenevern objects are characterized by a matrix of pairwise dissimilarities, they may be clustered by any of a number of sequential, agglomerative, hierarchical, nonoverlapping (SAHN) clustering methods. These SAHN clustering methods are defined by a paradigmatic algorithm that usually requires 0(n 3) time, in the worst case, to cluster the objects. An improved algorithm (Anderberg 1973), while still requiring 0(n 3) worst-case time, can reasonably be expected to exhibit 0(n 2) expected behavior. By contrast, we describe a SAHN clustering algorithm that requires 0(n 2 logn) time in the worst case. When SAHN clustering methods exhibit reasonable space distortion properties, further improvements are possible. We adapt a SAHN clustering algorithm, based on the efficient construction of nearest neighbor chains, to obtain a reasonably general SAHN clustering algorithm that requires in the worst case 0(n 2) time and space.\r\nWhenevern objects are characterized byk-tuples of real numbers, they may be clustered by any of a family of centroid SAHN clustering methods. These methods are based on a geometric model in which clusters are represented by points ink-dimensional real space and points being agglomerated are replaced by a single (centroid) point. For this model, we have solved a class of special packing problems involving point-symmetric convex objects and have exploited it to design an efficient centroid clustering algorithm. Specifically, we describe a centroid SAHN clustering algorithm that requires 0(n 2) time, in the worst case, for fixedk and for a family of dissimilarity measures including the Manhattan, Euclidean, Chebychev and all other Minkowski metrics.","lang":"eng"}],"status":"public","author":[{"last_name":"Day","full_name":"Day, William","first_name":"William"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"publication_status":"published","day":"01","citation":{"ista":"Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1, 7–24.","short":"W. Day, H. Edelsbrunner, Journal of Classification 1 (1984) 7–24.","mla":"Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.” <i>Journal of Classification</i>, vol. 1, Springer, 1984, pp. 7–24, doi:<a href=\"https://doi.org/10.1007/BF01890115\">10.1007/BF01890115</a>.","ama":"Day W, Edelsbrunner H. Efficient algorithms for agglomerative hierarchical clustering methods. <i>Journal of Classification</i>. 1984;1:7-24. doi:<a href=\"https://doi.org/10.1007/BF01890115\">10.1007/BF01890115</a>","chicago":"Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.” <i>Journal of Classification</i>. Springer, 1984. <a href=\"https://doi.org/10.1007/BF01890115\">https://doi.org/10.1007/BF01890115</a>.","ieee":"W. Day and H. Edelsbrunner, “Efficient algorithms for agglomerative hierarchical clustering methods,” <i>Journal of Classification</i>, vol. 1. Springer, pp. 7–24, 1984.","apa":"Day, W., &#38; Edelsbrunner, H. (1984). Efficient algorithms for agglomerative hierarchical clustering methods. <i>Journal of Classification</i>. Springer. <a href=\"https://doi.org/10.1007/BF01890115\">https://doi.org/10.1007/BF01890115</a>"},"type":"journal_article","date_created":"2018-12-11T12:07:04Z","main_file_link":[{"url":"https://link.springer.com/article/10.1007%2FBF01890115"}],"publisher":"Springer","title":"Efficient algorithms for agglomerative hierarchical clustering methods","language":[{"iso":"eng"}],"doi":"10.1007/BF01890115","year":"1984","month":"01","date_published":"1984-01-01T00:00:00Z","article_type":"original"},{"date_created":"2018-12-11T12:07:04Z","conference":{"name":"STACS: Theoretical Aspects of Computer Science","end_date":"1984-04-13","location":"Paris, France","start_date":"1984-04-11"},"date_published":"1984-01-01T00:00:00Z","month":"01","language":[{"iso":"eng"}],"publisher":"Springer","scopus_import":"1","page":"1 - 13","publication":"1st Symposium of Theoretical Aspects of Computer Science","type":"conference","series_title":"STACS","day":"01","status":"public","intvolume":"       166","alternative_title":["LNCS"],"year":"1984","doi":"10.1007/3-540-12920-0_1","title":"Key-problems and key-methods in computational geometry","volume":166,"publist_id":"1999","date_updated":"2022-01-27T14:48:15Z","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","_id":"4122","extern":"1","publication_identifier":{"isbn":["3-540-12920-0"]},"publication_status":"published","citation":{"chicago":"Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.” In <i>1st Symposium of Theoretical Aspects of Computer Science</i>, 166:1–13. STACS. Springer, 1984. <a href=\"https://doi.org/10.1007/3-540-12920-0_1\">https://doi.org/10.1007/3-540-12920-0_1</a>.","ieee":"H. Edelsbrunner, “Key-problems and key-methods in computational geometry,” in <i>1st Symposium of Theoretical Aspects of Computer Science</i>, Paris, France, 1984, vol. 166, pp. 1–13.","apa":"Edelsbrunner, H. (1984). Key-problems and key-methods in computational geometry. In <i>1st Symposium of Theoretical Aspects of Computer Science</i> (Vol. 166, pp. 1–13). Paris, France: Springer. <a href=\"https://doi.org/10.1007/3-540-12920-0_1\">https://doi.org/10.1007/3-540-12920-0_1</a>","ista":"Edelsbrunner H. 1984. Key-problems and key-methods in computational geometry. 1st Symposium of Theoretical Aspects of Computer Science. STACS: Theoretical Aspects of Computer ScienceSTACS, LNCS, vol. 166, 1–13.","short":"H. Edelsbrunner, in:, 1st Symposium of Theoretical Aspects of Computer Science, Springer, 1984, pp. 1–13.","ama":"Edelsbrunner H. Key-problems and key-methods in computational geometry. In: <i>1st Symposium of Theoretical Aspects of Computer Science</i>. Vol 166. STACS. Springer; 1984:1-13. doi:<a href=\"https://doi.org/10.1007/3-540-12920-0_1\">10.1007/3-540-12920-0_1</a>","mla":"Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.” <i>1st Symposium of Theoretical Aspects of Computer Science</i>, vol. 166, Springer, 1984, pp. 1–13, doi:<a href=\"https://doi.org/10.1007/3-540-12920-0_1\">10.1007/3-540-12920-0_1</a>."},"author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"Computational geometry, considered a subfield of computer science, is concerned with the computational aspects of geometric problems. The increasing activity in this rather young field made it split into several reasonably independent subareas. This paper presents several key-problems of the classical part of computational geometry which exhibit strong interrelations. A unified view of the problems is stressed, and the general ideas behind the methods that solve them are worked out.","lang":"eng"}]},{"abstract":[{"text":"Windowing a two-dimensional picture means to determine those line segments of the picture that are visible through an axis-parallel window. A study of some algorithmic problems involved in windowing a picture is offered. Some methods from computational geometry are exploited to store the picture in a computer such that (1) those line segments inside or partially inside of a window can be determined efficiently, and (2) the set of those line segments can be maintained efficiently while the window is moved parallel to a coordinate axis and/or it is enlarged or reduced.","lang":"eng"}],"author":[{"first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mark","full_name":"Overmars, Mark","last_name":"Overmars"},{"full_name":"Seidel, Raimund","last_name":"Seidel","first_name":"Raimund"}],"citation":{"short":"H. Edelsbrunner, M. Overmars, R. Seidel, Computer Vision, Graphics, and Image Processing 28 (1984) 92–108.","ista":"Edelsbrunner H, Overmars M, Seidel R. 1984. Some methods of computational geometry applied to computer graphics. Computer Vision, Graphics, and Image Processing. 28(1), 92–108.","ama":"Edelsbrunner H, Overmars M, Seidel R. Some methods of computational geometry applied to computer graphics. <i>Computer Vision, Graphics, and Image Processing</i>. 1984;28(1):92-108. doi:<a href=\"https://doi.org/10.1016/0734-189X(84)90142-7\">10.1016/0734-189X(84)90142-7</a>","mla":"Edelsbrunner, Herbert, et al. “Some Methods of Computational Geometry Applied to Computer Graphics.” <i>Computer Vision, Graphics, and Image Processing</i>, vol. 28, no. 1, Elsevier, 1984, pp. 92–108, doi:<a href=\"https://doi.org/10.1016/0734-189X(84)90142-7\">10.1016/0734-189X(84)90142-7</a>.","chicago":"Edelsbrunner, Herbert, Mark Overmars, and Raimund Seidel. “Some Methods of Computational Geometry Applied to Computer Graphics.” <i>Computer Vision, Graphics, and Image Processing</i>. Elsevier, 1984. <a href=\"https://doi.org/10.1016/0734-189X(84)90142-7\">https://doi.org/10.1016/0734-189X(84)90142-7</a>.","ieee":"H. Edelsbrunner, M. Overmars, and R. Seidel, “Some methods of computational geometry applied to computer graphics,” <i>Computer Vision, Graphics, and Image Processing</i>, vol. 28, no. 1. Elsevier, pp. 92–108, 1984.","apa":"Edelsbrunner, H., Overmars, M., &#38; Seidel, R. (1984). Some methods of computational geometry applied to computer graphics. <i>Computer Vision, Graphics, and Image Processing</i>. Elsevier. <a href=\"https://doi.org/10.1016/0734-189X(84)90142-7\">https://doi.org/10.1016/0734-189X(84)90142-7</a>"},"publication_status":"published","extern":"1","publication_identifier":{"eissn":["1557-895X"],"issn":["0734-189X"]},"_id":"4123","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"Research reported in this paper was done while the second author visited the Technical University of Graz. He was supported by the Netherlands Organization for the Advancement of Pure Research (ZWO). The first author was supported by the Austrian Fonds zur Foerderung der wissenschaftlichen Forschung.\r\n","article_processing_charge":"No","date_updated":"2022-01-27T15:10:04Z","volume":28,"publist_id":"2000","title":"Some methods of computational geometry applied to computer graphics","year":"1984","doi":"10.1016/0734-189X(84)90142-7","intvolume":"        28","status":"public","day":"01","type":"journal_article","publication":"Computer Vision, Graphics, and Image Processing","issue":"1","page":"92 - 108","publisher":"Elsevier","language":[{"iso":"eng"}],"month":"10","article_type":"original","date_published":"1984-10-01T00:00:00Z","date_created":"2018-12-11T12:07:04Z"},{"date_created":"2018-12-11T12:08:16Z","date_published":"1984-11-01T00:00:00Z","article_type":"original","month":"11","language":[{"iso":"eng"}],"publisher":"Annual Reviews","scopus_import":"1","page":"133 - 164","publication":"Annual Review of Ecology and Systematics","type":"journal_article","day":"01","status":"public","intvolume":"        15","main_file_link":[{"url":"https://www.annualreviews.org/doi/10.1146/annurev.es.15.110184.001025"}],"doi":"10.1146/annurev.es.15.110184.001025","year":"1984","title":"Genetic revolutions, founder effects, and speciation","date_updated":"2022-01-27T13:51:54Z","publist_id":"1713","volume":15,"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","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.","oa_version":"None","quality_controlled":"1","_id":"4327","extern":"1","publication_identifier":{"eissn":["1545-2069"],"issn":["0066-4162"]},"publication_status":"published","citation":{"short":"N.H. Barton, B. Charlesworth, Annual Review of Ecology and Systematics 15 (1984) 133–164.","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>.","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>","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>"},"author":[{"last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Brian","last_name":"Charlesworth","full_name":"Charlesworth, Brian"}]},{"date_created":"2018-12-11T12:03:58Z","main_file_link":[{"url":"http://pub.ist.ac.at/~edels/Papers/1983-B-01-ExpectedSegmentTrees.pdf"}],"alternative_title":["Advances in Computing Research "],"language":[{"iso":"eng"}],"title":"On expected- and worst-case segment trees","publisher":"Elsevier","date_published":"1983-01-01T00:00:00Z","year":"1983","month":"01","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","_id":"3562","page":"109 - 125","article_processing_charge":"No","volume":1,"date_updated":"2022-01-27T07:40:13Z","publist_id":"2823","publication":"Computational Geometry: Theory and Applications","editor":[{"first_name":"Franco","last_name":"Preparata","full_name":"Preparata, Franco"}],"author":[{"first_name":"W.","full_name":"Bucher, W.","last_name":"Bucher"},{"first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"status":"public","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"}],"intvolume":"         1","type":"book_chapter","day":"01","citation":{"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.","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.","short":"W. Bucher, H. Edelsbrunner, in:, F. Preparata (Ed.), Computational Geometry: Theory and Applications, Elsevier, 1983, pp. 109–125.","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.","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.","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."},"publication_status":"published"},{"language":[{"iso":"eng"}],"publisher":"Elsevier","title":"Graphics in Flatland: a case study","date_published":"1983-01-01T00:00:00Z","year":"1983","month":"01","date_created":"2018-12-11T12:03:59Z","alternative_title":[" Advances in Computing Research"],"status":"public","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Overmars","full_name":"Overmars, Mark","first_name":"Mark"},{"full_name":"Wood, Derick","last_name":"Wood","first_name":"Derick"}],"intvolume":"         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"}],"type":"book_chapter","publication_status":"published","day":"01","citation":{"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.","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.","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.","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.","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.","short":"H. Edelsbrunner, M. Overmars, D. Wood, in:, F. Preparata (Ed.), Computational Geometry: Theory and Applications, Elsevier, 1983, pp. 35–59."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","_id":"3563","publication_identifier":{"isbn":["0-89232-356-6"]},"extern":"1","date_updated":"2022-01-25T15:49:17Z","volume":1,"publist_id":"2822","page":"35 - 59","article_processing_charge":"No","editor":[{"first_name":"Franco","last_name":"Preparata","full_name":"Preparata, Franco"}],"publication":"Computational Geometry: Theory and Applications"},{"date_created":"2018-12-11T12:03:59Z","language":[{"iso":"ger"}],"publisher":"BI Wissenschaftsverlag","title":"Neue Entwicklungen im Bereich Datenstrukturen","date_published":"1983-01-01T00:00:00Z","month":"01","year":"1983","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","quality_controlled":"1","_id":"3564","publication_identifier":{"isbn":["9783411016587"]},"extern":"1","date_updated":"2022-01-25T15:28:05Z","publist_id":"2821","article_processing_charge":"No","page":"55 - 109","editor":[{"full_name":"Maurer, Hermann","last_name":"Maurer","first_name":"Hermann"}],"publication":"Überblicke Informationsverarbeitung ","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"status":"public","type":"book_chapter","publication_status":"published","citation":{"chicago":"Edelsbrunner, Herbert. “Neue Entwicklungen im Bereich Datenstrukturen.” In <i>Überblicke Informationsverarbeitung </i>, edited by Hermann Maurer, 55–109. BI Wissenschaftsverlag, 1983.","apa":"Edelsbrunner, H. (1983). Neue Entwicklungen im Bereich Datenstrukturen. In H. Maurer (Ed.), <i>Überblicke Informationsverarbeitung </i> (pp. 55–109). BI Wissenschaftsverlag.","ieee":"H. Edelsbrunner, “Neue Entwicklungen im Bereich Datenstrukturen,” in <i>Überblicke Informationsverarbeitung </i>, H. Maurer, Ed. BI Wissenschaftsverlag, 1983, pp. 55–109.","short":"H. Edelsbrunner, in:, H. Maurer (Ed.), Überblicke Informationsverarbeitung , BI Wissenschaftsverlag, 1983, pp. 55–109.","ista":"Edelsbrunner H. 1983.Neue Entwicklungen im Bereich Datenstrukturen. In: Überblicke Informationsverarbeitung . , 55–109.","mla":"Edelsbrunner, Herbert. “Neue Entwicklungen im Bereich Datenstrukturen.” <i>Überblicke Informationsverarbeitung </i>, edited by Hermann Maurer, BI Wissenschaftsverlag, 1983, pp. 55–109.","ama":"Edelsbrunner H. Neue Entwicklungen im Bereich Datenstrukturen. In: Maurer H, ed. <i>Überblicke Informationsverarbeitung </i>. BI Wissenschaftsverlag; 1983:55-109."},"day":"01"},{"author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"},{"first_name":"Steve","full_name":"Jones, Steve","last_name":"Jones"}],"citation":{"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>","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>.","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>"},"publication_status":"published","extern":"1","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"pmid":1,"_id":"3598","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","date_updated":"2022-01-25T15:17:15Z","volume":306,"publist_id":"2785","title":"Mitochondrial DNA: new clues about evolution","external_id":{"pmid":["6646215"]},"year":"1983","doi":"10.1038/306317a0","main_file_link":[{"url":"https://www.nature.com/articles/306317a0"}],"intvolume":"       306","status":"public","day":"24","type":"journal_article","publication":"Nature","page":"317 - 318","scopus_import":"1","publisher":"Springer Nature","language":[{"iso":"eng"}],"month":"11","article_type":"original","date_published":"1983-11-24T00:00:00Z","date_created":"2018-12-11T12:04:10Z"},{"publication":"Biological Journal of the Linnean Society","issue":"1","page":"51 - 62","intvolume":"        19","status":"public","day":"01","type":"journal_article","date_created":"2018-12-11T12:04:31Z","scopus_import":"1","publisher":"Oxford University Press","language":[{"iso":"eng"}],"month":"02","date_published":"1983-02-01T00:00:00Z","article_type":"original","extern":"1","publication_identifier":{"eissn":["1095-8312"],"issn":["0024-4066"]},"_id":"3666","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","volume":19,"date_updated":"2022-01-25T14:52:15Z","publist_id":"2717","abstract":[{"lang":"eng","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."}],"keyword":["Hybrid zone","Electrophoresis","Podisma pedestris","Polymorphism"],"author":[{"full_name":"Halliday, Bruce","last_name":"Halliday","first_name":"Bruce"},{"first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Godfrey","last_name":"Hewitt","full_name":"Hewitt, Godfrey"}],"citation":{"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.","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>.","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>","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>","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."},"publication_status":"published","main_file_link":[{"url":"https://academic.oup.com/biolinnean/article-abstract/19/1/51/2666256?redirectedFrom=fulltext"}],"title":"Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma pedestris","year":"1983","doi":"10.1111/j.1095-8312.1983.tb00776.x"},{"intvolume":"        50","status":"public","day":"01","type":"journal_article","publication":"Heredity","issue":"2","page":"139 - 146","scopus_import":"1","publisher":"Nature Publishing Group","language":[{"iso":"eng"}],"month":"04","date_published":"1983-04-01T00:00:00Z","article_type":"original","date_created":"2018-12-11T12:04:31Z","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."}],"author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H"},{"first_name":"Bruce","full_name":"Halliday, Bruce","last_name":"Halliday"},{"first_name":"Godfrey","full_name":"Hewitt, Godfrey","last_name":"Hewitt"}],"citation":{"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>","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>.","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.","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.","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>."},"publication_status":"published","publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"extern":"1","_id":"3667","quality_controlled":"1","oa_version":"Published Version","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.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","publist_id":"2716","oa":1,"volume":50,"date_updated":"2022-01-25T14:07:12Z","title":"Rare electrophoretic variants in a hybrid zone","doi":"10.1038/hdy.1983.15","year":"1983","main_file_link":[{"url":"https://www.nature.com/articles/hdy198315","open_access":"1"}]},{"author":[{"last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"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.","lang":"eng"}],"citation":{"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.","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>","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>.","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>","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>.","ista":"Barton NH. 1983. Multilocus clines. Evolution; International Journal of Organic Evolution. 37(3), 454–471.","short":"N.H. Barton, Evolution; International Journal of Organic Evolution 37 (1983) 454–471."},"publication_status":"published","quality_controlled":"1","oa_version":"None","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","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.","publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"extern":"1","_id":"3668","pmid":1,"article_processing_charge":"No","publist_id":"2715","date_updated":"2022-08-19T07:08:29Z","volume":37,"external_id":{"pmid":["28563316 "]},"title":"Multilocus clines","doi":"10.2307/2408260","year":"1983","main_file_link":[{"url":"http://www.jstor.org/stable/2408260"}],"status":"public","intvolume":"        37","type":"journal_article","day":"01","page":"454 - 471","publication":"Evolution; International Journal of Organic Evolution","issue":"3","language":[{"iso":"eng"}],"publisher":"Society for the Study of Evolution","date_published":"1983-05-01T00:00:00Z","article_type":"original","month":"05","date_created":"2018-12-11T12:04:31Z"},{"keyword":["Voronoi diagram","Asymptotic bound","Straightforward counting","Affine trans","Neighbor Voronoi diagram"],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert"},{"last_name":"Welzl","full_name":"Welzl, Emo","first_name":"Emo"}],"publication_status":"published","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>","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.","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>.","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>","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."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"None","_id":"4124","extern":"1","volume":154,"date_updated":"2022-01-25T13:42:40Z","publist_id":"1996","article_processing_charge":"No","title":"On the number of equal-sized semispaces of a set of points in the plane","year":"1983","doi":"10.1007/BFb0036908","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007%2FBFb0036908"}],"alternative_title":["LNCS"],"status":"public","intvolume":"       154","type":"conference","series_title":"LNCS","day":"01","page":"182 - 187","publication":"International Colloquium on Automata, Languages, and Programming","language":[{"iso":"eng"}],"publisher":"Springer","scopus_import":"1","date_published":"1983-01-01T00:00:00Z","month":"01","date_created":"2018-12-11T12:07:04Z","conference":{"start_date":"1983-07-18","end_date":"1983-07-22","name":"ICALP: Automata, Languages and Programming","location":"Barcelona, Spain"}},{"publication":"Pattern Recognition","issue":"2","page":"251 - 257","day":"01","type":"journal_article","intvolume":"        17","status":"public","date_created":"2018-12-11T12:07:05Z","month":"07","article_type":"original","date_published":"1983-07-01T00:00:00Z","scopus_import":"1","publisher":"Elsevier","language":[{"iso":"eng"}],"article_processing_charge":"No","publist_id":"1997","date_updated":"2022-01-27T14:06:27Z","volume":17,"publication_identifier":{"issn":["0031-3203"],"eissn":["1873-5142"]},"extern":"1","_id":"4125","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"The second author gratefully acknowledges discussions on the presented topic with David Kirkpatrick and Raimund Seidel.","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>","ista":"Aurenhammer F, Edelsbrunner H. 1983. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition. 17(2), 251–257.","short":"F. Aurenhammer, H. Edelsbrunner, Pattern Recognition 17 (1983) 251–257.","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>."},"publication_status":"published","abstract":[{"lang":"eng","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"}],"author":[{"first_name":"Franz","last_name":"Aurenhammer","full_name":"Aurenhammer, Franz"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0031320384900645?via%3Dihub"}],"doi":"10.1016/0031-3203(84)90064-5","year":"1983","title":"An optimal algorithm for constructing the weighted Voronoi diagram in the plane"}]