分支限界法类似于回溯法，也是一种在问题的解空间树T上搜索问题解的算法-Branch and bound method is similar to retroactive law, is also a solution in the problem search space tree T on the issue of solution algorithm

该gsuffix库实现枚举的字符串搜索使用 serveral的算法。它采用了后缀树和后缀数组的数据结构，以及一些其他方法。-The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.

用动态规划解答最优二叉查找树问题，最优二叉搜索树-Using dynamic programming solution optimal binary search tree problem with Optimal binary search tree