@article{2533,
abstract = {A cDNA clone for a new metabotropic glutamate receptor, mGluR5, was isolated through polymerase chain reaction-mediated DNA amplification by using primer sequences conserved among the metabotropic glutamate receptor (mGluR) family and by the subsequent screening of a rat brain cDNA library. The cloned receptor consists of 1171 amino acid residues and exhibits a structural architecture common to the mGluR family, possessing a large extracellular domain preceding the seven putative membrane-spanning segments. mGluR5 shows the highest sequence similarity to mGluR1 among the mGluR members and is coupled to the stimulation of phosphatidylinositol hydrolysis/ Ca2+ signal transduction in Chinese hamster ovary cells transfected with the cloned cDNA. This receptor also resembles mGluR1 in its agonist selectivity and antagonist responses; the potency rank order of agonists for mGluR5 was determined to be quisqualate > L-glutamate ≥ ibotenate > trans-1-aminocyclopentane-1,3-dicarboxylate. Blot and in situ hybridization analyses indicated that mGluR5 mRNA is widely distributed in neuronal cells of the central nervous system and is expressed differently from mGluR1 mRNA in many brain regions. This investigation thus demonstrates that there is an additional mGluR subtype which closely resembles mGluR1 in its signal transduction and pharmacological properties and is expressed in specialized neuronal cells in the central nervous system.},
author = {Abe, Takaaki and Sugihara, Hidemitsu and Nawa, Hiroyuki and Ryuichi Shigemoto and Mizuno, Noboru and Nakanishi, Shigetada},
journal = {Journal of Biological Chemistry},
number = {19},
pages = {13361 -- 13368},
publisher = {American Society for Biochemistry and Molecular Biology},
title = {{Molecular characterization of a novel metabotropic glutamate receptor mGluR5 coupled to inositol phosphate/Ca2+ signal transduction}},
volume = {267},
year = {1992},
}
@article{2534,
abstract = {Vasoactive intestinal polypeptide (VIP), a 28 amino acid peptide hormone, plays many physiological roles in the peripheral and central nerve systems. A functional cDNA clone of the VIP receptor was isolated from a rat lung cDNA library by cross-hybridization with the secretin receptor cDNA. VIP bound the cloned VIP receptor expressed in mouse COP cells and stimulated adenylate cyclase through the cloned receptor. The rat VIP receptor consists of 459 amino acids with a calculated Mr of 52,054 and contains seven transmembrane segments. It is structurally related to the secretin, calcitonin, and parathyroid hormone receptors, suggesting that they constitute a new subfamily of the G5 protein - coupled receptors. VIP receptor mRNA was detected in various rat tissues including liver, lung, intestines, and brain. In situ hybridization revealed that VIP receptor mRNA is widely distributed in neuronal cells of the adult rat brain, with a relatively high expression in the cerebral cortex and hippocampus.},
author = {Ishihara, Takeshi and Ryuichi Shigemoto and Mori, Kensaku and Takahashi, Kenji and Nagata, Shigekazu},
journal = {Neuron},
number = {4},
pages = {811 -- 819},
publisher = {Elsevier},
title = {{Functional expression and tissue distribution of a novel receptor for vasoactive intestinal polypeptide}},
doi = {10.1016/0896-6273(92)90101-I},
volume = {8},
year = {1992},
}
@article{2535,
abstract = {We report the molecular characterization of two novel rat helix-loop-helix (HLH) proteins, designated HES-1 and HES-3, that show structural homology to the Drosophila hairy and Enhancer of split [E(spl)] proteins, both of which are required for normal neurogenesis. HES-1 mRNA, expressed in various tissues of both embryos and adults, is present at a high level in the epithelial cells, including the embryonal neuroepithelial cells, as well as in the mesoderm-derived tissues such as the embryonal muscle. In contrast, HES-3 mRNA is produced exclusively in cerebellar Purkinje cells. HES-1 represses transcription by binding to the N box, which is a recognition sequence of E(spl) proteins. Interestingly, neither HES-1 nor HES-3 alone interacts efficiently with the E box, but each protein decreases the transcription induced by E-box-binding HLH activators such as E47. Furthermore, HES-1 also inhibits the functions of MyoD and MASH1 and effectively diminishes the myogenic conversion of C3H10T1/2 cells induced by MyoD. These results suggest that HES-1 may play an important role in mammalian development by negatively acting on the two different sequences while HES-3 acts as a repressor in a specific type of neurons.},
author = {Sasai, Yoshiki and Kageyama, Ryoichiro and Tagawa, Yoshiaki and Ryuichi Shigemoto and Nakanishi, Shigetada},
journal = {Genes and Development},
number = {12 B},
pages = {2620 -- 2634},
publisher = {Cold Spring Harbor Laboratory Press},
title = {{Two mammalian helix-loop-helix factors structurally related to Drosophila hairy and Enhancer of split}},
doi = {10.1101/gad.6.12b.2620},
volume = {6},
year = {1992},
}
@article{2714,
author = {László Erdös},
journal = {Acta Mathematica Hungarica},
number = {1-2},
pages = {11 -- 24},
publisher = {Springer},
title = {{On some problems of P. Turán concerning power sums of complex numbers}},
doi = {10.1007/BF00052086},
volume = {59},
year = {1992},
}
@article{2722,
abstract = {A version of the one-dimensional Rayleigh gas is considered: a point particle of mass M (molecule), confined to the unit interval [0,1], is surrounded by an infinite ideal gas of point particles of mass 1 (atoms). The molecule interacts with the atoms and with the walls via elastic collision. Central limit theorems are proved for a wide class of additive functionals of this system (e.g. the number of collisions with the walls and the total length of the molecular path).},
author = {László Erdös and Tuyen, Dao Quang},
journal = {Communications in Mathematical Physics},
number = {3},
pages = {451 -- 466},
publisher = {Springer},
title = {{Central limit theorems for the one-dimensional Rayleigh gas with semipermeable barriers}},
doi = {10.1007/BF02099260},
volume = {143},
year = {1992},
}
@article{1945,
abstract = {The effects of ultra-low (10(-18)-10(-14) M) doses (ULD) of biologically active substances have been reviewed in terms of common regularities of ULD effects and peculiarities of action of various groups of compounds. The most common and at the same time paradoxical regularities of ULD action are bi- or polymodal patterns of dose dependence, absence or presence of an inverse effect at higher doses, and instability of ULD effect. Possible mechanisms of ULD action including the mechanism based on the adaptation theory are discussed.},
author = {Leonid Sazanov and Zaǐtsev, Sergei V},
journal = {Biokhimiya},
number = {10},
pages = {1443 -- 1460},
publisher = {Izdatel'stvo Nauka},
title = {{Effect of superlow doses (10(-18)-10-(-14) M) of biologically active substances: general rules, features, and possible mechanisms}},
volume = {57},
year = {1992},
}
@article{4043,
abstract = {It is shown that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). The algorithm is fairly easy to implement and is based on the edge-insertion scheme that iteratively improves an arbitrary initial triangulation. It can be extended to the case where edges are prescribed, and, within the same time- and space-bounds, it can lexicographically minimize the sorted angle vector if the point set is in general position. Experimental results on the efficiency of the algorithm and the quality of the triangulations obtained are included.},
author = {Herbert Edelsbrunner and Tan, Tiow Seng and Waupotitsch, Roman},
journal = {SIAM Journal on Scientific Computing},
number = {4},
pages = {994 -- 1008},
publisher = {Society for Industrial and Applied Mathematics },
title = {{An O(n^2 log n) time algorithm for the MinMax angle triangulation}},
doi = {10.1137/0913058},
volume = {13},
year = {1992},
}
@article{4046,
abstract = {The main contribution of this work is an O(n log n + k)-time algorithm for computing all k intersections among n line segments in the plane. This time complexity is easily shown to be optimal. Within the same asymptotic cost, our algorithm can also construct the subdivision of the plane defined by the segments and compute which segment (if any) lies right above (or below) each intersection and each endpoint. The algorithm has been implemented and performs very well. The storage requirement is on the order of n + k in the worst case, but it is considerably lower in practice. To analyze the complexity of the algorithm, an amortization argument based on a new combinatorial theorem on line arrangements is used.},
author = {Chazelle, Bernard and Herbert Edelsbrunner},
journal = {Journal of the ACM},
number = {1},
pages = {1 -- 54},
publisher = {ACM},
title = {{An optimal algorithm for intersecting line segments in the plane}},
doi = {10.1145/147508.147511},
volume = {39},
year = {1992},
}
@article{4047,
abstract = {Arrangements of curves in the plane are fundamental to many problems in 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 Edelsbrunner (1986) and Chazelle (1985) 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 that theorem to obtain a nearly quadratic incremental algorithm for the construction of such arrangements.},
author = {Herbert Edelsbrunner and Guibas, Leonidas and Pach, János and Pollack, Richard and Seidel, Raimund and Sharir, Micha},
journal = {Theoretical Computer Science},
number = {2},
pages = {319 -- 336},
publisher = {Elsevier},
title = {{Arrangements of curves in the plane - topology, combinatorics, and algorithms}},
doi = {10.1016/0304-3975(92)90319-B},
volume = {92},
year = {1992},
}
@article{4048,
abstract = {Given a sequence of n points that form the vertices of a simple polygon, we show that determining a closest pair requires OMEGA(n log n) time in the algebraic decision tree model. Together with the well-known O(n log n) upper bound for finding a closest pair, this settles an open problem of Lee and Preparata. We also extend this O(n log n) upper bound to the following problem: Given a collection of sets with a total of n points in the plane, find for each point a closest neighbor that does not belong to the same set.},
author = {Aggarwal, Alok and Herbert Edelsbrunner and Raghavan, Prabhakar and Tiwari, Prasoon},
journal = {Information Processing Letters},
number = {1},
pages = {55 -- 60},
publisher = {Elsevier},
title = {{Optimal time bounds for some proximity problems in the plane}},
doi = {10.1016/0020-0190(92)90133-G},
volume = {42},
year = {1992},
}
@inproceedings{4049,
abstract = {The edge-insertion paradigm improves a triangulation of a finite point set in R2
iteratively by adding a new edge, deleting intersecting old edges, and retriangulating
the resulting two polygonal regions. After presenting an abstract view of the paradigm,
this paper shows that it can be used to obtain polynomial time algorithms for several
types of optimal triangulations.},
author = {Bern, Marshall and Herbert Edelsbrunner and Eppstein, David and Mitchell, Stephen and Tan, Tiow Seng},
pages = {46 -- 60},
publisher = {Springer},
title = {{Edge insertion for optimal triangulations}},
doi = {10.1007/BFb0023816},
volume = {583},
year = {1992},
}
@article{4050,
author = {Herbert Edelsbrunner},
journal = {Discrete & Computational Geometry},
number = {1},
pages = {217 -- 217},
publisher = {Springer},
title = {{Guest editor's foreword}},
doi = {10.1007/BF02293046},
volume = {8},
year = {1992},
}
@article{4053,
abstract = {We show that the maximum number of edges bounding m faces in an arrangement of n line segments in the plane is O(m2/3n2/3+nα(n)+nlog m). This improves a previous upper bound of Edelsbrunner et al. [5] and almost matches the best known lower bound which is Ω(m2/3n2/3+nα(n)). In addition, we show that the number of edges bounding any m faces in an arrangement of n line segments with a total of t intersecting pairs is O(m2/3t1/3+nα(t/n)+nmin{log m,log t/n}), almost matching the lower bound of Ω(m2/3t1/3+nα(t/n)) demonstrated in this paper.},
author = {Aronov, Boris and Herbert Edelsbrunner and Guibas, Leonidas J and Sharir, Micha},
journal = {Combinatorica},
number = {3},
pages = {261 -- 274},
publisher = {Springer},
title = {{The number of edges of many faces in a line segment arrangement}},
doi = {10.1007/BF01285815},
volume = {12},
year = {1992},
}
@article{4195,
abstract = {The effects of tri-iodothyronine (T3), which are known to affect cerebellar development, were tested on neuronal survival and differentiation of cultured cerebellar granule neurons. T3 in physiological concentrations increased both granule neuron survival after three days in culture and synaptic vesicle protein formation, as shown by immunostaining with antibodies against synaptophysin. Likewise, T3 increased the mRNA level for synapsin(I), but not that for GAP43 in granule neurons. Antibodies against microtubule associated protein Tau, which is expressed in developing neurites, showed that T3 also enhanced neurite formation.},
author = {Heisenberg, Carl-Philipp J and Thoenen, Hans and Lindholm, Dan},
journal = {Neuroreport},
number = {8},
pages = {685 -- 688},
publisher = {Lippincott, Williams & Wilkins},
title = {{Triiodothyronine Regulates Survival and Differentiation of Rat Cerebellar Granule Neurons}},
volume = {3},
year = {1992},
}
@article{4305,
abstract = {The common shrew (Sorex araneus) is subdivided into several karyotypic races in Britain. Two of these races meet near Oxford to form the "Oxford-Hermitage" hybrid zone. We present a model which describes this system as a "tension zone," i.e., a set of clines maintained by a balance between dispersal and selection against chromosomal heterozygotes. The Oxford and Hermitage races differ by Robertsonian fusions with monobrachial homology (kq, no versus ko), and so F1 hybrids between them would have low fertility. However, the acrocentric karyotype is found at high frequency within the hybrid zone, so that complex Robertsonian heterozygotes (kq no/q ko n) are replaced by more fertile combinations, such as (kq no/k q n o). This suggests that the hybrid zone has been modified so as to increase hybrid fitness. Mathematical analysis and simulation show that, if selection against complex heterozygotes is sufficiently strong relative to selection against simple heterozygotes, acrocentrics increase, and displace the clines for kq and no from the cline for ko. Superimposed on this separation is a tendency for the hybrid zone to move m favor of the Oxford (kq no) race. We compare the model with estimates of linkage disequilibrium and cline shape made from field data.},
author = {Hatfield, Todd and Nicholas Barton and Searle, Jeremy B},
journal = {Evolution; International Journal of Organic Evolution},
number = {4},
pages = {1129 -- 1145},
publisher = {Wiley-Blackwell},
title = {{A model of a hybrid zone between two chromosomal races of the common shrew (Sorex araneus)}},
volume = {46},
year = {1992},
}
@misc{4306,
author = {Nicholas Barton and Goldman, Nick G},
booktitle = {Nature},
pages = {440 -- 441},
publisher = {Nature Publishing Group},
title = {{Genetics and geography}},
doi = {10.1038/357440a0},
volume = {357},
year = {1992},
}
@inbook{4307,
author = {Nicholas Barton},
booktitle = {Animal dispersal: small mammals as a model},
editor = {Stenseth, Nils C and Lidicker, William Z},
pages = {37 -- 60},
publisher = {Chapman Hall},
title = {{The genetic consequences of dispersal}},
year = {1992},
}
@article{4308,
author = {Nicholas Barton},
journal = {Evolution; International Journal of Organic Evolution},
number = {2},
pages = {551 -- 557},
publisher = {Wiley-Blackwell},
title = {{On the spread of new gene combinations in the third phase of Wright's shifting balance}},
volume = {46},
year = {1992},
}
@inproceedings{4504,
author = {Thomas Henzinger and Manna, Zohar and Pnueli,Amir},
pages = {545 -- 558},
publisher = {Springer},
title = {{What good are digital clocks?}},
doi = {10.1007/3-540-55719-9_103},
volume = {623},
year = {1992},
}
@inproceedings{4505,
abstract = {We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space.
For this purpose, we introduce a mu-calculus on computation trees over real-numbered time. Unfortunately, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed mu-calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does not impair the symbolic verification of "implementable" real-time programs--those whose safety constraints are machine-closed with respect to diverging time and whose fairness constraints are restricted to finite upper bounds on clock values. All timed CTL properties of such programs are shown to be computable as finitely approximable fixpoints in a simple decidable theory.},
author = {Thomas Henzinger and Nicollin, Xavier and Sifakis, Joseph and Yovine, Sergio},
pages = {394 -- 406},
publisher = {IEEE},
title = {{Symbolic model checking for real-time systems}},
doi = {10.1109/LICS.1992.185551},
year = {1992},
}