Login / Signup
Fast Exact Algorithms for the Closest String and Substring Problems with Application to the Planted (L, d)-Motif Model.
Zhi-Zhong Chen
Lusheng Wang
Published in:
IEEE ACM Trans. Comput. Biol. Bioinform. (2011)
Keyphrases
</>
exact algorithms
objective function
knapsack problem
approximation algorithms
machine learning
special case
cost function
approximation schemes