Some problems related to the space of optimal tree reconciliations (invited talk)

DOI10.1007/978-3-030-96731-4_1MaRDI QIDQ2154074zbMATH OpenOpenAlexFDO

Authors Tiziana Calamoneri, Blerina Sinaimeri

Publication date 13 July 2022

Full work available at URL https://doi.org/10.1007/978-3-030-96731-4_1

zbMATH Keywords

clusteringenumeration algorithmstree reconciliationvisualization algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A faster fixed-parameter approach to drawing binary tanglegrams
• Co-divergence and tree topology
• Drawing (complete) binary tanglegrams
• Drawing binary tanglegrams: an experimental evaluation
• Geometric medians in reconciliation spaces of phylogenetic trees
• Jungles: A new solution to the host/parasite phylogeny reconciliation problem
• Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations

Cited in

(1)

• A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Select Tree Topologies

This page was built for publication: Some problems related to the space of optimal tree reconciliations (invited talk)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154074)