Search

Your search keyword '"Giral, Erhan"' showing total 2 results
Start Over Author "Giral, Erhan" Topic bioinformatics
2 results on '"Giral, Erhan"'

1. A layout algorithm for undirected compound graphs

Author

Dogrusoz, Ugur, Giral, Erhan, Cetintas, Ahmet, Civril, Ali, and Demir, Emek

Subjects
*DIRECTED graphs, *ALGORITHMS, *DATA visualization, *BIOINFORMATICS, *TOPOLOGY, *GEOMETRY
Abstract

Abstract: We present an algorithm for the layout of undirected compound graphs, relaxing restrictions of previously known algorithms in regards to topology and geometry. The algorithm is based on the traditional force-directed layout scheme with extensions to handle multi-level nesting, edges between nodes of arbitrary nesting levels, varying node sizes, and other possible application-specific constraints. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory. The algorithm has also been successfully implemented as part of a pathway integration and analysis toolkit named PATIKA, for drawing complicated biological pathways with compartmental constraints and arbitrary nesting relations to represent molecular complexes and various types of pathway abstractions. [Copyright &y& Elsevier]

Published
2009
Full Text
View/download PDF

2. A Layout Algorithm For Undirected Compound Graphs

Author

Ahmet Cetintas, Erhan Giral, Ali Çivril, Ugur Dogrusoz, Emek Demir, Doğrusöz, Uğur, Giral, Erhan, Çetintaş, Ahmet, Civril, Ali, and Demir, Emek

Subjects
Information Systems and Management, Theoretical computer science, Bioinformatics, Computer science, Biological pathways, Graph Drawing, Comparability graph, Execution time, Layout algorithms, Layout schemes, Theoretical Computer Science, Information visualization, Information Visualization, Artificial Intelligence, Graph drawing, Photocopying, Compound Graphs, Information systems, Pathway integrations, Visualization, Layout algorithm, Information analysis, business.industry, Application specifics, Force-directed Graph Layout, Graph, Molecular complexes, Computer Science Applications, Graph theory, Arbitrary nesting, Control and Systems Engineering, Graph (abstract data type), Execution times, business, Algorithm, Software
Abstract

Cataloged from PDF version of article. We present an algorithm for the layout of undirected compound graphs, relaxing restrictions of previously known algorithms in regards to topology and geometry. The algorithm is based on the traditional force-directed layout scheme with extensions to handle multi-level nesting, edges between nodes of arbitrary nesting levels, varying node sizes, and other possible application-specific constraints. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory. The algorithm has also been successfully implemented as part of a pathway integration and analysis toolkit named PATIKA, for drawing complicated biological pathways with compartmental constraints and arbitrary nesting relations to represent molecular complexes and various types of pathway abstractions. (C) 2008 Elsevier Inc. All rights reserved.

Published
2009

Catalog

Books, media, physical & digital resources
See catalog results