Visualizing Geophylogenies -- Internal and External Labeling with Phylogenetic Tree Constraints
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916689498603520 |
|---|---|
| author | Klawitter, Jonathan Klesen, Felix Scholl, Joris Y. van Dijk, Thomas C. Zaft, Alexander |
| author_facet | Klawitter, Jonathan Klesen, Felix Scholl, Joris Y. van Dijk, Thomas C. Zaft, Alexander |
| contents | A geophylogeny is a phylogenetic tree (or dendrogram) where each leaf (e.g. biological taxon) has an associated geographic location (site). To clearly visualize a geophylogeny, the tree is typically represented as a crossing-free drawing next to a map. The correspondence between the taxa and the sites is either shown with matching labels on the map (internal labeling) or with leaders that connect each site to the corresponding leaf of the tree (external labeling). In both cases, a good order of the leaves is paramount for understanding the association between sites and taxa. We define several quality measures for internal labeling and give an efficient algorithm for optimizing them. In contrast, minimizing the number of leader crossings in an external labeling is NP-hard. On the positive side, we show that crossing-free instances can be solved in polynomial time and give a fixed-parameter tractable (FPT) algorithm. Furthermore, optimal solutions can be found in a matter of seconds on realistic instances using integer linear programming. Finally, we provide several efficient heuristic algorithms and experimentally show them to be near optimal on real-world and synthetic instances. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_17348 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Visualizing Geophylogenies -- Internal and External Labeling with Phylogenetic Tree Constraints Klawitter, Jonathan Klesen, Felix Scholl, Joris Y. van Dijk, Thomas C. Zaft, Alexander Discrete Mathematics Computational Complexity Combinatorics 68R10, 92D15 A geophylogeny is a phylogenetic tree (or dendrogram) where each leaf (e.g. biological taxon) has an associated geographic location (site). To clearly visualize a geophylogeny, the tree is typically represented as a crossing-free drawing next to a map. The correspondence between the taxa and the sites is either shown with matching labels on the map (internal labeling) or with leaders that connect each site to the corresponding leaf of the tree (external labeling). In both cases, a good order of the leaves is paramount for understanding the association between sites and taxa. We define several quality measures for internal labeling and give an efficient algorithm for optimizing them. In contrast, minimizing the number of leader crossings in an external labeling is NP-hard. On the positive side, we show that crossing-free instances can be solved in polynomial time and give a fixed-parameter tractable (FPT) algorithm. Furthermore, optimal solutions can be found in a matter of seconds on realistic instances using integer linear programming. Finally, we provide several efficient heuristic algorithms and experimentally show them to be near optimal on real-world and synthetic instances. |
| title | Visualizing Geophylogenies -- Internal and External Labeling with Phylogenetic Tree Constraints |
| topic | Discrete Mathematics Computational Complexity Combinatorics 68R10, 92D15 |
| url | https://arxiv.org/abs/2306.17348 |