@article{11126,
  abstract     = {Nuclear import of the two uracil-rich small nuclear ribonucleoprotein (U snRNP) components U1A and U2B′′ is mediated by unusually long and complex nuclear localization signals (NLSs). Here we investigate nuclear import of U1A and U2B′′ in vitro and demonstrate that it occurs by an active, saturable process. Several lines of evidence suggest that import of the two proteins occurs by an import mechanism different to those characterized previously. No cross competition is seen with a variety of previously studied NLSs. In contrast to import mediated by members of the importin-β family of nucleocytoplasmic transport receptors, U1A/U2B′′ import is not inhibited by either nonhydrolyzable guanosine triphosphate (GTP) analogues or by a mutant of the GTPase Ran that is incapable of GTP hydrolysis. Adenosine triphosphate is capable of supporting U1A and U2B′′ import, whereas neither nonhydrolyzable adenosine triphosphate analogues nor GTP can do so. U1A and U2B′′ import in vitro does not require the addition of soluble cytosolic proteins, but a factor or factors required for U1A and U2B′′ import remains tightly associated with the nuclear fraction of conventionally permeabilized cells. This activity can be solubilized in the presence of elevated MgCl2. These data suggest that U1A and U2B′′ import into the nucleus occurs by a hitherto uncharacterized mechanism.},
  author       = {HETZER, Martin W and Mattaj, Iain W.},
  issn         = {1540-8140},
  journal      = {Journal of Cell Biology},
  keywords     = {Cell Biology},
  number       = {2},
  pages        = {293--304},
  publisher    = {Rockefeller University Press},
  title        = {{An Atp-dependent, Ran-independent mechanism for nuclear import of the U1a and U2b′′ spliceosome proteins}},
  doi          = {10.1083/jcb.148.2.293},
  volume       = {148},
  year         = {2000},
}

@article{11127,
  abstract     = {Nuclear formation in Xenopus egg extracts requires cytosol and is inhibited by GTPγS, indicating a requirement for GTPase activity. Nuclear envelope (NE) vesicle fusion is extensively inhibited by GTPγS and two mutant forms of the Ran GTPase, Q69L and T24N. Depletion of either Ran or RCC1, the exchange factor for Ran, from the assembly reaction also inhibits this step of NE formation. Ran depletion can be complemented by the addition of Ran loaded with either GTP or GDP but not with GTPγS. RCC1 depletion is only complemented by RCC1 itself or by RanGTP. Thus, generation of RanGTP by RCC1 and GTP hydrolysis by Ran are both required for the extensive membrane fusion events that lead to NE formation.},
  author       = {HETZER, Martin W and Bilbao-Cortés, Daniel and Walther, Tobias C and Gruss, Oliver J and Mattaj, Iain W},
  issn         = {1097-2765},
  journal      = {Molecular Cell},
  keywords     = {Cell Biology, Molecular Biology},
  number       = {6},
  pages        = {1013--1024},
  publisher    = {Elsevier},
  title        = {{GTP hydrolysis by Ran is required for nuclear envelope assembly}},
  doi          = {10.1016/s1097-2765(00)80266-x},
  volume       = {5},
  year         = {2000},
}

@article{11683,
  abstract     = {The vertex connectivity κ of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known deterministic algorithm for finding the vertex connectivity and a corresponding separator. The time for a digraph having n vertices and m edges is O(min{κ3 + n, κn}m); for an undirected graph the term m can be replaced by κn. A randomized algorithm finds κ with error probability 1/2 in time O(nm). If the vertices have nonnegative weights the weighted vertex connectivity is found in time O(κ1nmlog(n2/m)) where κ1 ≤ m/n is the unweighted vertex connectivity or in expected time O(nmlog(n2/m)) with error probability 1/2. The main algorithm combines two previous vertex connectivity algorithms and a generalization of the preflow-push algorithm of Hao and Orlin (1994, J. Algorithms17, 424–446) that computes edge connectivity.},
  author       = {Henzinger, Monika H and Rao, Satish and Gabow, Harold N.},
  issn         = {0196-6774},
  journal      = {Journal of Algorithms},
  keywords     = {Computational Theory and Mathematics, Computational Mathematics, Control and Optimization},
  number       = {2},
  pages        = {222--250},
  publisher    = {Elsevier},
  title        = {{Computing vertex connectivity: New bounds from old techniques}},
  doi          = {10.1006/jagm.1999.1055},
  volume       = {34},
  year         = {2000},
}

