La contaminación por plaguicidas percibida por los inspectores de saneamiento ambiental

No disponible/Not availabl

HAMSTER: visualizing microarray experiments as a set of minimum spanning trees

<p>Abstract</p> <p>Background</p> <p>Visualization tools allow researchers to obtain a global view of the interrelationships between the probes or experiments of a gene expression (<it>e.g. microarray</it>) data set. Some existing methods include hierarchical clustering and k-means. In recent years, others have proposed applying minimum spanning trees (MST) for microarray clustering. Although MST-based clustering is formally equivalent to the dendrograms produced by hierarchical clustering under certain conditions; visually they can be quite different.</p> <p>Methods</p> <p>HAMSTER (Helpful Abstraction using Minimum Spanning Trees for Expression Relations) is an open source system for generating a <b>set </b>of MSTs from the experiments of a microarray data set. While previous works have generated a single MST from a data set for data clustering, we recursively merge experiments and repeat this process to obtain a set of MSTs for data visualization. Depending on the parameters chosen, each tree is analogous to a snapshot of one step of the hierarchical clustering process. We scored and ranked these trees using one of three proposed schemes. HAMSTER is implemented in C++ and makes use of Graphviz for laying out each MST.</p> <p>Results</p> <p>We report on the running time of HAMSTER and demonstrate using data sets from the NCBI Gene Expression Omnibus (GEO) that the images created by HAMSTER offer insights that differ from the dendrograms of hierarchical clustering. In addition to the C++ program which is available as open source, we also provided a web-based version (HAMSTER⁺) which allows users to apply our system through a web browser without any computer programming knowledge.</p> <p>Conclusion</p> <p>Researchers may find it helpful to include HAMSTER in their microarray analysis workflow as it can offer insights that differ from hierarchical clustering. We believe that HAMSTER would be useful for certain types of gradient data sets (e.g time-series data) and data that indicate relationships between cells/tissues. Both the source and the web server variant of HAMSTER are available from <url>http://hamster.cbrc.jp/</url>.</p

Cortical depth dependent functional responses in humans at 7T: improved specificity with 3D GRASE

Ultra high fields (7T and above) allow functional imaging with high contrast-to-noise ratios and improved spatial resolution. This, along with improved hardware and imaging techniques, allow investigating columnar and laminar functional responses. Using gradient-echo (GE) (T2* weighted) based sequences, layer specific responses have been recorded from human (and animal) primary visual areas. However, their increased sensitivity to large surface veins potentially clouds detecting and interpreting layer specific responses. Conversely, spin-echo (SE) (T2 weighted) sequences are less sensitive to large veins and have been used to map cortical columns in humans. T2 weighted 3D GRASE with inner volume selection provides high isotropic resolution over extended volumes, overcoming some of the many technical limitations of conventional 2D SE-EPI, whereby making layer specific investigations feasible. Further, the demonstration of columnar level specificity with 3D GRASE, despite contributions from both stimulated echoes and conventional T2 contrast, has made it an attractive alternative over 2D SE-EPI. Here, we assess the spatial specificity of cortical depth dependent 3D GRASE functional responses in human V1 and hMT by comparing it to GE responses. In doing so we demonstrate that 3D GRASE is less sensitive to contributions from large veins in superficial layers, while showing increased specificity (functional tuning) throughout the cortex compared to GE

Carbon Sequestration in Synechococcus Sp.: From Molecular Machines to Hierarchical Modeling

The U.S. Department of Energy recently announced the first five grants for the Genomes to Life (GTL) Program. The goal of this program is to "achieve the most far-reaching of all biological goals: a fundamental, comprehensive, and systematic understanding of life." While more information about the program can be found at the GTL website (www.doegenomestolife.org), this paper provides an overview of one of the five GTL projects funded, "Carbon Sequestration in Synechococcus Sp.: From Molecular Machines to Hierarchical Modeling." This project is a combined experimental and computational effort emphasizing developing, prototyping, and applying new computational tools and methods to ellucidate the biochemical mechanisms of the carbon sequestration of Synechococcus Sp., an abundant marine cyanobacteria known to play an important role in the global carbon cycle. Understanding, predicting, and perhaps manipulating carbon fixation in the oceans has long been a major focus of biological oceanography and has more recently been of interest to a broader audience of scientists and policy makers. It is clear that the oceanic sinks and sources of CO2 are important terms in the global environmental response to anthropogenic atmospheric inputs of CO2 and that oceanic microorganisms play a key role in this response. However, the relationship between this global phenomenon and the biochemical mechanisms of carbon fixation in these microorganisms is poorly understood. The project includes five subprojects: an experimental investigation, three computational biology efforts, and a fifth which deals with addressing computational infrastructure challenges of relevance to this project and the Genomes to Life program as a whole. Our experimental effort is designed to provide biology and data to drive the computational efforts and includes significant investment in developing new experimental methods for uncovering protein partners, characterizing protein complexes, identifying new binding domains. We will also develop and apply new data measurement and statistical methods for analyzing microarray experiments. Our computational efforts include coupling molecular simulation methods with knowledge discovery from diverse biological data sets for high-throughput discovery and characterization of protein-protein complexes and developing a set of novel capabilities for inference of regulatory pathways in microbial genomes across multiple sources of information through the integration of computational and experimental technologies. These capabilities will be applied to Synechococcus regulatory pathways to characterize their interaction map and identify component proteins in these pathways. We will also investigate methods for combining experimental and computational results with visualization and natural language tools to accelerate discovery of regulatory pathways. Furthermore, given that the ultimate goal of this effort is to develop a systems-level of understanding of how the Synechococcus genome affects carbon fixation at the global scale, we will develop and apply a set of tools for capturing the carbon fixation behavior of complex of Synechococcus at different levels of resolution. Finally, because the explosion of data being produced by high-throughput experiments requires data analysis and models which are more computationally complex, more heterogeneous, and require coupling to ever increasing amounts of experimentally obtained data in varying formats, we have also established a companion computational infrastructure to support this effort as well as the Genomes to Life program as a whole.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/63164/1/153623102321112746.pd

Hypoxia regulates human lung fibroblast proliferation via p53-dependent and -independent pathways

<p>Abstract</p> <p>Background</p> <p>Hypoxia induces the proliferation of lung fibroblasts in vivo and in vitro. However, the subcellular interactions between hypoxia and expression of tumor suppressor p53 and cyclin-dependent kinase inhibitors p21 and p27 remain unclear.</p> <p>Methods</p> <p>Normal human lung fibroblasts (NHLF) were cultured in a hypoxic chamber or exposed to desferroxamine (DFX). DNA synthesis was measured using bromodeoxyuridine incorporation, and expression of p53, p21 and p27 was measured using real-time RT-PCR and Western blot analysis.</p> <p>Results</p> <p>DNA synthesis was increased by moderate hypoxia (2% oxygen) but was decreased by severe hypoxia (0.1% oxygen) and DFX. Moderate hypoxia decreased p21 synthesis without affecting p53 synthesis, whereas severe hypoxia and DFX increased synthesis of both p21 and p53. p27 protein expression was decreased by severe hypoxia and DFX. Gene silencing of p21 and p27 promoted DNA synthesis at ambient oxygen concentrations. p21 and p53 gene silencing lessened the decrease in DNA synthesis due to severe hypoxia or DFX exposure. p21 gene silencing prevented increased DNA synthesis in moderate hypoxia. p27 protein expression was significantly increased by p53 gene silencing, and was decreased by wild-type p53 gene transfection.</p> <p>Conclusion</p> <p>These results indicate that in NHLF, severe hypoxia leads to cell cycle arrest via the p53-p21 pathway, but that moderate hypoxia enhances cell proliferation via the p21 pathway in a p53-independent manner. In addition, our results suggest that p27 may be involved in compensating for p53 in cultured NHLF proliferation.</p

Intelligence, educational attainment, and brain structure in those at familial high-risk for schizophrenia or bipolar disorder

First-degree relatives of patients diagnosed with schizophrenia (SZ-FDRs) show similar patterns of brain abnormalities and cognitive alterations to patients, albeit with smaller effect sizes. First-degree relatives of patients diagnosed with bipolar disorder (BD-FDRs) show divergent patterns; on average, intracranial volume is larger compared to controls, and findings on cognitive alterations in BD-FDRs are inconsistent. Here, we performed a meta-analysis of global and regional brain measures (cortical and subcortical), current IQ, and educational attainment in 5,795 individuals (1,103 SZ-FDRs, 867 BD-FDRs, 2,190 controls, 942 schizophrenia patients, 693 bipolar patients) from 36 schizophrenia and/or bipolar disorder family cohorts, with standardized methods. Compared to controls, SZ-FDRs showed a pattern of widespread thinner cortex, while BD-FDRs had widespread larger cortical surface area. IQ was lower in SZ-FDRs (d = −0.42, p = 3 × 10−5), with weak evidence of IQ reductions among BD-FDRs (d = −0.23, p =.045). Both relative groups had similar educational attainment compared to controls. When adjusting for IQ or educational attainment, the group-effects on brain measures changed, albeit modestly. Changes were in the expected direction, with less pronounced brain abnormalities in SZ-FDRs and more pronounced effects in BD-FDRs. To conclude, SZ-FDRs and BD-FDRs show a differential pattern of structural brain abnormalities. In contrast, both had lower IQ scores and similar school achievements compared to controls. Given that brain differences between SZ-FDRs and BD-FDRs remain after adjusting for IQ or educational attainment, we suggest that differential brain developmental processes underlying predisposition for schizophrenia or bipolar disorder are likely independent of general cognitive impairment

Optimal reconstruction of a surface using a reference library

To reconstruct (approximate) an arbitrary surface using subsurfaces (patches) from a library of surfaces in an optimal way is an interesting algorithmic problem and has many applications in image processing. This paper presents an efficient algorithm for an optimal reconstruction of a query surface using patches from a reference library of surfaces, under the constraint that the smallest patch size is above some specified value. In this algorithm, a surface is given as an integer function f(x, y) over a finite 2-D grid. The algorithm partitions a query surface into patches in such a way that each patch is represented by a similar patch from a library surface, and the total difference between the query surface and the representing (composite) surface is minimized, where the boundary of a patch is not pre-determined but solely determined by the optimization process. By using a minimum spanning tree-based data structure, this optimization problem can be solved efficiently. An application of this technique in computational forensics is outlined

A segmentation algorithm for noisy images

This paper presents a 2-D image segmentation algorithm and addresses issues related to its performance on noisy images. The algorithm segments an image by first constructing a minimum spanning tree representation of the image and then partitioning the spanning tree into sub-trees representing different homogeneous regions. The spanning tree is partitioned in such a way that the sum of gray-level variations over all partitioned subtrees is minimized under the constraints that each subtree has at least a specified number of pixels and two adjacent subtrees have significantly different ``average`` gray-levels. Two types of noise, transmission errors and Gaussian additive noise. are considered and their effects on the segmentation algorithm are studied. Evaluation results have shown that the segmentation algorithm is robust in the presence of these two types of noise