Biomedical subjects

L Vawter

Publications and source records attributed to L Vawter.

7 recordsLinked to original sources

PubMed2001

Cloning, expression, and pharmacological characterization of a novel human histamine receptor.

Using a genomics-based reverse pharmacological approach for screening orphan G-protein coupled receptors, we have identified and cloned a novel high-affinity histamine receptor. This receptor, termed AXOR35, is most closely related to the H3 histamine receptor, sharing 37% protein sequence identity. A multiple responsive element/cyclic AMP-responsive element-luciferase reporter assay was used to identify histamine as a ligand for AXOR35. When transfected into human embryonic kidney 293 cells, the AXOR35 receptor showed a strong, dose-dependent calcium mobilization response to histamine and H3 receptor agonists including imetit and immepip. Radioligand binding confirmed that the AXOR35 receptor was a high-affinity histamine receptor. The pharmacology of the AXOR35 receptor was found to closely resemble that of the H3 receptor; the major difference was that (R)-alpha-methylhistamine was a low potency agonist of the AXOR35 receptor. Thioperamide is an antagonist at AXOR 35. Expression of AXOR35 mRNA in human tissues is highest in peripheral blood mononuclear cells and in tissues likely to contain high concentrations of blood cells, such as bone marrow and lung. In situ hybridization analysis of a wide survey of mouse tissues showed that mouse AXOR35 mRNA is selectively expressed in hippocampus. The identification and localization of this new histamine receptor will expand our understanding of the physiological and pathological roles of histamine and may provide additional opportunities for pharmacological modification of these actions.

Amino Acid Sequence↗

PubMed2000

Neuromedin U is a potent agonist at the orphan G protein-coupled receptor FM3.

Neuromedins are a family of peptides best known for their contractile activity on smooth muscle preparations. The biological mechanism of action of neuromedin U remains unknown, despite the fact that the peptide was first isolated in 1985. Here we show that neuromedin U potently activates the orphan G protein-coupled receptor FM3, with subnanomolar potency, when FM3 is transiently expressed in human HEK-293 cells. Neuromedins B, C, K, and N are all inactive at this receptor. Quantitative reverse transcriptase-polymerase chain reaction analysis of neuromedin U expression in a range of human tissues showed that the peptide is highly expressed in the intestine, pituitary, and bone marrow, with lower levels of expression seen in stomach, adipose tissue, lymphocytes, spleen, and the cortex. Similar analysis of FM3 expression showed that the receptor is widely expressed in human tissue with highest levels seen in adipose tissue, intestine, spleen, and lymphocytes, suggesting that neuromedin U may have a wide range of presently undetermined physiological effects. The discovery that neuromedin U is an endogenous agonist for FM3 will significantly aid the study of the full physiological role of this peptide.

Calcium↗

PubMed2000

A G protein-coupled receptor for UDP-glucose.

Uridine 5'-diphosphoglucose (UDP-glucose) has a well established biochemical role as a glycosyl donor in the enzymatic biosynthesis of carbohydrates. It is less well known that UDP-glucose may possess pharmacological activity, suggesting that a receptor for this molecule may exist. Here, we show that UDP-glucose, and some closely related molecules, potently activate the orphan G protein-coupled receptor KIAA0001 heterologously expressed in yeast or mammalian cells. Nucleotides known to activate P2Y receptors were inactive, indicating the distinctly novel pharmacology of this receptor. The receptor is expressed in a wide variety of human tissues, including many regions of the brain. These data suggest that some sugar-nucleotides may serve important physiological roles as extracellular signaling molecules in addition to their familiar role in intermediary metabolism.

GTP-Binding Proteins↗

PubMed1999

Solving large scale phylogenetic problems using DCM2.

In an earlier paper, we described a new method for phylogenetic tree reconstruction called the Disk Covering Method, or DCM. This is a general method which can be used with any existing phylogenetic method in order to improve its performance. We showed analytically and experimentally that when DCM is used in conjunction with polynomial time distance-based methods, it improves the accuracy of the trees reconstructed. In this paper, we discuss a variant on DCM, that we call DCM2. DCM2 is designed to be used with phylogenetic methods whose objective is the solution of NP-hard optimization problems. We show that DCM2 can be used to accelerate searches for Maximum Parsimony trees. We also motivate the need for solutions to NP-hard optimization problems by showing that on some very large and important datasets, the most popular (and presumably best performing) polynomial time distance methods have poor accuracy.

Databases, Factual↗

PubMed1993

Rates and patterns of base change in the small subunit ribosomal RNA gene.

The small subunit ribosomal RNA gene (srDNA) has been used extensively for phylogenetic analyses. One common assumption in these analyses is that substitution rates are biased toward transitions. We have developed a simple method for estimating relative rates of base change that does not assume rate constancy and takes into account base composition biases in different structures and taxa. We have applied this method to srDNA sequences from taxa with a noncontroversial phylogeny to measure relative rates of evolution in various structural regions of srRNA and relative rates of the different transitions and transversions. We find that: (1) the long single-stranded regions of the RNA molecule evolve slowest, (2) biases in base composition associated with structure and phylogenetic position exist, and (3) the srDNAs studied lack a consistent transition/transversion bias. We have made suggestions based on these findings for refinement of phylogenetic analyses using srDNA data.

Animals↗

PubMed1986

Nuclear and mitochondrial DNA comparisons reveal extreme rate variation in the molecular clock.

The discovery that the rate of evolution of vertebrate mitochondrial DNA is rapid, compared to the rate for vertebrate nuclear DNA, has resulted in its widespread use in evolutionary studies. Comparison of mitochondrial and nuclear DNA divergences among echinoid and vertebrate taxa of similar ages indicates that the rapid rate of vertebrate mitochondrial DNA evolution is, in part, an artifact of a widely divergent rate of nuclear DNA evolution. This disparity in relative rates of mitochondrial and nuclear DNA divergence suggests that the controls and constraints under which the mitochondrial and nuclear genomes operate are evolving independently, and provides evidence that is independent of fossil dating for a robust rejection of a generalized molecular clock hypothesis of DNA evolution.

Animals↗

PubMedDate not supplied

Ligand-receptor pairing via tree comparison.

This paper introduces a novel class of tree comparison problems strongly motivated by an important and cost intensive step in drug discovery pipeline viz., mapping cell bound receptors to the ligands they bind to and vice versa. Tree comparison studies motivated by problems such as virus-host tree comparison, gene-species tree comparison and consensus tree problem have been reported. None of these studies are applicable in our context because in all these problems, there is a well-defined mapping of the nodes the trees are built on across the set of trees being compared. A new class of tree comparison problems arises in cases where finding the correspondence among the nodes of the trees being compared is itself the problem. The problem arises while trying to find the interclass correspondence between the members of a pair of coevolving classes, e.g., cell bound receptors and their ligands. Given the evolution of the two classes, the combinatorial problem is to find a mapping among the leaves of the two trees that optimizes a given cost function. In this work we formulate various combinatorial optimization problems motivated by the aforementioned biological problem for the first time. We present hardness results, give an efficient algorithm for a restriction of the problem and demonstrate its applicability.

Algorithms↗