Drawing Phylogenetic Trees : (Extended Abstract)

Bachmaier, Christian; Brandes, Ulrik; Schlieper, Barbara

Drawing Phylogenetic Trees : (Extended Abstract)

Dateien

bbs_dpt_05.pdfGröße: 344.28 KBDownloads: 844

Datum

2005

Autor:innen

Bachmaier, Christian

Brandes, Ulrik

Schlieper, Barbara

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

DENG, Xiaotie, ed., Ding-Zhu DU, ed.. Algorithms and Computation. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 1110-1121. Lecture Notes in Computer Science. 3827. ISBN 978-3-540-30935-2. Available under: doi: 10.1007/11602613_110

Zusammenfassung

We present linear-time algorithms for drawing phylogenetic trees in radial and circular representations. In radial drawings given edge lengths (representing evolutionary distances) are preserved, but labels (names of taxons represented in the leaves) need to be adjusted, whereas in circular drawings labels are perfectly spread out, but edge lengths adjusted. Our algorithms produce drawings that are unique solutions to reasonable criteria and assign to each subtree a wedge of its own. The linear running time is particularly interesting in the circular case, because our approach is a special case of Tutte s barycentric layout algorithm involving the solution of a system of linear equations.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

BACHMAIER, Christian, Ulrik BRANDES, Barbara SCHLIEPER, 2005. Drawing Phylogenetic Trees : (Extended Abstract). In: DENG, Xiaotie, ed., Ding-Zhu DU, ed.. Algorithms and Computation. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 1110-1121. Lecture Notes in Computer Science. 3827. ISBN 978-3-540-30935-2. Available under: doi: 10.1007/11602613_110

BibTex

@inproceedings{Bachmaier2005Drawi-5941,
  year={2005},
  doi={10.1007/11602613_110},
  title={Drawing Phylogenetic Trees : (Extended Abstract)},
  number={3827},
  isbn={978-3-540-30935-2},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Algorithms and Computation},
  pages={1110--1121},
  editor={Deng, Xiaotie and Du, Ding-Zhu},
  author={Bachmaier, Christian and Brandes, Ulrik and Schlieper, Barbara}
}

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/5941">
    <dc:contributor>Schlieper, Barbara</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5941/1/bbs_dpt_05.pdf"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:contributor>Bachmaier, Christian</dc:contributor>
    <dc:creator>Bachmaier, Christian</dc:creator>
    <dcterms:issued>2005</dcterms:issued>
    <dcterms:abstract xml:lang="eng">We present linear-time algorithms for drawing phylogenetic trees in radial and circular representations. In radial drawings given edge lengths (representing evolutionary distances) are preserved, but labels (names of taxons represented in the leaves) need to be adjusted, whereas in circular drawings labels are perfectly spread out, but edge lengths adjusted. Our algorithms produce drawings that are unique solutions to reasonable criteria and assign to each subtree a wedge of its own. The linear running time is particularly interesting in the circular case, because our approach is a special case of Tutte s barycentric layout algorithm involving the solution of a system of linear equations.</dcterms:abstract>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5941"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:rights>terms-of-use</dc:rights>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:title>Drawing Phylogenetic Trees : (Extended Abstract)</dcterms:title>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dcterms:bibliographicCitation>First publ. in: Proceedings of the 16th International Symposium Algorithms and Computation (ISAAC ´05) (LNCS 3827), 2005, pp. 1110-1121</dcterms:bibliographicCitation>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5941/1/bbs_dpt_05.pdf"/>
    <dc:format>application/pdf</dc:format>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:31Z</dcterms:available>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:31Z</dc:date>
    <dc:creator>Schlieper, Barbara</dc:creator>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja