Selecting the branches for an evolutionary tree.

DOI10.1016/S0196-6774(03)00086-5MaRDI QIDQ4818669zbMATH OpenOpenAlexFDO

Authors Jonathan Badger, John Tsang, Tao Jiang, Paul Kearney, Ming Li

Publication date 1 October 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0196-6774(03)00086-5

zbMATH Keywords

smooth polynomial integer programs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problems related to evolution (92D15) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 1305446
• Approximation algorithms for tree alignment with a given phylogeny
• A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
• scientific article; zbMATH DE number 1088267
• Minimizing phylogenetic number to find good evolutionary trees

Cited in

(4)

• Convex recolorings of strings and trees: Definitions, hardness results and algorithms
• An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree
• A combinatorial description of the closest tree algorithm for finding evolutionary trees
• Evolutionary trees can be learned in polynomial time in the two-state general Markov model

This page was built for publication: Selecting the branches for an evolutionary tree.

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