Login / Signup

A Linear Bound on the Number of States in Optimal Convex Characters for Maximum Parsimony Distance.

Olivier BoesMareike FischerSteven Kelk
Published in: IEEE ACM Trans. Comput. Biol. Bioinform. (2017)
Keyphrases
  • worst case
  • semi infinite programming
  • piecewise linear
  • machine learning
  • multi objective
  • information extraction
  • dynamic programming
  • upper bound
  • estimation error