Visualizing co-phylogenetic reconciliations

DOI10.1016/j.tcs.2019.12.024zbMath1433.68282arXiv1708.09691OpenAlexW4210270397WikidataQ126328255 ScholiaQ126328255MaRDI QIDQ2310765

Valentino Di Donato, Maurizio Patrignani, Diego Mariottini, Tiziana Calamoneri

Publication date: 6 April 2020

Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.09691

zbMATH Keywords

time-consistencyco-phylogenyreconciliationsspace-filling techniques

Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Some problems related to the space of optimal tree reconciliations (invited talk) ⋮ Algorithms for visualizing phylogenetic networks ⋮ Visualizing multispecies coalescent trees: drawing gene trees inside species trees ⋮ Visualizing co-phylogenetic reconciliations ⋮ Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings

Uses Software

• GDToolkit
• Tanglegrams
• SylvX

Cites Work

• Comparing trees via crossing minimization
• Bioinformatics and computational biology. First international conference, BICoB 2009, New Orleans, LA, USA, April 8--10, 2009. Proceedings
• Jungles: A new solution to the host/parasite phylogeny reconciliation problem
• LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs
• Algorithms for visualizing phylogenetic networks
• Visualizing co-phylogenetic reconciliations
• Drawing (complete) binary tanglegrams
• Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
• A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
• Drawing Binary Tanglegrams: An Experimental Evaluation

This page was built for publication: Visualizing co-phylogenetic reconciliations