56 research outputs found

    Contours in Visualization

    Get PDF
    This thesis studies the visualization of set collections either via or defines as the relations among contours. In the first part, dynamic Euler diagrams are used to communicate and improve semimanually the result of clustering methods which allow clusters to overlap arbitrarily. The contours of the Euler diagram are rendered as implicit surfaces called blobs in computer graphics. The interaction metaphor is the moving of items into or out of these blobs. The utility of the method is demonstrated on data arising from the analysis of gene expressions. The method works well for small datasets of up to one hundred items and few clusters. In the second part, these limitations are mitigated employing a GPU-based rendering of Euler diagrams and mixing textures and colors to resolve overlapping regions better. The GPU-based approach subdivides the screen into triangles on which it performs a contour interpolation, i.e. a fragment shader determines for each pixel which zones of an Euler diagram it belongs to. The rendering speed is thus increased to allow multiple hundred items. The method is applied to an example comparing different document clustering results. The contour tree compactly describes scalar field topology. From the viewpoint of graph drawing, it is a tree with attributes at vertices and optionally on edges. Standard tree drawing algorithms emphasize structural properties of the tree and neglect the attributes. Adapting popular graph drawing approaches to the problem of contour tree drawing it is found that they are unable to convey this information. Five aesthetic criteria for drawing contour trees are proposed and a novel algorithm for drawing contour trees in the plane that satisfies four of these criteria is presented. The implementation is fast and effective for contour tree sizes usually used in interactive systems and also produces readable pictures for larger trees. Dynamical models that explain the formation of spatial structures of RNA molecules have reached a complexity that requires novel visualization methods to analyze these model\''s validity. The fourth part of the thesis focuses on the visualization of so-called folding landscapes of a growing RNA molecule. Folding landscapes describe the energy of a molecule as a function of its spatial configuration; they are huge and high dimensional. Their most salient features are described by their so-called barrier tree -- a contour tree for discrete observation spaces. The changing folding landscapes of a growing RNA chain are visualized as an animation of the corresponding barrier tree sequence. The animation is created as an adaption of the foresight layout with tolerance algorithm for dynamic graph layout. The adaptation requires changes to the concept of supergraph and it layout. The thesis finishes with some thoughts on how these approaches can be combined and how the task the application should support can help inform the choice of visualization modality

    Recombineering in mycobacteria using mycobacteriophage proteins

    Get PDF
    Genetic manipulations of Mycobacterium tuberculosis are complicated by its slow growth, inefficient DNA uptake, and relatively high levels of illegitimate recombination. Most methods for construction of gene replacement mutants are lengthy and complicated, and the lack of generalized transducing phages that infect M. tuberculosis prevents simple construction of isogenic mutant strains. Characterization and genomic analysis of mycobacteriophages has provided numerous molecular and genetic tools for the mycobacteria. Recently, genes encoding homologues of the Escherichia coli Rac prophage RecET proteins were revealed in the genome of mycobacteriophage Chec9c. RecE and RecT are functional analogues of the phage λ Red recombination proteins, Exo (exonuclease) and Beta (recombinase), respectively. These recombination enzymes act coordinately to promote high levels of recombination in vivo in E. coli and related bacteria using short regions of homology, facilitating the development of a powerful genetic technique called 'recombineering.' Biochemical characterization of Che9c gp60 and gp61 demonstrated that they possess exonuclease and DNA binding activities, respectively, similar to RecET and λ Exo/Beta. Expression of gp60/gp61 in M. smegmatis and M. tuberculosis substantially increases homologous recombination such that 90% of recovered colonies are the desired gene replacement mutants. Further development of this system demonstrated that Che9c gp61 facilitates introduction of selectable and non-selectable point mutations on mycobacterial genomes at high frequencies using short (<50 nt) ssDNA substrates. The mycobacterial recombineering system provides a simple and efficient method for mutagenesis with minimal DNA manipulation. While it is clear that similar phage-encoded recombinase homologues are rare, they can be readily identified by genomic studies and by in vivo characterization. Several putative recombination systems have been identified in mycobacteriophages Halo, BPs, and Giles, and recombineering of drug-resistance point mutations provides an easy assay for recombinase activity. Analysis of recombinases from various phages – including λ Beta and E. coli RecT – indicates that these proteins function best in their native bacteria. The mycobacteriophage-encoded proteins exhibited varying levels of activity, suggesting that analysis of multiple proteins is required to achieve optimal recombination frequencies. The apparent species-specific nature of these recombinases suggests the recombineering technology could likely be extended to any bacterial system through characterization of host-specific bacteriophages

    Algorithms and data structures for grammar-compressed strings

    Get PDF

    In vivo investigations of genetically modified microorganisms using germ-free rats

    Get PDF
    • …
    corecore