Publikation: Computing a consensus of multilabeled trees
Lade...
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2013
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
BADER, David A., ed., Dort MUTZEL, ed.. 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Philadelphia, PA: SIAM, 2013, pp. 84-92. ISBN 978-1-61197-212-2. Available under: doi: 10.1137/1.9781611972924.9
Zusammenfassung
In this paper we consider two challenging problems that arise in the context of computing a consensus of a collection of multilabeled trees, namely (1) selecting a compatible collection of clusters on a multiset from an ordered list of such clusters and (2) optimally refining high degree vertices in a multilabeled tree. Forming such a consensus is part of an approach to reconstruct the evolutionary history of a set of species for which events such as genome duplication and hybridization have occurred in the past. We present exact algorithms for solving (1) and (2) that have an exponential runtime in the worst case. To give some impression of their performance in practice, we apply them to simulated input and to a real biological data set highlighting the impact of several structural properties of the input on the performance.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
The Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 16. Jan. 2012, Kyoto, Japan
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
HUBER, Katharina T., Vincent MOULTON, Andreas SPILLNER, Sabine STORANDT, Radoslaw SUCHECKI, 2013. Computing a consensus of multilabeled trees. The Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Kyoto, Japan, 16. Jan. 2012. In: BADER, David A., ed., Dort MUTZEL, ed.. 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Philadelphia, PA: SIAM, 2013, pp. 84-92. ISBN 978-1-61197-212-2. Available under: doi: 10.1137/1.9781611972924.9BibTex
@inproceedings{Huber2013-12-18Compu-45924,
year={2013},
doi={10.1137/1.9781611972924.9},
title={Computing a consensus of multilabeled trees},
isbn={978-1-61197-212-2},
publisher={SIAM},
address={Philadelphia, PA},
booktitle={2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX)},
pages={84--92},
editor={Bader, David A. and Mutzel, Dort},
author={Huber, Katharina T. and Moulton, Vincent and Spillner, Andreas and Storandt, Sabine and Suchecki, Radoslaw}
}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/45924">
<dcterms:title>Computing a consensus of multilabeled trees</dcterms:title>
<dc:contributor>Storandt, Sabine</dc:contributor>
<dc:contributor>Suchecki, Radoslaw</dc:contributor>
<dcterms:issued>2013-12-18</dcterms:issued>
<dc:contributor>Spillner, Andreas</dc:contributor>
<dc:creator>Spillner, Andreas</dc:creator>
<dc:contributor>Moulton, Vincent</dc:contributor>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/45924"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:creator>Storandt, Sabine</dc:creator>
<dc:contributor>Huber, Katharina T.</dc:contributor>
<dc:language>eng</dc:language>
<dcterms:abstract xml:lang="eng">In this paper we consider two challenging problems that arise in the context of computing a consensus of a collection of multilabeled trees, namely (1) selecting a compatible collection of clusters on a multiset from an ordered list of such clusters and (2) optimally refining high degree vertices in a multilabeled tree. Forming such a consensus is part of an approach to reconstruct the evolutionary history of a set of species for which events such as genome duplication and hybridization have occurred in the past. We present exact algorithms for solving (1) and (2) that have an exponential runtime in the worst case. To give some impression of their performance in practice, we apply them to simulated input and to a real biological data set highlighting the impact of several structural properties of the input on the performance.</dcterms:abstract>
<dc:creator>Moulton, Vincent</dc:creator>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-05-28T11:37:49Z</dc:date>
<dc:creator>Huber, Katharina T.</dc:creator>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:creator>Suchecki, Radoslaw</dc:creator>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-05-28T11:37:49Z</dcterms:available>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
