Visualisation and navigation methods for typed protein-protein interaction networks
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
Protein-protein interactions form large and complex networks. Their visualisation can aid biologists in gaining new insights about the processes in cells and is, therefore, very useful for building sophisticated research tools. Often standard force-directed graph drawing algorithms are used for the visualisation of these networks. However, currently available visual interfaces to biological databases only show general interactions and cannot cope well with more complex networks with different types of interactions. This paper presents a new approach to the visual analysis of protein-protein interaction networks. It uses a combination of circular and force-directed graph drawing algorithms to compute visual representations of protein networks depending on the type of the selected interaction. Smooth transitions between subsequent drawings enable users to explore different functional clusters in these networks without getting lost in the entire network. The visualisation system has been tested with data from the BRITE database.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
FRIEDRICH, Carsten, Falk SCHREIBER, 2003. Visualisation and navigation methods for typed protein-protein interaction networks. In: Applied Bioinformatics. 2003, 2(3 Suppl.), pp. 19-24. ISSN 1175-5636BibTex
@article{Friedrich2003Visua-40694, year={2003}, title={Visualisation and navigation methods for typed protein-protein interaction networks}, url={https://www.ncbi.nlm.nih.gov/pubmed/15130812}, number={3 Suppl.}, volume={2}, issn={1175-5636}, journal={Applied Bioinformatics}, pages={19--24}, author={Friedrich, Carsten and Schreiber, Falk} }
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/40694"> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-11-22T09:41:33Z</dc:date> <dc:language>eng</dc:language> <dcterms:title>Visualisation and navigation methods for typed protein-protein interaction networks</dcterms:title> <dc:contributor>Friedrich, Carsten</dc:contributor> <dcterms:issued>2003</dcterms:issued> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/40694"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:abstract xml:lang="eng">Protein-protein interactions form large and complex networks. Their visualisation can aid biologists in gaining new insights about the processes in cells and is, therefore, very useful for building sophisticated research tools. Often standard force-directed graph drawing algorithms are used for the visualisation of these networks. However, currently available visual interfaces to biological databases only show general interactions and cannot cope well with more complex networks with different types of interactions. This paper presents a new approach to the visual analysis of protein-protein interaction networks. It uses a combination of circular and force-directed graph drawing algorithms to compute visual representations of protein networks depending on the type of the selected interaction. Smooth transitions between subsequent drawings enable users to explore different functional clusters in these networks without getting lost in the entire network. The visualisation system has been tested with data from the BRITE database.</dcterms:abstract> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:creator>Schreiber, Falk</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-11-22T09:41:33Z</dcterms:available> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Schreiber, Falk</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Friedrich, Carsten</dc:creator> </rdf:Description> </rdf:RDF>