@article{4029, abstract = {A general and direct method for computing the Betti numbers of a finite simplicial complex in Bd is given. This method is complete for d less than or equal to 3, where versions of this method run in time O(n alpha(n)) and O(n), n the number of simplices. An implementation of the algorithm is applied to alpha shapes, which is a novel geometric modeling tool.}, author = {Delfinado, Cecil and Edelsbrunner, Herbert}, issn = {0167-8396}, journal = {Computer Aided Geometric Design}, number = {7}, pages = {771 -- 784}, publisher = {Elsevier}, title = {{An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere}}, doi = {10.1016/0167-8396(95)00016-Y}, volume = {12}, year = {1995}, } @inproceedings{4034, abstract = {Any arbitrary polyhedron P contained as a subset within Rd can be written as algebraic sum of simple terms, each an integer multiple of the intersection of d or fewer half-spaces defined by facets of P. P can be non-convex and can have holes of any kind. Among the consequences of this result are a short boolean formula for P, a fast parallel algorithm for point classification, and a new proof of the Gram-Sommerville angle relation.}, author = {Edelsbrunner, Herbert}, booktitle = {Proceedings of IEEE 36th Annual Foundations of Computer Science}, issn = {0272-5428}, location = {Milwaukee, WI, United States of America}, pages = {248 -- 257}, publisher = {IEEE}, title = {{Algebraic decomposition of non-convex polyhedra}}, year = {1995}, } @article{4035, abstract = {Let S be a set of n points in ℝd . A set W is a weak ε-net for (convex ranges of)S if, for any T⊆S containing εn points, the convex hull of T intersects W. We show the existence of weak ε-nets of size {Mathematical expression}, where β2=0, β3=1, and βd ≈0.149·2d-1(d-1)!, improving a previous bound of Alon et al. Such a net can be computed effectively. We also consider two special cases: when S is a planar point set in convex position, we prove the existence of a net of size O((1/ε) log1.6(1/ε)). In the case where S consists of the vertices of a regular polygon, we use an argument from hyperbolic geometry to exhibit an optimal net of size O(1/ε), which improves a previous bound of Capoyleas.}, author = {Chazelle, Bernard and Edelsbrunner, Herbert and Grigni, Michelangelo and Guibas, Leonidas and Sharir, Micha and Welzl, Emo}, issn = {0179-5376}, journal = {Discrete & Computational Geometry}, number = {1}, pages = {1 -- 15}, publisher = {Springer}, title = {{Improved bounds on weak ε-nets for convex sets}}, doi = {10.1007/BF02574025}, volume = {13}, year = {1995}, } @article{4153, author = {Ransom, D. and Brownlie, Alison and Haffter, Pascal and Odenthal, Jörg and Kelsh, Robert and Brand, Michael and Furutani Seiki, Makoto and Granato, Michael and Hammerschmidt, Matthias and Heisenberg, Carl-Philipp J and Jiang, Yunjin and Kane, David and Mullins, Mary and Van Eden, Fredericus and Warga, Rachel and Nüsslein Volhard, Christiane and Zon, L.}, issn = {0006-4971}, journal = {Blood}, number = {10}, pages = {1912 -- 1912}, publisher = {American Society of Hematology}, title = {{Hematopoietic mutants identified in a saturation screen of the zebrafish genome}}, volume = {86}, year = {1995}, } @article{4296, abstract = {Three replicate lines of Drosophila melanogaster were cultured at each of two temperatures (16.5⚬C and 25⚬C) in population cages for 4 yr. The lifespans of both sexes and the fecundity and fertility of the females were then measured at both experimental temperatures. The characters showed evidence of adaptation; flies of both sexes from each selection regime showed higher longevity, and females showed higher fecundity and fertility, than flies from the other selection regime when they were tested at the experimental temperature at which they had evolved. Calculation of intrinsic rates of increase under different assumptions about the rate of population increase showed that the difference between the lines from the two selection regimes became less the higher the rate of population increase, because the lines were more similar in early adulthood than they were later. Despite the increased adaptation of the low-temperature lines to the low temperature, like the high temperature lines they produced progeny at a higher rate at the higher temperature. The lines may have independently evolved adaptations to their respective thermal regimes during the experiment, or there may have been a trade-off between adaptation to the two temperatures, or mutation pressure may have lowered adaptation to the temperature that the flies no longer encountered.}, author = {Partridge, Linda and Barrie, Brian and Barton, Nicholas H and Fowler, Kevin and French, Vernon}, issn = {0014-3820}, journal = {Evolution}, number = {3}, pages = {538 -- 544}, publisher = {Wiley-Blackwell}, title = {{Rapid laboratory evolution of adult life history traits in Drosophila melanogaster in response to temperature}}, doi = {10.1111/j.1558-5646.1995.tb02285.x}, volume = {49}, year = {1995}, } @article{4297, abstract = {The F5 (2n = 34) and FM2 (2n = 44-46) chromosome races of the Sceloporus grammicus complex form a parapatric hybrid zone in the Mexican state of Hidalgo, characterized by steep concordant clines among three diagnostic chromosome markers across a straight-line distance of about 2 km. Here, we show that this zone is actually structured into local patches in which hybridization extends over an extremely irregular front. The distribution of hybrid-index (HI) scores across the transect reveals some hybridization at almost all localities mapped in a central 7 km x 3 km area. Pooling the central samples produces both a strong heterozygote deficit for all diagnostic markers and strong linkage disequilibria between all pairwise combinations of these (unlinked) markers. Moreover, a highly significant association exists between the habitat on which each individual was caught and its karyotype (F5 chromosomes are more likely to be found on oak). Analysis of genotype frequencies over a range of spatial scales shows that there is no significant heterozygote deficit or habitat association within local areas of less than about 200 m; however, there is significant linkage disequilibrium over the smallest scales (R = D (pquv)1/2 = 0.29, support limits, 0.18-0.36) over 100 m. These patterns suggest that lizards mate and choose habitats randomly within local patches. This conclusion is supported by mark-recapture estimates of dispersal (≈ 80 m in a generation) and by inference of matings from embryo and maternal karyotypes. Closer examination of the two-dimensional pattern reveals a convoluted cline for all three markers, with a width of 830 m (support limits 770 m-930 m). This cline width, combined with the strength of local linkage disequilibrium, implies a dispersal rate of σ = 160 m in a generation and an effective selection pressure of 30% on each chromosome marker. The proportion of inviable embryos is greater in females from the center of the hybrid zone; this is caused by effects associated with both karyotype and location. The hybrid zone is likely to be maintained by selection against chromosomal heterozygotes, by other kinds of selection against hybrids, and by selection adapting the chromosome races to different habitats. The structure of the contact may be caused by both random drift and by selection in relation to habitat.}, author = {Sites, Jack and Barton, Nicholas H and Reed, Kent}, issn = {0014-3820}, journal = {Evolution}, number = {1}, pages = {9 -- 36}, publisher = {Wiley-Blackwell}, title = {{The genetic structure of a mosaic hybrid zone between two chromosome races of the Sceloporus grammicus complex (Sauria, Phrynosomatidae) in central Mexico}}, doi = {10.1111/j.1558-5646.1995.tb05955.x}, volume = {49}, year = {1995}, } @article{4298, author = {Barton, Nicholas H}, issn = {1558-5646}, journal = {Evolution}, number = {6}, pages = {1038 -- 1045}, publisher = {Wiley}, title = {{Appendix to "A simulation study of multilocus clines" by S J E Baird}}, doi = {10.1111/j.1558-5646.1995.tb04431.x}, volume = {49}, year = {1995}, } @phdthesis{4428, abstract = {Hybrid systems are real-time systems that react to both discrete and continuous activities (such as analog signals, time, temperature, and speed). Typical examples of hybrid systems are embedded systems, timing-based communication protocols, and digital circuits at the transistor level. Due to the rapid development of microprocessor technology, hybrid systems directly control much of what we depend on in our daily lives. Consequently, the formal specification and verification of hybrid systems has become an active area of research. This dissertation presents the first general framework for the formal specification and verification of hybrid systems, as well as the first hybrid-system analysis tool--HyTech. The framework consists of a graphical finite-state-machine-like language for modeling hybrid systems, a temporal logic for modeling the requirements of hybrid systems, and a computer procedure that verifies modeled hybrid systems against modeled requirements. The tool HyTech is the implementation of the framework using C++ and Mathematica. More specifically, our hybrid-system modeling language, Hybrid Automata, is an extension of timed automata with discrete and continuous variables whose dynamics are governed by differential equations. Our requirement modeling language, ICTL, is a branching-time temporal logic, and is an extension of TCTL with stop-watch variables. Our verification procedure is a symbolic model-checking procedure that verifies linear hybrid automata against ICTL formulas. To make HyTech more efficient and effective, we use model-checking strategies and abstract operators that can expedite the verification process. To enable HyTech to verify nonlinear hybrid automata, we introduce two translations from nonlinear hybrid automata to linear hybrid automata. We have applied HyTech to analyze more than 30 hybrid-system benchmarks. In this dissertation, we present the application of HyTech to three nontrivial hybrid systems taken from the literature.}, author = {Ho, Pei}, pages = {1 -- 188}, publisher = {Cornell University}, title = {{Automatic analysis of hybrid systems}}, year = {1995}, } @inproceedings{4447, abstract = {This paper is addressed to potential users of HyTech, the Cornell Hybrid Technology Tool, an automatic tool for analyzing hybrid systems. We review the formal technologies that have been incorporated into HyTech, and we illustrate the use of HyTech with three nontrivial case studies.}, author = {Henzinger, Thomas A and Ho, Pei}, booktitle = {4th International Hybrid Systems Workshop}, editor = {Panos, Antsaklis and Kohn, Wolf and Nerode, Anil and Sastry, Shankar}, isbn = {9783540683346}, location = { New Brunswick, NJ, United States of America}, pages = {265 -- 293}, publisher = {Springer}, title = {{HyTech: The Cornell Hybrid Technology Tool}}, doi = {10.1007/3-540-60472-3_14}, volume = {999}, year = {1995}, } @inproceedings{4448, abstract = {We report on several abstract interpretation strategies that are designed to improve the performance of HyTech, a symbolic model checker for linear hybrid systems. We (1) simultaneously compute the target region from different directions, (2) conservatively approximate the target region by dropping constraints, and (3) iteratively refine the approximation until sufficient precision is obtained. We consider the standard abstract convex-hull operator and a novel abstract extrapolation operator.}, author = {Henzinger, Thomas A and Ho, Pei}, booktitle = {3rd International Hybrid Systems Workshop}, editor = {Panos, Antsaklis and Kohn, Wolf and Nerode, Anil and Sastry, Shankar}, isbn = {9783540604723}, location = {Ithaca, NY, United States of America}, pages = {252 -- 264}, publisher = {Springer}, title = {{A note on abstract-interpretation strategies for hybrid automata}}, doi = {10.1007/3-540-60472-3_13}, volume = {999}, year = {1995}, } @inproceedings{4450, abstract = {Hybrid systems model discrete programs that are embedded in continuous environments. Model-checking tools are available for the analysis of linear hybrid systems, whose continuous variables are bounded by piecewise-linear trajectories. Most embedded programs, however, operate in nonlinear environments. We present, analyze, and apply two algorithms for translating nonlinear hybrid systems into linear hybrid systems. The clock translation replaces nonlinear variables by clock variables; the rate translation approximates nonlinear variables by piecewise-linear envelopes. Both translations are sound for reachability; that is, if we establish a safety property of the translated linear system, we may conclude that the original nonlinear system satisfies the property. The clock translation is also complete for reachability; that is, the original system and the translated system satisfy the same safety properties. The two translations apply to incomparable classes of nonlinear hybrid systems. From the clock translation we obtain a new decidability result for hybrid systems. With the help of Hytech, a symbolic model checker for linear hybrid systems, we automatically verify a nonlinear railroad gate control program using the clock translation, and a nonlinear temperature control program using the rate translation.}, author = {Henzinger, Thomas A and Ho, Pei}, booktitle = {7th International Conference on Computer Aided Verification}, isbn = {9783540494133}, location = {Liege, Belgium}, pages = {225 -- 238}, publisher = {Springer}, title = {{Algorithmic analysis of nonlinear hybrid systems}}, doi = {10.1007/3-540-60045-0_53}, volume = {939}, year = {1995}, } @inproceedings{4497, abstract = {HyTech is a tool for the automated analysis of embedded systems. This document, designed for the first-time user of HyTech, guides the reader through the underlying system model, and through the input language for describing and analyzing systems. The guide gives several examples of usage, and some hints for gaining maximal computational efficiency from the tool. The version of HyTech described in this guide was released in August 1995, and is available through anonymous ftp from ftp.cs.cornell.edu in the directory pub/tah/HyTech, and through the World-Wide Web via HyTech's home page http:/www.cs.cornell.edu/Info/People/tah/hytech.html.}, author = {Henzinger, Thomas A and Ho, Pei and Wong Toi, Howard}, booktitle = {1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems}, isbn = {9783540606307}, location = {Aarhus, Denmark}, pages = {41 -- 71}, publisher = {Springer}, title = {{A user guide to HyTech}}, doi = {10.1007/3-540-60630-0_3}, volume = {1019}, year = {1995}, } @inproceedings{4498, abstract = {We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the refinement and verification of reactive systems. For finite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m⩾n). For effectively presented infinite graphs, we present a symbolic similarity-checking procedure that terminates if a finite similarity relation exists. We show that 2D rectangular automata, which model discrete reactive systems with continuous environments, define effectively presented infinite graphs with finite similarity relations. It follows that the refinement problem and the ∀CTL* model-checking problem are decidable for 2D rectangular automata}, author = {Henzinger, Monika H and Henzinger, Thomas A and Kopke, Peter}, booktitle = {Proceedings of IEEE 36th Annual Foundations of Computer Science}, isbn = {0818671831}, issn = {0272-5428}, location = {Milwaukee, WI, United States of America}, pages = {453 -- 462}, publisher = {IEEE}, title = {{Computing simulations on finite and infinite graphs}}, doi = {10.1109/SFCS.1995.492576}, year = {1995}, } @inproceedings{4499, abstract = {We describe a new implementation of HYTECH, a symbolic model checker for hybrid systems. Given a parametric description of an embedded system as a collection of communicating automata, HYTECH automatically computes the conditions on the parameters under which the system satisfies its safety and timing requirements. While the original HYTECH prototype was based on the symbolic algebra tool Mathematica, the new implementation is written in C++ and builds on geometric algorithms instead of formula manipulation. The new HYTECH offers a cleaner and more expressive input language, greater portability, superior performance (typically two to three orders of magnitude), and new features such as diagnostic error-trace generation. We illustrate the effectiveness of the new implementation by applying HYTECH to the automatic parametric analysis of the generic railroad crossing benchmark problem and to an active structure control algorithm}, author = {Henzinger, Thomas A and Ho, Pei and Wong Toi, Howard}, booktitle = {Proceedings 16th IEEE Real-Time Systems Symposium}, isbn = {0818673370}, location = {Pisa, Italy}, pages = {56 -- 65}, publisher = {IEEE}, title = {{HyTech: The next generation}}, doi = {10.1109/REAL.1995.495196 }, year = {1995}, } @inproceedings{4500, abstract = {We investigate the expressive power of timing restrictions on labeled transition systems. In particular, we show how constraints on clock variables together with a uniform liveness condition—the divergence of time—can express Büchi, Muller, Streett, Rabin, and weak and strong fairness conditions on a given labeled transition system. We then consider the effect, on both timed and time-abstract expressiveness, of varying the following parameters: time domain (discrete or dense), number of clocks, number of states, and size of constants used in timing restrictions.}, author = {Henzinger, Thomas A and Kopke, Peter and Wong Toi, Howard}, booktitle = {22nd International Colloquium on Automata, Languages and Programming }, isbn = {9783540600848}, location = {Szeged, Hungary}, pages = {417 -- 428}, publisher = {Springer}, title = {{The expressive power of clocks}}, doi = {10.1007/3-540-60084-1_93}, volume = {944}, year = {1995}, } @inproceedings{4502, abstract = {Hybrid automata model systems with both digital and analog components, such as embedded control programs. Many verification tasks for such programs can be expressed as reachability problems for hybrid automata. By improving on previous decidability and undecidability results, we identify the precise boundary between decidability and undecidability of the reachability problem for hybrid automata. On the positive side, we give an (optimal) PSPACE reachability algorithm for the case of initialized rectangular automata, where all analog variables follow trajectories within piecewise-linear envelopes and are reinitialized whenever the envelope changes. Our algorithm is based on the construction of a timed automaton that contains all reachability information about a given initialized rectangular automaton. The translation has practical significance for verification, because it guarantees the termination of symbolic procedures for the reachability analysis of initialized rectangular automata. The translation also preserves the omega-languages of initialized rectangular automata with bounded nondeterminism. On the negative side, we show that several slight generalizations of initialized rectangular automata lead to an undecidable reachability problem. In particular, we prove that the reachability problem is undecidable for timed automata augmented with a single stopwatch.}, author = {Henzinger, Thomas A and Kopke, Peter and Puri, Anuj and Varaiya, P.}, booktitle = {Proceedings of the 27th annual ACM symposium on Theory of computing}, isbn = {9780897917186}, location = {Las Vegas, NV, United States of America}, pages = {373 -- 382}, publisher = {ACM}, title = {{What's decidable about hybrid automata?}}, doi = {10.1145/225058.225162}, year = {1995}, } @inproceedings{4518, abstract = {The analysis, verification, and control of hybrid automata with finite bisimulations can be reduced to finite-state problems. We advocate a time-abstract, phase-based methodology for checking if a given hybrid automaton has a finite bisimulation. First, we factor the automaton into two components, a boolean automaton with a discrete dynamics on the finite state space B m and a euclidean automaton with a continuous dynamics on the infinite state space n . Second, we investigate the phase portrait of the euclidean component. In this fashion, we obtain new decidability results for hybrid systems as well as new, uniform proofs of known decidability results.}, author = {Henzinger, Thomas A}, booktitle = {22nd International Colloquium on Automata, Languages and Programming }, isbn = {9783540600848}, location = {Szeged, Hungary}, pages = {324 -- 335}, publisher = {Springer}, title = {{Hybrid automata with finite bisimulations}}, doi = {10.1007/3-540-60084-1_85}, volume = {944}, year = {1995}, } @article{2488, abstract = {Substance P receptor-expressing neurons in the rat cerebral neocortex were examined by single- and double-immunolabeling methods with an affinity-purified specific antibody to substance P receptor. Substance P receptor immunoreactivity was observed exclusively in non-pyramidal neurons. About a quarter of these substance P receptor-positive neocortical neurons showed intense immunoreactivity, and the other three quarters displayed weak substance P receptor immunoreactivity. The neurons showing intense substance P receptor immunoreactivity were large multipolar cells with a few long aspiny or sparsely-spiny dendrites, and were scattered throughout the neocortical layers except for layer I, and also in the underlying white matter. The weakly immunoreactive neurons were medium-sized multipolar cells with oval to round somata and aspiny varicose dendrites, and were distributed in all cortical layers with a bias to layers II-III and the superficial part of layer V. The double-immunofluorescence study revealed that almost all substance P receptor-positive neurons were immunoreactive for GABA, but negative for glutaminase. Substance P receptor immunoreactivity in GABAergic neocortical neurons were further examined by the double-immunofluorescence method with antibodies to markers for subgroups of GABAergic neurons. Somatostatin immunoreactivity was found in 89% of neurons with intense substance P receptor immunoreactivity, and in 1.5% of neurons with weak substance P receptor immunoreactivity. Neuropeptide Y immunoreactivity was also observed in 92% of neurons with intense immunoreactivity for substance P receptor, and in 1.6% of neurons with weak immunoreactivity for substance P receptor. In contrast, parvalbumin immunoreactivity was seen in 1.3% of neurons with intense substance P receptor immunoreactivity, and in 59% of weak substance P receptor immunoreactivity. Calbindin D28k immunoreactivity was found in 12 and 19% of neurons, respectively, with weak and intense immunoreactivities for substance P receptor. Virtually no cells showing substance P receptor immunoreactivity displayed immunoreactivity for vasoactive intestinal polypeptide or choline acetyltransferase. These results indicate that the neocortical neurons expressing substance P receptor constitute a subpopulation of GABAergic non-pyramidal cells, and are segregated into neurons with intense immunoreactivity and those with weak immunoreactivity for substance P receptor; the vast majority of neurons with intense substance P receptor immunoreactivity contain somatostatin and neuropeptide Y, and the majority of neurons with weak substance P receptor immunoreactivity have parvalbumin.}, author = {Kaneko, Takeshi and Shigemoto, Ryuichi and Nakanishi, Shigetada and Mizuno, Noboru}, issn = {0306-4522}, journal = {Neuroscience}, number = {1}, pages = {199 -- 211}, publisher = {Elsevier}, title = {{Morphological and chemical characteristics of substance P receptor immunoreactive neurons in the rat neocortex}}, doi = {10.1016/0306-4522(94)90215-1}, volume = {60}, year = {1994}, } @article{2489, abstract = {Five N-methyl-D-aspartate (NMDA) receptor subunits have been identified thus far: NR1, NR2A, NR2B, NR2C, and NR2D. Here, we have analyzed the expression patterns of mRNAs for the NMDA receptor subunits in the developing and adult rats by in situ hybridization. The developmental changes of the expression patterns were most salient in the cerebellum. In the external granular layer, hybridization signals of mRNAs for NR1, NR2A, NR2B, and NR2C appeared by postnatal day 3, but no NR2D mRNA was expressed at any developmental stage examined. The NR1 mRNA was expressed in all cerebellar neurons at all developmental stages examined. The signals for the NR2A mRNA appeared in Purkinje cells and granule cells during the second postnatal week. The signals for the NR2B mRNA in granule cells were seen transiently during the first 2 weeks after birth. The signals for NR2C mRNA appeared in granule cells and glial cells during the second postnatal week. The signals for NR2D mRNA appeared transiently in Purkinje cells during the first 8 postnatal days; in adult rats, these were seen in stellate and Golgi cells. In the cerebellar nuclei, mRNAs for NR1, NR2A, NR2B, and NR2D were more or less expressed on postnatal day 0, while expression signals for the NR2C mRNA were first detected in postnatal day 14. Thus, the most conspicuous changes of expression patterns were observed in the cerebellar cortex during the first 2 weeks after birth, when development and maturation of the cerebellum proceed most rapidly.}, author = {Akazawa, Chihiro and Shigemoto, Ryuichi and Bessho, Yasumasa and Nakanishi, Shigetada and Mizuno, Noboru}, issn = {0021-9967}, journal = {Journal of Comparative Neurology}, number = {1}, pages = {150 -- 160}, publisher = {Wiley-Blackwell}, title = {{Differential expression of five N-methyl-D-aspartate receptor subunit mRNAs in the cerebellum of developing and adult rats}}, doi = {10.1002/cne.903470112}, volume = {347}, year = {1994}, } @article{2490, abstract = {Distribution of the messenger RNA for the prostaglandin E receptor subtype EP3 was investigated by in situ hybridization in the nervous system of the mouse. The hybridization signals for EP3 were widely distributed in the brain and sensory ganglia and specifically localized to neurons. In the dorsal root and trigeminal ganglia, about half of the neurons were labeled intensely. In the brain, intensely labeled neurons were found in Ammon's horn, the preoptic nuclei, lateral hypothalamic area, dorsomedial hypothalamic nucleus, lateral mammillary nucleus, entopeduncular nucleus, substantia nigra pars compacta, locus coeruleus and raphe nuclei. Moderately labeled neurons were seen in the mitral cell layer of the main olfactory bulb, layer V of the entorhinal and parasubicular cortices, layers V and VI of the cerebral neocortex, nuclei of the diagonal band, magnocellular preoptic nucleus, globus pallidus and lateral parabrachial nucleus. In the thalamus, moderately labeled neurons were distributed in the anterior, ventromedial, laterodorsal, paraventricular and central medial nuclei. Based on these distributions, we suggest that EP3 not only mediates prostaglandin E2 signals evoked by blood-borne cytokines in the areas poor in the blood-brain barrier, but also responds to those formed intrinsically within the brain to modulate various neuronal activities. Possible EP3 actions are discussed in relation to the reported neuronal activities of prostaglandin E2 in the brain.}, author = {Sugimoto, Yukihiko and Shigemoto, Ryuichi and Namba, Tsunehisa and Negishi, Manabu and Mizuno, Noboru and Narumiya, Shuh and Ichikawa, Atsushi}, issn = {0306-4522}, journal = {Neuroscience}, number = {3}, pages = {919 -- 928}, publisher = {Elsevier}, title = {{Distribution of the messenger rna for the prostaglandin e receptor subtype ep3 in the mouse nervous system}}, doi = {10.1016/0306-4522(94)90483-9}, volume = {62}, year = {1994}, }