A generic algorithm for layout of biological networks

dc.contributor.authorSchreiber, Falk
dc.contributor.authorDwyer, Tim
dc.contributor.authorMarriott, Kim
dc.contributor.authorWybrow, Michael
dc.date.accessioned2017-10-02T08:44:38Z
dc.date.available2017-10-02T08:44:38Z
dc.date.issued2009eng
dc.description.abstractBackground
Biological networks are widely used to represent processes in biological systems and to capture interactions and dependencies between biological entities. Their size and complexity is steadily increasing due to the ongoing growth of knowledge in the life sciences. To aid understanding of biological networks several algorithms for laying out and graphically representing networks and network analysis results have been developed. However, current algorithms are specialized to particular layout styles and therefore different algorithms are required for each kind of network and/or style of layout. This increases implementation effort and means that new algorithms must be developed for new layout styles. Furthermore, additional effort is necessary to compose different layout conventions in the same diagram. Also the user cannot usually customize the placement of nodes to tailor the layout to their particular need or task and there is little support for interactive network exploration.

Results
We present a novel algorithm to visualize different biological networks and network analysis results in meaningful ways depending on network types and analysis outcome. Our method is based on constrained graph layout and we demonstrate how it can handle the drawing conventions used in biological networks.

Conclusion
The presented algorithm offers the ability to produce many of the fundamental popular drawing styles while allowing the exibility of constraints to further tailor these layouts.
eng
dc.description.versionpublishedeng
dc.identifier.doi10.1186/1471-2105-10-375eng
dc.identifier.pmid19909528eng
dc.identifier.ppn494003898
dc.identifier.urihttps://kops.uni-konstanz.de/handle/123456789/40219
dc.language.isoengeng
dc.rightsAttribution 2.0 Generic
dc.rights.urihttp://creativecommons.org/licenses/by/2.0/
dc.subject.ddc004eng
dc.titleA generic algorithm for layout of biological networkseng
dc.typeJOURNAL_ARTICLEeng
dspace.entity.typePublication
kops.citation.bibtex
@article{Schreiber2009gener-40219,
  year={2009},
  doi={10.1186/1471-2105-10-375},
  title={A generic algorithm for layout of biological networks},
  volume={10},
  journal={BMC Bioinformatics},
  author={Schreiber, Falk and Dwyer, Tim and Marriott, Kim and Wybrow, Michael},
  note={Article Number: 375}
}
kops.citation.iso690SCHREIBER, Falk, Tim DWYER, Kim MARRIOTT, Michael WYBROW, 2009. A generic algorithm for layout of biological networks. In: BMC Bioinformatics. 2009, 10, 375. eISSN 1471-2105. Available under: doi: 10.1186/1471-2105-10-375deu
kops.citation.iso690SCHREIBER, Falk, Tim DWYER, Kim MARRIOTT, Michael WYBROW, 2009. A generic algorithm for layout of biological networks. In: BMC Bioinformatics. 2009, 10, 375. eISSN 1471-2105. Available under: doi: 10.1186/1471-2105-10-375eng
kops.citation.rdf
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40219">
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/40219/1/Schreiber_0-425065.pdf"/>
    <dc:creator>Wybrow, Michael</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/40219/1/Schreiber_0-425065.pdf"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/40219"/>
    <dc:contributor>Wybrow, Michael</dc:contributor>
    <dcterms:abstract xml:lang="eng">Background&lt;br /&gt;Biological networks are widely used to represent processes in biological systems and to capture interactions and dependencies between biological entities. Their size and complexity is steadily increasing due to the ongoing growth of knowledge in the life sciences. To aid understanding of biological networks several algorithms for laying out and graphically representing networks and network analysis results have been developed. However, current algorithms are specialized to particular layout styles and therefore different algorithms are required for each kind of network and/or style of layout. This increases implementation effort and means that new algorithms must be developed for new layout styles. Furthermore, additional effort is necessary to compose different layout conventions in the same diagram. Also the user cannot usually customize the placement of nodes to tailor the layout to their particular need or task and there is little support for interactive network exploration.&lt;br /&gt;&lt;br /&gt;Results&lt;br /&gt;We present a novel algorithm to visualize different biological networks and network analysis results in meaningful ways depending on network types and analysis outcome. Our method is based on constrained graph layout and we demonstrate how it can handle the drawing conventions used in biological networks.&lt;br /&gt;&lt;br /&gt;Conclusion&lt;br /&gt;The presented algorithm offers the ability to produce many of the fundamental popular drawing styles while allowing the exibility of constraints to further tailor these layouts.</dcterms:abstract>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-10-02T08:44:38Z</dc:date>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-10-02T08:44:38Z</dcterms:available>
    <dcterms:issued>2009</dcterms:issued>
    <dc:creator>Dwyer, Tim</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Schreiber, Falk</dc:contributor>
    <dc:language>eng</dc:language>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:title>A generic algorithm for layout of biological networks</dcterms:title>
    <dc:rights>Attribution 2.0 Generic</dc:rights>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/2.0/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Dwyer, Tim</dc:contributor>
    <dc:contributor>Marriott, Kim</dc:contributor>
    <dc:creator>Marriott, Kim</dc:creator>
    <dc:creator>Schreiber, Falk</dc:creator>
  </rdf:Description>
</rdf:RDF>
kops.description.openAccessopenaccessgoldeng
kops.flag.knbibliographyfalse
kops.identifier.nbnurn:nbn:de:bsz:352-0-425065
kops.sourcefieldBMC Bioinformatics. 2009, <b>10</b>, 375. eISSN 1471-2105. Available under: doi: 10.1186/1471-2105-10-375deu
kops.sourcefield.plainBMC Bioinformatics. 2009, 10, 375. eISSN 1471-2105. Available under: doi: 10.1186/1471-2105-10-375deu
kops.sourcefield.plainBMC Bioinformatics. 2009, 10, 375. eISSN 1471-2105. Available under: doi: 10.1186/1471-2105-10-375eng
relation.isAuthorOfPublication4a62a6c5-bf37-4efa-a633-4229ff88ed2e
relation.isAuthorOfPublication.latestForDiscovery4a62a6c5-bf37-4efa-a633-4229ff88ed2e
source.bibliographicInfo.articleNumber375eng
source.bibliographicInfo.volume10eng
source.identifier.eissn1471-2105eng
source.periodicalTitleBMC Bioinformaticseng

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
Schreiber_0-425065.pdf
Größe:
3.57 MB
Format:
Adobe Portable Document Format
Beschreibung:
Schreiber_0-425065.pdf
Schreiber_0-425065.pdfGröße: 3.57 MBDownloads: 452

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
3.88 KB
Format:
Item-specific license agreed upon to submission
Beschreibung:
license.txt
license.txtGröße: 3.88 KBDownloads: 0