Selecting the branches for an evolutionary tree.

DOI10.1016/S0196-6774(03)00086-5zbMath1079.68112OpenAlexW1572683371MaRDI QIDQ4818669

John Tsang, Jonathan Badger, Tao Jiang, Ming Li, Paul E. Kearney

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

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

Related Items (1)

Convex recolorings of strings and trees: Definitions, hardness results and algorithms

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