[{"oa":1,"abstract":[{"lang":"eng","text":"Amphibian myelinated nerve fibers were treated with collagenase and protease. Axons with retraction of the myelin sheath were patch-clamped in the nodal and paranodal region. One type of Na channel was found. It has a single-channel conductance of 11 pS (15 degrees C) and is blocked by tetrodotoxin. Averaged events show the typical activation and inactivation kinetics of macroscopic Na current. Three potential-dependent K channels were identified (I, F, and S channel). The I channel, being the most frequent type, has a single-channel conductance of 23 pS (inward current, 105 mM K on both sides of the membrane), activates between -60 and -30 mV, deactivates with intermediate kinetics, and is sensitive to dendrotoxin. The F channel has a conductance of 30 pS, activates between -40 and 60 mV, and deactivates with fast kinetics. The former inactivates within tens of seconds; the latter inactivates within seconds. The third type, the S channel, has a conductance of 7 pS and deactivates slowly. All three channels can be blocked by external tetraethylammonium chloride. We suggest that these distinct K channel types form the basis for the different components of macroscopic K current described previously."}],"external_id":{"pmid":["2550937 "]},"page":"7238 - 7242","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"language":[{"iso":"eng"}],"year":"1989","pmid":1,"intvolume":"        86","extern":"1","citation":{"chicago":"Jonas, Peter M, Michael Bräu, Markus Hermsteiner, and Werner Vogel. “Single-Channel Recording in Myelinated Nerve Fibers Reveals One Type of Na Channel but Different K Channels.” <i>PNAS</i>. National Academy of Sciences, 1989. <a href=\"https://doi.org/10.1073/pnas.86.18.7238\">https://doi.org/10.1073/pnas.86.18.7238</a>.","short":"P.M. Jonas, M. Bräu, M. Hermsteiner, W. Vogel, PNAS 86 (1989) 7238–7242.","apa":"Jonas, P. M., Bräu, M., Hermsteiner, M., &#38; Vogel, W. (1989). Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.86.18.7238\">https://doi.org/10.1073/pnas.86.18.7238</a>","mla":"Jonas, Peter M., et al. “Single-Channel Recording in Myelinated Nerve Fibers Reveals One Type of Na Channel but Different K Channels.” <i>PNAS</i>, vol. 86, no. 18, National Academy of Sciences, 1989, pp. 7238–42, doi:<a href=\"https://doi.org/10.1073/pnas.86.18.7238\">10.1073/pnas.86.18.7238</a>.","ista":"Jonas PM, Bräu M, Hermsteiner M, Vogel W. 1989. Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels. PNAS. 86(18), 7238–7242.","ieee":"P. M. Jonas, M. Bräu, M. Hermsteiner, and W. Vogel, “Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels,” <i>PNAS</i>, vol. 86, no. 18. National Academy of Sciences, pp. 7238–7242, 1989.","ama":"Jonas PM, Bräu M, Hermsteiner M, Vogel W. Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels. <i>PNAS</i>. 1989;86(18):7238-7242. doi:<a href=\"https://doi.org/10.1073/pnas.86.18.7238\">10.1073/pnas.86.18.7238</a>"},"doi":"10.1073/pnas.86.18.7238","quality_controlled":"1","acknowledgement":"We thank Drs. C. Baumann, D. Siemen, and W. Stuhmer for reading the manuscript and Dr. F. Dreyer for the generous gift of DTX. The study was supported by the Deutsche Forschungsgemeinschaft.","date_published":"1989-09-01T00:00:00Z","month":"09","article_type":"original","publisher":"National Academy of Sciences","date_updated":"2022-02-14T16:12:33Z","publist_id":"2921","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC298032/?tool=pubmed"}],"day":"01","status":"public","title":"Single-channel recording in myelinated nerve fibers reveals one type of Na channel but different K channels","volume":86,"_id":"3466","issue":"18","article_processing_charge":"No","type":"journal_article","publication":"PNAS","date_created":"2018-12-11T12:03:28Z","oa_version":"Published Version","author":[{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M"},{"full_name":"Bräu, Michael","last_name":"Bräu","first_name":"Michael"},{"last_name":"Hermsteiner","first_name":"Markus","full_name":"Hermsteiner, Markus"},{"last_name":"Vogel","first_name":"Werner","full_name":"Vogel, Werner"}]},{"article_type":"original","date_published":"1989-08-01T00:00:00Z","month":"08","publist_id":"2731","date_updated":"2022-02-14T14:07:12Z","publisher":"Genetics Society of America","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203771","open_access":"1"}],"scopus_import":"1","day":"01","status":"public","title":"Inference from clines stabilized by frequency-dependent selection","volume":122,"publication":"Genetics","issue":"4","_id":"3652","article_processing_charge":"No","type":"journal_article","date_created":"2018-12-11T12:04:27Z","oa_version":"None","author":[{"full_name":"Mallet, James","first_name":"James","last_name":"Mallet"},{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"Frequency-dependent selection against rare forms can maintain clines. For weak selection, s, in simple linear models of frequency-dependence, single locus clines are stabilized with a maximum slope of between square root of s/square root of 8 sigma and square root of s/square root of 12 delta, where sigma is the dispersal distance. These clines are similar to those maintained by heterozygote disadvantage. Using computer simulations, the weak-selection analytical results are extended to higher selection pressures with up to three unlinked genes. Graphs are used to display the effect of selection, migration, dominance, and number of loci on cline widths, speeds of cline movements, two-way gametic correlations (\"linkage disequilibria\"), and heterozygote deficits. The effects of changing the order of reproduction, migration, and selection, are also briefly explored. Epistasis can also maintain tension zones. We show that epistatic selection is similar in its effects to frequency-dependent selection, except that the disequilibria produced in the zone will be higher for a given level of selection. If selection consists of a mixture of frequency-dependence and epistasis, as is likely in nature, the error made in estimating selection is usually less than twofold. From the graphs, selection and migration can be estimated using knowledge of the dominance and number of genes, of gene frequencies and of gametic correlations from a hybrid zone."}],"oa":1,"external_id":{"pmid":["2759433"]},"page":"967 - 976","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0016-6731"]},"year":"1989","intvolume":"       122","pmid":1,"extern":"1","quality_controlled":"1","doi":"10.1093/genetics/122.4.967","citation":{"ama":"Mallet J, Barton NH. Inference from clines stabilized by frequency-dependent selection. <i>Genetics</i>. 1989;122(4):967-976. doi:<a href=\"https://doi.org/10.1093/genetics/122.4.967\">10.1093/genetics/122.4.967</a>","mla":"Mallet, James, and Nicholas H. Barton. “Inference from Clines Stabilized by Frequency-Dependent Selection.” <i>Genetics</i>, vol. 122, no. 4, Genetics Society of America, 1989, pp. 967–76, doi:<a href=\"https://doi.org/10.1093/genetics/122.4.967\">10.1093/genetics/122.4.967</a>.","ieee":"J. Mallet and N. H. Barton, “Inference from clines stabilized by frequency-dependent selection,” <i>Genetics</i>, vol. 122, no. 4. Genetics Society of America, pp. 967–976, 1989.","ista":"Mallet J, Barton NH. 1989. Inference from clines stabilized by frequency-dependent selection. Genetics. 122(4), 967–976.","chicago":"Mallet, James, and Nicholas H Barton. “Inference from Clines Stabilized by Frequency-Dependent Selection.” <i>Genetics</i>. Genetics Society of America, 1989. <a href=\"https://doi.org/10.1093/genetics/122.4.967\">https://doi.org/10.1093/genetics/122.4.967</a>.","short":"J. Mallet, N.H. Barton, Genetics 122 (1989) 967–976.","apa":"Mallet, J., &#38; Barton, N. H. (1989). Inference from clines stabilized by frequency-dependent selection. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1093/genetics/122.4.967\">https://doi.org/10.1093/genetics/122.4.967</a>"},"acknowledgement":"The publication costs of this article were partly defrayed by the payment of page charges. This article must therefore be hereby marked “advertisment” in accordance with 18 U.S.C. §1734 solely to indicate this fact. \r\n\r\nWe thank the Natural Environmental Research Council for financial support, and N. SANDERSON, M. SLATKIN and an anonymous reviewer for comments on the manuscript."},{"acknowledgement":"Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862. Work by the third author has been supported by the Office of Naval Research Grant N00014-82-K-0381, National Science Foundation Grant No. NSF-DCR-83-20085, by grants from the Digital Equipment Corporation and the IBM Corporation, and by a research grant from NCRD, the Israeli National Council for Research and Development.","quality_controlled":"1","citation":{"mla":"Edelsbrunner, Herbert, et al. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 311–36, doi:<a href=\"https://doi.org/10.1007/BF02187733\">10.1007/BF02187733</a>.","ista":"Edelsbrunner H, Guibas L, Sharir M. 1989. The upper envelope of piecewise linear functions: Algorithms and applications. Discrete &#38; Computational Geometry. 4(1), 311–336.","ieee":"H. Edelsbrunner, L. Guibas, and M. Sharir, “The upper envelope of piecewise linear functions: Algorithms and applications,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 311–336, 1989.","short":"H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &#38; Computational Geometry 4 (1989) 311–336.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187733\">https://doi.org/10.1007/BF02187733</a>.","apa":"Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1989). The upper envelope of piecewise linear functions: Algorithms and applications. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187733\">https://doi.org/10.1007/BF02187733</a>","ama":"Edelsbrunner H, Guibas L, Sharir M. The upper envelope of piecewise linear functions: Algorithms and applications. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):311-336. doi:<a href=\"https://doi.org/10.1007/BF02187733\">10.1007/BF02187733</a>"},"doi":"10.1007/BF02187733","extern":"1","intvolume":"         4","year":"1989","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"language":[{"iso":"eng"}],"page":"311 - 336","abstract":[{"text":"This paper studies applications of envelopes of piecewise linear functions to problems in computational geometry. Among these applications we find problems involving hidden line/surface elimination, motion planning, transversals of polytopes, and a new type of Voronoi diagram for clusters of points. All results are either combinatorial or computational in nature. They are based on the combinatorial analysis in two companion papers [PS] and [E2] and a divide-and-conquer algorithm for computing envelopes described in this paper.","lang":"eng"}],"oa":1,"author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"date_created":"2018-12-11T12:06:50Z","oa_version":"Published Version","publication":"Discrete & Computational Geometry","type":"journal_article","_id":"4081","issue":"1","article_processing_charge":"No","title":"The upper envelope of piecewise linear functions: Algorithms and applications","volume":4,"status":"public","day":"01","main_file_link":[{"open_access":"1","url":"https://link.springer.com/article/10.1007/BF02187733"}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"2038","date_updated":"2022-02-10T15:53:48Z","publisher":"Springer","article_type":"original","month":"12","date_published":"1989-12-01T00:00:00Z"},{"author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"}],"oa_version":"Published Version","date_created":"2018-12-11T12:06:50Z","publication":"Journal of Computer and System Sciences","article_processing_charge":"No","_id":"4082","issue":"1","type":"journal_article","title":"Topologically sweeping an arrangement","volume":38,"status":"public","day":"01","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/002200008990038X?via%3Dihub"}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"2039","date_updated":"2022-02-10T16:06:05Z","publisher":"Elsevier","article_type":"original","date_published":"1989-02-01T00:00:00Z","month":"02","acknowledgement":"he authors wish to thank Raimund Seidel for suggesting the argument that we used to prove Theorem 3.1, Harald Rosenberger who implemented the topological sweep and compared it with a straight line sweep, the students who took the Stanford 1985 analysis of algorithms qualifying examination and suffered through a version of this problem, and finally Lyle Ramshaw and Cynthia Hibbard for their detailed reading and comments on the manuscript. The constructive criticism of an anonymous referee is also appreciated.","quality_controlled":"1","doi":"10.1016/0022-0000(89)90038-X","citation":{"ista":"Edelsbrunner H, Guibas L. 1989. Topologically sweeping an arrangement. Journal of Computer and System Sciences. 38(1), 165–194.","ieee":"H. Edelsbrunner and L. Guibas, “Topologically sweeping an arrangement,” <i>Journal of Computer and System Sciences</i>, vol. 38, no. 1. Elsevier, pp. 165–194, 1989.","mla":"Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” <i>Journal of Computer and System Sciences</i>, vol. 38, no. 1, Elsevier, 1989, pp. 165–94, doi:<a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">10.1016/0022-0000(89)90038-X</a>.","apa":"Edelsbrunner, H., &#38; Guibas, L. (1989). Topologically sweeping an arrangement. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">https://doi.org/10.1016/0022-0000(89)90038-X</a>","chicago":"Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” <i>Journal of Computer and System Sciences</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">https://doi.org/10.1016/0022-0000(89)90038-X</a>.","short":"H. Edelsbrunner, L. Guibas, Journal of Computer and System Sciences 38 (1989) 165–194.","ama":"Edelsbrunner H, Guibas L. Topologically sweeping an arrangement. <i>Journal of Computer and System Sciences</i>. 1989;38(1):165-194. doi:<a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">10.1016/0022-0000(89)90038-X</a>"},"extern":"1","intvolume":"        38","year":"1989","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1090-2724"],"issn":["0022-0000"]},"page":"165 - 194","abstract":[{"text":"Sweeping a collection of figures in the Euclidean plane with a straight line is one of the novel algorithmic paradigms that have emerged in the field of computational geometry. In this paper we demonstrate the advantages of sweeping with a topological line that is not necessarily straight. We show how an arrangement of n lines in the plane can be swept over in O(n2) time and O(n) space by a such a line. In the process each element, i.e., vertex, edge, or region, is visited once in a consistent ordering. Our technique makes use of novel data structures which exhibit interesting amortized complexity behavior; the result is an algorithm that improves upon all its predecessors either in the space or the time bounds, as well as being eminently practical. Numerous applications of the technique to problems in computational geometry are given—many through the use of duality transforms. Examples include solving visibility problems, detecting degeneracies in configurations, computing the extremal shadows of convex polytopes, and others. Even though our basic technique solves a planar problem, its applications include several problems in higher dimensions.","lang":"eng"}],"oa":1},{"month":"04","date_published":"1989-04-01T00:00:00Z","article_type":"original","publisher":"SIAM","date_updated":"2022-02-11T07:55:48Z","publist_id":"2040","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://epubs.siam.org/doi/10.1137/0218025"}],"scopus_import":"1","day":"01","status":"public","title":"Partitioning space for range queries","volume":18,"type":"journal_article","_id":"4083","article_processing_charge":"No","issue":"2","publication":"SIAM Journal on Computing","oa_version":"Published Version","date_created":"2018-12-11T12:06:50Z","author":[{"last_name":"Yao","first_name":"F.","full_name":"Yao, F."},{"full_name":"Dobkin, David","last_name":"Dobkin","first_name":"David"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Paterson","first_name":"Michael","full_name":"Paterson, Michael"}],"oa":1,"abstract":[{"lang":"eng","text":"It is shown that, given a set S of n points in $R^3 $, one can always find three planes that form an eight-partition of S, that is, a partition where at most ${n / 8}$ points of S lie in each of the eight open regions. This theorem is used to define a data structure, called an octant tree, for representing any point set in $R^3 $. An octant tree for n points occupies $O(n)$ space and can be constructed in polynomial time. With this data structure and its refinements, efficient solutions to various range query problems in two and three dimensions can be obtained, including (1) half-space queries: find all points of S that lie to one side of any given plane; (2) polyhedron queries: find all points that lie inside (outside) any given polyhedron; and (3) circle queries in $R^2 $: for a planar set S, find all points that lie inside (outside) any given circle. The retrieval time for all these queries is $T(n) = O(n^\\alpha + m)$, where $\\alpha = 0.8988$ (or 0.8471 in case (3)), and m is the size of the output. This performance is the best currently known for linear-space data structures that can be deterministically constructed in polynomial time."}],"page":"371 - 384","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"year":"1989","intvolume":"        18","extern":"1","citation":{"apa":"Yao, F., Dobkin, D., Edelsbrunner, H., &#38; Paterson, M. (1989). Partitioning space for range queries. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0218025\">https://doi.org/10.1137/0218025</a>","chicago":"Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.” <i>SIAM Journal on Computing</i>. SIAM, 1989. <a href=\"https://doi.org/10.1137/0218025\">https://doi.org/10.1137/0218025</a>.","short":"F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.","ista":"Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for range queries. SIAM Journal on Computing. 18(2), 371–384.","ieee":"F. Yao, D. Dobkin, H. Edelsbrunner, and M. Paterson, “Partitioning space for range queries,” <i>SIAM Journal on Computing</i>, vol. 18, no. 2. SIAM, pp. 371–384, 1989.","mla":"Yao, F., et al. “Partitioning Space for Range Queries.” <i>SIAM Journal on Computing</i>, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:<a href=\"https://doi.org/10.1137/0218025\">10.1137/0218025</a>.","ama":"Yao F, Dobkin D, Edelsbrunner H, Paterson M. Partitioning space for range queries. <i>SIAM Journal on Computing</i>. 1989;18(2):371-384. doi:<a href=\"https://doi.org/10.1137/0218025\">10.1137/0218025</a>"},"doi":"10.1137/0218025","quality_controlled":"1"},{"page":"157 - 180","oa":1,"abstract":[{"lang":"eng","text":"A tour  of a finite set P of points is a necklace-tour if there are disks with the points in P as centers such that two disks intersect if and only if their centers are adjacent in . It has been observed by Sanders that a necklace-tour is an optimal traveling salesman tour.\r\n\r\nIn this paper, we present an algorithm that either reports that no necklace-tour exists or outputs a necklace-tour of a given set of n points in O(n2 log n) time. If a tour is given, then we can test in O(n2) time whether or not this tour is a necklace-tour. Both algorithms can be generalized to ƒ-factors of point sets in the plane. The complexity results rely on a combinatorial analysis of certain intersection graphs of disks defined for finite sets of points in the plane."}],"extern":"1","citation":{"mla":"Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” <i>Theoretical Computer Science</i>, vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi:<a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">10.1016/0304-3975(89)90133-3</a>.","ieee":"H. Edelsbrunner, G. Rote, and E. Welzl, “Testing the necklace condition for shortest tours and optimal factors in the plane,” <i>Theoretical Computer Science</i>, vol. 66, no. 2. Elsevier, pp. 157–180, 1989.","ista":"Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 66(2), 157–180.","chicago":"Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” <i>Theoretical Computer Science</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">https://doi.org/10.1016/0304-3975(89)90133-3</a>.","short":"H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989) 157–180.","apa":"Edelsbrunner, H., Rote, G., &#38; Welzl, E. (1989). Testing the necklace condition for shortest tours and optimal factors in the plane. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">https://doi.org/10.1016/0304-3975(89)90133-3</a>","ama":"Edelsbrunner H, Rote G, Welzl E. Testing the necklace condition for shortest tours and optimal factors in the plane. <i>Theoretical Computer Science</i>. 1989;66(2):157-180. doi:<a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">10.1016/0304-3975(89)90133-3</a>"},"doi":"10.1016/0304-3975(89)90133-3","quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1879-2294"],"issn":["0304-3975"]},"year":"1989","intvolume":"        66","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/0304397589901333?via%3Dihub"}],"scopus_import":"1","month":"08","date_published":"1989-08-01T00:00:00Z","article_type":"original","publisher":"Elsevier","date_updated":"2022-02-11T11:15:43Z","publist_id":"2041","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","_id":"4084","type":"journal_article","article_processing_charge":"No","issue":"2","publication":"Theoretical Computer Science","date_created":"2018-12-11T12:06:51Z","oa_version":"Published Version","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Rote","first_name":"Günter","full_name":"Rote, Günter"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"day":"01","status":"public","volume":66,"title":"Testing the necklace condition for shortest tours and optimal factors in the plane"},{"title":"The upper envelope of piecewise linear functions: Tight bounds on the number of faces ","volume":4,"status":"public","day":"01","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","date_created":"2018-12-11T12:06:51Z","type":"journal_article","_id":"4086","issue":"4","article_processing_charge":"No","publication":"Discrete & Computational Geometry","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Springer","publist_id":"2034","date_updated":"2022-02-10T11:08:12Z","month":"11","date_published":"1989-11-01T00:00:00Z","article_type":"original","scopus_import":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187734","open_access":"1"}],"intvolume":"         4","year":"1989","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"acknowledgement":"This work was supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by the National Science Foundation under Grant CCR-8714565. Research on the presented result was partially carried out while the author worked for the IBM T. J. Watson Research Center at Yorktown Height, New York, USA. \r\n","citation":{"ama":"Edelsbrunner H. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . <i>Discrete &#38; Computational Geometry</i>. 1989;4(4):337-343. doi:<a href=\"https://doi.org/10.1007/BF02187734\">10.1007/BF02187734</a>","mla":"Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 4, Springer, 1989, pp. 337–43, doi:<a href=\"https://doi.org/10.1007/BF02187734\">10.1007/BF02187734</a>.","ista":"Edelsbrunner H. 1989. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete &#38; Computational Geometry. 4(4), 337–343.","ieee":"H. Edelsbrunner, “The upper envelope of piecewise linear functions: Tight bounds on the number of faces ,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 4. Springer, pp. 337–343, 1989.","chicago":"Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187734\">https://doi.org/10.1007/BF02187734</a>.","short":"H. Edelsbrunner, Discrete &#38; Computational Geometry 4 (1989) 337–343.","apa":"Edelsbrunner, H. (1989). The upper envelope of piecewise linear functions: Tight bounds on the number of faces . <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187734\">https://doi.org/10.1007/BF02187734</a>"},"doi":"10.1007/BF02187734","quality_controlled":"1","extern":"1","oa":1,"abstract":[{"text":"This note proves that the maximum number of faces (of any dimension) of the upper envelope of a set ofn possibly intersectingd-simplices ind+1 dimensions is (n d (n)). This is an extension of a result of Pach and Sharir [PS] who prove the same bound for the number ofd-dimensional faces of the upper envelope.","lang":"eng"}],"page":"337 - 343"},{"scopus_import":"1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187742","open_access":"1"}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-10T15:03:48Z","publist_id":"2036","publisher":"Springer","article_type":"original","month":"12","date_published":"1989-12-01T00:00:00Z","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"full_name":"Hershberger, John","last_name":"Hershberger","first_name":"John"},{"full_name":"Seidel, Raimund","last_name":"Seidel","first_name":"Raimund"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"},{"first_name":"Jack","last_name":"Snoeyink","full_name":"Snoeyink, Jack"},{"full_name":"Welzl, Emo","first_name":"Emo","last_name":"Welzl"}],"oa_version":"Published Version","date_created":"2018-12-11T12:06:52Z","publication":"Discrete & Computational Geometry","_id":"4088","article_processing_charge":"No","issue":"1","type":"journal_article","volume":4,"title":"Implicitly representing arrangements of lines or segments","status":"public","day":"01","page":"433 - 466","abstract":[{"lang":"eng","text":"Anarrangement ofn lines (or line segments) in the plane is the partition of the plane defined by these objects. Such an arrangement consists ofO(n 2) regions, calledfaces. In this paper we study the problem of calculating and storing arrangementsimplicitly, using subquadratic space and preprocessing, so that, given any query pointp, we can calculate efficiently the face containingp. First, we consider the case of lines and show that with (n) space1 and (n 3/2) preprocessing time, we can answer face queries in (n)+O(K) time, whereK is the output size. (The query time is achieved with high probability.) In the process, we solve three interesting subproblems: (1) given a set ofn points, find a straight-edge spanning tree of these points such that any line intersects only a few edges of the tree, (2) given a simple polygonal path , form a data structure from which we can find the convex hull of any subpath of quickly, and (3) given a set of points, organize them so that the convex hull of their subset lying above a query line can be found quickly. Second, using random sampling, we give a tradeoff between increasing space and decreasing query time. Third, we extend our structure to report faces in an arrangement of line segments in (n 1/3)+O(K) time, given(n 4/3) space and (n 5/3) preprocessing time. Lastly, we note that our techniques allow us to computem faces in an arrangement ofn lines in time (m 2/3 n 2/3+n), which is nearly optimal."}],"oa":1,"acknowledgement":"The first author is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565. Work on this paper by the fifth author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. The sixth author was supported in part by a National Science Foundation Graduate Fellowship. This work was begun while the non-DEC authors were visiting at the DEC Systems Research Center.","quality_controlled":"1","citation":{"mla":"Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:<a href=\"https://doi.org/10.1007/BF02187742\">10.1007/BF02187742</a>.","ista":"Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M, Snoeyink J, Welzl E. 1989. Implicitly representing arrangements of lines or segments. Discrete &#38; Computational Geometry. 4(1), 433–466.","ieee":"H. Edelsbrunner <i>et al.</i>, “Implicitly representing arrangements of lines or segments,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 433–466, 1989.","short":"H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete &#38; Computational Geometry 4 (1989) 433–466.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements of Lines or Segments.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187742\">https://doi.org/10.1007/BF02187742</a>.","apa":"Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., &#38; Welzl, E. (1989). Implicitly representing arrangements of lines or segments. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187742\">https://doi.org/10.1007/BF02187742</a>","ama":"Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements of lines or segments. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):433-466. doi:<a href=\"https://doi.org/10.1007/BF02187742\">10.1007/BF02187742</a>"},"doi":"10.1007/BF02187742","extern":"1","intvolume":"         4","year":"1989","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"language":[{"iso":"eng"}]},{"day":"01","volume":4,"title":"On arrangements of Jordan arcs with three intersections per pair","status":"public","oa_version":"Published Version","date_created":"2018-12-11T12:06:52Z","publication":"Discrete & Computational Geometry","_id":"4089","type":"journal_article","article_processing_charge":"No","issue":"1","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"full_name":"Hershberger, John","last_name":"Hershberger","first_name":"John"},{"full_name":"Pach, János","last_name":"Pach","first_name":"János"},{"full_name":"Pollack, Richard","last_name":"Pollack","first_name":"Richard"},{"full_name":"Seidel, Raimund","first_name":"Raimund","last_name":"Seidel"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"},{"full_name":"Snoeyink, Jack","last_name":"Snoeyink","first_name":"Jack"}],"article_type":"original","date_published":"1989-12-01T00:00:00Z","month":"12","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-10T15:40:04Z","publist_id":"2037","publisher":"Springer","main_file_link":[{"open_access":"1","url":"https://link.springer.com/article/10.1007/BF02187745"}],"scopus_import":"1","year":"1989","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"language":[{"iso":"eng"}],"intvolume":"         4","quality_controlled":"1","citation":{"ama":"Edelsbrunner H, Guibas L, Hershberger J, et al. On arrangements of Jordan arcs with three intersections per pair. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):523-539. doi:<a href=\"https://doi.org/10.1007/BF02187745\">10.1007/BF02187745</a>","ieee":"H. Edelsbrunner <i>et al.</i>, “On arrangements of Jordan arcs with three intersections per pair,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 523–539, 1989.","ista":"Edelsbrunner H, Guibas L, Hershberger J, Pach J, Pollack R, Seidel R, Sharir M, Snoeyink J. 1989. On arrangements of Jordan arcs with three intersections per pair. Discrete &#38; Computational Geometry. 4(1), 523–539.","mla":"Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections per Pair.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 523–39, doi:<a href=\"https://doi.org/10.1007/BF02187745\">10.1007/BF02187745</a>.","apa":"Edelsbrunner, H., Guibas, L., Hershberger, J., Pach, J., Pollack, R., Seidel, R., … Snoeyink, J. (1989). On arrangements of Jordan arcs with three intersections per pair. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187745\">https://doi.org/10.1007/BF02187745</a>","short":"H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, Discrete &#38; Computational Geometry 4 (1989) 523–539.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “On Arrangements of Jordan Arcs with Three Intersections per Pair.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187745\">https://doi.org/10.1007/BF02187745</a>."},"doi":"10.1007/BF02187745","extern":"1","acknowledgement":"The first author is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565. Work on this paper by the fourth and seventh authors has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, and by grants from the Digital Equipment Corporation and the IBM Corporation. The seventh author in addition wishes to acknowledge support by a research grant from the NCRD—the Israeli National Council for Research and Development. The fifth author would like to acknowledge support in part by NSF grant DMS-8501947. Finally, the eighth author was supported in part by a National Science Foundation Graduate Fellowship.","abstract":[{"lang":"eng","text":"Motivated by a number of motion-planning questions, we investigate in this paper some general topological and combinatorial properties of the boundary of the union ofn regions bounded by Jordan curves in the plane. We show that, under some fairly weak conditions, a simply connected surface can be constructed that exactly covers this union and whose boundary has combinatorial complexity that is nearly linear, even though the covered region can have quadratic complexity. In the case where our regions are delimited by Jordan acrs in the upper halfplane starting and ending on thex-axis such that any pair of arcs intersect in at most three points, we prove that the total number of subarcs that appear on the boundary of the union is only (n(n)), where(n) is the extremely slowly growing functional inverse of Ackermann's function."}],"oa":1,"page":"523 - 539"},{"publication_identifier":{"eissn":["1083-351X"],"issn":["0021-9258"]},"language":[{"iso":"eng"}],"year":"1989","pmid":1,"intvolume":"       264","extern":"1","citation":{"ama":"Yokota Y, Sasai Y, Tanaka K, et al. Molecular characterization of a functional cDNA for rat substance P receptor. <i>Journal of Biological Chemistry</i>. 1989;264(30):17649-17652. doi:<a href=\"https://doi.org/doi.org/10.1016/S0021-9258(19)84619-7\">doi.org/10.1016/S0021-9258(19)84619-7</a>","ieee":"Y. Yokota <i>et al.</i>, “Molecular characterization of a functional cDNA for rat substance P receptor,” <i>Journal of Biological Chemistry</i>, vol. 264, no. 30. American Society for Biochemistry and Molecular Biology, pp. 17649–17652, 1989.","ista":"Yokota Y, Sasai Y, Tanaka K, Fujiwara T, Tsuchida K, Shigemoto R, Kakizuka A, Ohkubo H, Nakanishi S. 1989. Molecular characterization of a functional cDNA for rat substance P receptor. Journal of Biological Chemistry. 264(30), 17649–17652.","mla":"Yokota, Yoshifumi, et al. “Molecular Characterization of a Functional CDNA for Rat Substance P Receptor.” <i>Journal of Biological Chemistry</i>, vol. 264, no. 30, American Society for Biochemistry and Molecular Biology, 1989, pp. 17649–52, doi:<a href=\"https://doi.org/doi.org/10.1016/S0021-9258(19)84619-7\">doi.org/10.1016/S0021-9258(19)84619-7</a>.","apa":"Yokota, Y., Sasai, Y., Tanaka, K., Fujiwara, T., Tsuchida, K., Shigemoto, R., … Nakanishi, S. (1989). Molecular characterization of a functional cDNA for rat substance P receptor. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/doi.org/10.1016/S0021-9258(19)84619-7\">https://doi.org/doi.org/10.1016/S0021-9258(19)84619-7</a>","chicago":"Yokota, Yoshifumi, Yoshiki Sasai, Kohichi Tanaka, Tsutomu Fujiwara, Kunihiro Tsuchida, Ryuichi Shigemoto, Akira Kakizuka, Hiroaki Ohkubo, and Shigetada Nakanishi. “Molecular Characterization of a Functional CDNA for Rat Substance P Receptor.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 1989. <a href=\"https://doi.org/doi.org/10.1016/S0021-9258(19)84619-7\">https://doi.org/doi.org/10.1016/S0021-9258(19)84619-7</a>.","short":"Y. Yokota, Y. Sasai, K. Tanaka, T. Fujiwara, K. Tsuchida, R. Shigemoto, A. Kakizuka, H. Ohkubo, S. Nakanishi, Journal of Biological Chemistry 264 (1989) 17649–17652."},"doi":"doi.org/10.1016/S0021-9258(19)84619-7","quality_controlled":"1","acknowledgement":"This work was supported in part by research grants from the Ministry of Education, Science and Culture of Japan, the Institute of Physical and Chemical Research, and the Science and Technology Agency of Japan. The costs of publication of this article were defrayed in part by the payment of page charges. This article must therefore be hereby marked “advertisement” in accordance with 18 U.S.C. Section 1734 solely to indicate this fact. ","oa":1,"abstract":[{"text":"This paper describes the amino acid sequence of the rat substance P receptor and its comparison with that of the rat substance K receptor on the basis of molecular cloning and sequence analysis. From a rat brain cDNA library constructed with an RNA expression vector, we identified a cDNA mixture containing a functional substance P receptor cDNA by examining electrophysiologically a receptor expression following injection of the mRNAs synthesized in vitro into Xenopus oocytes. A receptor cDNA clone was then isolated by cross-hybridization with the bovine substance K receptor DNA. The clone was confirmed by selective binding of substance P to the cloned receptor expressed in mammalian COS cells. The deduced amino acid sequence (407 amino acid residues) possesses seven putative membrane spanning domains and shows a sequence similarity to the members of G-protein-coupled receptors. The rat substance P and substance K receptor are very similar in both size and amino acid sequences, particularly in the putative transmembrane similarity is in marked contrast to the sequence divergence in the amino- and carboxyl-terminal regions and the third cytoplasmic loop. The observed sequence similarytity and divergence would thus contribute to the expression of similar but pharmacological regions and the first and second cytoplasmic loops. This distinguishable activities of the two tachykinin receptors.","lang":"eng"}],"external_id":{"pmid":["2478537"]},"page":"17649 - 17652","day":"25","status":"public","title":"Molecular characterization of a functional cDNA for rat substance P receptor","volume":264,"issue":"30","_id":"2525","type":"journal_article","article_processing_charge":"No","publication":"Journal of Biological Chemistry","oa_version":"Published Version","date_created":"2018-12-11T11:58:11Z","author":[{"full_name":"Yokota, Yoshifumi","last_name":"Yokota","first_name":"Yoshifumi"},{"full_name":"Sasai, Yoshiki","first_name":"Yoshiki","last_name":"Sasai"},{"full_name":"Tanaka, Kohichi","last_name":"Tanaka","first_name":"Kohichi"},{"last_name":"Fujiwara","first_name":"Tsutomu","full_name":"Fujiwara, Tsutomu"},{"first_name":"Kunihiro","last_name":"Tsuchida","full_name":"Tsuchida, Kunihiro"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444"},{"full_name":"Kakizuka, Akira","first_name":"Akira","last_name":"Kakizuka"},{"full_name":"Ohkubo, Hiroaki","first_name":"Hiroaki","last_name":"Ohkubo"},{"full_name":"Nakanishi, Shigetada","last_name":"Nakanishi","first_name":"Shigetada"}],"date_published":"1989-10-25T00:00:00Z","month":"10","article_type":"original","publisher":"American Society for Biochemistry and Molecular Biology","date_updated":"2022-02-15T09:29:36Z","publist_id":"4374","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0021925819846197","open_access":"1"}],"scopus_import":"1"},{"day":"01","volume":5,"title":"Interracial rDNA variation in the grasshopper Podisma Pedestris","status":"public","date_created":"2018-12-11T12:04:28Z","oa_version":"None","publication":"Molecular Biology and Evolution","issue":"6","_id":"3655","article_processing_charge":"No","type":"journal_article","author":[{"last_name":"Dallas","first_name":"John","full_name":"Dallas, John"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"last_name":"Dover","first_name":"Gabriel","full_name":"Dover, Gabriel"}],"article_type":"original","month":"07","date_published":"1988-07-01T00:00:00Z","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-08T13:20:51Z","publist_id":"2728","publisher":"Oxford University Press","main_file_link":[{"open_access":"1","url":"https://academic.oup.com/mbe/article/5/6/660/1044340"}],"year":"1988","publication_identifier":{"issn":["0737-4038"],"eissn":["1537-1719"]},"language":[{"iso":"eng"}],"intvolume":"         5","quality_controlled":"1","citation":{"ama":"Dallas J, Barton NH, Dover G. Interracial rDNA variation in the grasshopper Podisma Pedestris. <i>Molecular Biology and Evolution</i>. 1988;5(6):660-674. doi:<a href=\"https://doi.org/10.1093/oxfordjournals.molbev.a040528\">10.1093/oxfordjournals.molbev.a040528</a>","mla":"Dallas, John, et al. “Interracial RDNA Variation in the Grasshopper Podisma Pedestris.” <i>Molecular Biology and Evolution</i>, vol. 5, no. 6, Oxford University Press, 1988, pp. 660–74, doi:<a href=\"https://doi.org/10.1093/oxfordjournals.molbev.a040528\">10.1093/oxfordjournals.molbev.a040528</a>.","ieee":"J. Dallas, N. H. Barton, and G. Dover, “Interracial rDNA variation in the grasshopper Podisma Pedestris,” <i>Molecular Biology and Evolution</i>, vol. 5, no. 6. Oxford University Press, pp. 660–674, 1988.","ista":"Dallas J, Barton NH, Dover G. 1988. Interracial rDNA variation in the grasshopper Podisma Pedestris. Molecular Biology and Evolution. 5(6), 660–674.","short":"J. Dallas, N.H. Barton, G. Dover, Molecular Biology and Evolution 5 (1988) 660–674.","chicago":"Dallas, John, Nicholas H Barton, and Gabriel Dover. “Interracial RDNA Variation in the Grasshopper Podisma Pedestris.” <i>Molecular Biology and Evolution</i>. Oxford University Press, 1988. <a href=\"https://doi.org/10.1093/oxfordjournals.molbev.a040528\">https://doi.org/10.1093/oxfordjournals.molbev.a040528</a>.","apa":"Dallas, J., Barton, N. H., &#38; Dover, G. (1988). Interracial rDNA variation in the grasshopper Podisma Pedestris. <i>Molecular Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/oxfordjournals.molbev.a040528\">https://doi.org/10.1093/oxfordjournals.molbev.a040528</a>"},"doi":"10.1093/oxfordjournals.molbev.a040528","extern":"1","acknowledgement":"We thank Dr. W. Kunz for providing the clones pLm6F4 and pLm4Bll and Dr. D. Glover for the clone pDm238. We thank Brian Curtis for his photographic assistance. ","abstract":[{"lang":"eng","text":"The structural basis and distribution of variation in the ribosomal RNA multigene family ( rDNA) was studied in the X0 and neo-XY races of the Alpine grasshopper Podisma pedestris. Restriction-enzyme sites in the gene region of the rDNA repeat were identical in both races and homogeneous in the rDNA family. In contrast, sites for Hind111 and PvuII in the intergenic spacer (IGS) region showed racial divergence and variation within the rDNA family and within populations. A short insertion in the 28s gene region was present in a minority of repeats in both races. The distributions of four polymorphic IGS Hind111 fragments were surveyed at 43 locations in and around the hybrid zone. Two of these fragments appear to be distributed as clines, one of which is strongly associated with the neo-X chromosome. The other two fragments show considerable variation in both races and show negative association. It is proposed that the clinally distributed variants arise from processes of amplification and divergence of IGS sequence variants and that such \r\ndivergence may contribute to hybrid inviability. "}],"oa":1,"page":"660 - 674"},{"day":"01","title":"Minimum polygonal separation","volume":77,"status":"public","oa_version":"None","date_created":"2018-12-11T12:06:53Z","article_processing_charge":"No","_id":"4090","issue":"3","type":"journal_article","publication":"Information and Computation","author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Preparata, Franco","first_name":"Franco","last_name":"Preparata"}],"date_published":"1988-06-01T00:00:00Z","month":"06","article_type":"original","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Elsevier","date_updated":"2022-02-08T10:36:30Z","publist_id":"2029","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0890540188900491?via%3Dihub","open_access":"1"}],"scopus_import":"1","year":"1988","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["0890-5401"]},"intvolume":"        77","citation":{"apa":"Edelsbrunner, H., &#38; Preparata, F. (1988). Minimum polygonal separation. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/0890-5401(88)90049-1\">https://doi.org/10.1016/0890-5401(88)90049-1</a>","short":"H. Edelsbrunner, F. Preparata, Information and Computation 77 (1988) 218–232.","chicago":"Edelsbrunner, Herbert, and Franco Preparata. “Minimum Polygonal Separation.” <i>Information and Computation</i>. Elsevier, 1988. <a href=\"https://doi.org/10.1016/0890-5401(88)90049-1\">https://doi.org/10.1016/0890-5401(88)90049-1</a>.","ieee":"H. Edelsbrunner and F. Preparata, “Minimum polygonal separation,” <i>Information and Computation</i>, vol. 77, no. 3. Elsevier, pp. 218–232, 1988.","ista":"Edelsbrunner H, Preparata F. 1988. Minimum polygonal separation. Information and Computation. 77(3), 218–232.","mla":"Edelsbrunner, Herbert, and Franco Preparata. “Minimum Polygonal Separation.” <i>Information and Computation</i>, vol. 77, no. 3, Elsevier, 1988, pp. 218–32, doi:<a href=\"https://doi.org/10.1016/0890-5401(88)90049-1\">10.1016/0890-5401(88)90049-1</a>.","ama":"Edelsbrunner H, Preparata F. Minimum polygonal separation. <i>Information and Computation</i>. 1988;77(3):218-232. doi:<a href=\"https://doi.org/10.1016/0890-5401(88)90049-1\">10.1016/0890-5401(88)90049-1</a>"},"doi":"10.1016/0890-5401(88)90049-1","quality_controlled":"1","extern":"1","acknowledgement":"Research of the first author is supported by Amoco Fnd. Fat. Dev. Comput. Sci. l-6-44862; research of the second author is supported by NSF Grant ECS 84-10902.","oa":1,"abstract":[{"lang":"eng","text":"In this paper we study the problem of polygonal separation in the plane, i.e., finding a convex polygon with minimum number k of sides separating two given finite point sets (k-separator), if it exists. We show that for k = Θ(n),  is a lower bound to the running time of any algorithm for this problem, and exhibit two algorithms of distinctly different flavors. The first relies on an O(n log n)-time preprocessing task, which constructs the convex hull of the internal set and a nested star-shaped polygon determined by the external set; the k-separator is contained in the annulus between the boundaries of these two polygons and is constructed in additional linear time. The second algorithm adapts the prune-and-search approach, and constructs, in each iteration, one side of the separator; its running time is O(kn), but the separator may have one more side than the minimum."}],"page":"218 - 232"},{"date_created":"2018-12-11T12:04:28Z","oa_version":"Published Version","_id":"3658","article_processing_charge":"No","type":"journal_article","issue":"3","publication":"Heredity","author":[{"first_name":"Godfrey","last_name":"Hewitt","full_name":"Hewitt, Godfrey"},{"first_name":"R.","last_name":"Nichols","full_name":"Nichols, R."},{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"}],"day":"01","title":"Homogamy in a hybrid zone in the alpine grasshopper Podisma pedestris","volume":59,"status":"public","main_file_link":[{"url":"https://www.nature.com/articles/hdy1987156","open_access":"1"}],"scopus_import":"1","date_published":"1987-12-01T00:00:00Z","month":"12","article_type":"original","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Nature Publishing Group","date_updated":"2022-02-04T12:20:46Z","publist_id":"2725","doi":"10.1038/hdy.1987.156","citation":{"ama":"Hewitt G, Nichols R, Barton NH. Homogamy in a hybrid zone in the alpine grasshopper Podisma pedestris. <i>Heredity</i>. 1987;59(3):457-466. doi:<a href=\"https://doi.org/10.1038/hdy.1987.156\">10.1038/hdy.1987.156</a>","mla":"Hewitt, Godfrey, et al. “Homogamy in a Hybrid Zone in the Alpine Grasshopper Podisma Pedestris.” <i>Heredity</i>, vol. 59, no. 3, Nature Publishing Group, 1987, pp. 457–66, doi:<a href=\"https://doi.org/10.1038/hdy.1987.156\">10.1038/hdy.1987.156</a>.","ieee":"G. Hewitt, R. Nichols, and N. H. Barton, “Homogamy in a hybrid zone in the alpine grasshopper Podisma pedestris,” <i>Heredity</i>, vol. 59, no. 3. Nature Publishing Group, pp. 457–466, 1987.","ista":"Hewitt G, Nichols R, Barton NH. 1987. Homogamy in a hybrid zone in the alpine grasshopper Podisma pedestris. Heredity. 59(3), 457–466.","short":"G. Hewitt, R. Nichols, N.H. Barton, Heredity 59 (1987) 457–466.","chicago":"Hewitt, Godfrey, R. Nichols, and Nicholas H Barton. “Homogamy in a Hybrid Zone in the Alpine Grasshopper Podisma Pedestris.” <i>Heredity</i>. Nature Publishing Group, 1987. <a href=\"https://doi.org/10.1038/hdy.1987.156\">https://doi.org/10.1038/hdy.1987.156</a>.","apa":"Hewitt, G., Nichols, R., &#38; Barton, N. H. (1987). Homogamy in a hybrid zone in the alpine grasshopper Podisma pedestris. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.1987.156\">https://doi.org/10.1038/hdy.1987.156</a>"},"quality_controlled":"1","extern":"1","acknowledgement":"We are most grateful to Manse East for excellent technical assistance, to Dr Michael Shaw and Martin Dransfield for statistical advice and to Dr Roger Butlin for critical reading of the manuscript. It is a pleasure to thank M. and Mme. Aviotti and family at Casterino for their help and hospitality over several years of field work. The authorities of Le Parc National de Mercantour kindly gave permission for the collections. This work was financed by grants from the N.E.R.C. and S.E.R.C.\r\n","year":"1987","publication_identifier":{"eissn":["1365-2540"],"issn":["0018-067X"]},"language":[{"iso":"eng"}],"intvolume":"        59","page":"457 - 466","oa":1,"abstract":[{"text":"Females of the grasshopper Podisima pedestris were collected from the middle of a hybrid zone between two chromosomal races in the Alpes Maritimes. They had already mated in the field, and could therefore lay fertilised eggs in the laboratory. The embryos were karyotyped, and found to contain an excess of chromosomal homozygotes. No evidence of assortative mating was found from copulating pairs taken in the field. The excess appears to have been caused by a combination of multiple insemination and assortative fertilisation. The genetics of the assortment, and the implications for the evolution of reproductive isolation are discussed.","lang":"eng"}]},{"oa":1,"abstract":[{"lang":"eng","text":"The grasshopper Podisma pedestris contains two chromosomal races, which differ by a Robertsonian fusion between the sex chromosome and an autosome, and which meet in a narrow hybrid zone in the Alpes Maritimes. DNA content variation across this hybrid zone was investigated by optical densitometry of Feulgen stained spermatids. Spermatids from males with the unfused sex chromosome stain more strongly than those from males with the fused chromosome. The difference between the karyotypes is greater in the centre of the hybrid zone, suggesting that it is not a pleiotropic effect of the fusion itself, but is due instead to differences at closely linked loci."}],"page":"221 - 228","publication_identifier":{"eissn":["1365-2540"],"issn":["0018-067X"]},"language":[{"iso":"eng"}],"year":"1987","intvolume":"        58","extern":"1","doi":"10.1038/hdy.1987.36","citation":{"ama":"Westerman M, Barton NH, Hewitt G. Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris. <i>Heredity</i>. 1987;58:221-228. doi:<a href=\"https://doi.org/10.1038/hdy.1987.36\">10.1038/hdy.1987.36</a>","apa":"Westerman, M., Barton, N. H., &#38; Hewitt, G. (1987). Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.1987.36\">https://doi.org/10.1038/hdy.1987.36</a>","chicago":"Westerman, Michael, Nicholas H Barton, and Godfrey Hewitt. “Differences in DNA Content between Two Chromosomal Races of the Grasshopper Podisma Pedestris.” <i>Heredity</i>. Nature Publishing Group, 1987. <a href=\"https://doi.org/10.1038/hdy.1987.36\">https://doi.org/10.1038/hdy.1987.36</a>.","short":"M. Westerman, N.H. Barton, G. Hewitt, Heredity 58 (1987) 221–228.","ieee":"M. Westerman, N. H. Barton, and G. Hewitt, “Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris,” <i>Heredity</i>, vol. 58. Nature Publishing Group, pp. 221–228, 1987.","ista":"Westerman M, Barton NH, Hewitt G. 1987. Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris. Heredity. 58, 221–228.","mla":"Westerman, Michael, et al. “Differences in DNA Content between Two Chromosomal Races of the Grasshopper Podisma Pedestris.” <i>Heredity</i>, vol. 58, Nature Publishing Group, 1987, pp. 221–28, doi:<a href=\"https://doi.org/10.1038/hdy.1987.36\">10.1038/hdy.1987.36</a>."},"quality_controlled":"1","acknowledgement":"s We would like to thank Manse East for technical assistance and M. et Mme Aviotti for their hospitality in France. We are grateful to Dr Michael Rennet, Dr Donald Fox, Professor Hubert Rees, and an anonymous referee for their helpful comments on earlier manuscripts. This work was supported by an S.E.R.C. grant to G.M.H., and by an S.E.R.C. postdoctoral fellowship to N.H.B. MW. worked at UEA under an Outside Studies Program.\r\n","month":"01","date_published":"1987-01-01T00:00:00Z","article_type":"original","publisher":"Nature Publishing Group","publist_id":"1733","date_updated":"2022-02-03T10:48:40Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy198736"}],"scopus_import":"1","day":"01","status":"public","volume":58,"title":"Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris","type":"journal_article","_id":"4319","article_processing_charge":"No","publication":"Heredity","date_created":"2018-12-11T12:08:14Z","oa_version":"Published Version","author":[{"full_name":"Westerman, Michael","last_name":"Westerman","first_name":"Michael"},{"last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"full_name":"Hewitt, Godfrey","first_name":"Godfrey","last_name":"Hewitt"}]},{"author":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"},{"first_name":"Montgomery","last_name":"Slatkin","full_name":"Slatkin, Montgomery"}],"date_created":"2018-12-11T12:04:30Z","oa_version":"None","publication":"Heredity","issue":"3","_id":"3663","type":"journal_article","article_processing_charge":"No","title":"A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population","volume":56,"status":"public","day":"01","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy198663"}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"2720","date_updated":"2022-02-01T15:04:01Z","publisher":"Nature Publishing Group","article_type":"original","date_published":"1986-06-01T00:00:00Z","month":"06","acknowledgement":"This research has been supported in part by grants from the Royal Society of London, S.E.R.C., and the National Science Foundation. We thank J. Felsenstein for helpful discussions of this problem.","quality_controlled":"1","doi":"10.1038/hdy.1986.63","citation":{"apa":"Barton, N. H., &#38; Slatkin, M. (1986). A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.1986.63\">https://doi.org/10.1038/hdy.1986.63</a>","short":"N.H. Barton, M. Slatkin, Heredity 56 (1986) 409–416.","chicago":"Barton, Nicholas H, and Montgomery Slatkin. “A Quasi-Equilibrium Theory of the Distribution of Rare Alleles in a Subdivided Population.” <i>Heredity</i>. Nature Publishing Group, 1986. <a href=\"https://doi.org/10.1038/hdy.1986.63\">https://doi.org/10.1038/hdy.1986.63</a>.","ieee":"N. H. Barton and M. Slatkin, “A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population,” <i>Heredity</i>, vol. 56, no. 3. Nature Publishing Group, pp. 409–416, 1986.","ista":"Barton NH, Slatkin M. 1986. A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population. Heredity. 56(3), 409–416.","mla":"Barton, Nicholas H., and Montgomery Slatkin. “A Quasi-Equilibrium Theory of the Distribution of Rare Alleles in a Subdivided Population.” <i>Heredity</i>, vol. 56, no. 3, Nature Publishing Group, 1986, pp. 409–16, doi:<a href=\"https://doi.org/10.1038/hdy.1986.63\">10.1038/hdy.1986.63</a>.","ama":"Barton NH, Slatkin M. A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population. <i>Heredity</i>. 1986;56(3):409-416. doi:<a href=\"https://doi.org/10.1038/hdy.1986.63\">10.1038/hdy.1986.63</a>"},"extern":"1","intvolume":"        56","pmid":1,"year":"1986","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"page":"409 - 416","external_id":{"pmid":["3733460 "]},"abstract":[{"text":"The conditional average frequency of rare alleles has been shown in simulations to provide a simple and robust estimator of the number of individuals exchanged between local populations in an island model (Nm). This statistic is defined as the average frequency of an allele in those samples in which the allele is present. Here, we show that the conditional average frequency can be calculated from the distribution of allele frequencies. It is a measure of the spread of this distribution, and so is analogous to the standardised variance, FST. Analytic predictions for the island model of migration agree well with the corresponding simulation results. These predictions are based on the assumption that the rare alleles found in samples have reached a &quot;quasi-equilibrium&quot; distribution. As well as relating the conditional average frequency to the underlying allele frequency distribution, our results provide a more accurate method of estimating Nm from the conditional average frequency of private alleles in samples of different sizes.","lang":"eng"}],"oa":1},{"oa":1,"abstract":[{"lang":"eng","text":"Suppose that selection acts at one or more loci to maintain genetic differences between hybridising populations. Then, the flow of alleles at a neutral marker locus which is linked to these selected loci will be impeded. We define and calculate measures of the barrier to gene flow between two distinct demes, and across a continuous habitat. In both cases, we find that in order for gene flow to be significantly reduced over much of the genome, hybrids must be substantially less fit, and the number of genes involved in building the barrier must be so large that the majority of other genes become closely linked to some locus which is under selection. This conclusion is not greatly affected by the pattern of epistasis, or the position of the marker locus along the chromosome."}],"page":"357 - 376","intvolume":"        57","year":"1986","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1365-2540"],"issn":["0018-067X"]},"citation":{"ama":"Barton NH, Bengtsson B. The barrier to genetic exchange between hybridising populations. <i>Heredity</i>. 1986;57:357-376.","mla":"Barton, Nicholas H., and Bengt Bengtsson. “The Barrier to Genetic Exchange between Hybridising Populations.” <i>Heredity</i>, vol. 57, Nature Publishing Group, 1986, pp. 357–76.","ieee":"N. H. Barton and B. Bengtsson, “The barrier to genetic exchange between hybridising populations,” <i>Heredity</i>, vol. 57. Nature Publishing Group, pp. 357–376, 1986.","ista":"Barton NH, Bengtsson B. 1986. The barrier to genetic exchange between hybridising populations. Heredity. 57, 357–376.","chicago":"Barton, Nicholas H, and Bengt Bengtsson. “The Barrier to Genetic Exchange between Hybridising Populations.” <i>Heredity</i>. Nature Publishing Group, 1986.","short":"N.H. Barton, B. Bengtsson, Heredity 57 (1986) 357–376.","apa":"Barton, N. H., &#38; Bengtsson, B. (1986). The barrier to genetic exchange between hybridising populations. <i>Heredity</i>. Nature Publishing Group."},"quality_controlled":"1","extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Nature Publishing Group","publist_id":"2719","date_updated":"2022-02-01T14:49:02Z","month":"01","date_published":"1986-01-01T00:00:00Z","article_type":"original","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy1986135"}],"volume":57,"title":"The barrier to genetic exchange between hybridising populations","status":"public","day":"01","author":[{"last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"},{"full_name":"Bengtsson, Bengt","last_name":"Bengtsson","first_name":"Bengt"}],"date_created":"2018-12-11T12:04:30Z","oa_version":"Published Version","article_processing_charge":"No","type":"journal_article","_id":"3664","publication":"Heredity"},{"extern":"1","citation":{"apa":"Barton, N. H. (1986). The effects of linkage and density-dependent regulation on gene flow. <i>Heredity</i>. Nature Publishing Group.","chicago":"Barton, Nicholas H. “The Effects of Linkage and Density-Dependent Regulation on Gene Flow.” <i>Heredity</i>. Nature Publishing Group, 1986.","short":"N.H. Barton, Heredity 57 (1986) 415–426.","ista":"Barton NH. 1986. The effects of linkage and density-dependent regulation on gene flow. Heredity. 57, 415–426.","ieee":"N. H. Barton, “The effects of linkage and density-dependent regulation on gene flow,” <i>Heredity</i>, vol. 57. Nature Publishing Group, pp. 415–426, 1986.","mla":"Barton, Nicholas H. “The Effects of Linkage and Density-Dependent Regulation on Gene Flow.” <i>Heredity</i>, vol. 57, Nature Publishing Group, 1986, pp. 415–26.","ama":"Barton NH. The effects of linkage and density-dependent regulation on gene flow. <i>Heredity</i>. 1986;57:415-426."},"quality_controlled":"1","acknowledgement":"I would like to thank Shahin Rouhani and Richard Nichols for their helpful comments on the manuscript, and the latter for providing the data used in fig. 3. This work was supported by a grant from the Science and Engineering Research Council (GR/C/91529).","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"year":"1986","intvolume":"        57","page":"415 - 426","oa":1,"abstract":[{"lang":"eng","text":"The rate of gene flow across a hybrid zone may be reduced by the presence of a physical barrier, by a reduction of population density caused by reduced fitness of hybrids (the “hybrid sink” effect), and by linkage. If the reduction in hybrid fitness is not extreme, the strength of the barrier to gene flow caused by these effects is. Here, w is the width of the cline; ρ* is the carrying capacity; W̄* is the mean fitness of the population, excluding effects of density; R is the strength of density-dependent regulation; and r̄ is the harmonic mean recombination rate between the locus whose flow is being calculated, and loci under selection. +, 0 denote populations outside the hybrid zone, and at its centre, respectively. This relation is illustrated using data from hybrid ones in Bombina and Podisma, and its implications for interpretation of data from nature are discussed."}],"_id":"3665","type":"journal_article","article_processing_charge":"No","publication":"Heredity","date_created":"2018-12-11T12:04:30Z","oa_version":"Published Version","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"day":"01","status":"public","title":"The effects of linkage and density-dependent regulation on gene flow","volume":57,"main_file_link":[{"url":"https://www.nature.com/articles/hdy1986142","open_access":"1"}],"scopus_import":"1","month":"01","date_published":"1986-01-01T00:00:00Z","article_type":"original","publisher":"Nature Publishing Group","publist_id":"2718","date_updated":"2022-02-01T14:31:29Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published"},{"page":"344 - 349","abstract":[{"lang":"eng","text":"To points p and q of a finite set S in d-dimensional Euclidean space Ed are extreme if {p, q} = S ∩ h, for some open halfspace h. Let e2(d)(n) be the maximum number of extreme pairs realized by any n points in Ed. We give geometric proofs of , if n⩾4, and e2(3)(n) = 3n−6, if n⩾6. These results settle the question since all other cases are trivial."}],"oa":1,"quality_controlled":"1","citation":{"ama":"Edelsbrunner H, Stöckl G. The number of extreme pairs of finite point-sets in Euclidean spaces. <i>Journal of Combinatorial Theory Series A</i>. 1986;43(2):344-349. doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90075-0\">10.1016/0097-3165(86)90075-0</a>","ieee":"H. Edelsbrunner and G. Stöckl, “The number of extreme pairs of finite point-sets in Euclidean spaces,” <i>Journal of Combinatorial Theory Series A</i>, vol. 43, no. 2. Elsevier, pp. 344–349, 1986.","ista":"Edelsbrunner H, Stöckl G. 1986. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 43(2), 344–349.","mla":"Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” <i>Journal of Combinatorial Theory Series A</i>, vol. 43, no. 2, Elsevier, 1986, pp. 344–49, doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90075-0\">10.1016/0097-3165(86)90075-0</a>.","apa":"Edelsbrunner, H., &#38; Stöckl, G. (1986). The number of extreme pairs of finite point-sets in Euclidean spaces. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/0097-3165(86)90075-0\">https://doi.org/10.1016/0097-3165(86)90075-0</a>","short":"H. Edelsbrunner, G. Stöckl, Journal of Combinatorial Theory Series A 43 (1986) 344–349.","chicago":"Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/0097-3165(86)90075-0\">https://doi.org/10.1016/0097-3165(86)90075-0</a>."},"doi":"10.1016/0097-3165(86)90075-0","extern":"1","year":"1986","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"intvolume":"        43","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/0097316586900750?via%3Dihub"}],"scopus_import":"1","article_type":"original","month":"11","date_published":"1986-11-01T00:00:00Z","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"2020","date_updated":"2022-02-01T14:02:41Z","publisher":"Elsevier","oa_version":"None","date_created":"2018-12-11T12:06:56Z","publication":"Journal of Combinatorial Theory Series A","type":"journal_article","_id":"4098","article_processing_charge":"No","issue":"2","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Stöckl, Gerd","last_name":"Stöckl","first_name":"Gerd"}],"day":"01","title":"The number of extreme pairs of finite point-sets in Euclidean spaces","volume":43,"status":"public"},{"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"year":"1986","intvolume":"        41","extern":"1","quality_controlled":"1","doi":"10.1016/0097-3165(86)90078-6","citation":{"mla":"Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” <i>Journal of Combinatorial Theory Series A</i>, vol. 41, no. 2, Elsevier, 1986, pp. 159–66, doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">10.1016/0097-3165(86)90078-6</a>.","ista":"Edelsbrunner H, Welzl E. 1986. On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. 41(2), 159–166.","ieee":"H. Edelsbrunner and E. Welzl, “On the maximal number of edges of many faces in an arrangement,” <i>Journal of Combinatorial Theory Series A</i>, vol. 41, no. 2. Elsevier, pp. 159–166, 1986.","short":"H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 41 (1986) 159–166.","chicago":"Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">https://doi.org/10.1016/0097-3165(86)90078-6</a>.","apa":"Edelsbrunner, H., &#38; Welzl, E. (1986). On the maximal number of edges of many faces in an arrangement. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">https://doi.org/10.1016/0097-3165(86)90078-6</a>","ama":"Edelsbrunner H, Welzl E. On the maximal number of edges of many faces in an arrangement. <i>Journal of Combinatorial Theory Series A</i>. 1986;41(2):159-166. doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">10.1016/0097-3165(86)90078-6</a>"},"acknowledgement":"The second author thanks Gan Gusfield for useful discussion.","abstract":[{"text":"Let A be an arrangement of n lines in the plane. Suppose F1,…, Fk are faces in the dissection induced by A and that Fi is a t(Fi)-gon. We give asymptotic bounds on the maximal sum ∑i=1kt(Fi) which can be realized by k different faces in an arrangement of n lines. The results improve known bounds for k of higher order than n(1/2).","lang":"eng"}],"oa":1,"page":"159 - 166","day":"01","status":"public","title":"On the maximal number of edges of many faces in an arrangement","volume":41,"publication":"Journal of Combinatorial Theory Series A","article_processing_charge":"No","_id":"4103","issue":"2","type":"journal_article","date_created":"2018-12-11T12:06:57Z","oa_version":"Published Version","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"date_published":"1986-11-01T00:00:00Z","month":"11","date_updated":"2022-02-01T09:46:55Z","publist_id":"2015","publisher":"Elsevier","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/0097316586900786?via%3Dihub"}],"scopus_import":"1"},{"publisher":"Elsevier","date_updated":"2022-01-31T11:09:26Z","publist_id":"2008","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","date_published":"1985-01-01T00:00:00Z","month":"01","article_type":"original","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/0304397585900052?via%3Dihub"}],"status":"public","title":"Finding Transversals for Sets of Simple Geometric-Figures","volume":35,"day":"01","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"}],"_id":"4116","type":"journal_article","article_processing_charge":"No","issue":"1","publication":"Theoretical Computer Science","oa_version":"Published Version","date_created":"2018-12-11T12:07:02Z","oa":1,"abstract":[{"lang":"eng","text":"A straight line that intersects all members of a set S of objects in the real plane is called a transversal of S. Geometric transforms are described that reduce transversal problems for various types of objects to convex hull problems for points. These reductions lead to efficient algorithms for finding transversals which are also described. Applications of the algorithms are found in computer graphics: “Reproduce the line displayed by a collection of pixels”, and in statistics: “Find the line that minimizes the maximum distance from a collection of (weighted) points in the plane”."}],"page":"55 - 69","intvolume":"        35","publication_identifier":{"eissn":["0304-3975"],"issn":["0304-3975"]},"language":[{"iso":"eng"}],"year":"1985","acknowledgement":"The author gratefully acknowledges the criticism of an anonymous referee who discovered a serious flaw in an earlier version of this paper. ","extern":"1","doi":"10.1016/0304-3975(85)90005-2","citation":{"chicago":"Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” <i>Theoretical Computer Science</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/0304-3975(85)90005-2\">https://doi.org/10.1016/0304-3975(85)90005-2</a>.","short":"H. Edelsbrunner, Theoretical Computer Science 35 (1985) 55–69.","apa":"Edelsbrunner, H. (1985). Finding Transversals for Sets of Simple Geometric-Figures. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3975(85)90005-2\">https://doi.org/10.1016/0304-3975(85)90005-2</a>","mla":"Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” <i>Theoretical Computer Science</i>, vol. 35, no. 1, Elsevier, 1985, pp. 55–69, doi:<a href=\"https://doi.org/10.1016/0304-3975(85)90005-2\">10.1016/0304-3975(85)90005-2</a>.","ieee":"H. Edelsbrunner, “Finding Transversals for Sets of Simple Geometric-Figures,” <i>Theoretical Computer Science</i>, vol. 35, no. 1. Elsevier, pp. 55–69, 1985.","ista":"Edelsbrunner H. 1985. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 35(1), 55–69.","ama":"Edelsbrunner H. Finding Transversals for Sets of Simple Geometric-Figures. <i>Theoretical Computer Science</i>. 1985;35(1):55-69. doi:<a href=\"https://doi.org/10.1016/0304-3975(85)90005-2\">10.1016/0304-3975(85)90005-2</a>"},"quality_controlled":"1"}]