A compound graph layout algorithm for biological pathways

Simple item page
buir.contributor.authorDoğrusöz, Uğur
buir.contributor.authorGiral, Erhan
buir.contributor.authorÇetintaş, Ahmet
buir.contributor.authorÇivril, Ali
buir.contributor.authorDemir, Emek
dc.citation.epage447en_US
dc.citation.spage442en_US
dc.contributor.authorDoğrusöz, Uğuren_US
dc.contributor.authorGiral, Erhanen_US
dc.contributor.authorÇetintaş, Ahmeten_US
dc.contributor.authorÇivril, Alien_US
dc.contributor.authorDemir, Emeken_US
dc.coverage.spatialNew York, NY, USAen_US
dc.date.accessioned2016-02-08T11:52:59Z
dc.date.available2016-02-08T11:52:59Zen_US
dc.date.issued2004-09-10en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.departmentBilkent Center for Bioinformatics (BCBI)
dc.descriptionDate of Conference: 29 September - 2 October 2004en_US
dc.descriptionConference name: 12th International Symposium on Graph Drawing, GD 2004en_US
dc.description.abstractWe present a new compound graph layout algorithm based on traditional force-directed layout scheme with extensions for nesting and other application-specific constraints. The algorithm has been successfully implemented within PATIKA, a pathway analysis tool for drawing complicated biological pathways with compartimental constraints and arbitrary nesting relations to represent molecular complexes and pathway abstractions. Experimental results show that execution times and quality of the produced drawings with respect to commonly accepted layout criteria and pathway drawing conventions are quite satisfactory. © Springer-Verlag Berlin Heidelberg 2004.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T11:52:59Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2004en_US
dc.identifier.doi10.1007/978-3-540-31843-9_45en_US
dc.identifier.doi10.1007/b105810en_US
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11693/27422en_US
dc.language.isoEnglishen_US
dc.publisherSpringer, Berlin, Heidelbergen_US
dc.relation.isversionofhttps://doi.org/10.1007/978-3-540-31843-9_45en_US
dc.relation.isversionofhttps://doi.org/10.1007/b105810en_US
dc.source.titleGD'04: Proceedings of the 12th international conference on Graph Drawingen_US
dc.subjectComputer scienceen_US
dc.subjectConstraint theoryen_US
dc.subjectDrawing (graphics)en_US
dc.subjectGraph theoryen_US
dc.subjectArbitrary nestingen_US
dc.subjectBiological pathwaysen_US
dc.subjectCompartimental constraintsen_US
dc.subjectCompound graph layout algorithmsen_US
dc.subjectAlgorithmsen_US
dc.titleA compound graph layout algorithm for biological pathwaysen_US
dc.typeConference Paperen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_compound_graph_layout_algorithm_for_biological_pathways.pdf
Size:
583.39 KB
Format:
Adobe Portable Document Format
Description:
Download

Collections

Scholarly Publications - Computer Engineering
Scholarly Publications - BCBI