Faster exact computation of rSPR distance

DOI10.1007/978-3-642-38756-2_7MaRDI QIDQ5405915zbMATH OpenOpenAlexFDO

Authors Zhi-Zhong Chen, Lusheng Wang

Publication date 3 April 2014

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38756-2_7

zbMATH Keywords

fixed-parameter algorithmphylogenetic treerSPR distance

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Problems related to evolution (92D15)

Recommendations

• Faster exact computation of rSPR distance
• Better practical algorithms for rSPR distance and hybridization number
• A cluster reduction for computing the subtree distance between phylogenies
• An improved approximation algorithm for rSPR distance
• Faster computation of the Robinson-Foulds distance between phylogenetic networks

Cited in

(7)

• Faster exact computation of rSPR distance
• Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
• An improved approximation algorithm for rSPR distance
• Better practical algorithms for rSPR distance and hybridization number
• Efficiently inferring pairwise subtree prune-and-regraft adjacencies between phylogenetic trees
• A cluster reduction for computing the subtree distance between phylogenies
• Algorithms for parameterized maximum agreement forest problem on multiple trees

This page was built for publication: Faster exact computation of rSPR distance

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