An improved approximation algorithm for rSPR distance

DOI10.1007/978-3-319-42634-1_38MaRDI QIDQ2817889zbMATH OpenOpenAlexFDO

Authors Zhi-Zhong Chen, Eita MacHida, Lusheng Wang

Publication date 2 September 2016

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

Full work available at URL https://doi.org/10.1007/978-3-319-42634-1_38

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Problems related to evolution (92D15)

Recommendations

• Faster exact computation of rSPR distance
• Better practical algorithms for rSPR distance and hybridization number
• A 3-approximation algorithm for the subtree distance between phylogenies
• Faster exact computation of rSPR distance
• A duality based 2-approximation algorithm for maximum agreement forest

Cites work

• A 3-approximation algorithm for the subtree distance between phylogenies
• Bounding the number of hybridisation events for a consistent evolutionary history
• Faster exact computation of rSPR distance
• Fitting distances by tree metrics with increment error
• Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees
• On the complexity of comparing evolutionary trees
• On the computational complexity of the rooted subtree prune and regraft distance
• The maximum agreement forest problem: Approximation algorithms and computational experiments

Cited in

(5)

• A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
• Faster exact computation of rSPR distance
• A duality based 2-approximation algorithm for maximum agreement forest
• Better practical algorithms for rSPR distance and hybridization number
• Faster exact computation of rSPR distance

Describes a project that uses

Uses Software

• FastHN
• rSPR

This page was built for publication: An improved approximation algorithm for rSPR distance

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