A lower bound for the breakpoint phylogeny problem.
David BryantPublished in: J. Discrete Algorithms (2004)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- optimal solution
- np hard
- branch and bound
- objective function
- worst case
- lower and upper bounds
- branch and bound method
- lagrangian relaxation
- phylogenetic trees
- lower bounding
- sufficiently accurate
- polynomial approximation
- constant factor
- sequence data
- approximation algorithms
- special case
- learning algorithm