University of New Mexico

About: University of New Mexico is a education organization based out in Albuquerque, New Mexico, United States. It is known for research contribution in the topics: Population & Poison control. The organization has 28870 authors who have published 64767 publications receiving 2578371 citations. The organization is also known as: UNM & Universitatis Novus Mexico.

MicroRNA miR-137 regulates neuronal maturation by targeting ubiquitin ligase Mind Bomb-1

Abstract: The maturation of young neurons is regulated by complex mechanisms and dysregulation of this process is frequently found in neurodevepmental disorders. MicroRNAs have been implicated in several steps of neuronal maturation including dendritic and axonal growth, spine development, and synaptogenesis. We demonstrate that one brain-enriched microRNA, miR-137, has a significant role in regulating neuronal maturation. Overexpression of miR-137 inhibits dendritic morphogenesis, phenotypic maturation, and spine development both in brain and cultured primary neurons. On the other hand, a reduction in miR-137 had opposite effects. We further show that miR-137 targets the Mind bomb one (Mib1) protein through the conserved target site located in the 3' untranslated region of Mib1 messenger RNA. Mib1 is an ubiquitin ligase known to be important for neurodevelopment. We show that exogenously expressed Mib1 could partially rescue the phenotypes associated with miR-137 overexpression. These results demonstrate a novel miRNA-mediated mechanism involving miR-137 and Mib1 that function to regulate neuronal maturation and dendritic morphogenesis during development.

Evaluating the Advocacy Coalition Framework

Abstract: The Advocacy Coalition Framework (ACF) was developed to provide a causal theory of the policy process which would serve as one of several alternatives to the familiar stages heuristic, with its recognized limitations. This paper first summarizes the central features of the ACF, including a set of underlying assumptions and specific hypotheses. We next review the implications for the framework of six case studies by various authors dealing with Canadian education and with American transportation, telecommunications, water, environmental, and energy policy. While generally supportive of the ACF, the case studies also suggest several revisions.

A linear-time algorithm for computing inversion distance between signed permutations with an experimental study.

Abstract: Hannenhalli and Pevzner gave the first polynomial-time algorithm for computing the inversion distance between two signed permutations, as part of the larger task of determining the shortest sequence of inversions needed to transform one permutation into the other. Their algorithm (restricted to distance calculation) proceeds in two stages: in the first stage, the overlap graph induced by the permutation is decomposed into connected components; then, in the second stage, certain graph structures (hurdles and others) are identified. Berman and Hannenhalli avoided the explicit computation of the overlap graph and gave an O(nalpha(n)) algorithm, based on a Union-Find structure, to find its connected components, where alpha is the inverse Ackerman function. Since for all practical purposes alpha(n) is a constant no larger than four, this algorithm has been the fastest practical algorithm to date. In this paper, we present a new linear-time algorithm for computing the connected components, which is more efficient than that of Berman and Hannenhalli in both theory and practice. Our algorithm uses only a stack and is very easy to implement. We give the results of computational experiments over a large range of permutation pairs produced through simulated evolution; our experiments show a speed-up by a factor of 2 to 5 in the computation of the connected components and by a factor of 1.3 to 2 in the overall distance computation.