1 Ocak 2009 Dergi makalesi Açık Erişim

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

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/38827</identifier>
  <creators>
    <creator>
      <creatorName>Dogrusoz, Ugur</creatorName>
      <givenName>Ugur</givenName>
      <familyName>Dogrusoz</familyName>
    </creator>
    <creator>
      <creatorName>Giral, Erhan</creatorName>
      <givenName>Erhan</givenName>
      <familyName>Giral</familyName>
      <affiliation>Tom Sawyer Software, Oakland, CA USA</affiliation>
    </creator>
    <creator>
      <creatorName>Cetintas, Ahmet</creatorName>
      <givenName>Ahmet</givenName>
      <familyName>Cetintas</familyName>
      <affiliation>Bilkent Univ, Dept Comp Engn, TR-06800 Ankara, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Civril, Ali</creatorName>
      <givenName>Ali</givenName>
      <familyName>Civril</familyName>
      <affiliation>Rensselaer Polytech Inst, Troy, NY USA</affiliation>
    </creator>
    <creator>
      <creatorName>Demir, Emek</creatorName>
      <givenName>Emek</givenName>
      <familyName>Demir</familyName>
      <affiliation>Mem Sloan Kettering Canc Ctr, New York, NY 10021 USA</affiliation>
    </creator>
  </creators>
  <titles>
    <title>A Layout Algorithm For Undirected Compound Graphs</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2009</publicationYear>
  <dates>
    <date dateType="Issued">2009-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/38827</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1016/j.ins.2008.11.017</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="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. (C) 2008 Elsevier Inc. All rights reserved.</description>
  </descriptions>
</resource>