Drawing Phylogenetic Trees : (Extended Abstract)

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:57aa1dc35840f1829f2dc21c1bf064a4

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, pp. 1110-1121. ISBN 978-3-540-30935-2. Available under: doi: 10.1007/11602613_110

@inproceedings{Bachmaier2005Drawi-5941, title={Drawing Phylogenetic Trees : (Extended Abstract)}, year={2005}, doi={10.1007/11602613_110}, number={3827}, isbn={978-3-540-30935-2}, address={Berlin, Heidelberg}, publisher={Springer 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 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/rdf/resource/123456789/5941"> <dc:contributor>Schlieper, Barbara</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:creator>Bachmaier, Christian</dc:creator> <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:rights>deposit-license</dc:rights> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:31Z</dc:date> <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:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:31Z</dcterms:available> <dc:contributor>Brandes, Ulrik</dc:contributor> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dc:creator>Brandes, Ulrik</dc:creator> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5941"/> <dcterms:issued>2005</dcterms:issued> <dc:creator>Schlieper, Barbara</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5941/1/bbs_dpt_05.pdf"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5941/1/bbs_dpt_05.pdf"/> <dcterms:title>Drawing Phylogenetic Trees : (Extended Abstract)</dcterms:title> <dc:contributor>Bachmaier, Christian</dc:contributor> <dc:format>application/pdf</dc:format> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:language>eng</dc:language> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

bbs_dpt_05.pdf 244

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto