[{"day":"20","status":"public","title":"Tetrahedrizing point sets in three dimensions","volume":358,"_id":"4087","article_processing_charge":"No","type":"conference","publication":" International Symposium on Symbolic and Algebraic Computation","oa_version":"None","date_created":"2018-12-11T12:06:52Z","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"last_name":"Preparata","first_name":"Franco","full_name":"Preparata, Franco"},{"full_name":"West, Douglas","last_name":"West","first_name":"Douglas"}],"month":"09","date_published":"1989-09-20T00:00:00Z","publisher":"Springer","date_updated":"2022-02-10T13:27:41Z","publist_id":"2035","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-51084-2_31"}],"scopus_import":"1","language":[{"iso":"eng"}],"year":"1989","intvolume":"       358","extern":"1","doi":"10.1007/3-540-51084-2_31","citation":{"ama":"Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions. In: <i> International Symposium on Symbolic and Algebraic Computation</i>. Vol 358. Springer; 1989:315-331. doi:<a href=\"https://doi.org/10.1007/3-540-51084-2_31\">10.1007/3-540-51084-2_31</a>","mla":"Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” <i> International Symposium on Symbolic and Algebraic Computation</i>, vol. 358, Springer, 1989, pp. 315–31, doi:<a href=\"https://doi.org/10.1007/3-540-51084-2_31\">10.1007/3-540-51084-2_31</a>.","ieee":"H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in three dimensions,” in <i> International Symposium on Symbolic and Algebraic Computation</i>, Rome, Italy, 1989, vol. 358, pp. 315–331.","ista":"Edelsbrunner H, Preparata F, West D. 1989. Tetrahedrizing point sets in three dimensions.  International Symposium on Symbolic and Algebraic Computation. ISSAC: International Symposium on Symbolic and Algebraic Computation, LNCS, vol. 358, 315–331.","chicago":"Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.” In <i> International Symposium on Symbolic and Algebraic Computation</i>, 358:315–31. Springer, 1989. <a href=\"https://doi.org/10.1007/3-540-51084-2_31\">https://doi.org/10.1007/3-540-51084-2_31</a>.","short":"H. Edelsbrunner, F. Preparata, D. West, in:,  International Symposium on Symbolic and Algebraic Computation, Springer, 1989, pp. 315–331.","apa":"Edelsbrunner, H., Preparata, F., &#38; West, D. (1989). Tetrahedrizing point sets in three dimensions. In <i> International Symposium on Symbolic and Algebraic Computation</i> (Vol. 358, pp. 315–331). Rome, Italy: Springer. <a href=\"https://doi.org/10.1007/3-540-51084-2_31\">https://doi.org/10.1007/3-540-51084-2_31</a>"},"quality_controlled":"1","conference":{"location":"Rome, Italy","start_date":"1988-07-04","end_date":"1988-07-08","name":"ISSAC: International Symposium on Symbolic and Algebraic Computation"},"acknowledgement":"Research of the first author is supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862, the second author is supported by NSF Grant ECS 84-10902, and research of the third author is supported in part by ONR Grant N00014-85K0570 and by NSF Grant DMS 8504","abstract":[{"text":"This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in a tetrahedrization of n points in general position in three dimensions, i.e. such that no four points are coplanar. It also presents an algorithm that in O(nlog n) time constructs a tetrahedrization of a set of n points consisting of at most 3n–11 tetrahedra.","lang":"eng"}],"alternative_title":["LNCS"],"page":"315 - 331"},{"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"language":[{"iso":"eng"}],"year":"1989","intvolume":"         4","extern":"1","citation":{"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>","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>","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>.","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.","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>."},"doi":"10.1007/BF02187742","quality_controlled":"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.","oa":1,"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."}],"page":"433 - 466","day":"01","status":"public","volume":4,"title":"Implicitly representing arrangements of lines or segments","_id":"4088","issue":"1","article_processing_charge":"No","type":"journal_article","publication":"Discrete & Computational Geometry","date_created":"2018-12-11T12:06:52Z","oa_version":"Published Version","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Guibas, Leonidas","last_name":"Guibas","first_name":"Leonidas"},{"last_name":"Hershberger","first_name":"John","full_name":"Hershberger, John"},{"full_name":"Seidel, Raimund","first_name":"Raimund","last_name":"Seidel"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"},{"first_name":"Jack","last_name":"Snoeyink","full_name":"Snoeyink, Jack"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"month":"12","date_published":"1989-12-01T00:00:00Z","article_type":"original","publisher":"Springer","publist_id":"2036","date_updated":"2022-02-10T15:03:48Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187742","open_access":"1"}],"scopus_import":"1"},{"status":"public","title":"On arrangements of Jordan arcs with three intersections per pair","volume":4,"day":"01","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"last_name":"Hershberger","first_name":"John","full_name":"Hershberger, John"},{"first_name":"János","last_name":"Pach","full_name":"Pach, János"},{"full_name":"Pollack, Richard","last_name":"Pollack","first_name":"Richard"},{"last_name":"Seidel","first_name":"Raimund","full_name":"Seidel, Raimund"},{"full_name":"Sharir, Micha","last_name":"Sharir","first_name":"Micha"},{"first_name":"Jack","last_name":"Snoeyink","full_name":"Snoeyink, Jack"}],"_id":"4089","issue":"1","type":"journal_article","article_processing_charge":"No","publication":"Discrete & Computational Geometry","oa_version":"Published Version","date_created":"2018-12-11T12:06:52Z","publisher":"Springer","publist_id":"2037","date_updated":"2022-02-10T15:40:04Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","date_published":"1989-12-01T00:00:00Z","month":"12","article_type":"original","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://link.springer.com/article/10.1007/BF02187745"}],"intvolume":"         4","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"language":[{"iso":"eng"}],"year":"1989","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.","extern":"1","doi":"10.1007/BF02187745","citation":{"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>","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>.","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.","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>"},"quality_controlled":"1","oa":1,"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."}],"page":"523 - 539"},{"publisher":"Springer","date_updated":"2022-02-10T10:06:23Z","publist_id":"2031","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","month":"07","date_published":"1989-07-24T00:00:00Z","scopus_import":"1","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/BFb0035760"}],"status":"public","volume":372,"title":"A singly exponential stratification scheme for real semi-algebraic varieties and its applications","day":"24","author":[{"full_name":"Chazelle, Bernard","last_name":"Chazelle","first_name":"Bernard"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"article_processing_charge":"No","type":"conference","_id":"4092","publication":"16th International Colloquium on Automata, Languages, and Programming","date_created":"2018-12-11T12:06:53Z","oa_version":"None","page":"179 - 193","alternative_title":["LNCS"],"intvolume":"       372","language":[{"iso":"eng"}],"year":"1989","conference":{"location":"Stresa, Italy","end_date":"1989-07-15","start_date":"1989-07-11","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"acknowledgement":"The support of the Digital Systems Research center and the Digital Paris Research laboratory, where much of this research was carried out, are gratefully acknowledged. Work on this paper by Bernard Chazelle has been supported by NSF Grant CCI~-87-00917. Work on this paper by Herbert Edelsbrunner has been supported by NSF Grant CCR-87-14565. Work on this paper by Micha Sharir has been supported by ONR Grant N00014-87-K-0129, by NSF Grant DCP~-83-20085, and by grants from the U.S.-Israeli Binational Science Foundation, the NCRD - the Israeli National Council for Research and Development, and the EMET Fund of the Israeli Academy of Sciences. ","extern":"1","doi":"10.1007/BFb0035760","citation":{"mla":"Chazelle, Bernard, et al. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” <i>16th International Colloquium on Automata, Languages, and Programming</i>, vol. 372, Springer, 1989, pp. 179–93, doi:<a href=\"https://doi.org/10.1007/BFb0035760\">10.1007/BFb0035760</a>.","ista":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1989. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. 16th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 372, 179–193.","ieee":"B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “A singly exponential stratification scheme for real semi-algebraic varieties and its applications,” in <i>16th International Colloquium on Automata, Languages, and Programming</i>, Stresa, Italy, 1989, vol. 372, pp. 179–193.","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” In <i>16th International Colloquium on Automata, Languages, and Programming</i>, 372:179–93. Springer, 1989. <a href=\"https://doi.org/10.1007/BFb0035760\">https://doi.org/10.1007/BFb0035760</a>.","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, in:, 16th International Colloquium on Automata, Languages, and Programming, Springer, 1989, pp. 179–193.","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1989). A singly exponential stratification scheme for real semi-algebraic varieties and its applications. In <i>16th International Colloquium on Automata, Languages, and Programming</i> (Vol. 372, pp. 179–193). Stresa, Italy: Springer. <a href=\"https://doi.org/10.1007/BFb0035760\">https://doi.org/10.1007/BFb0035760</a>","ama":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. In: <i>16th International Colloquium on Automata, Languages, and Programming</i>. Vol 372. Springer; 1989:179-193. doi:<a href=\"https://doi.org/10.1007/BFb0035760\">10.1007/BFb0035760</a>"},"quality_controlled":"1"},{"page":"139 - 181","abstract":[{"text":"This paper investigates the combinatorial and computational aspects of certain extremal geometric problems in two and three dimensions. Specifically, we examine the problem of intersecting a convex subdivision with a line in order to maximize the number of intersections. A similar problem is to maximize the number of intersected facets in a cross-section of a three-dimensional convex polytope. Related problems concern maximum chains in certain families of posets defined over the regions of a convex subdivision. In most cases we are able to prove sharp bounds on the asymptotic behavior of the corresponding extremal functions. We also describe polynomial algorithms for all the problems discussed.","lang":"eng"}],"acknowledgement":"Bernard Chazelle wishes to acknowledge the National Science Foundation for supporting this research in part under Grant No. MCS83-03925. Herbert Edelsbrunner is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862. We wish to thank J. Pach and E. Szemeredi for valuable discussions on several\r\nof the problems studied in this paper.","citation":{"ieee":"B. Chazelle, H. Edelsbrunner, and L. Guibas, “The complexity of cutting complexes,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 139–181, 1989.","ista":"Chazelle B, Edelsbrunner H, Guibas L. 1989. The complexity of cutting complexes. Discrete &#38; Computational Geometry. 4(1), 139–181.","mla":"Chazelle, Bernard, et al. “The Complexity of Cutting Complexes.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 139–81, doi:<a href=\"https://doi.org/10.1007/BF02187720\">10.1007/BF02187720</a>.","apa":"Chazelle, B., Edelsbrunner, H., &#38; Guibas, L. (1989). The complexity of cutting complexes. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187720\">https://doi.org/10.1007/BF02187720</a>","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, Discrete &#38; Computational Geometry 4 (1989) 139–181.","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, and Leonidas Guibas. “The Complexity of Cutting Complexes.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187720\">https://doi.org/10.1007/BF02187720</a>.","ama":"Chazelle B, Edelsbrunner H, Guibas L. The complexity of cutting complexes. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):139-181. doi:<a href=\"https://doi.org/10.1007/BF02187720\">10.1007/BF02187720</a>"},"doi":"10.1007/BF02187720","quality_controlled":"1","extern":"1","intvolume":"         4","year":"1989","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187720"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Springer","date_updated":"2022-02-10T10:25:57Z","publist_id":"2032","date_published":"1989-03-01T00:00:00Z","month":"03","author":[{"last_name":"Chazelle","first_name":"Bernard","full_name":"Chazelle, Bernard"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"}],"date_created":"2018-12-11T12:06:54Z","oa_version":"None","issue":"1","type":"journal_article","article_processing_charge":"No","_id":"4093","publication":"Discrete & Computational Geometry","title":"The complexity of cutting complexes","volume":4,"status":"public","day":"01"},{"_id":"4309","type":"journal_article","article_processing_charge":"No","issue":"7","publication":"Evolution; International Journal of Organic Evolution","date_created":"2018-12-11T12:08:10Z","oa_version":"None","author":[{"first_name":"Montgomery","last_name":"Slatkin","full_name":"Slatkin, Montgomery"},{"first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"}],"day":"01","status":"public","volume":43,"title":"A comparison of three methods for estimating average levels of gene flow","main_file_link":[{"url":"http://www.jstor.org/stable/2409452"}],"month":"11","date_published":"1989-11-01T00:00:00Z","article_type":"original","publisher":"Wiley-Blackwell","publist_id":"1751","date_updated":"2022-02-10T09:44:53Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","extern":"1","doi":"10.1111/j.1558-5646.1989.tb02587.x ","citation":{"ista":"Slatkin M, Barton NH. 1989. A comparison of three methods for estimating average levels of gene flow. Evolution; International Journal of Organic Evolution. 43(7), 1349–1368.","ieee":"M. Slatkin and N. H. Barton, “A comparison of three methods for estimating average levels of gene flow,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 43, no. 7. Wiley-Blackwell, pp. 1349–1368, 1989.","mla":"Slatkin, Montgomery, and Nicholas H. Barton. “A Comparison of Three Methods for Estimating Average Levels of Gene Flow.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 43, no. 7, Wiley-Blackwell, 1989, pp. 1349–68, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1989.tb02587.x \">10.1111/j.1558-5646.1989.tb02587.x </a>.","apa":"Slatkin, M., &#38; Barton, N. H. (1989). A comparison of three methods for estimating average levels of gene flow. <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.1989.tb02587.x \">https://doi.org/10.1111/j.1558-5646.1989.tb02587.x </a>","short":"M. Slatkin, N.H. Barton, Evolution; International Journal of Organic Evolution 43 (1989) 1349–1368.","chicago":"Slatkin, Montgomery, and Nicholas H Barton. “A Comparison of Three Methods for Estimating Average Levels of Gene Flow.” <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell, 1989. <a href=\"https://doi.org/10.1111/j.1558-5646.1989.tb02587.x \">https://doi.org/10.1111/j.1558-5646.1989.tb02587.x </a>.","ama":"Slatkin M, Barton NH. A comparison of three methods for estimating average levels of gene flow. <i>Evolution; International Journal of Organic Evolution</i>. 1989;43(7):1349-1368. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1989.tb02587.x \">10.1111/j.1558-5646.1989.tb02587.x </a>"},"quality_controlled":"1","acknowledgement":"This research has been supported in partv by grant 85-00258 from the National Science Foundation and by grants GR/C/9 1529 and GR/E/08507 from the Science and Engineering Research Council. We thank C. C. Cockerham and B. S. Weir for helpful discussions of this topic, C. Wehrhahn for bringing his method to our attention and for providing us with a copy of his program for estimating Nm, and J. Coyne, M. Nei, B. S. Weir, and an anonymous referee for comments on an earlier draft of this paper.","publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]},"language":[{"iso":"eng"}],"year":"1989","pmid":1,"intvolume":"        43","external_id":{"pmid":["28564250 "]},"page":"1349 - 1368","abstract":[{"text":"Three methods for estimating the average level of gene flow in natural population are discussed and compared. The three methods are FST, rare alleles, and maximum likelihood. All three methods yield estimates of the combination of parameters (the number of migrants [Nm] in a demic model or the neighborhood size [4πDσ2] in a continuum model) that determines the relative importance of gene flow and genetic drift. We review the theory underlying these methods and derive new analytic results for the expectation of FST in stepping-stone and continuum models when small sets of samples are taken. We also compare the effectiveness of the different methods using a variety of simulated data. We found that the FST and rare-alleles methods yield comparable estimates under a wide variety of conditions when the population being sampled is demographically stable. They are roughly equally sensitive to selection and to variation in population structure, and they approach their equilibrium values at approximately the same rate. We found that two different maximum-likelihood methods tend to yield biased estimates when relatively small numbers of locations are sampled but more accurate estimates when larger numbers are sampled. Our conclusion is that, although FST and rare-alleles methods are expected to be equally effective in analyzing ideal data, practical problems in estimating the frequencies of rare alleles in electrophoretic studies suggest that FST is likely to be more useful under realistic conditions.","lang":"eng"}]},{"main_file_link":[{"url":"https://www.annualreviews.org/doi/10.1146/annurev.ge.23.120189.002005"}],"page":"337 - 370","date_published":"1989-01-01T00:00:00Z","month":"01","article_type":"original","publisher":"Annual Reviews","publist_id":"1744","date_updated":"2022-02-09T16:01:46Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","_id":"4312","type":"journal_article","article_processing_charge":"No","publication":"Annual Review of Genetics","extern":"1","citation":{"ama":"Barton NH, Turelli M. Evolutionary quantitative genetics: how little do we know? <i>Annual Review of Genetics</i>. 1989;23:337-370. doi:<a href=\"https://doi.org/10.1146/annurev.ge.23.120189.002005\">10.1146/annurev.ge.23.120189.002005</a>","ista":"Barton NH, Turelli M. 1989. Evolutionary quantitative genetics: how little do we know? Annual Review of Genetics. 23, 337–370.","ieee":"N. H. Barton and M. Turelli, “Evolutionary quantitative genetics: how little do we know?,” <i>Annual Review of Genetics</i>, vol. 23. Annual Reviews, pp. 337–370, 1989.","mla":"Barton, Nicholas H., and Michael Turelli. “Evolutionary Quantitative Genetics: How Little Do We Know?” <i>Annual Review of Genetics</i>, vol. 23, Annual Reviews, 1989, pp. 337–70, doi:<a href=\"https://doi.org/10.1146/annurev.ge.23.120189.002005\">10.1146/annurev.ge.23.120189.002005</a>.","apa":"Barton, N. H., &#38; Turelli, M. (1989). Evolutionary quantitative genetics: how little do we know? <i>Annual Review of Genetics</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev.ge.23.120189.002005\">https://doi.org/10.1146/annurev.ge.23.120189.002005</a>","short":"N.H. Barton, M. Turelli, Annual Review of Genetics 23 (1989) 337–370.","chicago":"Barton, Nicholas H, and Michael Turelli. “Evolutionary Quantitative Genetics: How Little Do We Know?” <i>Annual Review of Genetics</i>. Annual Reviews, 1989. <a href=\"https://doi.org/10.1146/annurev.ge.23.120189.002005\">https://doi.org/10.1146/annurev.ge.23.120189.002005</a>."},"doi":"10.1146/annurev.ge.23.120189.002005","oa_version":"None","date_created":"2018-12-11T12:08:11Z","quality_controlled":"1","acknowledgement":"We thank G. E. Bradford, B. Charlesworth, J. A. Coyne, D. Currie, H. Dingle, J. H. Gillespie, A. Gimelfarb, W. G. Hill, A. A. Hoffmann, K. S. Jackson, J. S. Jones, A. Liebowiz, T. Mitchell-aids , T. A. Mousseau, J. Peck, T. Prout, B. Riska, D. A. Roff, H. B. Shaffer, and M. Slatkin for helpful discussions and comments on earlier drafts. Our research is supported\r\nin part by grants from the Science and Engineering Research Council, the National Science Foundation (BSR-8866548), and the Institute of Theoretical Dynamics at University of California, Davis.","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":"Turelli, Michael","last_name":"Turelli","first_name":"Michael"}],"publication_identifier":{"issn":["0066-4197"],"eissn":["1545-2948"]},"language":[{"iso":"eng"}],"year":"1989","day":"01","status":"public","intvolume":"        23","title":"Evolutionary quantitative genetics: how little do we know?","volume":23},{"editor":[{"last_name":"Otte","first_name":"Daniel","full_name":"Otte, Daniel"},{"last_name":"Endler","first_name":"John","full_name":"Endler, John"}],"main_file_link":[{"url":"https://www.researchgate.net/publication/237005503_Speciation_and_Its_Consequences"}],"date_published":"1989-01-01T00:00:00Z","month":"01","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"1742","date_updated":"2022-02-09T15:03:06Z","publisher":"Sinauer Press","oa_version":"None","date_created":"2018-12-11T12:08:12Z","citation":{"ama":"Barton NH. Founder effect speciation. In: Otte D, Endler J, eds. <i>Speciation and Its Consequences</i>. Sinauer Press; 1989.","apa":"Barton, N. H. (1989). Founder effect speciation. In D. Otte &#38; J. Endler (Eds.), <i>Speciation and its consequences</i>. Sinauer Press.","short":"N.H. Barton, in:, D. Otte, J. Endler (Eds.), Speciation and Its Consequences, Sinauer Press, 1989.","chicago":"Barton, Nicholas H. “Founder Effect Speciation.” In <i>Speciation and Its Consequences</i>, edited by Daniel Otte and John Endler. Sinauer Press, 1989.","ieee":"N. H. Barton, “Founder effect speciation,” in <i>Speciation and its consequences</i>, D. Otte and J. Endler, Eds. Sinauer Press, 1989.","ista":"Barton NH. 1989.Founder effect speciation. In: Speciation and its consequences. .","mla":"Barton, Nicholas H. “Founder Effect Speciation.” <i>Speciation and Its Consequences</i>, edited by Daniel Otte and John Endler, Sinauer Press, 1989."},"extern":"1","publication":"Speciation and its consequences","_id":"4313","type":"book_chapter","article_processing_charge":"No","author":[{"last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"year":"1989","day":"01","publication_identifier":{"isbn":["‎ 978-0878936571"]},"language":[{"iso":"eng"}],"title":"Founder effect speciation","status":"public"},{"date_created":"2018-12-11T12:08:12Z","oa_version":"None","publication":"Genetical Research","_id":"4314","article_processing_charge":"No","issue":"1","type":"journal_article","author":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"day":"01","title":"The divergence of a polygenic system under stabilising selection, mutation and drift","volume":54,"status":"public","main_file_link":[{"url":"https://www.cambridge.org/core/journals/genetics-research/article/divergence-of-a-polygenic-system-subject-to-stabilizing-selection-mutation-and-drift/95DF5B589A5C32376F1AAEE99F3200D8"}],"scopus_import":"1","article_type":"original","date_published":"1989-08-01T00:00:00Z","month":"08","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-09T14:18:28Z","publist_id":"1741","publisher":"Cambridge University Press","quality_controlled":"1","doi":"10.1017/S0016672300028378","citation":{"mla":"Barton, Nicholas H. “The Divergence of a Polygenic System under Stabilising Selection, Mutation and Drift.” <i>Genetical Research</i>, vol. 54, no. 1, Cambridge University Press, 1989, pp. 59–78, doi:<a href=\"https://doi.org/10.1017/S0016672300028378\">10.1017/S0016672300028378</a>.","ista":"Barton NH. 1989. The divergence of a polygenic system under stabilising selection, mutation and drift. Genetical Research. 54(1), 59–78.","ieee":"N. H. Barton, “The divergence of a polygenic system under stabilising selection, mutation and drift,” <i>Genetical Research</i>, vol. 54, no. 1. Cambridge University Press, pp. 59–78, 1989.","short":"N.H. Barton, Genetical Research 54 (1989) 59–78.","chicago":"Barton, Nicholas H. “The Divergence of a Polygenic System under Stabilising Selection, Mutation and Drift.” <i>Genetical Research</i>. Cambridge University Press, 1989. <a href=\"https://doi.org/10.1017/S0016672300028378\">https://doi.org/10.1017/S0016672300028378</a>.","apa":"Barton, N. H. (1989). The divergence of a polygenic system under stabilising selection, mutation and drift. <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300028378\">https://doi.org/10.1017/S0016672300028378</a>","ama":"Barton NH. The divergence of a polygenic system under stabilising selection, mutation and drift. <i>Genetical Research</i>. 1989;54(1):59-78. doi:<a href=\"https://doi.org/10.1017/S0016672300028378\">10.1017/S0016672300028378</a>"},"extern":"1","year":"1989","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0016-6723"],"eissn":["1469-5073"]},"intvolume":"        54","pmid":1,"page":"59 - 78","external_id":{"pmid":["2806907"]},"abstract":[{"lang":"eng","text":"Polygenic variation can be maintained by a balance between mutation and stabilizing selection. When the alleles responsible for variation are rare, many classes of equilibria may be stable. The rate at which drift causes shifts between equilibria is investigated by integrating the gene frequency distribution W2N II (pq)4N mu-1. This integral can be found exactly, by numerical integration, or can be approximated by assuming that the full distribution of allele frequencies is approximately Gaussian. These methods are checked against simulations. Over a wide range of population sizes, drift will keep the population near an equilibrium which minimizes the genetic variance and the deviation from the selective optimum. Shifts between equilibria in this class occur at an appreciable rate if the product of population size and selection on each locus is small (Ns alpha 2 less than 10). The Gaussian approximation is accurate even when the underlying distribution is strongly skewed. Reproductive isolation evolves as populations shift to new combinations of alleles: however, this process is slow, approaching the neutral rate (approximately mu) in small populations."}]},{"title":"A really temporal logic","status":"public","year":"1989","day":"01","publication_identifier":{"issn":["0018-9162"],"eissn":["1558-0814"],"isbn":["0-8186-1982-1"]},"language":[{"iso":"eng"}],"author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"conference":{"name":"FOCS: Foundations of Computer Science","start_date":"1989-10-30","end_date":"1989-11-01","location":"Research Triangle Park, NC, USA"},"acknowledgement":"We thank Zohar Manna, Amir Pnueli, and David Dill for their guidance. Moshe Vardi and Joe Halpern gave us very helpful advice for refilling our undecidability results. ","doi":"10.1109/SFCS.1989.63473","citation":{"ama":"Alur R, Henzinger TA. A really temporal logic. In: <i>30th Annual Symposium on Foundations of Computer Science</i>. FCOS. IEEE; 1989:164-169. doi:<a href=\"https://doi.org/10.1109/SFCS.1989.63473\">10.1109/SFCS.1989.63473</a>","ista":"Alur R, Henzinger TA. 1989. A really temporal logic. 30th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer ScienceFCOS, 164–169.","ieee":"R. Alur and T. A. Henzinger, “A really temporal logic,” in <i>30th Annual Symposium on Foundations of Computer Science</i>, Research Triangle Park, NC, USA, 1989, pp. 164–169.","mla":"Alur, Rajeev, and Thomas A. Henzinger. “A Really Temporal Logic.” <i>30th Annual Symposium on Foundations of Computer Science</i>, IEEE, 1989, pp. 164–69, doi:<a href=\"https://doi.org/10.1109/SFCS.1989.63473\">10.1109/SFCS.1989.63473</a>.","apa":"Alur, R., &#38; Henzinger, T. A. (1989). A really temporal logic. In <i>30th Annual Symposium on Foundations of Computer Science</i> (pp. 164–169). Research Triangle Park, NC, USA: IEEE. <a href=\"https://doi.org/10.1109/SFCS.1989.63473\">https://doi.org/10.1109/SFCS.1989.63473</a>","short":"R. Alur, T.A. Henzinger, in:, 30th Annual Symposium on Foundations of Computer Science, IEEE, 1989, pp. 164–169.","chicago":"Alur, Rajeev, and Thomas A Henzinger. “A Really Temporal Logic.” In <i>30th Annual Symposium on Foundations of Computer Science</i>, 164–69. FCOS. IEEE, 1989. <a href=\"https://doi.org/10.1109/SFCS.1989.63473\">https://doi.org/10.1109/SFCS.1989.63473</a>."},"quality_controlled":"1","date_created":"2018-12-11T12:09:40Z","oa_version":"None","article_processing_charge":"No","_id":"4596","type":"conference","publication":"30th Annual Symposium on Foundations of Computer Science","extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"IEEE","publist_id":"111","date_updated":"2022-02-09T10:40:13Z","abstract":[{"lang":"eng","text":"A real-time temporal logic for the specification of reactive systems is introduced. The novel feature of the logic, TPTL, is the adoption of temporal operators as quantifiers over time variables; every modality binds a variable to the time(s) it refers to. TPTL is demonstrated to be both a natural specification language and a suitable formalism for verification and synthesis. A tableau-based decision procedure and model-checking algorithm for TPTL are presented. Several generalizations of TPTL are shown to be highly undecidable."}],"date_published":"1989-01-01T00:00:00Z","month":"01","series_title":"FCOS","page":"164 - 169","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/63473"}]},{"citation":{"ama":"Kaneko T, Itoh K, Shigemoto R, Mizuno N. Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat. <i>Neuroscience</i>. 1989;32(1):79-98. doi:<a href=\"https://doi.org/10.1016/0306-4522(89)90109-7\">10.1016/0306-4522(89)90109-7</a>","mla":"Kaneko, Takeshi, et al. “Glutaminase-like Immunoreactivity in the Lower Brainstem and Cerebellum of the Adult Rat.” <i>Neuroscience</i>, vol. 32, no. 1, Elsevier, 1989, pp. 79–98, doi:<a href=\"https://doi.org/10.1016/0306-4522(89)90109-7\">10.1016/0306-4522(89)90109-7</a>.","ista":"Kaneko T, Itoh K, Shigemoto R, Mizuno N. 1989. Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat. Neuroscience. 32(1), 79–98.","ieee":"T. Kaneko, K. Itoh, R. Shigemoto, and N. Mizuno, “Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat,” <i>Neuroscience</i>, vol. 32, no. 1. Elsevier, pp. 79–98, 1989.","chicago":"Kaneko, Takeshi, Kazuo Itoh, Ryuichi Shigemoto, and Noboru Mizuno. “Glutaminase-like Immunoreactivity in the Lower Brainstem and Cerebellum of the Adult Rat.” <i>Neuroscience</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0306-4522(89)90109-7\">https://doi.org/10.1016/0306-4522(89)90109-7</a>.","short":"T. Kaneko, K. Itoh, R. Shigemoto, N. Mizuno, Neuroscience 32 (1989) 79–98.","apa":"Kaneko, T., Itoh, K., Shigemoto, R., &#38; Mizuno, N. (1989). Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat. <i>Neuroscience</i>. Elsevier. <a href=\"https://doi.org/10.1016/0306-4522(89)90109-7\">https://doi.org/10.1016/0306-4522(89)90109-7</a>"},"doi":"10.1016/0306-4522(89)90109-7","quality_controlled":"1","extern":"1","acknowledgement":"The authors wish to thank Mr. Akira Uesugi and Mr. Ken’ichi Uesugi for their photographic help. This work was partly supported by grants-in-aid from the Ministry of Education, science and Culture of Japan for Special Project Research 63112003. Special Research Project on Priority-Areas 63623505, Special Research 62480098 and Encouragement of Young Scientist 63770043. The support of the Niwa Medical Research Foundation, Dr. Satoru Fukuchi, Dr. Toshio Fukuda, Dr. Ritsu Hayashi, Dr. Yutaka Kitani, Dr. Hiroshi Matsushima, Dr. Gonpei Niwa, Dr. Hiroyasu Ohtsuka, Dr. Shigeo Tamaki, and Dr. Eizo Watanabe are gratefully acknowledged. ","year":"1989","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0306-4522"],"eissn":["1873-7544"]},"pmid":1,"intvolume":"        32","page":"79 - 98","external_id":{"pmid":["2586753"]},"abstract":[{"text":"Distribution of putative glutamatergic neurons in the lower brainstem and cerebellum of the rat was examined immunocytochemically by using a monoclonal antibody against phosphate-activated glutaminase, which has been proposed to be a major synthetic enzyme of transmitter glutamate and so may serve as a marker for glutamatergic neurons in the central nervous system. Intensely-immunolabeled neuronal cell bodies were densely distributed in the main precerebellar nuclei sending mossy fibers to the cerebellum; in the pontine nuclei, pontine tegmental reticular nucleus of Bechterew, external cuneate nucleus, and lateral reticular nucleus of the medulla oblongata. Phosphate-activated glutaminase-immunoreactive granular deposits were densely seen in the brachium pontis and restiform body, suggesting the immunolabeling of mossy fibers of passage. In the cerebellum, neuropil within the granule cell layer of the cerebellar cortex displayed intense phosphate-activated glutaminase-immunoreactivity, and that within the deep cerebellar nuclei showed moderate immunoreactivity. These results indicate that many mossy fiber terminals originate from phosphate-activated glutaminase-containing neurons and utilize phosphate-activated glutaminase for the synthesis of transmitter glutamate. Intensely-immunostained neuronal cell bodies were further observed in other regions which have been reported to contain neurons sending mossy fibers to the cerebellum; in the dorsal part of the principal sensory trigeminal nucleus, dorsomedial part of the oral subnucleus of the spinal trigeminal nucleus, interpolar subnucleus of the spinal trigeminal nucleus, paratrigeminal nucleus, supragenual nucleus, regions dorsal to the abducens nucleus and genu of the facial nerve, superior and medial vestibular nuclei, cell groups f, x and y, hypoglossal prepositus nucleus, intercalated nucleus, nucleus of Roller, reticular regions intercalated between the motor trigeminal and principal sensory trigeminal nuclei, linear nucleus, and gigantocellular and paramedian reticular formation. Neuronal cell bodies with intense phosphate-activated glutaminase-immunoreactivity were also found in other brainstem regions, such as the paracochlear glial substance, posterior ventral cochlear nucleus, and cell group e. Although it is still controversial whether all glutamatergic neurons use phosphate-activated glutaminase in a transmitter-related process and whether phosphate-activated glutaminase is involved in other metabolism-related processes, the neurons showing intense phosphate-activated glutaminase-immuno-reactivity in the present study were suggested to be putative glutamatergic neurons.","lang":"eng"}],"date_created":"2018-12-11T11:57:54Z","oa_version":"None","article_processing_charge":"No","_id":"2479","issue":"1","type":"journal_article","publication":"Neuroscience","author":[{"last_name":"Kaneko","first_name":"Takeshi","full_name":"Kaneko, Takeshi"},{"full_name":"Itoh, Kazuo","first_name":"Kazuo","last_name":"Itoh"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444"},{"full_name":"Mizuno, Noboru","first_name":"Noboru","last_name":"Mizuno"}],"day":"01","volume":32,"title":"Glutaminase-like immunoreactivity in the lower brainstem and cerebellum of the adult rat","status":"public","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0306452289901097?via%3Dihub"}],"scopus_import":"1","date_published":"1989-01-01T00:00:00Z","month":"01","article_type":"original","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Elsevier","publist_id":"4422","date_updated":"2022-02-15T09:47:08Z"},{"day":"25","status":"public","volume":264,"title":"Molecular characterization of a functional cDNA for rat substance P receptor","_id":"2525","article_processing_charge":"No","issue":"30","type":"journal_article","publication":"Journal of Biological Chemistry","oa_version":"Published Version","date_created":"2018-12-11T11:58:11Z","author":[{"full_name":"Yokota, Yoshifumi","first_name":"Yoshifumi","last_name":"Yokota"},{"full_name":"Sasai, Yoshiki","first_name":"Yoshiki","last_name":"Sasai"},{"full_name":"Tanaka, Kohichi","last_name":"Tanaka","first_name":"Kohichi"},{"first_name":"Tsutomu","last_name":"Fujiwara","full_name":"Fujiwara, Tsutomu"},{"full_name":"Tsuchida, Kunihiro","last_name":"Tsuchida","first_name":"Kunihiro"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi"},{"last_name":"Kakizuka","first_name":"Akira","full_name":"Kakizuka, Akira"},{"full_name":"Ohkubo, Hiroaki","last_name":"Ohkubo","first_name":"Hiroaki"},{"full_name":"Nakanishi, Shigetada","first_name":"Shigetada","last_name":"Nakanishi"}],"date_published":"1989-10-25T00:00:00Z","month":"10","article_type":"original","publisher":"American Society for Biochemistry and Molecular Biology","publist_id":"4374","date_updated":"2022-02-15T09:29:36Z","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","publication_identifier":{"issn":["0021-9258"],"eissn":["1083-351X"]},"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>","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>.","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.","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.","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.","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>.","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>"},"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":[{"lang":"eng","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."}],"external_id":{"pmid":["2478537"]},"page":"17649 - 17652"},{"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0006899389913462?via%3Dihub"}],"scopus_import":"1","month":"02","date_published":"1989-02-06T00:00:00Z","article_type":"original","publisher":"Elsevier","date_updated":"2022-02-15T09:14:43Z","publist_id":"4373","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","issue":"1","_id":"2526","type":"journal_article","article_processing_charge":"No","publication":"Brain Research","date_created":"2018-12-11T11:58:11Z","oa_version":"None","author":[{"full_name":"Ino, Tadashi","last_name":"Ino","first_name":"Tadashi"},{"full_name":"Itoh, Kazuo","first_name":"Kazuo","last_name":"Itoh"},{"full_name":"Kamiya, Hiroto","first_name":"Hiroto","last_name":"Kamiya"},{"full_name":"Kaneko, Takeshi","last_name":"Kaneko","first_name":"Takeshi"},{"last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444"},{"last_name":"Akiguchi","first_name":"Ichiro","full_name":"Akiguchi, Ichiro"},{"last_name":"Mizuno","first_name":"Noboru","full_name":"Mizuno, Noboru"}],"day":"06","status":"public","title":"Direct projections from Ammon's horn to the rostral raphe regions in the brainstem of the cat","volume":479,"external_id":{"pmid":["2466535 "]},"page":"157 - 161","abstract":[{"text":"When WGA-HRP (wheat germ agglutinin-horseradish peroxidase conjugate) or HRP was injected into the regions around the superior central and/or the dorsal raphe nuclei in the cat, cell bodies of a number of non-pyramidal neurons were labeled in Ammon's horn. Thus the existence of direct projections from non-pyramidal neurons in Ammon's horn to the rostral raphe regions in the brainstem was suggested in the cat.","lang":"eng"}],"extern":"1","citation":{"apa":"Ino, T., Itoh, K., Kamiya, H., Kaneko, T., Shigemoto, R., Akiguchi, I., &#38; Mizuno, N. (1989). Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat. <i>Brain Research</i>. Elsevier. <a href=\"https://doi.org/10.1016/0006-8993(89)91346-2\">https://doi.org/10.1016/0006-8993(89)91346-2</a>","chicago":"Ino, Tadashi, Kazuo Itoh, Hiroto Kamiya, Takeshi Kaneko, Ryuichi Shigemoto, Ichiro Akiguchi, and Noboru Mizuno. “Direct Projections from Ammon’s Horn to the Rostral Raphe Regions in the Brainstem of the Cat.” <i>Brain Research</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0006-8993(89)91346-2\">https://doi.org/10.1016/0006-8993(89)91346-2</a>.","short":"T. Ino, K. Itoh, H. Kamiya, T. Kaneko, R. Shigemoto, I. Akiguchi, N. Mizuno, Brain Research 479 (1989) 157–161.","ieee":"T. Ino <i>et al.</i>, “Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat,” <i>Brain Research</i>, vol. 479, no. 1. Elsevier, pp. 157–161, 1989.","ista":"Ino T, Itoh K, Kamiya H, Kaneko T, Shigemoto R, Akiguchi I, Mizuno N. 1989. Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat. Brain Research. 479(1), 157–161.","mla":"Ino, Tadashi, et al. “Direct Projections from Ammon’s Horn to the Rostral Raphe Regions in the Brainstem of the Cat.” <i>Brain Research</i>, vol. 479, no. 1, Elsevier, 1989, pp. 157–61, doi:<a href=\"https://doi.org/10.1016/0006-8993(89)91346-2\">10.1016/0006-8993(89)91346-2</a>.","ama":"Ino T, Itoh K, Kamiya H, et al. Direct projections from Ammon’s horn to the rostral raphe regions in the brainstem of the cat. <i>Brain Research</i>. 1989;479(1):157-161. doi:<a href=\"https://doi.org/10.1016/0006-8993(89)91346-2\">10.1016/0006-8993(89)91346-2</a>"},"doi":"10.1016/0006-8993(89)91346-2","quality_controlled":"1","acknowledgement":"The photographic help of Mr. Akira Uesugi, and the support of Niwa Medical Research Foundation are gratefully acknowledged. This work has been supported in part by Grant-in-Aid for Special Project Research (No. 63112003) and Grant-in-Aid for Scientific Research (No. 62480098) from the Ministry of Education, Science and Culture of Japan.","publication_identifier":{"issn":["0006-8993"],"eissn":["1872-6240"]},"language":[{"iso":"eng"}],"year":"1989","pmid":1,"intvolume":"       479"},{"main_file_link":[{"url":"https://www.jstage.jst.go.jp/article/nisshoshi1964/86/11/86_11_2627/_article/-char/ja/"}],"scopus_import":"1","page":"2627","date_published":"1989-11-01T00:00:00Z","month":"11","article_type":"original","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Japanese Society of Gastroenterology","date_updated":"2022-02-15T09:06:39Z","publist_id":"4372","doi":"10.11405/nisshoshi1964.86.2627","citation":{"ieee":"Akimoto M. <i>et al.</i>, “Effect of endothelin on gastric mucosal blood flow in rat,” <i>Japanese Journal of Gastroenterology</i>, vol. 86, no. 11. Japanese Society of Gastroenterology, p. 2627, 1989.","ista":"Akimoto M, Shigemoto R, Kawamura M, Yamagata H, Kurihara T, Takata S, Miwa Y, Akagami N, Katsu K, Yamauchi D. 1989. Effect of endothelin on gastric mucosal blood flow in rat. Japanese Journal of Gastroenterology. 86(11), 2627.","mla":"Akimoto Masumi, et al. “Effect of endothelin on gastric mucosal blood flow in rat.” <i>Japanese Journal of Gastroenterology</i>, vol. 86, no. 11, Japanese Society of Gastroenterology, 1989, p. 2627, doi:<a href=\"https://doi.org/10.11405/nisshoshi1964.86.2627\">10.11405/nisshoshi1964.86.2627</a>.","apa":"Akimoto M., Shigemoto R., Kawamura M., Yamagata H., Kurihara T., Takata S., … Yamauchi D. (1989). Effect of endothelin on gastric mucosal blood flow in rat. <i>Japanese Journal of Gastroenterology</i>. Japanese Society of Gastroenterology. <a href=\"https://doi.org/10.11405/nisshoshi1964.86.2627\">https://doi.org/10.11405/nisshoshi1964.86.2627</a>","short":"Akimoto M., Shigemoto R., Kawamura M., Yamagata H., Kurihara T., Takata S., Miwa Y., Akagami N., Katsu K., Yamauchi D., Japanese Journal of Gastroenterology 86 (1989) 2627.","chicago":"Akimoto Masumi, Shigemoto Ryuichi, Kawamura Makiko, Yamagata Hideharu, Kurihara Takeshi, Takata S, Miwa Yoko, Akagami N, Katsu Kenichi, and Yamauchi D. “Effect of endothelin on gastric mucosal blood flow in rat.” <i>Japanese Journal of Gastroenterology</i>. Japanese Society of Gastroenterology, 1989. <a href=\"https://doi.org/10.11405/nisshoshi1964.86.2627\">https://doi.org/10.11405/nisshoshi1964.86.2627</a>.","ama":"Akimoto M, Shigemoto R, Kawamura M, et al. Effect of endothelin on gastric mucosal blood flow in rat. <i>Japanese Journal of Gastroenterology</i>. 1989;86(11):2627. doi:<a href=\"https://doi.org/10.11405/nisshoshi1964.86.2627\">10.11405/nisshoshi1964.86.2627</a>"},"oa_version":"None","date_created":"2018-12-11T11:58:12Z","quality_controlled":"1","_id":"2527","issue":"11","article_processing_charge":"No","type":"journal_article","extern":"1","publication":"Japanese Journal of Gastroenterology","author":[{"first_name":"Masumi","last_name":"Akimoto","full_name":"Akimoto, Masumi"},{"last_name":"Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi"},{"last_name":"Kawamura","first_name":"Makiko","full_name":"Kawamura, Makiko"},{"full_name":"Yamagata, Hideharu","first_name":"Hideharu","last_name":"Yamagata"},{"full_name":"Kurihara, Takeshi","first_name":"Takeshi","last_name":"Kurihara"},{"full_name":"Takata, S","first_name":"S","last_name":"Takata"},{"first_name":"Yoko","last_name":"Miwa","full_name":"Miwa, Yoko"},{"full_name":"Akagami, N","first_name":"N","last_name":"Akagami"},{"first_name":"Kenichi","last_name":"Katsu","full_name":"Katsu, Kenichi"},{"full_name":"Yamauchi, D","first_name":"D","last_name":"Yamauchi"}],"year":"1989","day":"01","language":[{"iso":"jpn"}],"title":"Effect of endothelin on gastric mucosal blood flow in rat","volume":86,"intvolume":"        86","status":"public"},{"publication_status":"published","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","date_updated":"2022-02-09T13:40:17Z","publist_id":"5144","publisher":"Elsevier","article_type":"original","month":"01","date_published":"1988-01-01T00:00:00Z","page":"3351 - 3354","volume":52,"title":"Mathematical model of photosynthesis regulation accounts for the effects of changes in external conditions and observed oscillations","status":"public","intvolume":"        52","day":"01","year":"1988","language":[{"iso":"rus"}],"publication_identifier":{"issn":["1990-7931"],"eissn":["1990-7923"]},"author":[{"full_name":"Sazanov, Leonid A","orcid":"0000-0002-4561-241X","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A"},{"full_name":"Karavaev, V A","first_name":"V A","last_name":"Karavaev"},{"last_name":"Kukushkin","first_name":"A K","full_name":"Kukushkin, A K"}],"oa_version":"None","date_created":"2018-12-11T11:54:50Z","quality_controlled":"1","citation":{"mla":"Sazanov, Leonid A., et al. “Mathematical model of photosynthesis regulation accounts for the effects of changes in external conditions and observed oscillations.” <i>Russian Journal of Physical Chemistry B</i>, vol. 52, Elsevier, 1988, pp. 3351–54.","ieee":"L. A. Sazanov, V. A. Karavaev, and A. K. Kukushkin, “Mathematical model of photosynthesis regulation accounts for the effects of changes in external conditions and observed oscillations,” <i>Russian Journal of Physical Chemistry B</i>, vol. 52. Elsevier, pp. 3351–3354, 1988.","ista":"Sazanov LA, Karavaev VA, Kukushkin AK. 1988. Mathematical model of photosynthesis regulation accounts for the effects of changes in external conditions and observed oscillations. Russian Journal of Physical Chemistry B. 52, 3351–3354.","short":"L.A. Sazanov, V.A. Karavaev, A.K. Kukushkin, Russian Journal of Physical Chemistry B 52 (1988) 3351–3354.","chicago":"Sazanov, Leonid A, V A Karavaev, and A K Kukushkin. “Mathematical model of photosynthesis regulation accounts for the effects of changes in external conditions and observed oscillations.” <i>Russian Journal of Physical Chemistry B</i>. Elsevier, 1988.","apa":"Sazanov, L. A., Karavaev, V. A., &#38; Kukushkin, A. K. (1988). Mathematical model of photosynthesis regulation accounts for the effects of changes in external conditions and observed oscillations. <i>Russian Journal of Physical Chemistry B</i>. Elsevier.","ama":"Sazanov LA, Karavaev VA, Kukushkin AK. Mathematical model of photosynthesis regulation accounts for the effects of changes in external conditions and observed oscillations. <i>Russian Journal of Physical Chemistry B</i>. 1988;52:3351-3354."},"publication":"Russian Journal of Physical Chemistry B","extern":"1","type":"journal_article","_id":"1941","article_processing_charge":"No"},{"oa":1,"abstract":[{"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. ","lang":"eng"}],"page":"660 - 674","intvolume":"         5","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0737-4038"],"eissn":["1537-1719"]},"year":"1988","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. ","extern":"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>","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>","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>.","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.","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>."},"doi":"10.1093/oxfordjournals.molbev.a040528","quality_controlled":"1","publisher":"Oxford University Press","publist_id":"2728","date_updated":"2022-02-08T13:20:51Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","month":"07","date_published":"1988-07-01T00:00:00Z","article_type":"original","main_file_link":[{"open_access":"1","url":"https://academic.oup.com/mbe/article/5/6/660/1044340"}],"status":"public","title":"Interracial rDNA variation in the grasshopper Podisma Pedestris","volume":5,"day":"01","author":[{"first_name":"John","last_name":"Dallas","full_name":"Dallas, John"},{"last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"first_name":"Gabriel","last_name":"Dover","full_name":"Dover, Gabriel"}],"article_processing_charge":"No","_id":"3655","issue":"6","type":"journal_article","publication":"Molecular Biology and Evolution","date_created":"2018-12-11T12:04:28Z","oa_version":"None"},{"day":"01","volume":77,"title":"Minimum polygonal separation","status":"public","oa_version":"None","date_created":"2018-12-11T12:06:53Z","publication":"Information and Computation","type":"journal_article","_id":"4090","article_processing_charge":"No","issue":"3","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"first_name":"Franco","last_name":"Preparata","full_name":"Preparata, Franco"}],"article_type":"original","date_published":"1988-06-01T00:00:00Z","month":"06","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-08T10:36:30Z","publist_id":"2029","publisher":"Elsevier","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/0890540188900491?via%3Dihub"}],"scopus_import":"1","year":"1988","publication_identifier":{"eissn":["0890-5401"]},"language":[{"iso":"eng"}],"intvolume":"        77","quality_controlled":"1","doi":"10.1016/0890-5401(88)90049-1","citation":{"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>","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>.","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>","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>.","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."},"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.","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."}],"oa":1,"page":"218 - 232"},{"title":"Probing convex polygons with X-Rays","volume":17,"status":"public","day":"01","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"first_name":"Steven","last_name":"Skiena","full_name":"Skiena, Steven"}],"oa_version":"None","date_created":"2018-12-11T12:06:53Z","publication":"SIAM Journal on Computing","_id":"4091","type":"journal_article","issue":"5","article_processing_charge":"No","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-08T11:14:23Z","publist_id":"2030","publisher":"SIAM","article_type":"original","month":"01","date_published":"1988-01-01T00:00:00Z","scopus_import":"1","main_file_link":[{"url":"https://epubs.siam.org/doi/10.1137/0217054"}],"intvolume":"        17","year":"1988","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"language":[{"iso":"eng"}],"acknowledgement":"The research of this author was supported by the Amoco Foundation Facility for the Development of Computer Science 1-6-44862.","quality_controlled":"1","citation":{"chicago":"Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.” <i>SIAM Journal on Computing</i>. SIAM, 1988. <a href=\"https://doi.org/10.1137/0217054 \">https://doi.org/10.1137/0217054 </a>.","short":"H. Edelsbrunner, S. Skiena, SIAM Journal on Computing 17 (1988) 870–882.","apa":"Edelsbrunner, H., &#38; Skiena, S. (1988). Probing convex polygons with X-Rays. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0217054 \">https://doi.org/10.1137/0217054 </a>","mla":"Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.” <i>SIAM Journal on Computing</i>, vol. 17, no. 5, SIAM, 1988, pp. 870–82, doi:<a href=\"https://doi.org/10.1137/0217054 \">10.1137/0217054 </a>.","ista":"Edelsbrunner H, Skiena S. 1988. Probing convex polygons with X-Rays. SIAM Journal on Computing. 17(5), 870–882.","ieee":"H. Edelsbrunner and S. Skiena, “Probing convex polygons with X-Rays,” <i>SIAM Journal on Computing</i>, vol. 17, no. 5. SIAM, pp. 870–882, 1988.","ama":"Edelsbrunner H, Skiena S. Probing convex polygons with X-Rays. <i>SIAM Journal on Computing</i>. 1988;17(5):870-882. doi:<a href=\"https://doi.org/10.1137/0217054 \">10.1137/0217054 </a>"},"doi":"10.1137/0217054 ","extern":"1","abstract":[{"lang":"eng","text":"An X-ray probe through a polygon measures the length of intersection between a line and the polygon. This paper considers the properties of various classes of X-ray probes, and shows how they interact to give finite strategies for completely describing convex n-gons. It is shown that (3n/2)+6 probes are sufficient to verify a specified n-gon, while for determining convex polygons (3n-1)/2 X-ray probes are necesssary and 5n+O(1) sufficient, with 3n+O(1) sufficient given that a lower bound on the size of the smallest edge of P is known."}],"page":"870 - 882"},{"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-19488-6_117"}],"date_published":"1988-01-01T00:00:00Z","month":"01","date_updated":"2022-02-08T09:53:52Z","publist_id":"2027","publisher":"Springer","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"15th International Colloquium on Automata, Languages and Programming","article_processing_charge":"No","_id":"4096","type":"conference","oa_version":"None","date_created":"2018-12-11T12:06:55Z","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"}],"day":"01","status":"public","title":"Geometric structures in computational geometry","volume":317,"alternative_title":["LNCS"],"page":"201 - 213","extern":"1","quality_controlled":"1","citation":{"mla":"Edelsbrunner, Herbert. “Geometric Structures in Computational Geometry.” <i>15th International Colloquium on Automata, Languages and Programming</i>, vol. 317, Springer, 1988, pp. 201–13, doi:<a href=\"https://doi.org/10.1007/3-540-19488-6_117\">10.1007/3-540-19488-6_117</a>.","ieee":"H. Edelsbrunner, “Geometric structures in computational geometry,” in <i>15th International Colloquium on Automata, Languages and Programming</i>, Tampere, Finland, 1988, vol. 317, pp. 201–213.","ista":"Edelsbrunner H. 1988. Geometric structures in computational geometry. 15th International Colloquium on Automata, Languages and Programming. ALP: Automata, Languages and Programming, LNCS, vol. 317, 201–213.","chicago":"Edelsbrunner, Herbert. “Geometric Structures in Computational Geometry.” In <i>15th International Colloquium on Automata, Languages and Programming</i>, 317:201–13. Springer, 1988. <a href=\"https://doi.org/10.1007/3-540-19488-6_117\">https://doi.org/10.1007/3-540-19488-6_117</a>.","short":"H. Edelsbrunner, in:, 15th International Colloquium on Automata, Languages and Programming, Springer, 1988, pp. 201–213.","apa":"Edelsbrunner, H. (1988). Geometric structures in computational geometry. In <i>15th International Colloquium on Automata, Languages and Programming</i> (Vol. 317, pp. 201–213). Tampere, Finland: Springer. <a href=\"https://doi.org/10.1007/3-540-19488-6_117\">https://doi.org/10.1007/3-540-19488-6_117</a>","ama":"Edelsbrunner H. Geometric structures in computational geometry. In: <i>15th International Colloquium on Automata, Languages and Programming</i>. Vol 317. Springer; 1988:201-213. doi:<a href=\"https://doi.org/10.1007/3-540-19488-6_117\">10.1007/3-540-19488-6_117</a>"},"doi":"10.1007/3-540-19488-6_117","acknowledgement":"Research on this paper was supported by the National Science Foundation under grant CCR-8714565.","conference":{"location":"Tampere, Finland","start_date":"1988-07-11","end_date":"1988-07-15","name":"ALP: Automata, Languages and Programming"},"publication_identifier":{"isbn":["978-3-540-19488-0"],"eisbn":["978-3-540-39291-0"]},"language":[{"iso":"eng"}],"year":"1988","intvolume":"       317"},{"alternative_title":["LNCS"],"page":"214 - 229","abstract":[{"text":"Arrangements of curves in the plane are of fundamental significance in many problems of computational and combinatorial geometry (e.g. motion planning, algebraic cell decomposition, etc.). In this paper we study various topological and combinatorial properties of such arrangements under some mild assumptions on the shape of the curves, and develop basic tools for the construction, manipulation, and analysis of these arrangements. Our main results include a generalization of the zone theorem of [EOS], [CGL] to arrangements of curves (in which we show that the combinatorial complexity of the zone of a curve is nearly linear in the number of curves), and an application of (some weaker variant of) that theorem to obtain a nearly quadratic incremental algorithm for the construction of such arrangements.","lang":"eng"}],"keyword":["line segment","computational geometry","Jordan curve","cell decomposition","vertical tangency"],"extern":"1","citation":{"ama":"Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. Arrangements of curves in the plane - topology, combinatorics, and algorithms. In: <i>15th International Colloquium on Automata, Languages and Programming</i>. Vol 317. Springer; 1988:214-229. doi:<a href=\"https://doi.org/10.1007/3-540-19488-6_118\">10.1007/3-540-19488-6_118</a>","apa":"Edelsbrunner, H., Guibas, L., Pach, J., Pollack, R., Seidel, R., &#38; Sharir, M. (1988). Arrangements of curves in the plane - topology, combinatorics, and algorithms. In <i>15th International Colloquium on Automata, Languages and Programming</i> (Vol. 317, pp. 214–229). Tampere, Finland: Springer. <a href=\"https://doi.org/10.1007/3-540-19488-6_118\">https://doi.org/10.1007/3-540-19488-6_118</a>","short":"H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir, in:, 15th International Colloquium on Automata, Languages and Programming, Springer, 1988, pp. 214–229.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” In <i>15th International Colloquium on Automata, Languages and Programming</i>, 317:214–29. Springer, 1988. <a href=\"https://doi.org/10.1007/3-540-19488-6_118\">https://doi.org/10.1007/3-540-19488-6_118</a>.","ieee":"H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir, “Arrangements of curves in the plane - topology, combinatorics, and algorithms,” in <i>15th International Colloquium on Automata, Languages and Programming</i>, Tampere, Finland, 1988, vol. 317, pp. 214–229.","ista":"Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1988. Arrangements of curves in the plane - topology, combinatorics, and algorithms. 15th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 317, 214–229.","mla":"Edelsbrunner, Herbert, et al. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” <i>15th International Colloquium on Automata, Languages and Programming</i>, vol. 317, Springer, 1988, pp. 214–29, doi:<a href=\"https://doi.org/10.1007/3-540-19488-6_118\">10.1007/3-540-19488-6_118</a>."},"doi":"10.1007/3-540-19488-6_118","quality_controlled":"1","conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"1988-07-11","end_date":"1988-07-15","location":"Tampere, Finland"},"acknowledgement":"Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by the National Science Foundation under grant CCR-8714566. Work on this paper by the third and sixth authors has been supported by Office of Naval Research Grant N00014-82-K-0381, by National Science Foundation Grant No. NSF-DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation. Work by the sixth author has also been supported by a research grant from the NCRD — the Israeli National Council for Research and Development. Work by the fourth author has been supported by National Science Foundation Grant DMS-8501947.","publication_identifier":{"isbn":["978-3-540-19488-0"]},"language":[{"iso":"eng"}],"year":"1988","intvolume":"       317","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-19488-6_118"}],"scopus_import":"1","date_published":"1988-01-01T00:00:00Z","month":"01","publisher":"Springer","date_updated":"2022-02-08T10:15:09Z","publist_id":"2028","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","article_processing_charge":"No","_id":"4097","type":"conference","publication":"15th International Colloquium on Automata, Languages and Programming","oa_version":"None","date_created":"2018-12-11T12:06:55Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Guibas, Leonidas","last_name":"Guibas","first_name":"Leonidas"},{"full_name":"Pach, János","first_name":"János","last_name":"Pach"},{"first_name":"Richard","last_name":"Pollack","full_name":"Pollack, Richard"},{"full_name":"Seidel, Raimund","first_name":"Raimund","last_name":"Seidel"},{"full_name":"Sharir, Micha","last_name":"Sharir","first_name":"Micha"}],"day":"01","status":"public","title":"Arrangements of curves in the plane - topology, combinatorics, and algorithms","volume":317}]