Better Practical Algorithms for rSPR Distance and Hybridization Number
From MaRDI portal
Publication:5091731
DOI10.4230/LIPIcs.WABI.2019.5zbMath1495.92050OpenAlexW2979079658MaRDI QIDQ5091731
Kohei Yamada, Zhi-Zhong Chen, Lusheng Wang
Publication date: 27 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11035/pdf/LIPIcs-WABI-2019-5.pdf/
Problems related to evolution (92D15) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)
Cites Work
- On the computational complexity of the rooted subtree prune and regraft distance
- Faster exact computation of rSPR distance
- An Improved Approximation Algorithm for rSPR Distance
- Fixed-Parameter Algorithms for Maximum Agreement Forests
- A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest
- Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set
- On the complexity of comparing evolutionary trees
This page was built for publication: Better Practical Algorithms for rSPR Distance and Hybridization Number