Graph Representations
Mostrando 1-8 de 8 artigos, teses e dissertações.
-
1. Representações retangulares de grafos planares / Rectangular representations of plane graphs
Uma representação retangular de um grafo plano G é uma representação de G, onde cada vértice é desenhado como um retângulo de modo que dois retângulos devem compartilhar algum segmento de seus lados se e somente se existe uma aresta em G entre os vértices correspondentes aos retângulos. Ainda, a representação de G deve formar um retângulo e nã
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 04/04/2012
-
2. Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes / Efficient Data Structures to Evolutionary Algorithms Applied to Network Design Problems.
Network design problems (NDPs) are very important since they involve several applications from areas of Engineering and Sciences. In order to solve the limitations of traditional algorithms for NDPs that involve real world complex networks (in general, modeled by large-scale complete or sparse graphs), heuristics, such as evolutionary algorithms (EAs), have
Publicado em: 2009
-
3. Sequential and parallel approaches to reduce the data cube size.
Since the introduction of Data Warehouse (DW) and Online Analytical Processing (OLAP) technologies, efficient computation of data cubes has become one of the most relevant and pervasive problems in the DW area. The data cube operator has exponential complexity; therefore, the materialization of a data cube involves both huge amount of memory and substantial
Publicado em: 2009
-
4. EsboÃo do grÃfico de funÃÃo : um estudo semiÃtico
This study aims to investigate students use of different representations while doing function activities, after undertaking a methodological teaching approach based on function graph sketch, in which the geometric perspective is the starting point. The research was theoretically based on the Semiotic Theory of Representation Register of Raymond Duval. In t
Publicado em: 2008
-
5. Uma abordagem para desenho de grafos baseada na utilização de times assincronos
Graph Drawing is a new area that deals with the development of techniques and algorithms whose major concern is the geometric representations of graphs. These geometric representations must follow a set of aesthetic criteria in a "nice" way. The activity of drawing graphs run into many dificulties, for example: the problem of satisfying some aesthetic criter
Publicado em: 1997
-
6. BLAST Filter and GraphAlign: rule-based formation and analysis of sets of related DNA and protein sequences
BLAST Filter and GraphAlign are web-based tools that offer novel methods for building and analyzing sets of related (i.e. similar) DNA and protein sequences. They can be used separately or together. BLAST Filter generates related sequence sets in an automated, objective and reproducible way based on an input query sequence. Sequences matched by BLAST are fil
Oxford University Press.
-
7. KEGG: Kyoto Encyclopedia of Genes and Genomes
KEGG (Kyoto Encyclopedia of Genes and Genomes) is a knowledge base for systematic analysis of gene functions, linking genomic information with higher order functional information. The genomic information is stored in the GENES database, which is a collection of gene catalogs for all the completely sequenced genomes and some partial genomes with up-to-date an
Oxford University Press.
-
8. Computational Identification of Operons in Microbial Genomes
By applying graph representations to biochemical pathways, a new computational pipeline is proposed to find potential operons in microbial genomes. The algorithm relies on the fact that enzyme genes in operons tend to catalyze successive reactions in metabolic pathways. We applied this algorithm to 42 microbial genomes to identify putative operon structures.
Cold Spring Harbor Laboratory Press.