@article{11685,
  abstract     = {We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the fraction of pages in various Internet domains or written in various languages. Moreover, uniform URL sampling can be used to determine the sizes of various search engines relative to the entire Web. In this paper, we consider sampling approaches based on random walks of the Web graph. In particular, we suggest ways of improving sampling based on random walks to make the samples closer to uniform. We suggest a natural test bed based on random graphs for testing the effectiveness of our procedures. We then use our sampling approach to estimate the distribution of pages over various Internet domains and to estimate the coverage of various search engine indexes.},
  author       = {Henzinger, Monika H and Heydon, Allan and Mitzenmacher, Michael and Najork, Marc},
  issn         = {1389-1286},
  journal      = {Computer Networks},
  keywords     = {URL sampling, Random walks, Internet domain distribution, Search engine size},
  number       = {1-6},
  pages        = {295--308},
  publisher    = {Elsevier},
  title        = {{On near-uniform URL sampling}},
  doi          = {10.1016/s1389-1286(00)00055-4},
  volume       = {33},
  year         = {2000},
}

@article{11694,
  abstract     = {We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connected graph. The robot's task is to visit all nodes and edges of the graph using the minimum number R of edge traversals. Deng and Papadimitriou [Proceedings of the 31st Symposium on the Foundations of Computer Science, 1990, pp. 356-361] showed an upper bound for R ofd O(d)m and Koutsoupias (reported by Deng and Papadimitriou) gave a lower bound of Ω≠(d2m), where m is the number of edges in the graph and d is the minimum number of edges that have to be added to make the graph Eulerian.  We give the 1rst subexponential algorithm for this exploration problem, which achieves an upper bound of dO(logd)m.  We also show a matching lower bound of d≠(logd)m for our algorithm. Additionally, we give lower bounds of 2≠(d)m, respectively, d≠(logd)m for various other natural exploration algorithms.},
  author       = {Albers, Susanne and Henzinger, Monika H},
  issn         = {1095-7111},
  journal      = {SIAM Journal on Computing},
  keywords     = {directed graph, exploration algorithm},
  location     = {El Paso, TX, United States},
  number       = {4},
  pages        = {1164--1188},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Exploring unknown environments}},
  doi          = {10.1137/s009753979732428x},
  volume       = {29},
  year         = {2000},
}

@article{11770,
  abstract     = {We compare several algorithms for identifying mirrored hosts on the World Wide Web. The algorithms operate on the basis of URL strings and linkage data: the type of information about Web pages easily available from Web proxies and crawlers. Identification of mirrored hosts can improve Web-based information retrieval in several ways: first, by identifying mirrored hosts, search engines can avoid storing and returning duplicate documents. Second, several new information retrieval techniques for the Web make inferences based on the explicit links among hypertext documents—mirroring perturbs their graph model and degrades performance. Third, mirroring information can be used to redirect users to alternate mirror sites to compensate for various failures, and can thus improve the performance of Web browsers and proxies. We evaluated four classes of “top-down” algorithms for detecting mirrored host pairs (that is, algorithms that are based on page attributes such as URL, IP address, and hyperlinks between pages, and not on the page content) on a collection of 140 million URLs (on 230,000 hosts) and their associated connectivity information. Our best approach is one which combines five algorithms and achieved a precision of 0.57 for a recall of 0.86 considering 100,000 ranked host pairs.},
  author       = {Bharat, Krishna and Broder, Andrei and Dean, Jeffrey and Henzinger, Monika H},
  issn         = {0002-8231},
  journal      = {Journal of the American Society for Information Science},
  number       = {12},
  pages        = {1114--1122},
  publisher    = {Wiley},
  title        = {{A comparison of techniques to find mirrored hosts on the WWW}},
  doi          = {10.1002/1097-4571(2000)9999:9999<::aid-asi1025>3.0.co;2-0},
  volume       = {51},
  year         = {2000},
}

@inproceedings{11802,
  abstract     = {In this paper we survey algorithmic aspects of Web information retrieval. As an example, we discuss ranking of search engine results using connectivity analysis.},
  author       = {Henzinger, Monika H},
  booktitle    = {8th Annual European Symposium on Algorithms},
  isbn         = {9783540410041},
  issn         = {1611-3349},
  location     = {Saarbrücken, Germany},
  pages        = {1–8},
  publisher    = {Springer Nature},
  title        = {{Web information retrieval - an algorithmic perspective}},
  doi          = {10.1007/3-540-45253-2_1},
  volume       = {1879},
  year         = {2000},
}

