• Medientyp: E-Artikel; Elektronischer Konferenzbericht; Sonstige Veröffentlichung
  • Titel: A Faster Algorithm for Constructing the Frequency Difference Consensus Tree
  • Beteiligte: Jansson, Jesper [VerfasserIn]; Sung, Wing-Kin [VerfasserIn]; Tabatabaee, Seyed Ali [VerfasserIn]; Yang, Yutong [VerfasserIn]
  • Erschienen: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
  • Sprache: Englisch
  • DOI: https://doi.org/10.4230/LIPIcs.STACS.2024.43
  • Schlagwörter: phylogenetic tree ; tree algorithm ; max-Manhattan Skyline Problem ; centroid path decomposition ; frequency difference consensus tree
  • Entstehung:
  • Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Beschreibung: A consensus tree is a phylogenetic tree that summarizes the evolutionary relationships inferred from a collection of phylogenetic trees with the same set of leaf labels. Among the many types of consensus trees that have been proposed in the last 50 years, the frequency difference consensus tree is one of the more finely resolved types that retains a large amount of information. This paper presents a new deterministic algorithm for constructing the frequency difference consensus tree. Given k phylogenetic trees with identical sets of n leaf labels, it runs in O(knlog{n}) time, improving the best previously known solution.
  • Zugangsstatus: Freier Zugang