@article{4312,
  author       = {Barton, Nicholas H and Turelli, Michael},
  issn         = {1545-2948},
  journal      = {Annual Review of Genetics},
  pages        = {337 -- 370},
  publisher    = {Annual Reviews},
  title        = {{Evolutionary quantitative genetics: how little do we know?}},
  doi          = {10.1146/annurev.ge.23.120189.002005},
  volume       = {23},
  year         = {1989},
}

@inbook{4313,
  author       = {Barton, Nicholas H},
  booktitle    = {Speciation and its consequences},
  editor       = {Otte, Daniel and Endler, John},
  isbn         = {‎ 978-0878936571},
  publisher    = {Sinauer Press},
  title        = {{Founder effect speciation}},
  year         = {1989},
}

@article{4314,
  abstract     = {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.},
  author       = {Barton, Nicholas H},
  issn         = {1469-5073},
  journal      = {Genetical Research},
  number       = {1},
  pages        = {59 -- 78},
  publisher    = {Cambridge University Press},
  title        = {{The divergence of a polygenic system under stabilising selection, mutation and drift}},
  doi          = {10.1017/S0016672300028378},
  volume       = {54},
  year         = {1989},
}

@article{1941,
  author       = {Sazanov, Leonid A and Karavaev, V A and Kukushkin, A K},
  issn         = {1990-7923},
  journal      = {Russian Journal of Physical Chemistry B},
  pages        = {3351 -- 3354},
  publisher    = {Elsevier},
  title        = {{Mathematical model of photosynthesis regulation accounts for the effects of changes in external conditions and observed oscillations}},
  volume       = {52},
  year         = {1988},
}

@article{2522,
  abstract     = {Non-pyramidal neurons in cat Ammon's horn were shown to send their axons to the supramammillary regions (SMR), i.e. the supramammillary nucleus and its vicinities including the supramammillary nucleus and the lateral, posterior and dorsal hypothalamic areas: wheat germ agglutinin-horseradish peroxidase (WGA-HRP) injection into Ammon's horn resulted in labeling of presumed axon terminals in the SMR; and after injecting HRP into the SMR, retrogradely labeled non-pyramidal neurons were seen in Ammon's horn.},
  author       = {Ino, Tadashi and Itoh, Kazuo and Kamiya, Hiroto and Shigemoto, Ryuichi and Akiguchi, Ichiro and Mizuno, Noboru},
  issn         = {1872-6240},
  journal      = {Brain Research},
  number       = {1},
  pages        = {173 -- 177},
  publisher    = {Elsevier},
  title        = {{Direct projections of non-pyramidal neurons of Ammon's horn to the supramammillary region in the cat}},
  doi          = {10.1016/0006-8993(88)91219-X},
  volume       = {460},
  year         = {1988},
}

@article{2523,
  abstract     = {Injection of large amounts of a mixture of horseradish peroxidase and wheat germ agglutinin-horseradish peroxidase conjugate into the upper cervical segments of the spinal cord in the Japanese monkey (Macaca fuscata) led to the retrograde labeling of a small number of neuronal cell bodies within the rostral part of the subthalamic nucleus of Luys. Direct projection from the subthalamic nucleus to the spinal cord appeared to be much less prominent in the Japanese monkey than in the cat and rat.},
  author       = {Mizuno, Noboru and Ueyama, Teizo and Itoh, Kazuo and Satoda, Takahiro and Tashiro, Takashi and Shigemoto, Ryuichi},
  issn         = {1872-7972},
  journal      = {Neuroscience Letters},
  number       = {1},
  pages        = {13 -- 18},
  publisher    = {Elsevier},
  title        = {{Direct projections from the subthalamic nucleus of Luys to the spinal cord in the Japanese monkey}},
  doi          = {10.1016/0304-3940(88)90473-9},
  volume       = {89},
  year         = {1988},
}

@article{2524,
  abstract     = {Alpha-ketoglutamate (α-KG) reductive amination activity in rat brain was found to be mostly absorbed with an antibody against liver glutamate dehydrogenase. With this and anti-glutamine synthetase antibodies, α-KG reductive amination activity was immunocytochemically shown to coexist with glutamine synthetase activity in astrocytes. The results suggest that astrocytes de novo synthesize glutamate from α-KG and ammonia, and metabolize it to glutamine.},
  author       = {Kaneko, Takeshi and Shigemoto, Ryuichi and Mizuno, Noboru},
  issn         = {1872-6240},
  journal      = {Brain Research},
  number       = {1},
  pages        = {160 -- 164},
  publisher    = {Elsevier},
  title        = {{Metabolism of glutamate and ammonia in astrocyte an immunocytochemical study}},
  doi          = {10.1016/0006-8993(88)90069-8},
  volume       = {457},
  year         = {1988},
}

@article{3655,
  abstract     = {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 
divergence may contribute to hybrid inviability. },
  author       = {Dallas, John and Barton, Nicholas H and Dover, Gabriel},
  issn         = {1537-1719},
  journal      = {Molecular Biology and Evolution},
  number       = {6},
  pages        = {660 -- 674},
  publisher    = {Oxford University Press},
  title        = {{Interracial rDNA variation in the grasshopper Podisma Pedestris}},
  doi          = {10.1093/oxfordjournals.molbev.a040528},
  volume       = {5},
  year         = {1988},
}

@article{4090,
  abstract     = {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.},
  author       = {Edelsbrunner, Herbert and Preparata, Franco},
  issn         = {0890-5401},
  journal      = {Information and Computation},
  number       = {3},
  pages        = {218 -- 232},
  publisher    = {Elsevier},
  title        = {{Minimum polygonal separation}},
  doi          = {10.1016/0890-5401(88)90049-1},
  volume       = {77},
  year         = {1988},
}

@article{4091,
  abstract     = {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.},
  author       = {Edelsbrunner, Herbert and Skiena, Steven},
  issn         = {1095-7111},
  journal      = {SIAM Journal on Computing},
  number       = {5},
  pages        = {870 -- 882},
  publisher    = {SIAM},
  title        = {{Probing convex polygons with X-Rays}},
  doi          = {10.1137/0217054 },
  volume       = {17},
  year         = {1988},
}

@inproceedings{4096,
  author       = {Edelsbrunner, Herbert},
  booktitle    = {15th International Colloquium on Automata, Languages and Programming},
  isbn         = {978-3-540-19488-0},
  location     = {Tampere, Finland},
  pages        = {201 -- 213},
  publisher    = {Springer},
  title        = {{Geometric structures in computational geometry}},
  doi          = {10.1007/3-540-19488-6_117},
  volume       = {317},
  year         = {1988},
}

@inproceedings{4097,
  abstract     = {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.},
  author       = {Edelsbrunner, Herbert and Guibas, Leonidas and Pach, János and Pollack, Richard and Seidel, Raimund and Sharir, Micha},
  booktitle    = {15th International Colloquium on Automata, Languages and Programming},
  isbn         = {978-3-540-19488-0},
  keywords     = {line segment, computational geometry, Jordan curve, cell decomposition, vertical tangency},
  location     = {Tampere, Finland},
  pages        = {214 -- 229},
  publisher    = {Springer},
  title        = {{Arrangements of curves in the plane - topology, combinatorics, and algorithms}},
  doi          = {10.1007/3-540-19488-6_118},
  volume       = {317},
  year         = {1988},
}

@misc{4315,
  author       = {Coyne, Jerry and Barton, Nicholas H},
  booktitle    = {Nature},
  issn         = {1476-4687},
  pages        = {485 -- 486},
  publisher    = {Nature Publishing Group},
  title        = {{What do we know about speciation?}},
  doi          = {10.1038/331485a0},
  volume       = {331},
  year         = {1988},
}

@misc{4316,
  author       = {Barton, Nicholas H and Jones, Steve},
  booktitle    = {Nature},
  issn         = {1476-4687},
  pages        = {597 -- 597},
  publisher    = {Springer Nature},
  title        = {{Molecular evolutionary genetics}},
  doi          = {10.1038/332597a0},
  volume       = {332},
  year         = {1988},
}

@inbook{4317,
  author       = {Barton, Nicholas H},
  booktitle    = {Analytical biogeography: An integrated approach to the study of animal and plant distributions},
  editor       = {Myers, Alan and Giller, Paul},
  isbn         = {978-0-412-40050-6},
  issn         = {978-94-009-0435-4},
  keywords     = {biogeography, biology, complexity, distribution, evolution, geology},
  pages        = {185 -- 218},
  publisher    = {Springer},
  title        = {{Speciation}},
  doi          = {10.1007/978-94-009-0435-4},
  year         = {1988},
}

@misc{4318,
  author       = {Barton, Nicholas H and Jones, Steve and Mallet, James},
  booktitle    = {Nature},
  issn         = {1476-4687},
  pages        = {13 -- 14},
  publisher    = {Springer Nature},
  title        = {{No barriers to speciation}},
  doi          = {10.1038/336013a0},
  volume       = {336},
  year         = {1988},
}

@article{2521,
  author       = {Nishimura, Masaki and Shigemoto, Ryuichi and Matsubayashi, K and Mimori, Y and Kameyama, Masakuni},
  journal      = {Clinical Neurology},
  number       = {11},
  pages        = {1441 -- 1444},
  publisher    = {Societas Neurologica Japonica},
  title        = {{Meningoencephalitis during the pre-icteric phase of hepatitis A - a case report}},
  volume       = {27},
  year         = {1987},
}

@inproceedings{3514,
  abstract     = {We consider the problem of obtaining sharp (nearly quadratic) bounds for the combinatorial complexity of the lower envelope (i.e. pointwise minimum) of a collection of n bivariate (or generally multi-variate) continuous and &quot;simple&quot; functions, and of designing efficient algorithms for the calculation of this envelope. This problem generalizes the well-studied univariate case (whose analysis is based on the theory of Davenport-Schinzel sequences), but appears to be much more difficult and still largely unsolved. It is a central problem that arises in many areas in computational and combinatorial geometry, and has numerous applications including generalized planar Voronoi diagrams, hidden surface elimination for intersecting surfaces, purely translational motion planning, finding common transversals of polyhedra, and more. In this abstract we provide several partial solutions and generalizations of this problem, and apply them to the problems mentioned above. The most significant of our results is that the lower envelope of n triangles in three dimensions has combinatorial complexity at most O(n2α(n)) (where α(n) is the extremely slowly growing inverse of Ackermann's function), that this bound is tight in the worst case, and that this envelope can be calculated in time O(n2α(n)).},
  author       = {Edelsbrunner, Herbert and Pach, János and Schwartz, Jacob and Sharir, Micha},
  booktitle    = {28th Annual Symposium on Foundations of Computer Science },
  isbn         = {0-8186-0807-2},
  issn         = {0272-5428},
  location     = {Los Angeles, CA, USA},
  pages        = {27 -- 37},
  publisher    = {IEEE},
  title        = {{On the lower envelope of bivariate functions and its applications}},
  doi          = {10.1109/SFCS.1987.44},
  year         = {1987},
}

@article{3656,
  abstract     = {We have analysed the role of sampling drift in inducing shifts between alternative adaptive peaks, in small and rapidly growing populations. Using a simple model of disruptive selection on a polygenic character, we calculate the net probabilityofapeakshift. If the growth rate is high, theprobabilityofashiftina growing population is insensitive to selection on the character. Assuming that the character is effectively neutral during the brief initial increase, we find that theprobabilityofapeakshift is given by theprobabilityof finding a standard normal variate greater than √2ΔV where ΔV is the reduction in additive genetic variance during the growth period. This result holds for arbitrary pattern of increase in size, provided that the rate of increase is high enough for selection to be negligible, and the character depends on a large number of loci. Comparing theprobabilityofpeakshiftsin founding populations with the rate ofshiftsin static and allopatric populations it appears that although strongly selected shifts are only likely to occur ina growing population, a static population is a more congenial setting for adaptive shifts.},
  author       = {Rouhani, Shahin and Barton, Nicholas H},
  issn         = {1095-8541},
  journal      = {Journal of Theoretical Biology},
  number       = {1},
  pages        = {51 -- 62},
  publisher    = {Elsevier},
  title        = {{The probability of peak shifts in a founder population}},
  doi          = {10.1016/S0022-5193(87)80100-5},
  volume       = {126},
  year         = {1987},
}

@article{3657,
  abstract     = {Shifts between adaptive peaks, caused by sampling drift, are involved in both speciation and adaptation via Wright's “shiftingbalance.” We use techniques from statistical mechanics to calculate the rate of such transitions for apopulation in a single panmictic deme and for apopulation which is continuously distributed over one- and two-dimensional regions. This calculation applies in the limit where transitions are rare. Our results indicate that stochastic divergence is feasible despite free gene flow, provided that neighbourhood size is low enough. In two dimensions, the rate of transition depends primarily on neighbourhood size N and only weakly on selection pressure (≈sk exp(− cN)), where k is a number determined by the local population structure, in contrast with the exponential dependence on selection pressure in one dimension (≈exp(− cN √s)) or in a single deme (≈exp(− cNs)). Our calculations agree with simulations of a single deme and a one-dimensional population.},
  author       = {Rouhani, Shahin and Barton, Nicholas H},
  issn         = {1096-0325},
  journal      = {Theoretical Population Biology},
  number       = {3},
  pages        = {465 -- 492},
  publisher    = {Elsevier},
  title        = {{Speciation and the &quot;shifting balance&quot; in a continuous population}},
  doi          = {10.1016/0040-5809(87)90016-5},
  volume       = {31},
  year         = {1987},
}