@article{11893,
  abstract     = {We present fully dynamic algorithms for maintaining the biconnected components in general and plane graphs.

A fully dynamic algorithm maintains a graph during a sequence of insertions and deletions of edges or isolated vertices. Let m be the number of edges and n be the number of vertices in a graph. The time per operation of the best deterministic algorithms is 𝑂(𝑛√) in general graphs and O(log n) in plane graphs for fully dynamic connectivity and O(min m2/3 ,n}) in general graphs and 𝑂(𝑛√) in plane graphs for fully dynamic biconnectivity. We improve the later running times to 𝑂(𝑚log𝑛‾‾‾‾‾‾‾√) in general graphs and O(log 2n ) in plane graphs. Our algorithm for general graphscan also find the biconnected components of all vertices in time O(n).},
  author       = {Henzinger, Monika H},
  issn         = {1095-7111},
  journal      = {SIAM Journal on Computing},
  number       = {6},
  pages        = {1761--1815},
  publisher    = {Society for Industrial & Applied Mathematics},
  title        = {{Improved data structures for fully dynamic biconnectivity}},
  doi          = {10.1137/s0097539794263907},
  volume       = {29},
  year         = {2000},
}

@inproceedings{2325,
  author       = {Robert Seiringer},
  pages        = {53 -- 72},
  publisher    = {American Mathematical Society},
  title        = {{Inequalities for Schrödinger operators and applications to the stability of matter problem }},
  doi          = {10.1090/conm/529},
  volume       = {529},
  year         = {2000},
}

@inproceedings{2342,
  abstract     = {In the theoretical description of recent experiments with dilute Bose gases confined in external potentials the Gross-Pitaevskii equation plays an important role. Its status as an approximation for the quantum mechanical many-body ground state problem has recently been rigorously clarified. A summary of this work is presented here.},
  author       = {Seiringer, Robert and Lieb, Élliott and Yngvason, Jakob},
  booktitle    = {Proceedings of the International Symposium on Quantum Theory and Symmetries},
  isbn         = {9789810242374 },
  pages        = {101 -- 110},
  publisher    = {World Scientific Publishing},
  title        = {{The ground state energy and density of interacting bosons in a trap}},
  year         = {2000},
}

@article{2343,
  abstract     = {We study the energy levels of a single particle in a homogeneous magnetic field and in an axially symmetric external potential. For potentials that are superharmonic off the central axis, we find a general 'pseudoconcave' ordering of the ground state energies of the Hamiltonian restricted to the sectors with fixed angular momentum. The physical applications include atoms and ions in strong magnetic fields. There the energies are monotone increasing and concave in angular momentum. In the case of a periodic chain of atoms, the pseudoconcavity extends to the entire lowest band of Bloch functions.},
  author       = {Baumgartner, Bernhard and Robert Seiringer},
  journal      = {Letters in Mathematical Physics},
  number       = {3},
  pages        = {213 -- 226},
  publisher    = {Springer},
  title        = {{On the ordering of energy levels in homogeneous magnetic fields}},
  doi          = {    10.1023/A:1010978807635},
  volume       = {54},
  year         = {2000},
}

@article{2344,
  abstract     = {The ground-state properties of interacting Bose gases in external potentials, as considered in recent experiments, are usually described by means of the Gross-Pitaevskii energy functional. We present here a rigorous proof of the asymptotic exactness of this approximation for the ground-state energy and particle density of a dilute Bose gas with a positive interaction.},
  author       = {Lieb, Élliott and Seiringer, Robert and Yngvason, Jakob},
  issn         = {0556-2791},
  journal      = {Physical Review A - Atomic, Molecular, and Optical Physics},
  number       = {4},
  pages        = {436021 -- 4360213},
  publisher    = {American Physical Society},
  title        = {{Bosons in a trap: A rigorous derivation of the Gross-Pitaevskii energy functional}},
  doi          = {10.1103/PhysRevA.61.043602},
  volume       = {61},
  year         = {2000},
}

