Discrete evolution as a method for computing the MAF distance between trees

DOI10.1134/S0032946026020043MaRDI QIDQ7396676zbMATH OpenFDO

Authors Konstantin Yu. Gorbunov, Vassily Lyubetsky

Publication date 2026

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0032946026020043

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A duality based 2-approximation algorithm for maximum agreement forest
• A duality based 2-approximation algorithm for maximum agreement forest
• A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees
• An exact quadratic algorithm for the shortest tree transformation
• Approximating maximum agreement forest on multiple binary trees
• Approximating the maximum agreement forest on k trees
• On the complexity of comparing evolutionary trees
• On the computational complexity of the rooted subtree prune and regraft distance

This page was built for publication: Discrete evolution as a method for computing the MAF distance between trees

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