On the linear-cost subtree-transfer distance between phylogenetic trees

DOI10.1007/PL00008273zbMath0952.68113MaRDI QIDQ1125442

Xin He, Ming Li, Tao Jiang, John Tromp, Bhaskar Das Gupta

Publication date: 14 January 2001

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

evolutionary treesphylogenetic trees

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees ⋮ A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs ⋮ SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES ⋮ Computing nearest neighbour interchange distances between ranked phylogenetic trees ⋮ Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation ⋮ Fixed topology alignment with recombination

This page was built for publication: On the linear-cost subtree-transfer distance between phylogenetic trees