@inproceedings{2418,
  abstract     = {For an absolutely continuous probability measure μ on Rd and a nonnegative integer k, let sk(μ, 0) denote the probability that the convex hull of k+d+1 random points which are i.i.d. according to μ contains the origin 0. For d and k given, we determine a tight upper bound on sk(μ, 0), and we characterize the measures in Rd which attain this bound. This result can be considered a continuous analogue of the Upper Bound Theorem for the maximal number of faces of convex polytopes with a given number of vertices. For our proof we introduce so-called h-functions, continuous counterparts of h-vectors for simplicial convex polytopes.},
  author       = {Wagner, Uli and Welzl, Emo},
  booktitle    = {Proceedings of the 16th annual symposium on Computational geometry},
  isbn         = {9781581132243},
  location     = {Clear Water Bay Kowloon, Hong Kong},
  pages        = {50 -- 56},
  publisher    = {ACM},
  title        = {{Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem}},
  doi          = {10.1145/336154.336176},
  year         = {2000},
}

@inbook{2494,
  abstract     = {This chapter focuses on metabotropic glutamate receptors (mGluRs). These receptors are linked to several intracellular signal transduction mechanisms via G-protein and are implicated in diverse functions of the mammalian central nervous system (CNS). These functions include mediation of slow excitatory and inhibitory responses; regulation of calcium channels, potassium channels, and non-selective cation channels; inhibition and facilitation of transmitter release; induction of long-term potentiation and long-term depression; and regulation of neuronal development. Functional diversity of the metabotropic glutamate receptor is reflected in molecular diversity of receptor subtypes. The sites of action of mGluRs are widely found throughout different membrane compartments of neuronal and glial cells. The chapter reviews the differential subcellular localization of metabotropic glutamate receptors in relation to transmitter release sites. Patterns of subcellular localization of mGluRs are different among three subgroups: group I and III mGluRs are mainly localized to somatodendritic and axonal domains of neurons, respectively, while group II mGluRs are extensively localized to both domains as well as to glial cell processes.},
  author       = {Shigemoto, Ryuichi and Mizuno, Noboru},
  booktitle    = {Glutamate},
  issn         = {0924-8196},
  pages        = {63 -- 98},
  publisher    = {Elsevier},
  title        = {{Chapter III Metabotropic glutamate receptors - immunocytochemical and in situ hybridization analyses}},
  doi          = {10.1016/S0924-8196(00)80044-5},
  volume       = {18},
  year         = {2000},
}

