Opioid regulation of Mu receptor internalisation: relevance to the development of tolerance and dependence

Internalisation of the mu opioid receptor from the surface of cells is generally achieved by receptor occupancy with agonist ligands of high efficacy. However, in many situations the potent analgesic morphine fails to promote internalisation effectively and whether there is a direct link between this and the propensity for the sustained use of morphine to result in both tolerance and dependence has been studied intensely. Although frequently described as a partial agonist, this characteristic appears insufficient to explain the poor capacity of morphine to promote internalisation of the mu opioid receptor. Experiments performed using both transfected cell systems and ex vivo/in vivo models have provided evidence that when morphine can promote internalisation of the mu receptor there is a decrease in the development of tolerance and dependence. Although aspects of this model are controversial, such observations suggest a number of approaches to further enhance the use of morphine as an analgesic

Multi-Path Matroids

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural properties. Key elements of this work are two complementary perspectives we develop for these matroids: on the one hand, multi-path matroids are transversal matroids that have special types of presentations; on the other hand, the bases of multi-path matroids can be viewed as sets of lattice paths in certain planar diagrams.Comment: 24 pages; 10 figure

Improving Hickson-like compact group finders in redshift surveys: an implementation in the SDSS

In this work we present an algorithm to identify compact groups (CGs) that closely follows Hickson's original aim and that improves the completeness of the samples of compact groups obtained from redshift surveys. Instead of identifying CGs in projection first and then checking a velocity concordance criterion, we identify them directly in redshift space using Hickson-like criteria. The methodology was tested on a mock lightcone of galaxies built from the outputs of a recent semi-analytic model of galaxy formation run on top of the Millennium Simulation I after scaling to represent the first-year Planck cosmology. The new algorithm identifies nearly twice as many CGs, no longer missing CGs that failed the isolation criterion because of velocity outliers lying in the isolation annulus. The new CG sample picks up lower surface brightness groups, which are both looser and with fainter brightest galaxies, missed by the classic method. A new catalogue of compact groups from the Sloan Digital Sky Survey is the natural corollary of this study. The publicly available sample comprises $462$ observational groups with four or more galaxy members, of which $406$ clearly fulfil all the compact group requirements: compactness, isolation, and velocity concordance of all of their members. The remaining $56$ groups need further redshift information of potentially contaminating sources. This constitutes the largest sample of groups that strictly satisfy all the Hickson's criteria in a survey with available spectroscopic information.Comment: 17 pages, 8 figures, 8 tables. Accepted for publication in Astronomy & Astrophysics. Tables D1 and D2 will be available in electronic form at the CDS via anonymous ftp to cdsarc.u-strasbg.fr (130.79.128.5) or via http://cdsarc.u-strasbg.fr/viz-bin/qcat?J/A+A/ or https://iate.oac.uncor.edu/index.php/alcance-publico/catalogos