• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 7
  • 1
  • 1
  • 1
  • Tagged with
  • 12
  • 12
  • 4
  • 4
  • 4
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

Modern Methods for Tree Graph Structures Rendering / Modern Methods for Tree Graph Structures Rendering

Zajíc, Jiří January 2013 (has links)
Tento projekt se věnuje problematice zobrazení velkých hierarchických struktur, zejména možnostem vizualizace stromových grafů. Cílem je implementace hyperbolického prohlížeče ve webovém prostředí, který využívá potenciálu neeukleidovské geometrie k promítnutí stromu na hyperbolickou rovinu. Velký důraz je kladen na uživatelsky přívětivou manipulaci se zobrazovaným modelem a snadnou orientaci.
12

A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network.

Koessler, Denise Renee 08 May 2010 (has links) (PDF)
In this work we use a graph-theoretic representation of secondary RNA structure found in the database RAG: RNA-As-Graphs. We model the bonding of two RNA secondary structures to form a larger structure with a graph operation called merge. The resulting data from each tree merge operation is summarized and represented by a vector. We use these vectors as input values for a neural network and train the network to recognize a tree as RNA-like or not based on the merge data vector. The network correctly assigned a high probability of RNA-likeness to trees identified as RNA-like in the RAG database, and a low probability of RNA-likeness to those classified as not RNA-like in the RAG database. We then used the neural network to predict the RNA-likeness of all the trees of order 9. The use of a graph operation to theoretically describe the bonding of secondary RNA is novel.

Page generated in 0.0708 seconds