@article{2598,
  abstract     = {There are many types of cerebellar ataxia, including ataxia due to congenital or metabolic disorders and a paraneoplastic form in patients with gynecologic cancer, breast cancer, lung cancer, or Hodgkin's disease.1 This paraneoplastic syndrome is the only type of cerebellar ataxia associated with autoantibodies against neuronal antigens. Often, the neuronal antigens are aberrantly expressed by the tumor cells.2-4 The antineuronal autoantibodies are believed to cause cerebellar ataxia, but this is unproved.5,6 In Hodgkin's disease, the lymphoma precedes the ataxia by months to years in 80 percent of patients, and ataxia often occurs during a prolonged complete remission.4 Among patients with this type of ataxia, 30 percent have anti–Purkinje-cell antibodies, some of which have the features of the neuronal antibody anti-Tr.4,7

We identified a new autoantibody in two patients with severe cerebellar ataxia that developed while they were in remission from Hodgkin's disease. The antibody reacts specifically with the metabotropic glutamate receptor mGluR1 in mouse brain. Metabotropic glutamate receptors belong to a large family of cell-surface receptors that transmit signals into the cell by coupling to guanine nucleotide-binding proteins (G proteins) in the cytoplasm. Purified IgG from the serum of both patients blocked the glutamate-stimulated formation of inositol phosphates in Chinese-hamster-ovary (CHO) cells that expressed mGluR1α, and the injection of IgG from serum or cerebrospinal fluid into the cerebellar subarachnoid space of mice caused severe, reversible ataxia. These results indicate that antineuronal autoantibodies can cause disease of the central nervous system by blocking neuronal receptors.},
  author       = {Sillevis Smitt, Peter and Kinoshita, Ayae and De Leeuw, Bertie and Moll, Wiebe and Coesmans, Michiel and Jaarsma, Dick and Henzen Logmans, Sonja and Vecht, Charles and De Zeeuw, Chris and Sekiyama, Naotaka and Nakanishi, Shigetada and Shigemoto, Ryuichi},
  issn         = {0028-4793},
  journal      = {New England Journal of Medicine},
  number       = {1},
  pages        = {21 -- 27},
  publisher    = {Massachussetts Medical Society},
  title        = {{Paraneoplastic cerebellar ataxia due to autoantibodies against a glutamate receptor}},
  doi          = {10.1056/NEJM200001063420104},
  volume       = {342},
  year         = {2000},
}

@article{2599,
  abstract     = {The synaptic relationship between substance P (SP) and its receptor, i.e., neurokinin-1 receptor (NK1R), was examined in the striatum of the rat by confocal laser-scanning microscopy and electron microscopy. For confocal laser-scanning microscopy, triple-immunofluorescence histochemistry was performed to label NK1R, SP, and vesicular acetylcholine transporter (a specific marker for cholinergic neurons). In electron microscopic double- immunolabeling study, immunoreactivity for NK1R was detected with the silver- intensified gold method, while immunoreactivity for SP was detected with peroxidase immunohistochemistry. Simultaneous immunolabeling of NK1R and SP revealed significant mismatch at the synaptic level: although some SP- immunopositive axon terminals were in synaptic contact with NK1R- immunopositive sites of plasma membrane, NK1R-immunoreactivity was observed at both synaptic and non-synaptic sites of plasma membrane. Thus, SP released from the sites remote from NK1Rs might diffuse in the extracellular fluid to act, as a paracrine neurotransmitter, on NK1Rs distant from its releasing site. SP neurotransmission in the striatum might occur not only synaptically but also extrasynaptically. The SP-NK1R system might constitute an association system within the striatum.},
  author       = {Li, Jin and Wang, Dan and Kaneko, Takeshi and Shigemoto, Ryuichi and Nomura, Sakashi and Mizuno, Noboru},
  issn         = {0021-9967},
  journal      = {Journal of Comparative Neurology},
  number       = {2},
  pages        = {156 -- 163},
  publisher    = {Wiley-Blackwell},
  title        = {{Relationship between neurokinin-1 receptor and substance P in the striatum: Light and electron microscopic immunohistochemical study in the rat}},
  doi          = {10.1002/(SICI)1096-9861(20000306)418:2&lt;156::AID-CNE3&gt;3.0.CO;2-Z},
  volume       = {418},
  year         = {2000},
}

@article{2600,
  abstract     = {The synaptic relationship between substance P (SP) and its receptor, i.e. neurokinin-1 receptor (NK1R), was examined in the superficial laminae of the caudal subnucleus of the spinal trigeminal nucleus (medullary dorsal horn; MDH) of the rat. For confocal laser-scanning microscopy, double-immunofluorescence histochemistry for NK1 and SP was performed. In electron microscopic double-immunolabeling study, immunoreactivity for NK1R was detected with the silver-intensified gold method, while immunoreactivity for SP was detected with peroxidase immunohistochemistry. SP-immunoreactive axon terminals were observed to be in synaptic (mostly asymmetric) contact with NK1R-immunoreactive neuronal profiles in lamina I and lamina IIo. Although some SP-immunoreactive axon terminals were in synaptic contact with NK1R-immunoreactive sites of plasma membranes, NK1R-immunoreactivity was observed at both synaptic and non-synaptic sites of plasma membrane. Thus, SP released from axon terminals might not only act on NK1Rs facing the SP-containing axon terminals, but also diffuse in the extracellular fluid for distances larger than the synaptic cleft to act on NK1Rs at some distances from the synaptic sites. },
  author       = {Li, Jin and Wang, Dan and Kaneko, Takeshi and Shigemoto, Ryuichi and Nomura, Sakashi and Mizuno, Noboru},
  issn         = {0168-0102},
  journal      = {Neuroscience Research},
  number       = {4},
  pages        = {327 -- 334},
  publisher    = {Elsevier},
  title        = {{The relationship between neurokinin-1 receptor and substance P in the medullary dorsal horn: A light and electron microscopic immunohistochemical study in the rat}},
  doi          = {10.1016/S0168-0102(00)00095-X},
  volume       = {36},
  year         = {2000},
}

@article{2601,
  abstract     = {Targeted deletion of metabotropic glutamate receptor-subtype 1 (mGluR1) gene can cause defects in development and function in the cerebellum. We introduced the mGluR1α transgene into mGluR1-null mutant [mGluR1 (-/-)] mice with a Purkinje cell (PC)-specific promoter. mGluR1-rescue mice showed normal cerebellar long-term depression and regression of multiple climbing fiber innervation, events significantly impaired in mGluR1 (-/-) mice. The impaired motor coordination was rescued by this transgene, in a dose-dependent manner. We propose that mGluR1 in PCs is a key molecule for normal synapse formation, synaptic plasticity, and motor control in the cerebellum.},
  author       = {Ichise, Taeko and Kano, Masanobu and Hashimoto, Kouichi and Yanagihara, Dai and Nakao, Kazuki and Shigemoto, Ryuichi and Katsuki, Motoya and Aiba, Atsu},
  issn         = {0036-8075},
  journal      = {Science},
  number       = {5472},
  pages        = {1832 -- 1835},
  publisher    = {American Association for the Advancement of Science},
  title        = {{mGluR1 in cerebellar Purkinje cells essential for long-term depression, synapse elimination, and motor coordination}},
  doi          = {10.1126/science.288.5472.1832},
  volume       = {288},
  year         = {2000},
}

@article{2602,
  abstract     = {Although presynaptic localization of mGluR7 is well established, the mechanism by which the receptor may control Ca2+ channels in neurons is still unknown. We show here that cultured cerebellar granule cells express native metabotropic glutamate receptor type 7 (mGluR7) in neuritic processes, whereas transfected mGluR7 was also expressed in cell bodies. This allowed us to study the effect of the transfected receptor on somatic Ca2+ channels. In transfected neurons, mGuR7 selectively inhibited P/Q-type Ca2+ channels. The effect was mimicked by GTPγS and blocked by pertussis toxin (PTX) or a selective antibody raised against the G-protein αo subunit, indicating the involvement of a G(o)-like protein. The mGuR7 effect did not display the characteristics of a direct interaction between G-protein βγ subunits and the α1A Ca2+ channel subunit, but was abolished by quenching βγ subunits with specific intracellular peptides. Intracellular dialysis of G-protein βγ subunits did not mimic the action of mGluR7, suggesting that both G-protein βγ and αo subunits were required to mediate the effect. Inhibition of phospholipase C (PLC) blocked the inhibitory action of mGluR7, suggesting that a coincident activation of PLC by the G-protein βγ with αo subunits was required. The Ca2+ chelator BAPTA, as well as inhibition of either the inositol trisphosphate (IP3) receptor or protein kinase C (PKC) abolished the mGluR7 effect. Moreover, activation of native mGluR7 induced a PTX-dependent IP3 formation. These results indicated that IP3-mediated intracellular Ca2+ release was required for PKC-dependent inhibition of the Ca2+ channels. Possible control of synaptic transmission by the present mechanisms is discussed.},
  author       = {Perroy, Julie and Prezèau, Laurent and De Waard, Michel and Shigemoto, Ryuichi and Bockaërt, Joël and Fagni, Laurent},
  issn         = {0270-6474},
  journal      = {Journal of Neuroscience},
  number       = {21},
  pages        = {7896 -- 7904},
  publisher    = {Society for Neuroscience},
  title        = {{Selective blockade of P/Q-type calcium channels by the metabotropic glutamate receptor type 7 involves a phospholipase C pathway in neurons}},
  doi          = {10.1523/JNEUROSCI.20-21-07896.2000},
  volume       = {20},
  year         = {2000},
}

@article{2603,
  abstract     = {Aggregation of neurotransmitter receptors at pre- and postsynaptic structures is crucial for efficient neuronal communication. In contrast to the wealth of information about postsynaptic specializations, little is known about the molecular organization of presynaptic membrane proteins. We show here that the metabotropic glutamate receptor mGluR7a, which localizes specifically to presynaptic active zones, interacts in vitro and in vivo with PICK1. Coexpression in heterologous systems induces coclustering dependent upon the extreme C terminus of mGluR7a and the PDZ domain of PICK1. mGluR7a and PICK1 localize to excitatory synapses in hippocampal neurons. Furthermore, whereas transfected mGluR7a clusters at presynaptic sites, mGluR7aΔ3 lacking the PICK1 binding site targets to axons but does not cluster. These results suggest that PICK1 is a component of the presynaptic machinery involved in mGlUR7a aggregation and in modulation of glutamate neurotransmission.},
  author       = {Boudin, Hélène and Doan, Andrew and Xia, Jun and Shigemoto, Ryuichi and Huganir, Richard and Worley, Paul and Craig, Ann},
  issn         = {0896-6273},
  journal      = {Neuron},
  number       = {2},
  pages        = {485 -- 497},
  publisher    = {Elsevier},
  title        = {{Presynaptic clustering of mGluR7a requires the PICK1 PDZ domain binding site}},
  doi          = {10.1016/S0896-6273(00)00127-6},
  volume       = {28},
  year         = {2000},
}